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/loops/eureka_05.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c6af20d [2019-09-03 19:19:43,080 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-03 19:19:43,082 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-03 19:19:43,093 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-03 19:19:43,094 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-03 19:19:43,095 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-03 19:19:43,096 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-03 19:19:43,098 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-03 19:19:43,100 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-03 19:19:43,101 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-03 19:19:43,102 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-03 19:19:43,103 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-03 19:19:43,103 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-03 19:19:43,104 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-03 19:19:43,105 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-03 19:19:43,107 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-03 19:19:43,107 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-03 19:19:43,108 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-03 19:19:43,110 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-03 19:19:43,112 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-03 19:19:43,114 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-03 19:19:43,115 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-03 19:19:43,116 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-03 19:19:43,117 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-03 19:19:43,119 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-03 19:19:43,119 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-03 19:19:43,119 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-03 19:19:43,120 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-03 19:19:43,121 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-03 19:19:43,122 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-03 19:19:43,122 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-03 19:19:43,123 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-03 19:19:43,124 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-03 19:19:43,124 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-03 19:19:43,125 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-03 19:19:43,126 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-03 19:19:43,126 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-03 19:19:43,127 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-03 19:19:43,127 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-03 19:19:43,128 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-03 19:19:43,128 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-03 19:19:43,131 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-03 19:19:43,146 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-03 19:19:43,146 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-03 19:19:43,147 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-03 19:19:43,148 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-03 19:19:43,148 INFO L138 SettingsManager]: * Use SBE=true [2019-09-03 19:19:43,148 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-03 19:19:43,148 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-03 19:19:43,148 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-03 19:19:43,149 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-03 19:19:43,149 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-03 19:19:43,149 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-03 19:19:43,149 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-03 19:19:43,149 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-03 19:19:43,150 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-03 19:19:43,150 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-03 19:19:43,150 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-03 19:19:43,150 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-03 19:19:43,150 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-03 19:19:43,151 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-03 19:19:43,151 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-03 19:19:43,151 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-03 19:19:43,151 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 19:19:43,151 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-03 19:19:43,152 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-03 19:19:43,152 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-03 19:19:43,152 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-03 19:19:43,152 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-03 19:19:43,153 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-03 19:19:43,153 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-03 19:19:43,182 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-03 19:19:43,196 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-03 19:19:43,201 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-03 19:19:43,202 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-03 19:19:43,203 INFO L275 PluginConnector]: CDTParser initialized [2019-09-03 19:19:43,204 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/eureka_05.i [2019-09-03 19:19:43,289 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26d909184/c5cb7d0094634b2fa9e407182367ced1/FLAG87a530366 [2019-09-03 19:19:43,746 INFO L306 CDTParser]: Found 1 translation units. [2019-09-03 19:19:43,748 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/eureka_05.i [2019-09-03 19:19:43,755 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26d909184/c5cb7d0094634b2fa9e407182367ced1/FLAG87a530366 [2019-09-03 19:19:44,143 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26d909184/c5cb7d0094634b2fa9e407182367ced1 [2019-09-03 19:19:44,153 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-03 19:19:44,154 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-03 19:19:44,155 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-03 19:19:44,155 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-03 19:19:44,158 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-03 19:19:44,159 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 07:19:44" (1/1) ... [2019-09-03 19:19:44,162 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66d1c6e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:19:44, skipping insertion in model container [2019-09-03 19:19:44,162 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 07:19:44" (1/1) ... [2019-09-03 19:19:44,169 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-03 19:19:44,186 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-03 19:19:44,361 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 19:19:44,368 INFO L188 MainTranslator]: Completed pre-run [2019-09-03 19:19:44,393 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 19:19:44,412 INFO L192 MainTranslator]: Completed translation [2019-09-03 19:19:44,412 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:19:44 WrapperNode [2019-09-03 19:19:44,413 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-03 19:19:44,413 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-03 19:19:44,413 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-03 19:19:44,413 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-03 19:19:44,512 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:19:44" (1/1) ... [2019-09-03 19:19:44,512 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:19:44" (1/1) ... [2019-09-03 19:19:44,519 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:19:44" (1/1) ... [2019-09-03 19:19:44,520 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:19:44" (1/1) ... [2019-09-03 19:19:44,528 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:19:44" (1/1) ... [2019-09-03 19:19:44,539 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:19:44" (1/1) ... [2019-09-03 19:19:44,541 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:19:44" (1/1) ... [2019-09-03 19:19:44,544 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-03 19:19:44,544 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-03 19:19:44,544 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-03 19:19:44,545 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-03 19:19:44,545 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:19:44" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 19:19:44,600 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-03 19:19:44,600 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-03 19:19:44,600 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-03 19:19:44,601 INFO L138 BoogieDeclarations]: Found implementation of procedure SelectionSort [2019-09-03 19:19:44,601 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-03 19:19:44,601 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-03 19:19:44,601 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-03 19:19:44,601 INFO L130 BoogieDeclarations]: Found specification of procedure SelectionSort [2019-09-03 19:19:44,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-03 19:19:44,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-03 19:19:44,601 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-03 19:19:44,601 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-03 19:19:44,602 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-03 19:19:44,602 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-03 19:19:44,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-03 19:19:44,602 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-03 19:19:44,894 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-03 19:19:44,895 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-09-03 19:19:44,896 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 07:19:44 BoogieIcfgContainer [2019-09-03 19:19:44,896 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-03 19:19:44,904 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-03 19:19:44,904 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-03 19:19:44,909 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-03 19:19:44,910 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.09 07:19:44" (1/3) ... [2019-09-03 19:19:44,911 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1144f8a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 07:19:44, skipping insertion in model container [2019-09-03 19:19:44,911 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:19:44" (2/3) ... [2019-09-03 19:19:44,912 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1144f8a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 07:19:44, skipping insertion in model container [2019-09-03 19:19:44,912 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 07:19:44" (3/3) ... [2019-09-03 19:19:44,914 INFO L109 eAbstractionObserver]: Analyzing ICFG eureka_05.i [2019-09-03 19:19:44,925 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-03 19:19:44,940 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-03 19:19:44,957 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-03 19:19:44,990 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-03 19:19:44,991 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-03 19:19:44,991 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-03 19:19:44,991 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-03 19:19:44,991 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-03 19:19:44,991 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-03 19:19:44,992 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-03 19:19:44,992 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-03 19:19:44,993 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-03 19:19:45,016 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2019-09-03 19:19:45,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-03 19:19:45,021 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:19:45,022 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:19:45,024 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:19:45,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:19:45,030 INFO L82 PathProgramCache]: Analyzing trace with hash 625586084, now seen corresponding path program 1 times [2019-09-03 19:19:45,033 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:19:45,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:19:45,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:45,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:19:45,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:45,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:19:45,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:19:45,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:19:45,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-03 19:19:45,191 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-03 19:19:45,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-03 19:19:45,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-03 19:19:45,207 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 2 states. [2019-09-03 19:19:45,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:19:45,240 INFO L93 Difference]: Finished difference Result 60 states and 78 transitions. [2019-09-03 19:19:45,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-03 19:19:45,242 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2019-09-03 19:19:45,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:19:45,252 INFO L225 Difference]: With dead ends: 60 [2019-09-03 19:19:45,252 INFO L226 Difference]: Without dead ends: 29 [2019-09-03 19:19:45,258 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-03 19:19:45,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-09-03 19:19:45,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-09-03 19:19:45,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-09-03 19:19:45,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2019-09-03 19:19:45,321 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 18 [2019-09-03 19:19:45,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:19:45,323 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2019-09-03 19:19:45,324 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-03 19:19:45,324 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2019-09-03 19:19:45,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-03 19:19:45,327 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:19:45,327 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:19:45,328 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:19:45,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:19:45,330 INFO L82 PathProgramCache]: Analyzing trace with hash 2087778385, now seen corresponding path program 1 times [2019-09-03 19:19:45,330 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:19:45,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:19:45,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:45,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:19:45,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:45,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:19:45,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:19:45,463 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:19:45,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-03 19:19:45,467 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-03 19:19:45,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-03 19:19:45,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 19:19:45,468 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 3 states. [2019-09-03 19:19:45,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:19:45,496 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2019-09-03 19:19:45,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-03 19:19:45,497 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-09-03 19:19:45,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:19:45,499 INFO L225 Difference]: With dead ends: 52 [2019-09-03 19:19:45,499 INFO L226 Difference]: Without dead ends: 31 [2019-09-03 19:19:45,500 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 19:19:45,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-09-03 19:19:45,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-09-03 19:19:45,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-03 19:19:45,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2019-09-03 19:19:45,509 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 18 [2019-09-03 19:19:45,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:19:45,509 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2019-09-03 19:19:45,509 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-03 19:19:45,510 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2019-09-03 19:19:45,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-03 19:19:45,511 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:19:45,511 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:19:45,511 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:19:45,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:19:45,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1482156659, now seen corresponding path program 1 times [2019-09-03 19:19:45,512 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:19:45,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:19:45,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:45,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:19:45,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:45,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:19:45,594 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:19:45,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:19:45,595 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:19:45,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:19:45,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:19:45,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-03 19:19:45,700 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:19:45,726 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:19:45,732 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:19:45,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-09-03 19:19:45,736 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-03 19:19:45,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-03 19:19:45,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-03 19:19:45,741 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 4 states. [2019-09-03 19:19:45,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:19:45,791 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2019-09-03 19:19:45,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 19:19:45,791 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-09-03 19:19:45,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:19:45,793 INFO L225 Difference]: With dead ends: 54 [2019-09-03 19:19:45,793 INFO L226 Difference]: Without dead ends: 33 [2019-09-03 19:19:45,794 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-03 19:19:45,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-09-03 19:19:45,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2019-09-03 19:19:45,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-09-03 19:19:45,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2019-09-03 19:19:45,801 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 20 [2019-09-03 19:19:45,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:19:45,801 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2019-09-03 19:19:45,802 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-03 19:19:45,802 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2019-09-03 19:19:45,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-03 19:19:45,803 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:19:45,803 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:19:45,804 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:19:45,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:19:45,804 INFO L82 PathProgramCache]: Analyzing trace with hash -699737067, now seen corresponding path program 2 times [2019-09-03 19:19:45,804 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:19:45,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:19:45,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:45,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:19:45,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:45,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:19:45,878 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:19:45,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:19:45,878 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:19:45,893 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:19:45,923 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-09-03 19:19:45,924 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:19:45,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-03 19:19:45,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:19:45,957 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-03 19:19:45,961 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-03 19:19:45,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-09-03 19:19:45,963 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-03 19:19:45,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-03 19:19:45,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-03 19:19:45,964 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 7 states. [2019-09-03 19:19:46,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:19:46,104 INFO L93 Difference]: Finished difference Result 62 states and 74 transitions. [2019-09-03 19:19:46,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-03 19:19:46,105 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-09-03 19:19:46,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:19:46,106 INFO L225 Difference]: With dead ends: 62 [2019-09-03 19:19:46,106 INFO L226 Difference]: Without dead ends: 41 [2019-09-03 19:19:46,107 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-09-03 19:19:46,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-09-03 19:19:46,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 35. [2019-09-03 19:19:46,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-09-03 19:19:46,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2019-09-03 19:19:46,115 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 22 [2019-09-03 19:19:46,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:19:46,116 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2019-09-03 19:19:46,116 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-03 19:19:46,116 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2019-09-03 19:19:46,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-03 19:19:46,117 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:19:46,118 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:19:46,118 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:19:46,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:19:46,118 INFO L82 PathProgramCache]: Analyzing trace with hash -1207034289, now seen corresponding path program 1 times [2019-09-03 19:19:46,119 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:19:46,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:19:46,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:46,120 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:19:46,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:46,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:19:46,243 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-03 19:19:46,244 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:19:46,244 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:19:46,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:19:46,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:19:46,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-03 19:19:46,326 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:19:46,341 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:19:46,350 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:19:46,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-09-03 19:19:46,350 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-03 19:19:46,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-03 19:19:46,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-03 19:19:46,351 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 6 states. [2019-09-03 19:19:46,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:19:46,413 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2019-09-03 19:19:46,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 19:19:46,414 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-09-03 19:19:46,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:19:46,415 INFO L225 Difference]: With dead ends: 60 [2019-09-03 19:19:46,415 INFO L226 Difference]: Without dead ends: 38 [2019-09-03 19:19:46,416 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-03 19:19:46,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-09-03 19:19:46,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2019-09-03 19:19:46,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-09-03 19:19:46,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2019-09-03 19:19:46,427 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 28 [2019-09-03 19:19:46,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:19:46,427 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2019-09-03 19:19:46,428 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-03 19:19:46,428 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2019-09-03 19:19:46,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-03 19:19:46,429 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:19:46,429 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:19:46,429 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:19:46,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:19:46,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1674464753, now seen corresponding path program 2 times [2019-09-03 19:19:46,430 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:19:46,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:19:46,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:46,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:19:46,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:46,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:19:46,527 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-03 19:19:46,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:19:46,528 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:19:46,542 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:19:46,570 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:19:46,571 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:19:46,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-03 19:19:46,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:19:46,628 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-03 19:19:46,635 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-03 19:19:46,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2019-09-03 19:19:46,636 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-03 19:19:46,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-03 19:19:46,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-09-03 19:19:46,637 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 10 states. [2019-09-03 19:19:46,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:19:46,921 INFO L93 Difference]: Finished difference Result 85 states and 102 transitions. [2019-09-03 19:19:46,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-03 19:19:46,921 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 30 [2019-09-03 19:19:46,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:19:46,924 INFO L225 Difference]: With dead ends: 85 [2019-09-03 19:19:46,925 INFO L226 Difference]: Without dead ends: 63 [2019-09-03 19:19:46,925 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2019-09-03 19:19:46,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-09-03 19:19:46,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 40. [2019-09-03 19:19:46,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-09-03 19:19:46,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2019-09-03 19:19:46,938 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 30 [2019-09-03 19:19:46,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:19:46,938 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2019-09-03 19:19:46,939 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-03 19:19:46,939 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2019-09-03 19:19:46,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-09-03 19:19:46,941 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:19:46,941 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:19:46,941 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:19:46,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:19:46,942 INFO L82 PathProgramCache]: Analyzing trace with hash -175519861, now seen corresponding path program 1 times [2019-09-03 19:19:46,942 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:19:46,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:19:46,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:46,944 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:19:46,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:46,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:19:47,039 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-03 19:19:47,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:19:47,039 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:19:47,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:19:47,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:19:47,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-03 19:19:47,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:19:47,151 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (6)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:19:47,157 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:19:47,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 9 [2019-09-03 19:19:47,158 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-03 19:19:47,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-03 19:19:47,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-03 19:19:47,159 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 9 states. [2019-09-03 19:19:47,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:19:47,392 INFO L93 Difference]: Finished difference Result 74 states and 89 transitions. [2019-09-03 19:19:47,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-03 19:19:47,393 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2019-09-03 19:19:47,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:19:47,395 INFO L225 Difference]: With dead ends: 74 [2019-09-03 19:19:47,395 INFO L226 Difference]: Without dead ends: 55 [2019-09-03 19:19:47,398 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-09-03 19:19:47,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-09-03 19:19:47,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2019-09-03 19:19:47,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-09-03 19:19:47,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2019-09-03 19:19:47,413 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 35 [2019-09-03 19:19:47,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:19:47,414 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2019-09-03 19:19:47,414 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-03 19:19:47,415 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2019-09-03 19:19:47,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-03 19:19:47,420 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:19:47,420 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:19:47,425 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:19:47,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:19:47,425 INFO L82 PathProgramCache]: Analyzing trace with hash 1018225731, now seen corresponding path program 2 times [2019-09-03 19:19:47,426 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:19:47,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:19:47,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:47,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:19:47,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:47,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:19:47,526 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-09-03 19:19:47,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:19:47,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 19:19:47,527 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 19:19:47,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 19:19:47,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-03 19:19:47,528 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand 5 states. [2019-09-03 19:19:47,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:19:47,597 INFO L93 Difference]: Finished difference Result 82 states and 96 transitions. [2019-09-03 19:19:47,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 19:19:47,597 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-09-03 19:19:47,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:19:47,599 INFO L225 Difference]: With dead ends: 82 [2019-09-03 19:19:47,599 INFO L226 Difference]: Without dead ends: 56 [2019-09-03 19:19:47,600 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-03 19:19:47,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-09-03 19:19:47,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2019-09-03 19:19:47,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-09-03 19:19:47,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2019-09-03 19:19:47,607 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 46 [2019-09-03 19:19:47,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:19:47,607 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 61 transitions. [2019-09-03 19:19:47,607 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 19:19:47,608 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2019-09-03 19:19:47,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-03 19:19:47,612 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:19:47,612 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:19:47,612 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:19:47,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:19:47,613 INFO L82 PathProgramCache]: Analyzing trace with hash -1159318645, now seen corresponding path program 3 times [2019-09-03 19:19:47,613 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:19:47,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:19:47,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:47,614 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:19:47,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:47,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:19:47,748 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-09-03 19:19:47,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:19:47,748 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:19:47,767 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:19:47,814 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-09-03 19:19:47,815 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:19:47,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-03 19:19:47,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:19:47,882 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (7)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:19:47,886 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:19:47,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 13 [2019-09-03 19:19:47,887 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-03 19:19:47,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-03 19:19:47,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2019-09-03 19:19:47,888 INFO L87 Difference]: Start difference. First operand 54 states and 61 transitions. Second operand 13 states. [2019-09-03 19:19:48,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:19:48,132 INFO L93 Difference]: Finished difference Result 86 states and 99 transitions. [2019-09-03 19:19:48,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-03 19:19:48,133 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 49 [2019-09-03 19:19:48,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:19:48,134 INFO L225 Difference]: With dead ends: 86 [2019-09-03 19:19:48,134 INFO L226 Difference]: Without dead ends: 59 [2019-09-03 19:19:48,135 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2019-09-03 19:19:48,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-09-03 19:19:48,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2019-09-03 19:19:48,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-09-03 19:19:48,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 65 transitions. [2019-09-03 19:19:48,154 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 65 transitions. Word has length 49 [2019-09-03 19:19:48,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:19:48,155 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 65 transitions. [2019-09-03 19:19:48,156 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-03 19:19:48,156 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 65 transitions. [2019-09-03 19:19:48,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-03 19:19:48,158 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:19:48,158 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:19:48,159 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:19:48,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:19:48,159 INFO L82 PathProgramCache]: Analyzing trace with hash 589875219, now seen corresponding path program 4 times [2019-09-03 19:19:48,159 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:19:48,159 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:19:48,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:48,160 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:19:48,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:48,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:19:48,253 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 20 proven. 22 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-03 19:19:48,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:19:48,253 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:19:48,281 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:19:48,318 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:19:48,318 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:19:48,319 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-03 19:19:48,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:19:48,336 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 20 proven. 22 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (8)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:19:48,341 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:19:48,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-09-03 19:19:48,342 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-03 19:19:48,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-03 19:19:48,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-09-03 19:19:48,346 INFO L87 Difference]: Start difference. First operand 57 states and 65 transitions. Second operand 9 states. [2019-09-03 19:19:48,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:19:48,649 INFO L93 Difference]: Finished difference Result 96 states and 114 transitions. [2019-09-03 19:19:48,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-03 19:19:48,651 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 52 [2019-09-03 19:19:48,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:19:48,652 INFO L225 Difference]: With dead ends: 96 [2019-09-03 19:19:48,653 INFO L226 Difference]: Without dead ends: 73 [2019-09-03 19:19:48,656 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2019-09-03 19:19:48,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-09-03 19:19:48,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 63. [2019-09-03 19:19:48,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-09-03 19:19:48,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 74 transitions. [2019-09-03 19:19:48,680 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 74 transitions. Word has length 52 [2019-09-03 19:19:48,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:19:48,681 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 74 transitions. [2019-09-03 19:19:48,681 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-03 19:19:48,681 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 74 transitions. [2019-09-03 19:19:48,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-03 19:19:48,685 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:19:48,685 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:19:48,685 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:19:48,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:19:48,686 INFO L82 PathProgramCache]: Analyzing trace with hash -1801585221, now seen corresponding path program 5 times [2019-09-03 19:19:48,689 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:19:48,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:19:48,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:48,690 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:19:48,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:48,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:19:48,863 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 14 proven. 41 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-03 19:19:48,863 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:19:48,864 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:19:48,891 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:19:48,998 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-09-03 19:19:48,999 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:19:49,000 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-03 19:19:49,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:19:49,019 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 40 proven. 7 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-03 19:19:49,026 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:19:49,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 9 [2019-09-03 19:19:49,027 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-03 19:19:49,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-03 19:19:49,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-03 19:19:49,028 INFO L87 Difference]: Start difference. First operand 63 states and 74 transitions. Second operand 9 states. [2019-09-03 19:19:49,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:19:49,227 INFO L93 Difference]: Finished difference Result 83 states and 95 transitions. [2019-09-03 19:19:49,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-03 19:19:49,228 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-09-03 19:19:49,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:19:49,229 INFO L225 Difference]: With dead ends: 83 [2019-09-03 19:19:49,229 INFO L226 Difference]: Without dead ends: 67 [2019-09-03 19:19:49,230 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2019-09-03 19:19:49,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-09-03 19:19:49,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-09-03 19:19:49,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-09-03 19:19:49,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 78 transitions. [2019-09-03 19:19:49,247 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 78 transitions. Word has length 55 [2019-09-03 19:19:49,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:19:49,248 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 78 transitions. [2019-09-03 19:19:49,248 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-03 19:19:49,248 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 78 transitions. [2019-09-03 19:19:49,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-03 19:19:49,253 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:19:49,253 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:19:49,253 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:19:49,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:19:49,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1704935675, now seen corresponding path program 6 times [2019-09-03 19:19:49,254 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:19:49,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:19:49,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:49,255 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:19:49,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:49,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:19:49,387 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-09-03 19:19:49,388 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:19:49,388 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:19:49,398 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:19:49,491 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2019-09-03 19:19:49,492 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:19:49,493 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-03 19:19:49,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:19:49,580 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 46 proven. 12 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-09-03 19:19:49,585 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:19:49,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2019-09-03 19:19:49,587 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-03 19:19:49,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-03 19:19:49,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2019-09-03 19:19:49,588 INFO L87 Difference]: Start difference. First operand 67 states and 78 transitions. Second operand 15 states. [2019-09-03 19:19:49,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:19:49,849 INFO L93 Difference]: Finished difference Result 117 states and 141 transitions. [2019-09-03 19:19:49,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-03 19:19:49,852 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 62 [2019-09-03 19:19:49,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:19:49,853 INFO L225 Difference]: With dead ends: 117 [2019-09-03 19:19:49,853 INFO L226 Difference]: Without dead ends: 77 [2019-09-03 19:19:49,854 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2019-09-03 19:19:49,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-09-03 19:19:49,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 70. [2019-09-03 19:19:49,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-09-03 19:19:49,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 82 transitions. [2019-09-03 19:19:49,861 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 82 transitions. Word has length 62 [2019-09-03 19:19:49,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:19:49,862 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 82 transitions. [2019-09-03 19:19:49,862 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-03 19:19:49,862 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 82 transitions. [2019-09-03 19:19:49,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-03 19:19:49,863 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:19:49,863 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:19:49,863 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:19:49,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:19:49,863 INFO L82 PathProgramCache]: Analyzing trace with hash 788547955, now seen corresponding path program 7 times [2019-09-03 19:19:49,864 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:19:49,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:19:49,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:49,865 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:19:49,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:49,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:19:49,959 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 61 proven. 46 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-09-03 19:19:49,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:19:49,960 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:19:49,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:19:50,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:19:50,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-03 19:19:50,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:19:50,148 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 48 proven. 37 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2019-09-03 19:19:50,151 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:19:50,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2019-09-03 19:19:50,152 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-03 19:19:50,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-03 19:19:50,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2019-09-03 19:19:50,153 INFO L87 Difference]: Start difference. First operand 70 states and 82 transitions. Second operand 17 states. [2019-09-03 19:19:50,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:19:50,842 INFO L93 Difference]: Finished difference Result 146 states and 180 transitions. [2019-09-03 19:19:50,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-03 19:19:50,843 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 65 [2019-09-03 19:19:50,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:19:50,844 INFO L225 Difference]: With dead ends: 146 [2019-09-03 19:19:50,844 INFO L226 Difference]: Without dead ends: 106 [2019-09-03 19:19:50,846 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 424 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=406, Invalid=1234, Unknown=0, NotChecked=0, Total=1640 [2019-09-03 19:19:50,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-09-03 19:19:50,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 83. [2019-09-03 19:19:50,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-09-03 19:19:50,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 99 transitions. [2019-09-03 19:19:50,854 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 99 transitions. Word has length 65 [2019-09-03 19:19:50,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:19:50,854 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 99 transitions. [2019-09-03 19:19:50,854 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-03 19:19:50,855 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 99 transitions. [2019-09-03 19:19:50,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-03 19:19:50,855 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:19:50,855 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:19:50,856 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:19:50,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:19:50,856 INFO L82 PathProgramCache]: Analyzing trace with hash -833747949, now seen corresponding path program 8 times [2019-09-03 19:19:50,856 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:19:50,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:19:50,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:50,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:19:50,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:50,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:19:51,168 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 9 proven. 107 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2019-09-03 19:19:51,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:19:51,169 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:19:51,185 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:19:51,238 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:19:51,239 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:19:51,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-03 19:19:51,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:19:51,595 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:19:51,596 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:19:51,597 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:19:51,608 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:19:51,609 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 44 [2019-09-03 19:19:51,610 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:19:51,623 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:19:51,624 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:19:51,624 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:72, output treesize:30 [2019-09-03 19:19:51,890 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:19:51,891 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:19:51,893 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:19:51,895 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:19:51,895 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 17 [2019-09-03 19:19:51,897 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:19:51,900 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:19:51,901 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:19:51,901 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:56, output treesize:9 [2019-09-03 19:19:51,945 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 90 proven. 102 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2019-09-03 19:19:51,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:19:51,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 18] total 30 [2019-09-03 19:19:51,949 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-03 19:19:51,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-03 19:19:51,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=783, Unknown=0, NotChecked=0, Total=870 [2019-09-03 19:19:51,950 INFO L87 Difference]: Start difference. First operand 83 states and 99 transitions. Second operand 30 states. [2019-09-03 19:19:54,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:19:54,061 INFO L93 Difference]: Finished difference Result 216 states and 269 transitions. [2019-09-03 19:19:54,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-03 19:19:54,062 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 78 [2019-09-03 19:19:54,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:19:54,063 INFO L225 Difference]: With dead ends: 216 [2019-09-03 19:19:54,063 INFO L226 Difference]: Without dead ends: 163 [2019-09-03 19:19:54,066 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 829 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=397, Invalid=3143, Unknown=0, NotChecked=0, Total=3540 [2019-09-03 19:19:54,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-09-03 19:19:54,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 124. [2019-09-03 19:19:54,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-09-03 19:19:54,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 150 transitions. [2019-09-03 19:19:54,078 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 150 transitions. Word has length 78 [2019-09-03 19:19:54,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:19:54,078 INFO L475 AbstractCegarLoop]: Abstraction has 124 states and 150 transitions. [2019-09-03 19:19:54,078 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-03 19:19:54,079 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 150 transitions. [2019-09-03 19:19:54,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-03 19:19:54,080 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:19:54,080 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 9, 5, 5, 5, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:19:54,080 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:19:54,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:19:54,080 INFO L82 PathProgramCache]: Analyzing trace with hash -1937848504, now seen corresponding path program 1 times [2019-09-03 19:19:54,081 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:19:54,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:19:54,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:54,082 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:19:54,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:54,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:19:54,744 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 2 proven. 128 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2019-09-03 19:19:54,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:19:54,744 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:19:54,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:19:54,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:19:54,819 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 52 conjunts are in the unsatisfiable core [2019-09-03 19:19:54,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:19:55,251 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:19:55,253 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:19:55,254 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:19:55,260 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:19:55,261 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 44 [2019-09-03 19:19:55,262 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:19:55,270 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:19:55,271 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:19:55,271 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:72, output treesize:30 [2019-09-03 19:19:55,469 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:19:55,471 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:19:55,472 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:19:55,474 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:19:55,474 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 44 [2019-09-03 19:19:55,475 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:19:55,488 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:19:55,489 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:19:55,489 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:72, output treesize:30 [2019-09-03 19:19:55,642 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:19:55,643 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:19:55,643 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 12 [2019-09-03 19:19:55,644 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:19:55,648 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:19:55,649 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:19:55,649 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:52, output treesize:12 [2019-09-03 19:19:55,705 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 55 proven. 169 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-03 19:19:55,708 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:19:55,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 23] total 39 [2019-09-03 19:19:55,709 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-03 19:19:55,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-03 19:19:55,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1349, Unknown=0, NotChecked=0, Total=1482 [2019-09-03 19:19:55,710 INFO L87 Difference]: Start difference. First operand 124 states and 150 transitions. Second operand 39 states. [2019-09-03 19:19:58,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:19:58,953 INFO L93 Difference]: Finished difference Result 277 states and 345 transitions. [2019-09-03 19:19:58,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-03 19:19:58,953 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 86 [2019-09-03 19:19:58,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:19:58,956 INFO L225 Difference]: With dead ends: 277 [2019-09-03 19:19:58,956 INFO L226 Difference]: Without dead ends: 218 [2019-09-03 19:19:58,959 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1570 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=510, Invalid=5040, Unknown=0, NotChecked=0, Total=5550 [2019-09-03 19:19:58,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-09-03 19:19:58,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 157. [2019-09-03 19:19:58,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-09-03 19:19:58,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 188 transitions. [2019-09-03 19:19:58,973 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 188 transitions. Word has length 86 [2019-09-03 19:19:58,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:19:58,973 INFO L475 AbstractCegarLoop]: Abstraction has 157 states and 188 transitions. [2019-09-03 19:19:58,973 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-03 19:19:58,973 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 188 transitions. [2019-09-03 19:19:58,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-03 19:19:58,974 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:19:58,975 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 8, 5, 5, 5, 5, 5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:19:58,975 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:19:58,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:19:58,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1811387833, now seen corresponding path program 2 times [2019-09-03 19:19:58,975 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:19:58,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:19:58,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:58,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:19:58,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:59,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:19:59,635 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 5 proven. 139 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2019-09-03 19:19:59,635 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:19:59,635 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:19:59,648 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:19:59,704 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:19:59,704 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:19:59,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-03 19:19:59,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:19:59,728 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:19:59,728 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2019-09-03 19:19:59,729 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:19:59,755 INFO L567 ElimStorePlain]: treesize reduction 10, result has 78.3 percent of original size [2019-09-03 19:19:59,756 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:19:59,756 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:36 [2019-09-03 19:19:59,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:19:59,822 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:19:59,822 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 55 [2019-09-03 19:19:59,823 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:19:59,832 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:19:59,832 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 35 treesize of output 39 [2019-09-03 19:19:59,833 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-03 19:19:59,860 INFO L567 ElimStorePlain]: treesize reduction 34, result has 43.3 percent of original size [2019-09-03 19:19:59,861 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:19:59,861 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:73, output treesize:26 [2019-09-03 19:19:59,897 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:19:59,900 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2019-09-03 19:19:59,901 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:19:59,911 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:19:59,911 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-03 19:19:59,912 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:37 [2019-09-03 19:19:59,974 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:19:59,995 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:19:59,996 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 86 [2019-09-03 19:19:59,997 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:20:00,029 INFO L567 ElimStorePlain]: treesize reduction 36, result has 57.1 percent of original size [2019-09-03 19:20:00,030 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-03 19:20:00,031 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:52, output treesize:48 [2019-09-03 19:20:00,077 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:20:00,090 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:20:00,090 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 86 [2019-09-03 19:20:00,091 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:20:00,121 INFO L567 ElimStorePlain]: treesize reduction 36, result has 57.1 percent of original size [2019-09-03 19:20:00,121 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-03 19:20:00,122 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:52, output treesize:48 [2019-09-03 19:20:00,167 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:20:00,180 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:20:00,180 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 86 [2019-09-03 19:20:00,181 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:20:00,214 INFO L567 ElimStorePlain]: treesize reduction 36, result has 57.1 percent of original size [2019-09-03 19:20:00,216 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-03 19:20:00,216 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:52, output treesize:48 [2019-09-03 19:20:00,265 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:20:00,277 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:20:00,278 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 86 [2019-09-03 19:20:00,279 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:20:00,313 INFO L567 ElimStorePlain]: treesize reduction 36, result has 57.1 percent of original size [2019-09-03 19:20:00,314 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-09-03 19:20:00,314 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:48 [2019-09-03 19:20:06,369 WARN L188 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 33 [2019-09-03 19:20:06,384 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:20:06,390 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:20:06,390 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 29 [2019-09-03 19:20:06,391 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-09-03 19:20:06,404 INFO L567 ElimStorePlain]: treesize reduction 16, result has 40.7 percent of original size [2019-09-03 19:20:06,404 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:20:06,405 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:51, output treesize:7 [2019-09-03 19:20:06,764 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 4 proven. 94 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2019-09-03 19:20:06,767 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:20:06,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 14] total 31 [2019-09-03 19:20:06,768 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-03 19:20:06,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-03 19:20:06,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=835, Unknown=2, NotChecked=0, Total=930 [2019-09-03 19:20:06,769 INFO L87 Difference]: Start difference. First operand 157 states and 188 transitions. Second operand 31 states. [2019-09-03 19:21:07,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:21:07,067 INFO L93 Difference]: Finished difference Result 300 states and 360 transitions. [2019-09-03 19:21:07,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-03 19:21:07,067 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 94 [2019-09-03 19:21:07,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:21:07,070 INFO L225 Difference]: With dead ends: 300 [2019-09-03 19:21:07,070 INFO L226 Difference]: Without dead ends: 171 [2019-09-03 19:21:07,071 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 86 SyntacticMatches, 4 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 683 ImplicationChecksByTransitivity, 24.3s TimeCoverageRelationStatistics Valid=364, Invalid=2706, Unknown=10, NotChecked=0, Total=3080 [2019-09-03 19:21:07,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-09-03 19:21:07,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 168. [2019-09-03 19:21:07,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-09-03 19:21:07,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 199 transitions. [2019-09-03 19:21:07,086 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 199 transitions. Word has length 94 [2019-09-03 19:21:07,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:21:07,086 INFO L475 AbstractCegarLoop]: Abstraction has 168 states and 199 transitions. [2019-09-03 19:21:07,087 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-03 19:21:07,087 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 199 transitions. [2019-09-03 19:21:07,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-03 19:21:07,088 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:21:07,088 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 7, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:21:07,088 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:21:07,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:21:07,089 INFO L82 PathProgramCache]: Analyzing trace with hash -1005309842, now seen corresponding path program 3 times [2019-09-03 19:21:07,089 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:21:07,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:21:07,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:21:07,090 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:21:07,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:21:07,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:21:07,496 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 25 [2019-09-03 19:21:08,764 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 12 proven. 203 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-09-03 19:21:08,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:21:08,764 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:21:08,775 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:21:08,847 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-09-03 19:21:08,847 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:21:08,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-03 19:21:08,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:21:08,871 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:21:08,872 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2019-09-03 19:21:08,872 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:21:08,916 INFO L567 ElimStorePlain]: treesize reduction 10, result has 77.3 percent of original size [2019-09-03 19:21:08,916 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:21:08,916 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:34 [2019-09-03 19:21:08,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:21:08,991 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:21:08,991 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 53 [2019-09-03 19:21:08,992 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:21:09,002 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:21:09,002 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 33 treesize of output 37 [2019-09-03 19:21:09,003 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-03 19:21:09,042 INFO L567 ElimStorePlain]: treesize reduction 32, result has 42.9 percent of original size [2019-09-03 19:21:09,042 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:21:09,042 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:69, output treesize:24 [2019-09-03 19:21:09,084 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:09,085 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2019-09-03 19:21:09,086 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:21:09,097 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:21:09,097 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-03 19:21:09,098 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:35 [2019-09-03 19:21:09,150 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:09,167 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:21:09,168 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 84 [2019-09-03 19:21:09,169 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:21:09,207 INFO L567 ElimStorePlain]: treesize reduction 36, result has 56.1 percent of original size [2019-09-03 19:21:09,208 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-03 19:21:09,208 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2019-09-03 19:21:09,252 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:09,267 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:21:09,268 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 84 [2019-09-03 19:21:09,269 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:21:09,303 INFO L567 ElimStorePlain]: treesize reduction 36, result has 56.1 percent of original size [2019-09-03 19:21:09,304 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-03 19:21:09,304 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2019-09-03 19:21:09,372 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:09,384 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:21:09,385 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 84 [2019-09-03 19:21:09,386 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:21:09,420 INFO L567 ElimStorePlain]: treesize reduction 36, result has 56.1 percent of original size [2019-09-03 19:21:09,421 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-03 19:21:09,422 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2019-09-03 19:21:09,482 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:09,501 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:21:09,502 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 84 [2019-09-03 19:21:09,503 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:21:09,532 INFO L567 ElimStorePlain]: treesize reduction 36, result has 56.1 percent of original size [2019-09-03 19:21:09,532 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-09-03 19:21:09,533 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:46 [2019-09-03 19:21:17,585 WARN L188 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 30 [2019-09-03 19:21:17,608 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:17,612 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:21:17,613 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 29 [2019-09-03 19:21:17,614 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-09-03 19:21:17,632 INFO L567 ElimStorePlain]: treesize reduction 16, result has 40.7 percent of original size [2019-09-03 19:21:17,633 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:21:17,633 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:49, output treesize:7 [2019-09-03 19:21:17,873 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 4 proven. 37 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2019-09-03 19:21:17,877 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:21:17,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 11] total 35 [2019-09-03 19:21:17,879 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-03 19:21:17,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-03 19:21:17,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1090, Unknown=3, NotChecked=0, Total=1190 [2019-09-03 19:21:17,880 INFO L87 Difference]: Start difference. First operand 168 states and 199 transitions. Second operand 35 states. [2019-09-03 19:21:46,245 WARN L188 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 42 [2019-09-03 19:21:52,341 WARN L188 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 43 [2019-09-03 19:21:54,411 WARN L188 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 45 [2019-09-03 19:21:58,537 WARN L188 SmtUtils]: Spent 4.08 s on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2019-09-03 19:22:02,683 WARN L188 SmtUtils]: Spent 4.10 s on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-03 19:22:04,826 WARN L188 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 50 [2019-09-03 19:22:06,937 WARN L188 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 54 [2019-09-03 19:23:07,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:23:07,051 INFO L93 Difference]: Finished difference Result 415 states and 507 transitions. [2019-09-03 19:23:07,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-03 19:23:07,052 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 102 [2019-09-03 19:23:07,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:23:07,055 INFO L225 Difference]: With dead ends: 415 [2019-09-03 19:23:07,055 INFO L226 Difference]: Without dead ends: 248 [2019-09-03 19:23:07,057 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 93 SyntacticMatches, 3 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1176 ImplicationChecksByTransitivity, 73.7s TimeCoverageRelationStatistics Valid=414, Invalid=3721, Unknown=25, NotChecked=0, Total=4160 [2019-09-03 19:23:07,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-09-03 19:23:07,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 225. [2019-09-03 19:23:07,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-09-03 19:23:07,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 271 transitions. [2019-09-03 19:23:07,078 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 271 transitions. Word has length 102 [2019-09-03 19:23:07,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:23:07,078 INFO L475 AbstractCegarLoop]: Abstraction has 225 states and 271 transitions. [2019-09-03 19:23:07,079 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-03 19:23:07,079 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 271 transitions. [2019-09-03 19:23:07,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-03 19:23:07,080 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:23:07,080 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 7, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:23:07,081 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:23:07,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:23:07,081 INFO L82 PathProgramCache]: Analyzing trace with hash -757435666, now seen corresponding path program 4 times [2019-09-03 19:23:07,081 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:23:07,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:23:07,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:23:07,082 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:23:07,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:23:07,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:23:07,811 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 6 proven. 133 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2019-09-03 19:23:07,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:23:07,811 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:23:07,821 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:23:07,871 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:23:07,872 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:23:07,873 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-03 19:23:07,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:23:08,288 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 45 [2019-09-03 19:23:08,289 INFO L341 Elim1Store]: treesize reduction 118, result has 60.9 percent of original size [2019-09-03 19:23:08,289 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 52 treesize of output 198 [2019-09-03 19:23:08,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:23:08,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:23:08,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:23:08,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:23:08,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:23:08,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:23:08,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:23:08,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:23:08,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:23:08,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:23:08,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:23:08,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:23:08,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:23:08,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:23:08,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:23:08,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:23:08,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:23:08,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:23:08,302 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:23:08,387 INFO L567 ElimStorePlain]: treesize reduction 524, result has 7.3 percent of original size [2019-09-03 19:23:08,388 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:23:08,388 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:25 [2019-09-03 19:23:08,544 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-09-03 19:23:08,545 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 34 treesize of output 10 [2019-09-03 19:23:08,545 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:23:08,547 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:23:08,548 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:23:08,548 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:3 [2019-09-03 19:23:08,583 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 121 proven. 47 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-09-03 19:23:08,586 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:23:08,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 33 [2019-09-03 19:23:08,588 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-03 19:23:08,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-03 19:23:08,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=937, Unknown=0, NotChecked=0, Total=1056 [2019-09-03 19:23:08,589 INFO L87 Difference]: Start difference. First operand 225 states and 271 transitions. Second operand 33 states. [2019-09-03 19:23:10,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:23:10,718 INFO L93 Difference]: Finished difference Result 345 states and 413 transitions. [2019-09-03 19:23:10,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-03 19:23:10,719 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 102 [2019-09-03 19:23:10,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:23:10,720 INFO L225 Difference]: With dead ends: 345 [2019-09-03 19:23:10,720 INFO L226 Difference]: Without dead ends: 255 [2019-09-03 19:23:10,722 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 93 SyntacticMatches, 5 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 613 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=351, Invalid=2511, Unknown=0, NotChecked=0, Total=2862 [2019-09-03 19:23:10,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-09-03 19:23:10,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 234. [2019-09-03 19:23:10,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-09-03 19:23:10,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 281 transitions. [2019-09-03 19:23:10,743 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 281 transitions. Word has length 102 [2019-09-03 19:23:10,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:23:10,743 INFO L475 AbstractCegarLoop]: Abstraction has 234 states and 281 transitions. [2019-09-03 19:23:10,743 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-03 19:23:10,743 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 281 transitions. [2019-09-03 19:23:10,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-03 19:23:10,744 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:23:10,745 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:23:10,745 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:23:10,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:23:10,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1986247122, now seen corresponding path program 5 times [2019-09-03 19:23:10,745 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:23:10,745 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:23:10,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:23:10,746 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:23:10,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:23:10,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:23:11,481 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 47 [2019-09-03 19:23:11,836 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-09-03 19:23:12,135 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 6 proven. 206 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-09-03 19:23:12,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:23:12,135 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:23:12,146 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:23:12,333 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2019-09-03 19:23:12,333 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:23:12,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 68 conjunts are in the unsatisfiable core [2019-09-03 19:23:12,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:23:12,355 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:23:12,356 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2019-09-03 19:23:12,356 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:23:12,393 INFO L567 ElimStorePlain]: treesize reduction 10, result has 79.6 percent of original size [2019-09-03 19:23:12,393 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:23:12,393 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:39 [2019-09-03 19:23:12,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:23:12,473 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:23:12,474 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 64 [2019-09-03 19:23:12,475 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:23:12,483 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:23:12,483 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 44 treesize of output 48 [2019-09-03 19:23:12,484 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-03 19:23:12,537 INFO L567 ElimStorePlain]: treesize reduction 43, result has 44.9 percent of original size [2019-09-03 19:23:12,538 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:23:12,538 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:91, output treesize:35 [2019-09-03 19:23:12,588 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:23:12,590 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2019-09-03 19:23:12,590 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:23:12,624 INFO L567 ElimStorePlain]: treesize reduction 4, result has 91.3 percent of original size [2019-09-03 19:23:12,624 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:23:12,624 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:50, output treesize:42 [2019-09-03 19:23:12,739 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:23:12,741 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:23:12,742 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:23:12,743 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:23:12,760 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:23:12,761 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 43 treesize of output 74 [2019-09-03 19:23:12,762 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:23:12,823 INFO L567 ElimStorePlain]: treesize reduction 38, result has 57.3 percent of original size [2019-09-03 19:23:12,823 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:23:12,823 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:55, output treesize:51 [2019-09-03 19:23:12,988 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:23:12,989 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:23:12,990 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:23:12,991 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:23:12,992 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:23:12,993 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:23:12,993 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:23:12,995 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:23:13,006 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:23:13,006 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 52 treesize of output 76 [2019-09-03 19:23:13,007 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:23:13,061 INFO L567 ElimStorePlain]: treesize reduction 34, result has 63.8 percent of original size [2019-09-03 19:23:13,062 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:23:13,062 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:64, output treesize:60 [2019-09-03 19:23:13,283 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:23:13,284 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:23:13,285 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:23:13,286 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:23:13,288 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:23:13,289 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:23:13,290 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:23:13,292 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:23:13,293 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:23:13,295 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:23:13,297 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:23:13,298 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:23:13,314 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:23:13,314 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 59 treesize of output 86 [2019-09-03 19:23:13,316 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:23:13,368 INFO L567 ElimStorePlain]: treesize reduction 34, result has 65.3 percent of original size [2019-09-03 19:23:13,369 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:23:13,369 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:68, output treesize:64 [2019-09-03 19:23:13,460 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:23:13,461 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:23:13,462 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:23:13,462 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:23:13,463 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:23:13,464 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:23:13,465 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:23:13,570 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-09-03 19:23:13,570 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:23:13,571 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 21 case distinctions, treesize of input 60 treesize of output 238 [2019-09-03 19:23:13,572 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:23:13,677 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2019-09-03 19:23:13,677 INFO L567 ElimStorePlain]: treesize reduction 152, result has 29.0 percent of original size [2019-09-03 19:23:13,678 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-03 19:23:13,678 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:66, output treesize:62 [2019-09-03 19:23:13,762 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:23:13,766 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:23:13,767 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:23:13,767 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:23:13,768 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:23:13,769 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:23:13,770 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:23:13,833 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:23:13,834 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 6 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 56 treesize of output 110 [2019-09-03 19:23:13,835 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:23:13,867 INFO L567 ElimStorePlain]: treesize reduction 72, result has 16.3 percent of original size [2019-09-03 19:23:13,867 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:23:13,868 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:65, output treesize:10 [2019-09-03 19:23:31,676 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 13 proven. 219 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2019-09-03 19:23:31,680 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:23:31,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 34] total 55 [2019-09-03 19:23:31,681 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-09-03 19:23:31,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-09-03 19:23:31,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=2746, Unknown=14, NotChecked=0, Total=2970 [2019-09-03 19:23:31,682 INFO L87 Difference]: Start difference. First operand 234 states and 281 transitions. Second operand 55 states. [2019-09-03 19:23:32,296 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2019-09-03 19:23:32,997 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2019-09-03 19:23:33,202 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2019-09-03 19:23:33,390 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2019-09-03 19:23:33,591 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 60 [2019-09-03 19:23:33,827 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 59 [2019-09-03 19:23:46,554 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 74 [2019-09-03 19:23:51,027 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 69 [2019-09-03 19:23:54,998 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 69 [2019-09-03 19:23:57,820 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 82 [2019-09-03 19:24:00,480 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 68 [2019-09-03 19:24:03,649 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 73 [2019-09-03 19:24:06,357 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 69 [2019-09-03 19:24:08,879 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 70 [2019-09-03 19:24:11,915 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 82 [2019-09-03 19:24:14,808 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 83 [2019-09-03 19:24:17,510 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 76 [2019-09-03 19:24:19,003 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 69 [2019-09-03 19:24:19,226 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 73 [2019-09-03 19:24:21,863 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 67 [2019-09-03 19:24:24,392 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 69 [2019-09-03 19:24:30,131 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 80 [2019-09-03 19:24:30,371 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 82 [2019-09-03 19:24:35,951 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 73 [2019-09-03 19:24:38,733 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 74 [2019-09-03 19:24:38,952 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 68 [2019-09-03 19:24:44,284 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 65 [2019-09-03 19:24:47,030 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 68 [2019-09-03 19:24:52,194 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 73 [2019-09-03 19:24:57,997 WARN L188 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 82 [2019-09-03 19:25:00,765 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 81 [2019-09-03 19:25:02,240 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 81 [2019-09-03 19:25:02,488 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 82 [2019-09-03 19:25:02,738 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 82 [2019-09-03 19:25:13,091 WARN L188 SmtUtils]: Spent 1.45 s on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2019-09-03 19:25:19,377 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 64 [2019-09-03 19:25:26,294 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 74 [2019-09-03 19:25:51,228 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 64 [2019-09-03 19:25:58,818 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 63 [2019-09-03 19:26:00,474 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-09-03 19:26:08,247 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 78 [2019-09-03 19:26:16,418 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 80 [2019-09-03 19:26:22,138 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 78 [2019-09-03 19:26:27,894 WARN L188 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 80 [2019-09-03 19:26:38,414 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 72 [2019-09-03 19:26:46,815 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 73 [2019-09-03 19:26:54,503 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 72 [2019-09-03 19:27:05,181 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 64 [2019-09-03 19:27:09,444 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 82 [2019-09-03 19:27:16,357 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 79 [2019-09-03 19:27:25,967 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 84 [2019-09-03 19:27:27,813 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 85 [2019-09-03 19:27:28,059 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 82 [2019-09-03 19:27:33,743 WARN L188 SmtUtils]: Spent 2.72 s on a formula simplification. DAG size of input: 100 DAG size of output: 96 [2019-09-03 19:27:41,590 WARN L188 SmtUtils]: Spent 3.10 s on a formula simplification. DAG size of input: 106 DAG size of output: 92 [2019-09-03 19:27:51,786 WARN L188 SmtUtils]: Spent 7.20 s on a formula simplification. DAG size of input: 105 DAG size of output: 91 [2019-09-03 19:28:05,581 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 82 [2019-09-03 19:28:09,529 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 78 [2019-09-03 19:28:20,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:28:20,551 INFO L93 Difference]: Finished difference Result 972 states and 1214 transitions. [2019-09-03 19:28:20,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-09-03 19:28:20,551 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 102 [2019-09-03 19:28:20,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:28:20,564 INFO L225 Difference]: With dead ends: 972 [2019-09-03 19:28:20,564 INFO L226 Difference]: Without dead ends: 529 [2019-09-03 19:28:20,574 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 78 SyntacticMatches, 6 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5781 ImplicationChecksByTransitivity, 184.7s TimeCoverageRelationStatistics Valid=1988, Invalid=18199, Unknown=119, NotChecked=0, Total=20306 [2019-09-03 19:28:20,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2019-09-03 19:28:20,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 310. [2019-09-03 19:28:20,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2019-09-03 19:28:20,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 384 transitions. [2019-09-03 19:28:20,635 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 384 transitions. Word has length 102 [2019-09-03 19:28:20,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:28:20,635 INFO L475 AbstractCegarLoop]: Abstraction has 310 states and 384 transitions. [2019-09-03 19:28:20,635 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-09-03 19:28:20,636 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 384 transitions. [2019-09-03 19:28:20,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-03 19:28:20,637 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:28:20,638 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:28:20,638 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:28:20,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:28:20,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1336748588, now seen corresponding path program 6 times [2019-09-03 19:28:20,639 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:28:20,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:28:20,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:28:20,642 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:28:20,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:28:20,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:28:22,615 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-09-03 19:28:22,790 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 45 [2019-09-03 19:28:23,214 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 11 proven. 215 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-09-03 19:28:23,215 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:28:23,215 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:28:23,226 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:28:23,353 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2019-09-03 19:28:23,353 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:28:23,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-03 19:28:23,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:28:23,950 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:23,952 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:23,954 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:23,955 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:28:23,956 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 43 [2019-09-03 19:28:23,957 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:28:23,974 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:28:23,975 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-03 19:28:23,976 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:81, output treesize:40 [2019-09-03 19:28:24,441 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:24,447 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:24,448 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:28:24,449 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:28:24,458 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:28:24,458 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 18 [2019-09-03 19:28:24,459 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:28:24,470 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:28:24,471 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:28:24,471 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:60, output treesize:15 [2019-09-03 19:28:24,590 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 117 proven. 60 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-09-03 19:28:24,602 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:28:24,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 19] total 47 [2019-09-03 19:28:24,603 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-03 19:28:24,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-03 19:28:24,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=2016, Unknown=0, NotChecked=0, Total=2162 [2019-09-03 19:28:24,604 INFO L87 Difference]: Start difference. First operand 310 states and 384 transitions. Second operand 47 states. [2019-09-03 19:28:25,421 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 34 [2019-09-03 19:28:25,668 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 45 [2019-09-03 19:28:25,900 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 34 [2019-09-03 19:28:26,105 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 45 [2019-09-03 19:28:26,620 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 34 [2019-09-03 19:28:26,849 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 45 [2019-09-03 19:28:27,437 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 34 [2019-09-03 19:28:27,649 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 44 [2019-09-03 19:28:28,424 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 32 [2019-09-03 19:28:28,679 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 44 [2019-09-03 19:28:29,057 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2019-09-03 19:28:30,704 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 57 [2019-09-03 19:28:31,046 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 41 [2019-09-03 19:28:31,834 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 53 [2019-09-03 19:28:32,057 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 58 [2019-09-03 19:28:32,716 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 41 [2019-09-03 19:28:33,109 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 61 [2019-09-03 19:28:33,395 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 41 [2019-09-03 19:28:33,655 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 54 [2019-09-03 19:28:34,029 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 58 [2019-09-03 19:28:34,315 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 46 [2019-09-03 19:28:34,685 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 40 [2019-09-03 19:28:34,908 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 58 [2019-09-03 19:28:36,444 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-03 19:28:37,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:28:37,054 INFO L93 Difference]: Finished difference Result 701 states and 877 transitions. [2019-09-03 19:28:37,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-09-03 19:28:37,054 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 102 [2019-09-03 19:28:37,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:28:37,058 INFO L225 Difference]: With dead ends: 701 [2019-09-03 19:28:37,058 INFO L226 Difference]: Without dead ends: 531 [2019-09-03 19:28:37,062 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 92 SyntacticMatches, 5 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2994 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=1220, Invalid=10552, Unknown=0, NotChecked=0, Total=11772 [2019-09-03 19:28:37,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2019-09-03 19:28:37,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 410. [2019-09-03 19:28:37,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-09-03 19:28:37,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 512 transitions. [2019-09-03 19:28:37,115 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 512 transitions. Word has length 102 [2019-09-03 19:28:37,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:28:37,115 INFO L475 AbstractCegarLoop]: Abstraction has 410 states and 512 transitions. [2019-09-03 19:28:37,116 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-03 19:28:37,116 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 512 transitions. [2019-09-03 19:28:37,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-03 19:28:37,117 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:28:37,118 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 7, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:28:37,118 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:28:37,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:28:37,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1664820590, now seen corresponding path program 7 times [2019-09-03 19:28:37,118 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:28:37,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:28:37,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:28:37,119 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:28:37,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:28:37,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:28:38,601 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 49 [2019-09-03 19:28:38,992 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 6 proven. 194 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-09-03 19:28:38,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:28:38,993 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:28:39,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:28:39,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:28:39,059 INFO L256 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-03 19:28:39,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:28:39,325 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:39,328 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2019-09-03 19:28:39,328 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:28:39,336 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:28:39,336 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:28:39,336 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:7 [2019-09-03 19:28:39,690 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:39,691 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:39,692 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:39,693 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:28:39,694 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 44 [2019-09-03 19:28:39,695 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:28:39,710 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:28:39,710 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:28:39,711 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:72, output treesize:30 [2019-09-03 19:28:39,880 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:39,881 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:28:39,882 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 12 [2019-09-03 19:28:39,882 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:28:39,888 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:28:39,888 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:28:39,889 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:9 [2019-09-03 19:28:39,950 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 55 proven. 147 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2019-09-03 19:28:39,953 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:28:39,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 18] total 42 [2019-09-03 19:28:39,954 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-09-03 19:28:39,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-09-03 19:28:39,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1596, Unknown=0, NotChecked=0, Total=1722 [2019-09-03 19:28:39,955 INFO L87 Difference]: Start difference. First operand 410 states and 512 transitions. Second operand 42 states. [2019-09-03 19:28:42,791 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 48 [2019-09-03 19:28:43,570 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 53 [2019-09-03 19:28:47,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:28:47,328 INFO L93 Difference]: Finished difference Result 968 states and 1212 transitions. [2019-09-03 19:28:47,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-09-03 19:28:47,328 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 102 [2019-09-03 19:28:47,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:28:47,333 INFO L225 Difference]: With dead ends: 968 [2019-09-03 19:28:47,333 INFO L226 Difference]: Without dead ends: 816 [2019-09-03 19:28:47,335 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 93 SyntacticMatches, 5 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1489 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=605, Invalid=6535, Unknown=0, NotChecked=0, Total=7140 [2019-09-03 19:28:47,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 816 states. [2019-09-03 19:28:47,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 816 to 455. [2019-09-03 19:28:47,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455 states. [2019-09-03 19:28:47,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 568 transitions. [2019-09-03 19:28:47,400 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 568 transitions. Word has length 102 [2019-09-03 19:28:47,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:28:47,400 INFO L475 AbstractCegarLoop]: Abstraction has 455 states and 568 transitions. [2019-09-03 19:28:47,400 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-09-03 19:28:47,400 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 568 transitions. [2019-09-03 19:28:47,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-03 19:28:47,402 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:28:47,403 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:28:47,403 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:28:47,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:28:47,403 INFO L82 PathProgramCache]: Analyzing trace with hash -973234200, now seen corresponding path program 8 times [2019-09-03 19:28:47,403 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:28:47,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:28:47,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:28:47,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:28:47,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:28:47,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:28:49,062 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 9 proven. 225 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-03 19:28:49,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:28:49,063 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:28:49,073 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:28:49,128 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:28:49,128 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:28:49,129 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-03 19:28:49,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:28:49,951 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:49,952 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:49,954 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:49,955 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:49,956 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:49,961 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:50,009 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:28:50,010 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 73 treesize of output 198 [2019-09-03 19:28:50,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:28:50,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:28:50,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:28:50,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-03 19:28:50,013 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:28:50,217 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 47 [2019-09-03 19:28:50,218 INFO L567 ElimStorePlain]: treesize reduction 296, result has 36.5 percent of original size [2019-09-03 19:28:50,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:28:50,220 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-03 19:28:50,220 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:84, output treesize:117 [2019-09-03 19:28:50,534 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:50,535 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:28:50,535 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 12 [2019-09-03 19:28:50,535 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:28:50,539 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:28:50,540 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:28:50,540 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:9 [2019-09-03 19:28:50,601 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 121 proven. 47 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-09-03 19:28:50,604 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:28:50,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 19] total 47 [2019-09-03 19:28:50,606 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-03 19:28:50,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-03 19:28:50,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1993, Unknown=0, NotChecked=0, Total=2162 [2019-09-03 19:28:50,606 INFO L87 Difference]: Start difference. First operand 455 states and 568 transitions. Second operand 47 states. [2019-09-03 19:28:53,209 WARN L188 SmtUtils]: Spent 416.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 41 [2019-09-03 19:28:54,155 WARN L188 SmtUtils]: Spent 842.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 39 [2019-09-03 19:28:58,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:28:58,070 INFO L93 Difference]: Finished difference Result 793 states and 997 transitions. [2019-09-03 19:28:58,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-03 19:28:58,074 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 102 [2019-09-03 19:28:58,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:28:58,076 INFO L225 Difference]: With dead ends: 793 [2019-09-03 19:28:58,077 INFO L226 Difference]: Without dead ends: 617 [2019-09-03 19:28:58,078 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 92 SyntacticMatches, 3 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1936 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=765, Invalid=7245, Unknown=0, NotChecked=0, Total=8010 [2019-09-03 19:28:58,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-09-03 19:28:58,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 529. [2019-09-03 19:28:58,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 529 states. [2019-09-03 19:28:58,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 662 transitions. [2019-09-03 19:28:58,143 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 662 transitions. Word has length 102 [2019-09-03 19:28:58,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:28:58,143 INFO L475 AbstractCegarLoop]: Abstraction has 529 states and 662 transitions. [2019-09-03 19:28:58,144 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-03 19:28:58,144 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 662 transitions. [2019-09-03 19:28:58,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-03 19:28:58,145 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:28:58,146 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:28:58,146 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:28:58,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:28:58,146 INFO L82 PathProgramCache]: Analyzing trace with hash -523632671, now seen corresponding path program 9 times [2019-09-03 19:28:58,146 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:28:58,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:28:58,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:28:58,147 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:28:58,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:28:58,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:28:58,866 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 22 proven. 119 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2019-09-03 19:28:58,867 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:28:58,867 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:28:58,877 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:28:59,011 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-09-03 19:28:59,011 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:28:59,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-03 19:28:59,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:28:59,033 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:28:59,034 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2019-09-03 19:28:59,034 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:28:59,065 INFO L567 ElimStorePlain]: treesize reduction 10, result has 78.3 percent of original size [2019-09-03 19:28:59,066 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:28:59,066 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:36 [2019-09-03 19:28:59,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:28:59,126 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:28:59,126 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 55 [2019-09-03 19:28:59,127 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:28:59,142 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:28:59,142 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 35 treesize of output 39 [2019-09-03 19:28:59,143 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-03 19:28:59,175 INFO L567 ElimStorePlain]: treesize reduction 34, result has 43.3 percent of original size [2019-09-03 19:28:59,175 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:28:59,176 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:73, output treesize:26 [2019-09-03 19:28:59,208 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:59,209 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2019-09-03 19:28:59,209 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:28:59,220 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:28:59,221 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:28:59,221 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:37 [2019-09-03 19:28:59,291 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:59,301 INFO L341 Elim1Store]: treesize reduction 40, result has 23.1 percent of original size [2019-09-03 19:28:59,302 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 53 [2019-09-03 19:28:59,302 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:28:59,317 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:28:59,318 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:28:59,318 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:55, output treesize:51 [2019-09-03 19:28:59,415 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:59,438 INFO L341 Elim1Store]: treesize reduction 96, result has 20.7 percent of original size [2019-09-03 19:28:59,438 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 70 [2019-09-03 19:28:59,439 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:28:59,455 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:28:59,456 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:28:59,456 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:69, output treesize:65 [2019-09-03 19:28:59,567 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:59,605 INFO L341 Elim1Store]: treesize reduction 171, result has 17.8 percent of original size [2019-09-03 19:28:59,605 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 76 treesize of output 87 [2019-09-03 19:28:59,606 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:28:59,628 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:28:59,629 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-03 19:28:59,629 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:83, output treesize:79 [2019-09-03 19:28:59,687 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:59,842 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 49 [2019-09-03 19:28:59,843 INFO L341 Elim1Store]: treesize reduction 105, result has 65.7 percent of original size [2019-09-03 19:28:59,843 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 87 treesize of output 254 [2019-09-03 19:28:59,844 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:28:59,929 INFO L567 ElimStorePlain]: treesize reduction 153, result has 37.0 percent of original size [2019-09-03 19:28:59,930 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-09-03 19:28:59,930 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:94, output treesize:90 [2019-09-03 19:28:59,999 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:29:00,059 INFO L341 Elim1Store]: treesize reduction 105, result has 39.3 percent of original size [2019-09-03 19:29:00,059 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 2 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 83 treesize of output 95 [2019-09-03 19:29:00,060 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:29:00,077 INFO L567 ElimStorePlain]: treesize reduction 73, result has 13.1 percent of original size [2019-09-03 19:29:00,077 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:29:00,078 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:93, output treesize:7 [2019-09-03 19:29:01,036 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 10 proven. 100 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (21)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:29:01,051 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:29:01,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 21] total 36 [2019-09-03 19:29:01,052 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-03 19:29:01,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-03 19:29:01,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1132, Unknown=1, NotChecked=0, Total=1260 [2019-09-03 19:29:01,053 INFO L87 Difference]: Start difference. First operand 529 states and 662 transitions. Second operand 36 states. [2019-09-03 19:29:03,047 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 79 [2019-09-03 19:29:03,597 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 88 [2019-09-03 19:29:04,062 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 78 [2019-09-03 19:29:04,300 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 79 [2019-09-03 19:29:04,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:29:04,589 INFO L93 Difference]: Finished difference Result 888 states and 1109 transitions. [2019-09-03 19:29:04,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-03 19:29:04,590 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 110 [2019-09-03 19:29:04,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:29:04,593 INFO L225 Difference]: With dead ends: 888 [2019-09-03 19:29:04,593 INFO L226 Difference]: Without dead ends: 427 [2019-09-03 19:29:04,595 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 97 SyntacticMatches, 5 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 880 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=463, Invalid=2958, Unknown=1, NotChecked=0, Total=3422 [2019-09-03 19:29:04,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2019-09-03 19:29:04,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 425. [2019-09-03 19:29:04,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2019-09-03 19:29:04,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 521 transitions. [2019-09-03 19:29:04,651 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 521 transitions. Word has length 110 [2019-09-03 19:29:04,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:29:04,652 INFO L475 AbstractCegarLoop]: Abstraction has 425 states and 521 transitions. [2019-09-03 19:29:04,652 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-03 19:29:04,652 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 521 transitions. [2019-09-03 19:29:04,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-03 19:29:04,653 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:29:04,653 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:29:04,654 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:29:04,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:29:04,654 INFO L82 PathProgramCache]: Analyzing trace with hash -2070152803, now seen corresponding path program 10 times [2019-09-03 19:29:04,654 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:29:04,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:29:04,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:29:04,655 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:29:04,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:29:04,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:29:05,193 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2019-09-03 19:29:05,323 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 40 [2019-09-03 19:29:05,471 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 42 [2019-09-03 19:29:05,877 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 20 proven. 167 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2019-09-03 19:29:05,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:29:05,877 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:29:05,894 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:29:05,945 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:29:05,945 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:29:05,947 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-03 19:29:05,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:29:06,328 INFO L341 Elim1Store]: treesize reduction 182, result has 11.7 percent of original size [2019-09-03 19:29:06,328 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 66 treesize of output 44 [2019-09-03 19:29:06,329 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:29:06,338 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:29:06,338 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:29:06,339 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:69, output treesize:27 [2019-09-03 19:29:06,512 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-09-03 19:29:06,512 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 36 treesize of output 12 [2019-09-03 19:29:06,513 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:29:06,515 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:29:06,515 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:29:06,515 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:5 [2019-09-03 19:29:06,557 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 90 proven. 123 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-09-03 19:29:06,560 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:29:06,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 18] total 38 [2019-09-03 19:29:06,561 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-03 19:29:06,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-03 19:29:06,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1264, Unknown=0, NotChecked=0, Total=1406 [2019-09-03 19:29:06,561 INFO L87 Difference]: Start difference. First operand 425 states and 521 transitions. Second operand 38 states. [2019-09-03 19:29:07,860 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 54 [2019-09-03 19:29:08,025 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 39 [2019-09-03 19:29:08,268 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 54 [2019-09-03 19:29:08,479 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 48 [2019-09-03 19:29:08,848 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 55 [2019-09-03 19:29:09,484 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 49 [2019-09-03 19:29:09,690 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 44 [2019-09-03 19:29:10,255 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 46 [2019-09-03 19:29:10,471 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 52 [2019-09-03 19:29:10,691 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 41 [2019-09-03 19:29:10,980 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 58 [2019-09-03 19:29:11,229 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 44 [2019-09-03 19:29:11,463 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 35 [2019-09-03 19:29:11,718 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 62 [2019-09-03 19:29:11,887 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 44 [2019-09-03 19:29:12,283 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 52 [2019-09-03 19:29:12,522 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 57 [2019-09-03 19:29:12,786 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 62 [2019-09-03 19:29:12,977 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 40 [2019-09-03 19:29:13,240 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 62 [2019-09-03 19:29:13,440 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 54 [2019-09-03 19:29:13,602 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 49 [2019-09-03 19:29:14,100 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 42 [2019-09-03 19:29:14,420 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 50 [2019-09-03 19:29:14,671 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 60 [2019-09-03 19:29:14,830 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 42 [2019-09-03 19:29:14,979 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 44 [2019-09-03 19:29:15,148 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-09-03 19:29:15,430 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 58 [2019-09-03 19:29:15,682 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 52 [2019-09-03 19:29:15,912 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 60 [2019-09-03 19:29:16,094 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 52 [2019-09-03 19:29:16,447 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 60 [2019-09-03 19:29:16,716 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 60 [2019-09-03 19:29:17,181 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 49 [2019-09-03 19:29:17,456 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 58 [2019-09-03 19:29:17,649 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 50 [2019-09-03 19:29:18,155 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 52 [2019-09-03 19:29:18,527 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 60 [2019-09-03 19:29:18,957 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 52 [2019-09-03 19:29:19,276 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 42 [2019-09-03 19:29:19,479 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 52 [2019-09-03 19:29:19,699 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 52 [2019-09-03 19:29:19,928 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 40 [2019-09-03 19:29:20,083 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 40 [2019-09-03 19:29:20,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:29:20,535 INFO L93 Difference]: Finished difference Result 943 states and 1163 transitions. [2019-09-03 19:29:20,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-09-03 19:29:20,536 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 110 [2019-09-03 19:29:20,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:29:20,539 INFO L225 Difference]: With dead ends: 943 [2019-09-03 19:29:20,539 INFO L226 Difference]: Without dead ends: 325 [2019-09-03 19:29:20,542 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 100 SyntacticMatches, 5 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4785 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=1742, Invalid=12300, Unknown=0, NotChecked=0, Total=14042 [2019-09-03 19:29:20,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2019-09-03 19:29:20,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 276. [2019-09-03 19:29:20,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-09-03 19:29:20,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 322 transitions. [2019-09-03 19:29:20,582 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 322 transitions. Word has length 110 [2019-09-03 19:29:20,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:29:20,583 INFO L475 AbstractCegarLoop]: Abstraction has 276 states and 322 transitions. [2019-09-03 19:29:20,583 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-03 19:29:20,583 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 322 transitions. [2019-09-03 19:29:20,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-03 19:29:20,584 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:29:20,584 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:29:20,584 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:29:20,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:29:20,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1594685855, now seen corresponding path program 11 times [2019-09-03 19:29:20,585 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:29:20,585 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:29:20,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:29:20,586 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:29:20,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:29:20,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:29:21,155 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 38 [2019-09-03 19:29:21,582 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 44 [2019-09-03 19:29:22,691 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 21 proven. 201 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-09-03 19:29:22,691 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:29:22,691 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:29:22,703 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:29:22,742 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-09-03 19:29:22,742 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:29:22,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-03 19:29:22,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:29:23,664 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 58 [2019-09-03 19:29:23,664 INFO L341 Elim1Store]: treesize reduction 187, result has 58.0 percent of original size [2019-09-03 19:29:23,665 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 73 treesize of output 277 [2019-09-03 19:29:23,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:29:23,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:29:23,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:29:23,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:29:23,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:29:23,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:29:23,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-03 19:29:23,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:29:23,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-03 19:29:23,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-03 19:29:23,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:29:23,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-03 19:29:23,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:29:23,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-03 19:29:23,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:29:23,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:29:23,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:29:23,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:29:23,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-03 19:29:23,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-03 19:29:23,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:29:23,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:29:23,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:29:23,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-03 19:29:23,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:29:23,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-03 19:29:23,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-03 19:29:23,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:29:23,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:29:23,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:29:23,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-03 19:29:23,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-03 19:29:23,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:29:23,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:29:23,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:29:23,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:29:23,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:29:23,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-03 19:29:23,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-03 19:29:23,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:29:23,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-03 19:29:23,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:29:23,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:29:23,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-03 19:29:23,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-03 19:29:23,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:29:23,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-03 19:29:23,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:29:23,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:29:23,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-03 19:29:23,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:29:23,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-03 19:29:23,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:29:23,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:29:23,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:29:23,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:29:23,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:29:23,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:29:23,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:29:23,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:29:23,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:29:23,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:29:23,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:29:23,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-03 19:29:23,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-03 19:29:23,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:29:23,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:29:23,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:29:23,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-03 19:29:23,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:29:23,714 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:29:24,065 WARN L188 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 46 [2019-09-03 19:29:24,066 INFO L567 ElimStorePlain]: treesize reduction 2692, result has 5.9 percent of original size [2019-09-03 19:29:24,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:29:24,068 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-03 19:29:24,068 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:83, output treesize:116 [2019-09-03 19:29:24,305 INFO L341 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2019-09-03 19:29:24,305 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 46 treesize of output 12 [2019-09-03 19:29:24,306 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:29:24,310 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:29:24,310 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:29:24,311 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:51, output treesize:5 [2019-09-03 19:29:24,370 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 167 proven. 27 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2019-09-03 19:29:24,374 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:29:24,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 19] total 46 [2019-09-03 19:29:24,375 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-09-03 19:29:24,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-09-03 19:29:24,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1934, Unknown=0, NotChecked=0, Total=2070 [2019-09-03 19:29:24,376 INFO L87 Difference]: Start difference. First operand 276 states and 322 transitions. Second operand 46 states. [2019-09-03 19:29:26,879 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-09-03 19:29:27,070 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 47 [2019-09-03 19:29:27,324 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 38 [2019-09-03 19:29:27,619 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 50 [2019-09-03 19:29:28,750 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 65 [2019-09-03 19:29:29,077 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 58 [2019-09-03 19:29:30,066 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-09-03 19:29:30,457 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 54 [2019-09-03 19:29:30,688 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 47 [2019-09-03 19:29:30,880 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 45 [2019-09-03 19:29:31,049 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 35 [2019-09-03 19:29:31,272 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 53 [2019-09-03 19:29:31,505 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 47 [2019-09-03 19:29:31,678 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 43 [2019-09-03 19:29:31,842 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 35 [2019-09-03 19:29:32,058 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 58 [2019-09-03 19:29:32,368 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 48 [2019-09-03 19:29:32,546 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 46 [2019-09-03 19:29:32,795 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 57 [2019-09-03 19:29:33,009 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 57 [2019-09-03 19:29:33,352 WARN L188 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 60 [2019-09-03 19:29:33,614 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 63 [2019-09-03 19:29:33,815 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 46 [2019-09-03 19:29:34,090 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 56 [2019-09-03 19:29:34,361 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 47 [2019-09-03 19:29:34,608 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 41 [2019-09-03 19:29:34,847 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 55 [2019-09-03 19:29:35,033 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 28 [2019-09-03 19:29:35,392 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 62 [2019-09-03 19:29:36,197 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 54 [2019-09-03 19:29:36,449 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 63 [2019-09-03 19:29:36,661 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 58 [2019-09-03 19:29:37,192 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 60 [2019-09-03 19:29:38,975 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 35 [2019-09-03 19:29:40,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:29:40,655 INFO L93 Difference]: Finished difference Result 543 states and 648 transitions. [2019-09-03 19:29:40,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-09-03 19:29:40,656 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 110 [2019-09-03 19:29:40,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:29:40,659 INFO L225 Difference]: With dead ends: 543 [2019-09-03 19:29:40,659 INFO L226 Difference]: Without dead ends: 369 [2019-09-03 19:29:40,661 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 104 SyntacticMatches, 5 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5163 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=1556, Invalid=16804, Unknown=0, NotChecked=0, Total=18360 [2019-09-03 19:29:40,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2019-09-03 19:29:40,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 303. [2019-09-03 19:29:40,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2019-09-03 19:29:40,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 354 transitions. [2019-09-03 19:29:40,724 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 354 transitions. Word has length 110 [2019-09-03 19:29:40,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:29:40,724 INFO L475 AbstractCegarLoop]: Abstraction has 303 states and 354 transitions. [2019-09-03 19:29:40,724 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-09-03 19:29:40,724 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 354 transitions. [2019-09-03 19:29:40,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-03 19:29:40,726 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:29:40,726 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:29:40,726 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:29:40,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:29:40,726 INFO L82 PathProgramCache]: Analyzing trace with hash 801223523, now seen corresponding path program 12 times [2019-09-03 19:29:40,726 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:29:40,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:29:40,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:29:40,727 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:29:40,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:29:40,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:29:41,898 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 52 [2019-09-03 19:29:42,178 WARN L188 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 57 [2019-09-03 19:29:42,405 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 42 [2019-09-03 19:29:42,748 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 45 [2019-09-03 19:29:43,002 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 46 [2019-09-03 19:29:43,331 WARN L188 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 54 [2019-09-03 19:29:43,652 WARN L188 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 50 [2019-09-03 19:29:43,815 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 43 [2019-09-03 19:29:44,723 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 18 proven. 204 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-09-03 19:29:44,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:29:44,724 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:29:44,734 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:29:44,877 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2019-09-03 19:29:44,877 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:29:44,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 71 conjunts are in the unsatisfiable core [2019-09-03 19:29:44,882 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:29:44,901 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:29:44,901 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2019-09-03 19:29:44,902 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:29:44,942 INFO L567 ElimStorePlain]: treesize reduction 10, result has 79.6 percent of original size [2019-09-03 19:29:44,942 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:29:44,942 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:39 [2019-09-03 19:29:45,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:29:45,022 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:29:45,023 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 38 treesize of output 42 [2019-09-03 19:29:45,023 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:29:45,045 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:29:45,046 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 58 [2019-09-03 19:29:45,046 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-03 19:29:45,082 INFO L567 ElimStorePlain]: treesize reduction 37, result has 43.9 percent of original size [2019-09-03 19:29:45,082 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:29:45,082 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:79, output treesize:29 [2019-09-03 19:29:45,136 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:29:45,137 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2019-09-03 19:29:45,137 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:29:45,152 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:29:45,152 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-03 19:29:45,153 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:44, output treesize:40 [2019-09-03 19:29:45,225 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:29:45,239 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:29:45,240 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 86 [2019-09-03 19:29:45,241 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:29:45,281 INFO L567 ElimStorePlain]: treesize reduction 36, result has 58.6 percent of original size [2019-09-03 19:29:45,282 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-03 19:29:45,282 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:51 [2019-09-03 19:29:45,340 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:29:45,355 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:29:45,356 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 86 [2019-09-03 19:29:45,357 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:29:45,396 INFO L567 ElimStorePlain]: treesize reduction 36, result has 58.6 percent of original size [2019-09-03 19:29:45,397 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-03 19:29:45,397 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:51 [2019-09-03 19:29:45,457 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:29:45,476 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:29:45,477 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 86 [2019-09-03 19:29:45,477 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:29:45,519 INFO L567 ElimStorePlain]: treesize reduction 36, result has 58.6 percent of original size [2019-09-03 19:29:45,520 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-03 19:29:45,520 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:51 [2019-09-03 19:29:45,581 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:29:45,598 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:29:45,598 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 86 [2019-09-03 19:29:45,599 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:29:45,639 INFO L567 ElimStorePlain]: treesize reduction 36, result has 58.6 percent of original size [2019-09-03 19:29:45,640 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-09-03 19:29:45,640 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:55, output treesize:51 [2019-09-03 19:29:51,715 WARN L188 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 35 [2019-09-03 19:29:51,726 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:29:51,732 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:29:51,733 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 29 [2019-09-03 19:29:51,733 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-09-03 19:29:51,750 INFO L567 ElimStorePlain]: treesize reduction 16, result has 46.7 percent of original size [2019-09-03 19:29:51,751 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:29:51,751 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:54, output treesize:10 [2019-09-03 19:29:56,822 WARN L188 SmtUtils]: Spent 796.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-09-03 19:29:57,715 WARN L188 SmtUtils]: Spent 825.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2019-09-03 19:29:58,619 WARN L188 SmtUtils]: Spent 832.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-09-03 19:30:00,222 WARN L188 SmtUtils]: Spent 1.49 s on a formula simplification that was a NOOP. DAG size: 36 [2019-09-03 19:30:01,095 WARN L188 SmtUtils]: Spent 792.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-09-03 19:30:01,995 WARN L188 SmtUtils]: Spent 811.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-09-03 19:30:03,406 WARN L188 SmtUtils]: Spent 1.30 s on a formula simplification that was a NOOP. DAG size: 47 [2019-09-03 19:30:04,320 WARN L188 SmtUtils]: Spent 823.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-09-03 19:30:40,605 WARN L188 SmtUtils]: Spent 1.51 s on a formula simplification that was a NOOP. DAG size: 38 [2019-09-03 19:30:44,548 WARN L188 SmtUtils]: Spent 1.83 s on a formula simplification that was a NOOP. DAG size: 42 [2019-09-03 19:30:46,671 WARN L188 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 42 [2019-09-03 19:31:06,988 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 14 proven. 210 refuted. 6 times theorem prover too weak. 89 trivial. 0 not checked. [2019-09-03 19:31:06,993 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:31:06,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 32] total 64 [2019-09-03 19:31:06,994 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-09-03 19:31:06,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-09-03 19:31:06,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=3772, Unknown=35, NotChecked=0, Total=4032 [2019-09-03 19:31:06,997 INFO L87 Difference]: Start difference. First operand 303 states and 354 transitions. Second operand 64 states. [2019-09-03 19:31:46,947 WARN L188 SmtUtils]: Spent 2.06 s on a formula simplification. DAG size of input: 49 DAG size of output: 41 [2019-09-03 19:32:04,742 WARN L188 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 50 DAG size of output: 49 [2019-09-03 19:32:14,337 WARN L188 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-09-03 19:32:24,133 WARN L188 SmtUtils]: Spent 4.12 s on a formula simplification. DAG size of input: 71 DAG size of output: 65 [2019-09-03 19:32:39,962 WARN L188 SmtUtils]: Spent 4.10 s on a formula simplification. DAG size of input: 72 DAG size of output: 60 [2019-09-03 19:32:50,095 WARN L188 SmtUtils]: Spent 4.12 s on a formula simplification. DAG size of input: 78 DAG size of output: 69 [2019-09-03 19:33:00,146 WARN L188 SmtUtils]: Spent 4.09 s on a formula simplification. DAG size of input: 65 DAG size of output: 56 [2019-09-03 19:33:12,204 WARN L188 SmtUtils]: Spent 4.10 s on a formula simplification. DAG size of input: 73 DAG size of output: 61 [2019-09-03 19:33:21,871 WARN L188 SmtUtils]: Spent 4.10 s on a formula simplification. DAG size of input: 66 DAG size of output: 60 [2019-09-03 19:33:47,480 WARN L188 SmtUtils]: Spent 4.12 s on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2019-09-03 19:34:07,117 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52