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/insertion_sort-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 02:27:14,993 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 02:27:14,995 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 02:27:15,007 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 02:27:15,007 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 02:27:15,008 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 02:27:15,010 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 02:27:15,011 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 02:27:15,013 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 02:27:15,014 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 02:27:15,015 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 02:27:15,016 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 02:27:15,016 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 02:27:15,017 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 02:27:15,018 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 02:27:15,019 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 02:27:15,020 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 02:27:15,020 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 02:27:15,022 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 02:27:15,024 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 02:27:15,025 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 02:27:15,026 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 02:27:15,027 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 02:27:15,028 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 02:27:15,030 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 02:27:15,030 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 02:27:15,030 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 02:27:15,031 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 02:27:15,031 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 02:27:15,032 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 02:27:15,032 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 02:27:15,033 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 02:27:15,034 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 02:27:15,034 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 02:27:15,035 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 02:27:15,035 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 02:27:15,036 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 02:27:15,036 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 02:27:15,037 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 02:27:15,037 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 02:27:15,038 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 02:27:15,039 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-08 02:27:15,053 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 02:27:15,053 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 02:27:15,054 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 02:27:15,054 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 02:27:15,054 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 02:27:15,055 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 02:27:15,055 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 02:27:15,055 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 02:27:15,055 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 02:27:15,055 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 02:27:15,056 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 02:27:15,056 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 02:27:15,056 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 02:27:15,056 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 02:27:15,056 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 02:27:15,057 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 02:27:15,057 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 02:27:15,057 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 02:27:15,057 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 02:27:15,057 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 02:27:15,058 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 02:27:15,058 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 02:27:15,058 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 02:27:15,058 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 02:27:15,059 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 02:27:15,059 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 02:27:15,059 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 02:27:15,059 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 02:27:15,059 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 02:27:15,089 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 02:27:15,105 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 02:27:15,108 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 02:27:15,109 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 02:27:15,110 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 02:27:15,110 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/insertion_sort-1.c [2019-09-08 02:27:15,180 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0cb406a3d/f4dc3a5797734cad8add66efb285a54f/FLAG8c67dec85 [2019-09-08 02:27:15,620 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 02:27:15,621 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/insertion_sort-1.c [2019-09-08 02:27:15,626 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0cb406a3d/f4dc3a5797734cad8add66efb285a54f/FLAG8c67dec85 [2019-09-08 02:27:15,990 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0cb406a3d/f4dc3a5797734cad8add66efb285a54f [2019-09-08 02:27:16,000 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 02:27:16,002 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 02:27:16,003 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 02:27:16,003 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 02:27:16,006 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 02:27:16,007 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 02:27:15" (1/1) ... [2019-09-08 02:27:16,010 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68fee3b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:27:16, skipping insertion in model container [2019-09-08 02:27:16,010 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 02:27:15" (1/1) ... [2019-09-08 02:27:16,017 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 02:27:16,035 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 02:27:16,199 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 02:27:16,202 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 02:27:16,223 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 02:27:16,243 INFO L192 MainTranslator]: Completed translation [2019-09-08 02:27:16,243 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:27:16 WrapperNode [2019-09-08 02:27:16,243 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 02:27:16,244 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 02:27:16,244 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 02:27:16,244 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 02:27:16,345 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:27:16" (1/1) ... [2019-09-08 02:27:16,346 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:27:16" (1/1) ... [2019-09-08 02:27:16,355 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:27:16" (1/1) ... [2019-09-08 02:27:16,357 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:27:16" (1/1) ... [2019-09-08 02:27:16,375 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:27:16" (1/1) ... [2019-09-08 02:27:16,383 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:27:16" (1/1) ... [2019-09-08 02:27:16,384 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:27:16" (1/1) ... [2019-09-08 02:27:16,386 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 02:27:16,387 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 02:27:16,387 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 02:27:16,387 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 02:27:16,388 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:27:16" (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-08 02:27:16,443 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 02:27:16,444 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 02:27:16,444 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-08 02:27:16,444 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 02:27:16,444 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 02:27:16,444 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-08 02:27:16,444 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2019-09-08 02:27:16,444 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 02:27:16,445 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-08 02:27:16,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-08 02:27:16,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-08 02:27:16,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-08 02:27:16,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 02:27:16,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 02:27:16,711 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 02:27:16,711 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-09-08 02:27:16,713 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 02:27:16 BoogieIcfgContainer [2019-09-08 02:27:16,713 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 02:27:16,714 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 02:27:16,714 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 02:27:16,717 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 02:27:16,718 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 02:27:15" (1/3) ... [2019-09-08 02:27:16,719 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58c2916c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 02:27:16, skipping insertion in model container [2019-09-08 02:27:16,719 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:27:16" (2/3) ... [2019-09-08 02:27:16,719 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58c2916c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 02:27:16, skipping insertion in model container [2019-09-08 02:27:16,720 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 02:27:16" (3/3) ... [2019-09-08 02:27:16,721 INFO L109 eAbstractionObserver]: Analyzing ICFG insertion_sort-1.c [2019-09-08 02:27:16,731 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 02:27:16,738 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 02:27:16,764 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 02:27:16,792 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 02:27:16,792 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 02:27:16,793 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 02:27:16,793 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 02:27:16,793 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 02:27:16,793 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 02:27:16,793 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 02:27:16,793 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 02:27:16,793 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 02:27:16,810 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2019-09-08 02:27:16,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-08 02:27:16,815 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:27:16,816 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:27:16,817 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:27:16,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:27:16,822 INFO L82 PathProgramCache]: Analyzing trace with hash 342854797, now seen corresponding path program 1 times [2019-09-08 02:27:16,823 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:27:16,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:27:16,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:27:16,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:27:16,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:27:16,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:27:17,113 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-08 02:27:17,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 02:27:17,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 02:27:17,119 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 02:27:17,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 02:27:17,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 02:27:17,132 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 5 states. [2019-09-08 02:27:17,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:27:17,232 INFO L93 Difference]: Finished difference Result 67 states and 92 transitions. [2019-09-08 02:27:17,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 02:27:17,234 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-09-08 02:27:17,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:27:17,243 INFO L225 Difference]: With dead ends: 67 [2019-09-08 02:27:17,243 INFO L226 Difference]: Without dead ends: 33 [2019-09-08 02:27:17,247 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-08 02:27:17,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-09-08 02:27:17,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 26. [2019-09-08 02:27:17,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-09-08 02:27:17,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2019-09-08 02:27:17,288 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 13 [2019-09-08 02:27:17,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:27:17,289 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2019-09-08 02:27:17,289 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 02:27:17,289 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2019-09-08 02:27:17,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-08 02:27:17,290 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:27:17,291 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:27:17,291 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:27:17,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:27:17,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1336061280, now seen corresponding path program 1 times [2019-09-08 02:27:17,292 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:27:17,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:27:17,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:27:17,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:27:17,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:27:17,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:27:17,805 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-08 02:27:17,805 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:27:17,806 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) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:27:17,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:27:17,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:27:17,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-08 02:27:17,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:27:17,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:27:18,151 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:27:18,158 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 28 treesize of output 27 [2019-09-08 02:27:18,161 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:27:18,179 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:27:18,180 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-08 02:27:18,181 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2019-09-08 02:27:18,235 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:27:18,236 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 26 treesize of output 10 [2019-09-08 02:27:18,237 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:27:18,240 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:27:18,240 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-08 02:27:18,241 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2019-09-08 02:27:18,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:27:18,283 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-08 02:27:18,288 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:27:18,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 19 [2019-09-08 02:27:18,289 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 02:27:18,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 02:27:18,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2019-09-08 02:27:18,291 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 19 states. [2019-09-08 02:27:19,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:27:19,011 INFO L93 Difference]: Finished difference Result 86 states and 109 transitions. [2019-09-08 02:27:19,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 02:27:19,012 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-09-08 02:27:19,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:27:19,016 INFO L225 Difference]: With dead ends: 86 [2019-09-08 02:27:19,016 INFO L226 Difference]: Without dead ends: 67 [2019-09-08 02:27:19,019 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=167, Invalid=703, Unknown=0, NotChecked=0, Total=870 [2019-09-08 02:27:19,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-09-08 02:27:19,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 44. [2019-09-08 02:27:19,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-09-08 02:27:19,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2019-09-08 02:27:19,035 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 19 [2019-09-08 02:27:19,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:27:19,035 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2019-09-08 02:27:19,036 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 02:27:19,036 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2019-09-08 02:27:19,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-08 02:27:19,037 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:27:19,037 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:27:19,038 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:27:19,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:27:19,038 INFO L82 PathProgramCache]: Analyzing trace with hash -455852680, now seen corresponding path program 1 times [2019-09-08 02:27:19,038 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:27:19,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:27:19,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:27:19,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:27:19,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:27:19,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:27:19,739 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-08 02:27:19,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:27:19,740 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) [2019-09-08 02:27:19,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:27:19,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:27:19,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-08 02:27:19,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:27:19,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:27:19,976 INFO L341 Elim1Store]: treesize reduction 39, result has 22.0 percent of original size [2019-09-08 02:27:19,977 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 29 [2019-09-08 02:27:19,978 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:27:19,987 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:27:19,988 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:27:19,988 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:40 [2019-09-08 02:27:20,251 INFO L341 Elim1Store]: treesize reduction 17, result has 85.8 percent of original size [2019-09-08 02:27:20,251 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 123 [2019-09-08 02:27:20,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:27:20,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:27:20,256 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:27:20,300 INFO L567 ElimStorePlain]: treesize reduction 131, result has 22.0 percent of original size [2019-09-08 02:27:20,301 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-08 02:27:20,302 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:64, output treesize:29 [2019-09-08 02:27:20,473 INFO L341 Elim1Store]: treesize reduction 27, result has 67.1 percent of original size [2019-09-08 02:27:20,474 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 66 [2019-09-08 02:27:20,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:27:20,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:27:20,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:27:20,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:27:20,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:27:20,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:27:20,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:27:20,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:27:20,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:27:20,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:27:20,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:27:20,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:27:20,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:27:20,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:27:20,493 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-09-08 02:27:20,527 INFO L567 ElimStorePlain]: treesize reduction 143, result has 7.7 percent of original size [2019-09-08 02:27:20,528 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:27:20,528 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:5 [2019-09-08 02:27:20,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:27:20,582 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-08 02:27:20,586 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:27:20,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 29 [2019-09-08 02:27:20,586 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-08 02:27:20,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-08 02:27:20,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=711, Unknown=0, NotChecked=0, Total=812 [2019-09-08 02:27:20,589 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand 29 states. [2019-09-08 02:27:21,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:27:21,577 INFO L93 Difference]: Finished difference Result 105 states and 128 transitions. [2019-09-08 02:27:21,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 02:27:21,578 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 24 [2019-09-08 02:27:21,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:27:21,581 INFO L225 Difference]: With dead ends: 105 [2019-09-08 02:27:21,581 INFO L226 Difference]: Without dead ends: 70 [2019-09-08 02:27:21,584 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 433 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=219, Invalid=1421, Unknown=0, NotChecked=0, Total=1640 [2019-09-08 02:27:21,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-09-08 02:27:21,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 44. [2019-09-08 02:27:21,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-09-08 02:27:21,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2019-09-08 02:27:21,604 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 24 [2019-09-08 02:27:21,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:27:21,605 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2019-09-08 02:27:21,605 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-08 02:27:21,606 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2019-09-08 02:27:21,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-08 02:27:21,607 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:27:21,607 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:27:21,607 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:27:21,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:27:21,608 INFO L82 PathProgramCache]: Analyzing trace with hash 2042668019, now seen corresponding path program 2 times [2019-09-08 02:27:21,608 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:27:21,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:27:21,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:27:21,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:27:21,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:27:21,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:27:22,252 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:27:22,252 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:27:22,252 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-08 02:27:22,268 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 02:27:22,290 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 02:27:22,291 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:27:22,292 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-08 02:27:22,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:27:22,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:27:22,450 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:27:22,451 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 28 treesize of output 27 [2019-09-08 02:27:22,451 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:27:22,462 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:27:22,463 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-08 02:27:22,464 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:35 [2019-09-08 02:27:22,545 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:27:22,547 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:27:22,548 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:27:22,549 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:27:22,550 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2019-09-08 02:27:22,550 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:27:22,559 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:27:22,560 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-08 02:27:22,560 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:25 [2019-09-08 02:27:22,594 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:27:22,595 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 26 treesize of output 10 [2019-09-08 02:27:22,596 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:27:22,597 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:27:22,598 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-08 02:27:22,598 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2019-09-08 02:27:22,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:27:22,632 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:27:22,635 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:27:22,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 23 [2019-09-08 02:27:22,636 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-08 02:27:22,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-08 02:27:22,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2019-09-08 02:27:22,637 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand 23 states. [2019-09-08 02:27:23,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:27:23,781 INFO L93 Difference]: Finished difference Result 136 states and 169 transitions. [2019-09-08 02:27:23,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 02:27:23,781 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 25 [2019-09-08 02:27:23,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:27:23,784 INFO L225 Difference]: With dead ends: 136 [2019-09-08 02:27:23,785 INFO L226 Difference]: Without dead ends: 117 [2019-09-08 02:27:23,786 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 14 SyntacticMatches, 5 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=171, Invalid=1089, Unknown=0, NotChecked=0, Total=1260 [2019-09-08 02:27:23,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-09-08 02:27:23,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 57. [2019-09-08 02:27:23,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-09-08 02:27:23,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 69 transitions. [2019-09-08 02:27:23,798 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 69 transitions. Word has length 25 [2019-09-08 02:27:23,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:27:23,799 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 69 transitions. [2019-09-08 02:27:23,799 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-08 02:27:23,799 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 69 transitions. [2019-09-08 02:27:23,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-08 02:27:23,800 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:27:23,800 INFO L399 BasicCegarLoop]: trace histogram [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-08 02:27:23,801 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:27:23,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:27:23,801 INFO L82 PathProgramCache]: Analyzing trace with hash 2145817879, now seen corresponding path program 1 times [2019-09-08 02:27:23,801 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:27:23,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:27:23,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:27:23,802 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:27:23,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:27:23,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:27:23,914 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:27:23,915 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:27:23,915 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-08 02:27:23,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:27:23,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:27:23,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-08 02:27:23,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:27:23,990 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:27:23,993 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:27:23,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-09-08 02:27:23,993 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 02:27:23,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 02:27:23,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-09-08 02:27:23,994 INFO L87 Difference]: Start difference. First operand 57 states and 69 transitions. Second operand 8 states. [2019-09-08 02:27:24,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:27:24,090 INFO L93 Difference]: Finished difference Result 82 states and 98 transitions. [2019-09-08 02:27:24,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 02:27:24,091 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2019-09-08 02:27:24,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:27:24,093 INFO L225 Difference]: With dead ends: 82 [2019-09-08 02:27:24,093 INFO L226 Difference]: Without dead ends: 66 [2019-09-08 02:27:24,093 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-09-08 02:27:24,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-09-08 02:27:24,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 57. [2019-09-08 02:27:24,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-09-08 02:27:24,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 67 transitions. [2019-09-08 02:27:24,102 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 67 transitions. Word has length 27 [2019-09-08 02:27:24,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:27:24,103 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 67 transitions. [2019-09-08 02:27:24,103 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 02:27:24,103 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2019-09-08 02:27:24,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-08 02:27:24,104 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:27:24,104 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:27:24,104 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:27:24,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:27:24,105 INFO L82 PathProgramCache]: Analyzing trace with hash 504300867, now seen corresponding path program 1 times [2019-09-08 02:27:24,105 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:27:24,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:27:24,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:27:24,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:27:24,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:27:24,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:27:24,401 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:27:24,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:27:24,402 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) [2019-09-08 02:27:24,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:27:24,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:27:24,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-08 02:27:24,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:27:24,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:27:24,533 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:27:24,534 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 21 treesize of output 20 [2019-09-08 02:27:24,535 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:27:24,540 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:27:24,540 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-08 02:27:24,541 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2019-09-08 02:27:24,561 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:27:24,562 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 26 treesize of output 10 [2019-09-08 02:27:24,562 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:27:24,563 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:27:24,564 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-08 02:27:24,564 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2019-09-08 02:27:24,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:27:24,587 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:27:24,590 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:27:24,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 20 [2019-09-08 02:27:24,591 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-08 02:27:24,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-08 02:27:24,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2019-09-08 02:27:24,592 INFO L87 Difference]: Start difference. First operand 57 states and 67 transitions. Second operand 20 states. [2019-09-08 02:27:25,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:27:25,857 INFO L93 Difference]: Finished difference Result 162 states and 212 transitions. [2019-09-08 02:27:25,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-09-08 02:27:25,857 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 30 [2019-09-08 02:27:25,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:27:25,859 INFO L225 Difference]: With dead ends: 162 [2019-09-08 02:27:25,859 INFO L226 Difference]: Without dead ends: 143 [2019-09-08 02:27:25,861 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 22 SyntacticMatches, 4 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 837 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=570, Invalid=2186, Unknown=0, NotChecked=0, Total=2756 [2019-09-08 02:27:25,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-09-08 02:27:25,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 67. [2019-09-08 02:27:25,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-09-08 02:27:25,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 82 transitions. [2019-09-08 02:27:25,873 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 82 transitions. Word has length 30 [2019-09-08 02:27:25,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:27:25,874 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 82 transitions. [2019-09-08 02:27:25,874 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-08 02:27:25,874 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 82 transitions. [2019-09-08 02:27:25,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-08 02:27:25,875 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:27:25,875 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:27:25,876 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:27:25,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:27:25,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1205365445, now seen corresponding path program 2 times [2019-09-08 02:27:25,876 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:27:25,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:27:25,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:27:25,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:27:25,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:27:25,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:27:25,933 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:27:25,933 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:27:25,933 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) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:27:25,950 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 02:27:25,971 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 02:27:25,971 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:27:25,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 02:27:25,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:27:25,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:27:25,979 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:27:25,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:27:25,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-09-08 02:27:25,985 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 02:27:25,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 02:27:25,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-08 02:27:25,986 INFO L87 Difference]: Start difference. First operand 67 states and 82 transitions. Second operand 7 states. [2019-09-08 02:27:26,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:27:26,146 INFO L93 Difference]: Finished difference Result 146 states and 186 transitions. [2019-09-08 02:27:26,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 02:27:26,147 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2019-09-08 02:27:26,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:27:26,148 INFO L225 Difference]: With dead ends: 146 [2019-09-08 02:27:26,148 INFO L226 Difference]: Without dead ends: 104 [2019-09-08 02:27:26,149 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-09-08 02:27:26,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-09-08 02:27:26,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 76. [2019-09-08 02:27:26,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-09-08 02:27:26,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 90 transitions. [2019-09-08 02:27:26,172 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 90 transitions. Word has length 30 [2019-09-08 02:27:26,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:27:26,173 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 90 transitions. [2019-09-08 02:27:26,173 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 02:27:26,173 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 90 transitions. [2019-09-08 02:27:26,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-08 02:27:26,177 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:27:26,178 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:27:26,178 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:27:26,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:27:26,178 INFO L82 PathProgramCache]: Analyzing trace with hash 488358411, now seen corresponding path program 3 times [2019-09-08 02:27:26,178 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:27:26,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:27:26,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:27:26,179 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:27:26,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:27:26,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:27:26,703 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:27:26,703 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:27:26,703 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-08 02:27:26,727 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 02:27:26,749 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-08 02:27:26,749 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:27:26,750 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-08 02:27:26,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:27:26,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:27:26,785 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:27:26,786 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 38 treesize of output 29 [2019-09-08 02:27:26,787 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:27:26,800 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:27:26,800 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:27:26,800 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:56, output treesize:53 [2019-09-08 02:27:26,998 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:27:26,999 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-08 02:27:27,000 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:27:27,001 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 50 treesize of output 44 [2019-09-08 02:27:27,002 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:27:27,028 INFO L567 ElimStorePlain]: treesize reduction 12, result has 76.9 percent of original size [2019-09-08 02:27:27,029 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-08 02:27:27,030 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:64, output treesize:37 [2019-09-08 02:27:27,220 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:27:27,221 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:27:27,222 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:27:27,222 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:27:27,223 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36 [2019-09-08 02:27:27,223 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:27:27,236 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:27:27,237 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-08 02:27:27,238 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:46, output treesize:27 [2019-09-08 02:27:27,275 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:27:27,275 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 28 treesize of output 12 [2019-09-08 02:27:27,275 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:27:27,277 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:27:27,277 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-08 02:27:27,277 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:5 [2019-09-08 02:27:27,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:27:27,344 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:27:27,347 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:27:27,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 28 [2019-09-08 02:27:27,348 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-08 02:27:27,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-08 02:27:27,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=655, Unknown=0, NotChecked=0, Total=756 [2019-09-08 02:27:27,349 INFO L87 Difference]: Start difference. First operand 76 states and 90 transitions. Second operand 28 states. [2019-09-08 02:27:28,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:27:28,770 INFO L93 Difference]: Finished difference Result 135 states and 160 transitions. [2019-09-08 02:27:28,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-08 02:27:28,770 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 30 [2019-09-08 02:27:28,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:27:28,771 INFO L225 Difference]: With dead ends: 135 [2019-09-08 02:27:28,771 INFO L226 Difference]: Without dead ends: 133 [2019-09-08 02:27:28,772 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 15 SyntacticMatches, 7 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 654 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=279, Invalid=1791, Unknown=0, NotChecked=0, Total=2070 [2019-09-08 02:27:28,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-09-08 02:27:28,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 70. [2019-09-08 02:27:28,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-09-08 02:27:28,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 83 transitions. [2019-09-08 02:27:28,784 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 83 transitions. Word has length 30 [2019-09-08 02:27:28,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:27:28,784 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 83 transitions. [2019-09-08 02:27:28,785 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-08 02:27:28,785 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 83 transitions. [2019-09-08 02:27:28,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-08 02:27:28,786 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:27:28,786 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:27:28,786 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:27:28,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:27:28,787 INFO L82 PathProgramCache]: Analyzing trace with hash 586827946, now seen corresponding path program 2 times [2019-09-08 02:27:28,787 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:27:28,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:27:28,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:27:28,788 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:27:28,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:27:28,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:27:29,072 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:27:29,073 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:27:29,073 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-08 02:27:29,098 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:27:29,126 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 02:27:29,126 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:27:29,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-08 02:27:29,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:27:29,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:27:29,282 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:27:29,283 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 23 treesize of output 22 [2019-09-08 02:27:29,284 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:27:29,292 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:27:29,293 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-08 02:27:29,293 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-09-08 02:27:29,526 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:27:29,526 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 26 treesize of output 10 [2019-09-08 02:27:29,527 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:27:29,531 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:27:29,531 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-08 02:27:29,532 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2019-09-08 02:27:29,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:27:29,583 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:27:29,588 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:27:29,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 28 [2019-09-08 02:27:29,588 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-08 02:27:29,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-08 02:27:29,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=675, Unknown=0, NotChecked=0, Total=756 [2019-09-08 02:27:29,589 INFO L87 Difference]: Start difference. First operand 70 states and 83 transitions. Second operand 28 states. [2019-09-08 02:27:44,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:27:44,484 INFO L93 Difference]: Finished difference Result 131 states and 153 transitions. [2019-09-08 02:27:44,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-08 02:27:44,484 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 33 [2019-09-08 02:27:44,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:27:44,486 INFO L225 Difference]: With dead ends: 131 [2019-09-08 02:27:44,487 INFO L226 Difference]: Without dead ends: 129 [2019-09-08 02:27:44,488 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 464 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=245, Invalid=1647, Unknown=0, NotChecked=0, Total=1892 [2019-09-08 02:27:44,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-09-08 02:27:44,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 82. [2019-09-08 02:27:44,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-09-08 02:27:44,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 96 transitions. [2019-09-08 02:27:44,499 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 96 transitions. Word has length 33 [2019-09-08 02:27:44,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:27:44,500 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 96 transitions. [2019-09-08 02:27:44,500 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-08 02:27:44,500 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 96 transitions. [2019-09-08 02:27:44,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-09-08 02:27:44,501 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:27:44,501 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:27:44,501 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:27:44,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:27:44,502 INFO L82 PathProgramCache]: Analyzing trace with hash 853695349, now seen corresponding path program 4 times [2019-09-08 02:27:44,502 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:27:44,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:27:44,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:27:44,503 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:27:44,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:27:44,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:27:44,864 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:27:44,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:27:44,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 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 02:27:44,877 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:27:44,898 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 02:27:44,898 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:27:44,899 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-08 02:27:44,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:27:44,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:27:45,018 INFO L341 Elim1Store]: treesize reduction 39, result has 22.0 percent of original size [2019-09-08 02:27:45,018 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 29 [2019-09-08 02:27:45,019 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:27:45,027 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:27:45,027 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:27:45,027 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:38 [2019-09-08 02:27:45,230 INFO L341 Elim1Store]: treesize reduction 17, result has 85.8 percent of original size [2019-09-08 02:27:45,230 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 123 [2019-09-08 02:27:45,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:27:45,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:27:45,233 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:27:45,271 INFO L567 ElimStorePlain]: treesize reduction 129, result has 22.3 percent of original size [2019-09-08 02:27:45,272 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-08 02:27:45,272 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:29 [2019-09-08 02:27:45,379 INFO L341 Elim1Store]: treesize reduction 27, result has 67.1 percent of original size [2019-09-08 02:27:45,380 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 66 [2019-09-08 02:27:45,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:27:45,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:27:45,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:27:45,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:27:45,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:27:45,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:27:45,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:27:45,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:27:45,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:27:45,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:27:45,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:27:45,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:27:45,390 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-09-08 02:27:45,424 INFO L567 ElimStorePlain]: treesize reduction 123, result has 8.9 percent of original size [2019-09-08 02:27:45,425 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:27:45,425 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:5 [2019-09-08 02:27:45,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:27:45,464 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-08 02:27:45,468 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:27:45,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 28 [2019-09-08 02:27:45,468 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-08 02:27:45,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-08 02:27:45,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=662, Unknown=0, NotChecked=0, Total=756 [2019-09-08 02:27:45,469 INFO L87 Difference]: Start difference. First operand 82 states and 96 transitions. Second operand 28 states. [2019-09-08 02:27:46,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:27:46,975 INFO L93 Difference]: Finished difference Result 168 states and 202 transitions. [2019-09-08 02:27:46,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-08 02:27:46,976 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 35 [2019-09-08 02:27:46,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:27:46,978 INFO L225 Difference]: With dead ends: 168 [2019-09-08 02:27:46,978 INFO L226 Difference]: Without dead ends: 126 [2019-09-08 02:27:46,980 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 830 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=421, Invalid=2659, Unknown=0, NotChecked=0, Total=3080 [2019-09-08 02:27:46,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-09-08 02:27:46,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 85. [2019-09-08 02:27:46,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-09-08 02:27:46,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 98 transitions. [2019-09-08 02:27:46,991 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 98 transitions. Word has length 35 [2019-09-08 02:27:46,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:27:46,991 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 98 transitions. [2019-09-08 02:27:46,991 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-08 02:27:46,991 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 98 transitions. [2019-09-08 02:27:46,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-08 02:27:46,992 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:27:46,992 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:27:46,993 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:27:46,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:27:46,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1400428558, now seen corresponding path program 1 times [2019-09-08 02:27:46,993 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:27:46,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:27:46,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:27:46,994 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:27:46,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:27:47,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:27:47,695 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:27:47,695 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:27:47,695 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-08 02:27:47,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:27:47,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:27:47,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-08 02:27:47,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:27:47,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:27:47,916 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:27:47,916 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-08 02:27:47,919 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:27:47,919 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 44 treesize of output 38 [2019-09-08 02:27:47,919 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:27:47,936 INFO L567 ElimStorePlain]: treesize reduction 19, result has 61.2 percent of original size [2019-09-08 02:27:47,936 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:27:47,937 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:53, output treesize:30 [2019-09-08 02:27:48,056 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2019-09-08 02:27:48,059 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:27:48,060 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:27:48,062 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:27:48,065 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:27:48,067 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:27:48,067 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:27:48,068 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:27:48,069 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 29 [2019-09-08 02:27:48,069 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:27:48,075 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:27:48,075 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:27:48,082 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:27:48,083 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-08 02:27:48,083 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:17 [2019-09-08 02:27:48,145 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:27:48,146 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:27:48,146 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:27:48,147 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:27:48,148 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2019-09-08 02:27:48,148 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:27:48,156 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:27:48,156 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-08 02:27:48,157 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:17 [2019-09-08 02:27:48,180 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:27:48,180 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 26 treesize of output 10 [2019-09-08 02:27:48,181 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:27:48,183 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:27:48,183 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-08 02:27:48,183 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2019-09-08 02:27:48,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:27:48,225 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 25 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 02:27:48,228 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:27:48,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17] total 28 [2019-09-08 02:27:48,229 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-08 02:27:48,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-08 02:27:48,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=641, Unknown=0, NotChecked=0, Total=756 [2019-09-08 02:27:48,230 INFO L87 Difference]: Start difference. First operand 85 states and 98 transitions. Second operand 28 states. [2019-09-08 02:27:49,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:27:49,773 INFO L93 Difference]: Finished difference Result 254 states and 303 transitions. [2019-09-08 02:27:49,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-08 02:27:49,774 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 36 [2019-09-08 02:27:49,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:27:49,777 INFO L225 Difference]: With dead ends: 254 [2019-09-08 02:27:49,777 INFO L226 Difference]: Without dead ends: 209 [2019-09-08 02:27:49,778 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 21 SyntacticMatches, 8 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 636 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=278, Invalid=1792, Unknown=0, NotChecked=0, Total=2070 [2019-09-08 02:27:49,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-09-08 02:27:49,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 115. [2019-09-08 02:27:49,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-09-08 02:27:49,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 138 transitions. [2019-09-08 02:27:49,794 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 138 transitions. Word has length 36 [2019-09-08 02:27:49,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:27:49,794 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 138 transitions. [2019-09-08 02:27:49,794 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-08 02:27:49,794 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 138 transitions. [2019-09-08 02:27:49,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-08 02:27:49,795 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:27:49,796 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:27:49,796 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:27:49,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:27:49,796 INFO L82 PathProgramCache]: Analyzing trace with hash -311016042, now seen corresponding path program 2 times [2019-09-08 02:27:49,796 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:27:49,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:27:49,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:27:49,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:27:49,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:27:49,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:27:50,631 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:27:50,631 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:27:50,631 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-08 02:27:50,642 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 02:27:50,676 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 02:27:50,676 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:27:50,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-08 02:27:50,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:27:50,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:27:50,890 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:27:50,891 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 29 treesize of output 28 [2019-09-08 02:27:50,892 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:27:50,904 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:27:50,904 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-08 02:27:50,905 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:31 [2019-09-08 02:27:51,001 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:27:51,002 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:27:51,003 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:27:51,004 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:27:51,005 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2019-09-08 02:27:51,005 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:27:51,012 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:27:51,013 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-08 02:27:51,013 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:17 [2019-09-08 02:27:51,036 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:27:51,036 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 26 treesize of output 10 [2019-09-08 02:27:51,036 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:27:51,038 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:27:51,038 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-08 02:27:51,038 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2019-09-08 02:27:51,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:27:51,087 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:27:51,090 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:27:51,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17] total 30 [2019-09-08 02:27:51,091 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-08 02:27:51,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-08 02:27:51,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=749, Unknown=0, NotChecked=0, Total=870 [2019-09-08 02:27:51,091 INFO L87 Difference]: Start difference. First operand 115 states and 138 transitions. Second operand 30 states. [2019-09-08 02:27:53,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:27:53,067 INFO L93 Difference]: Finished difference Result 253 states and 304 transitions. [2019-09-08 02:27:53,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-08 02:27:53,067 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 36 [2019-09-08 02:27:53,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:27:53,070 INFO L225 Difference]: With dead ends: 253 [2019-09-08 02:27:53,070 INFO L226 Difference]: Without dead ends: 208 [2019-09-08 02:27:53,072 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 25 SyntacticMatches, 4 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 880 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=403, Invalid=2567, Unknown=0, NotChecked=0, Total=2970 [2019-09-08 02:27:53,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-09-08 02:27:53,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 134. [2019-09-08 02:27:53,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-09-08 02:27:53,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 163 transitions. [2019-09-08 02:27:53,088 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 163 transitions. Word has length 36 [2019-09-08 02:27:53,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:27:53,089 INFO L475 AbstractCegarLoop]: Abstraction has 134 states and 163 transitions. [2019-09-08 02:27:53,089 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-08 02:27:53,089 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 163 transitions. [2019-09-08 02:27:53,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-08 02:27:53,090 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:27:53,090 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:27:53,090 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:27:53,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:27:53,091 INFO L82 PathProgramCache]: Analyzing trace with hash -591767046, now seen corresponding path program 1 times [2019-09-08 02:27:53,091 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:27:53,091 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:27:53,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:27:53,092 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:27:53,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:27:53,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:27:53,531 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:27:53,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:27:53,531 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-08 02:27:53,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:27:53,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:27:53,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-08 02:27:53,563 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:27:53,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:27:53,683 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:27:53,684 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 38 treesize of output 29 [2019-09-08 02:27:53,685 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:27:53,693 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:27:53,694 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:27:53,694 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:41 [2019-09-08 02:27:53,862 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:27:53,863 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-08 02:27:53,864 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:27:53,865 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 43 treesize of output 39 [2019-09-08 02:27:53,865 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:27:53,884 INFO L567 ElimStorePlain]: treesize reduction 9, result has 78.6 percent of original size [2019-09-08 02:27:53,885 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-08 02:27:53,885 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:52, output treesize:30 [2019-09-08 02:27:54,147 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:27:54,148 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-08 02:27:54,150 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:27:54,151 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 15 [2019-09-08 02:27:54,152 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:27:54,155 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:27:54,156 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-08 02:27:54,156 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:5 [2019-09-08 02:27:54,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:27:54,207 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:27:54,210 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:27:54,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 36 [2019-09-08 02:27:54,211 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-08 02:27:54,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-08 02:27:54,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1132, Unknown=0, NotChecked=0, Total=1260 [2019-09-08 02:27:54,213 INFO L87 Difference]: Start difference. First operand 134 states and 163 transitions. Second operand 36 states. [2019-09-08 02:27:57,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:27:57,123 INFO L93 Difference]: Finished difference Result 242 states and 290 transitions. [2019-09-08 02:27:57,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-09-08 02:27:57,123 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 38 [2019-09-08 02:27:57,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:27:57,126 INFO L225 Difference]: With dead ends: 242 [2019-09-08 02:27:57,126 INFO L226 Difference]: Without dead ends: 240 [2019-09-08 02:27:57,128 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1675 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=627, Invalid=4775, Unknown=0, NotChecked=0, Total=5402 [2019-09-08 02:27:57,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2019-09-08 02:27:57,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 160. [2019-09-08 02:27:57,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-09-08 02:27:57,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 194 transitions. [2019-09-08 02:27:57,147 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 194 transitions. Word has length 38 [2019-09-08 02:27:57,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:27:57,147 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 194 transitions. [2019-09-08 02:27:57,147 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-08 02:27:57,147 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 194 transitions. [2019-09-08 02:27:57,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-08 02:27:57,149 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:27:57,149 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:27:57,149 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:27:57,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:27:57,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1198506493, now seen corresponding path program 3 times [2019-09-08 02:27:57,150 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:27:57,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:27:57,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:27:57,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:27:57,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:27:57,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:27:57,475 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:27:57,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:27:57,475 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-08 02:27:57,495 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:27:57,532 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-08 02:27:57,532 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:27:57,534 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-08 02:27:57,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:27:57,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:27:57,725 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:27:57,726 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 28 treesize of output 27 [2019-09-08 02:27:57,726 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:27:57,735 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:27:57,735 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-08 02:27:57,735 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2019-09-08 02:27:57,897 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:27:57,898 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:27:57,899 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:27:57,900 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:27:57,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, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 33 [2019-09-08 02:27:57,901 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:27:57,911 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:27:57,911 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-08 02:27:57,912 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:22 [2019-09-08 02:27:58,199 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:27:58,200 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 26 treesize of output 10 [2019-09-08 02:27:58,200 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:27:58,202 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:27:58,202 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-08 02:27:58,202 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2019-09-08 02:27:58,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:27:58,248 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:27:58,251 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:27:58,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 21] total 35 [2019-09-08 02:27:58,252 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-08 02:27:58,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-08 02:27:58,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1062, Unknown=0, NotChecked=0, Total=1190 [2019-09-08 02:27:58,254 INFO L87 Difference]: Start difference. First operand 160 states and 194 transitions. Second operand 35 states. [2019-09-08 02:28:20,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:28:20,248 INFO L93 Difference]: Finished difference Result 302 states and 360 transitions. [2019-09-08 02:28:20,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-08 02:28:20,249 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 39 [2019-09-08 02:28:20,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:28:20,251 INFO L225 Difference]: With dead ends: 302 [2019-09-08 02:28:20,251 INFO L226 Difference]: Without dead ends: 242 [2019-09-08 02:28:20,253 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1207 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=429, Invalid=3603, Unknown=0, NotChecked=0, Total=4032 [2019-09-08 02:28:20,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-09-08 02:28:20,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 149. [2019-09-08 02:28:20,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-09-08 02:28:20,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 181 transitions. [2019-09-08 02:28:20,272 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 181 transitions. Word has length 39 [2019-09-08 02:28:20,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:28:20,273 INFO L475 AbstractCegarLoop]: Abstraction has 149 states and 181 transitions. [2019-09-08 02:28:20,273 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-08 02:28:20,273 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 181 transitions. [2019-09-08 02:28:20,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-08 02:28:20,274 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:28:20,274 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:28:20,274 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:28:20,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:28:20,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1463502433, now seen corresponding path program 4 times [2019-09-08 02:28:20,275 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:28:20,275 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:28:20,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:28:20,276 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:28:20,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:28:20,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:28:20,413 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-08 02:28:20,414 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:28:20,414 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-08 02:28:20,425 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 02:28:20,445 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 02:28:20,446 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:28:20,446 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-08 02:28:20,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:28:20,546 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-08 02:28:20,558 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:28:20,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2019-09-08 02:28:20,559 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 02:28:20,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 02:28:20,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-09-08 02:28:20,559 INFO L87 Difference]: Start difference. First operand 149 states and 181 transitions. Second operand 11 states. [2019-09-08 02:28:20,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:28:20,709 INFO L93 Difference]: Finished difference Result 238 states and 289 transitions. [2019-09-08 02:28:20,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 02:28:20,709 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 41 [2019-09-08 02:28:20,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:28:20,711 INFO L225 Difference]: With dead ends: 238 [2019-09-08 02:28:20,711 INFO L226 Difference]: Without dead ends: 218 [2019-09-08 02:28:20,711 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2019-09-08 02:28:20,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-09-08 02:28:20,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 167. [2019-09-08 02:28:20,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-09-08 02:28:20,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 199 transitions. [2019-09-08 02:28:20,735 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 199 transitions. Word has length 41 [2019-09-08 02:28:20,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:28:20,735 INFO L475 AbstractCegarLoop]: Abstraction has 167 states and 199 transitions. [2019-09-08 02:28:20,735 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 02:28:20,735 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 199 transitions. [2019-09-08 02:28:20,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-08 02:28:20,736 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:28:20,736 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:28:20,737 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:28:20,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:28:20,737 INFO L82 PathProgramCache]: Analyzing trace with hash -2065125816, now seen corresponding path program 5 times [2019-09-08 02:28:20,737 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:28:20,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:28:20,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:28:20,738 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:28:20,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:28:20,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:28:21,397 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 5 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:28:21,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:28:21,397 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-08 02:28:21,408 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 02:28:21,437 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-09-08 02:28:21,437 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:28:21,438 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-08 02:28:21,439 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:28:21,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:21,712 INFO L341 Elim1Store]: treesize reduction 39, result has 22.0 percent of original size [2019-09-08 02:28:21,712 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 29 [2019-09-08 02:28:21,713 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:28:21,736 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:28:21,737 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:28:21,737 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:49, output treesize:45 [2019-09-08 02:28:21,840 INFO L341 Elim1Store]: treesize reduction 60, result has 16.7 percent of original size [2019-09-08 02:28:21,841 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 33 [2019-09-08 02:28:21,841 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:28:21,851 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:28:21,852 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-08 02:28:21,852 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:67, output treesize:39 [2019-09-08 02:28:22,088 INFO L341 Elim1Store]: treesize reduction 18, result has 85.6 percent of original size [2019-09-08 02:28:22,089 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 124 [2019-09-08 02:28:22,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:22,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:22,092 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:28:22,135 INFO L567 ElimStorePlain]: treesize reduction 81, result has 38.6 percent of original size [2019-09-08 02:28:22,136 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-08 02:28:22,136 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:34 [2019-09-08 02:28:22,328 INFO L341 Elim1Store]: treesize reduction 28, result has 67.1 percent of original size [2019-09-08 02:28:22,329 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 68 [2019-09-08 02:28:22,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:22,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:22,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:22,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:22,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:22,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:22,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:22,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:22,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:22,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:22,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:22,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:22,344 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-09-08 02:28:22,403 INFO L567 ElimStorePlain]: treesize reduction 116, result has 12.1 percent of original size [2019-09-08 02:28:22,404 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:28:22,404 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:5 [2019-09-08 02:28:22,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:22,504 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 27 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-08 02:28:22,517 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:28:22,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20] total 39 [2019-09-08 02:28:22,518 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-08 02:28:22,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-08 02:28:22,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1319, Unknown=0, NotChecked=0, Total=1482 [2019-09-08 02:28:22,520 INFO L87 Difference]: Start difference. First operand 167 states and 199 transitions. Second operand 39 states. [2019-09-08 02:28:27,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:28:27,056 INFO L93 Difference]: Finished difference Result 407 states and 498 transitions. [2019-09-08 02:28:27,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-09-08 02:28:27,056 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 41 [2019-09-08 02:28:27,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:28:27,059 INFO L225 Difference]: With dead ends: 407 [2019-09-08 02:28:27,059 INFO L226 Difference]: Without dead ends: 347 [2019-09-08 02:28:27,062 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 45 SyntacticMatches, 4 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2528 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=920, Invalid=7090, Unknown=0, NotChecked=0, Total=8010 [2019-09-08 02:28:27,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2019-09-08 02:28:27,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 227. [2019-09-08 02:28:27,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-09-08 02:28:27,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 275 transitions. [2019-09-08 02:28:27,105 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 275 transitions. Word has length 41 [2019-09-08 02:28:27,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:28:27,105 INFO L475 AbstractCegarLoop]: Abstraction has 227 states and 275 transitions. [2019-09-08 02:28:27,105 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-08 02:28:27,105 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 275 transitions. [2019-09-08 02:28:27,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-08 02:28:27,106 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:28:27,106 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:28:27,106 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:28:27,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:28:27,107 INFO L82 PathProgramCache]: Analyzing trace with hash 591821558, now seen corresponding path program 1 times [2019-09-08 02:28:27,107 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:28:27,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:28:27,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:28:27,108 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:28:27,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:28:27,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:28:28,134 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:28:28,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:28:28,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) [2019-09-08 02:28:28,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:28:28,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:28:28,179 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-08 02:28:28,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:28:28,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:28,355 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:28:28,356 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 38 treesize of output 29 [2019-09-08 02:28:28,357 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:28:28,368 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:28:28,368 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:28:28,368 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:52, output treesize:49 [2019-09-08 02:28:28,594 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:28:28,595 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-08 02:28:28,600 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:28:28,601 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 51 treesize of output 44 [2019-09-08 02:28:28,601 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:28:28,635 INFO L567 ElimStorePlain]: treesize reduction 11, result has 81.7 percent of original size [2019-09-08 02:28:28,636 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-08 02:28:28,636 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:73, output treesize:46 [2019-09-08 02:28:28,780 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:28:28,781 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:28:28,782 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:28:28,783 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:28:28,784 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2019-09-08 02:28:28,784 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:28:28,802 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:28:28,803 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-08 02:28:28,803 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:41 [2019-09-08 02:28:28,977 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:28:28,979 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:28:28,982 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:28:28,983 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:28:28,983 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2019-09-08 02:28:28,983 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:28:29,024 INFO L567 ElimStorePlain]: treesize reduction 3, result has 94.6 percent of original size [2019-09-08 02:28:29,024 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-08 02:28:29,025 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:38 [2019-09-08 02:28:29,135 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-08 02:28:29,136 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:28:29,137 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-08 02:28:29,142 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:28:29,142 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 36 treesize of output 18 [2019-09-08 02:28:29,143 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:28:29,159 INFO L567 ElimStorePlain]: treesize reduction 3, result has 85.0 percent of original size [2019-09-08 02:28:29,160 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:28:29,160 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:5 [2019-09-08 02:28:29,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:29,301 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 3 proven. 39 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 02:28:29,313 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:28:29,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 40 [2019-09-08 02:28:29,314 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-09-08 02:28:29,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-09-08 02:28:29,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1397, Unknown=0, NotChecked=0, Total=1560 [2019-09-08 02:28:29,315 INFO L87 Difference]: Start difference. First operand 227 states and 275 transitions. Second operand 40 states. [2019-09-08 02:28:31,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:28:31,416 INFO L93 Difference]: Finished difference Result 397 states and 481 transitions. [2019-09-08 02:28:31,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-08 02:28:31,416 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 41 [2019-09-08 02:28:31,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:28:31,419 INFO L225 Difference]: With dead ends: 397 [2019-09-08 02:28:31,419 INFO L226 Difference]: Without dead ends: 318 [2019-09-08 02:28:31,421 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 23 SyntacticMatches, 3 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1199 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=394, Invalid=3512, Unknown=0, NotChecked=0, Total=3906 [2019-09-08 02:28:31,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-09-08 02:28:31,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 254. [2019-09-08 02:28:31,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-09-08 02:28:31,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 311 transitions. [2019-09-08 02:28:31,450 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 311 transitions. Word has length 41 [2019-09-08 02:28:31,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:28:31,451 INFO L475 AbstractCegarLoop]: Abstraction has 254 states and 311 transitions. [2019-09-08 02:28:31,451 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-09-08 02:28:31,451 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 311 transitions. [2019-09-08 02:28:31,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-08 02:28:31,452 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:28:31,452 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:28:31,452 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:28:31,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:28:31,452 INFO L82 PathProgramCache]: Analyzing trace with hash 369785307, now seen corresponding path program 2 times [2019-09-08 02:28:31,453 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:28:31,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:28:31,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:28:31,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:28:31,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:28:31,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:28:32,200 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 8 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:28:32,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:28:32,201 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-08 02:28:32,210 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 02:28:32,233 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 02:28:32,233 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:28:32,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-08 02:28:32,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:28:32,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:32,373 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:28:32,374 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 28 treesize of output 27 [2019-09-08 02:28:32,374 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:28:32,383 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:28:32,383 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-08 02:28:32,383 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:34 [2019-09-08 02:28:32,461 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:28:32,462 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:28:32,463 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:28:32,464 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:28:32,464 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2019-09-08 02:28:32,465 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:28:32,475 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:28:32,475 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-08 02:28:32,475 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:26 [2019-09-08 02:28:32,568 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:28:32,577 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:28:32,579 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:28:32,579 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:28:32,580 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2019-09-08 02:28:32,580 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:28:32,589 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:28:32,589 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-08 02:28:32,590 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:26 [2019-09-08 02:28:32,717 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:28:32,718 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:28:32,719 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:28:32,720 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:28:32,721 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 35 [2019-09-08 02:28:32,721 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:28:32,732 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:28:32,733 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-08 02:28:32,733 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:26 [2019-09-08 02:28:32,771 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:28:32,771 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 26 treesize of output 10 [2019-09-08 02:28:32,771 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:28:32,773 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:28:32,774 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-08 02:28:32,774 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2019-09-08 02:28:32,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:32,826 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:28:32,829 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:28:32,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 32 [2019-09-08 02:28:32,832 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-08 02:28:32,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-08 02:28:32,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=867, Unknown=0, NotChecked=0, Total=992 [2019-09-08 02:28:32,833 INFO L87 Difference]: Start difference. First operand 254 states and 311 transitions. Second operand 32 states. [2019-09-08 02:28:35,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:28:35,304 INFO L93 Difference]: Finished difference Result 538 states and 665 transitions. [2019-09-08 02:28:35,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-08 02:28:35,304 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 42 [2019-09-08 02:28:35,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:28:35,307 INFO L225 Difference]: With dead ends: 538 [2019-09-08 02:28:35,307 INFO L226 Difference]: Without dead ends: 459 [2019-09-08 02:28:35,308 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 27 SyntacticMatches, 6 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 850 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=448, Invalid=2744, Unknown=0, NotChecked=0, Total=3192 [2019-09-08 02:28:35,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2019-09-08 02:28:35,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 301. [2019-09-08 02:28:35,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2019-09-08 02:28:35,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 371 transitions. [2019-09-08 02:28:35,345 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 371 transitions. Word has length 42 [2019-09-08 02:28:35,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:28:35,345 INFO L475 AbstractCegarLoop]: Abstraction has 301 states and 371 transitions. [2019-09-08 02:28:35,345 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-08 02:28:35,345 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 371 transitions. [2019-09-08 02:28:35,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-09-08 02:28:35,346 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:28:35,346 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:28:35,346 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:28:35,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:28:35,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1630887468, now seen corresponding path program 1 times [2019-09-08 02:28:35,347 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:28:35,347 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:28:35,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:28:35,348 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:28:35,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:28:35,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:28:36,631 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:28:36,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:28:36,632 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) [2019-09-08 02:28:36,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:28:36,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:28:36,685 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-08 02:28:36,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:28:36,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:36,878 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:28:36,878 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 28 treesize of output 27 [2019-09-08 02:28:36,879 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:28:36,890 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:28:36,891 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-08 02:28:36,891 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:35 [2019-09-08 02:28:36,956 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:28:36,958 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:28:36,958 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:28:36,959 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:28:36,960 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-08 02:28:36,961 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:28:36,961 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 38 treesize of output 46 [2019-09-08 02:28:36,961 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:28:36,984 INFO L567 ElimStorePlain]: treesize reduction 17, result has 70.7 percent of original size [2019-09-08 02:28:36,985 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:28:36,985 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:41 [2019-09-08 02:28:37,206 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:28:37,207 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:28:37,208 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:28:37,209 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-08 02:28:37,210 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-08 02:28:37,211 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:28:37,215 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:28:37,216 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 56 treesize of output 61 [2019-09-08 02:28:37,217 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:28:37,248 INFO L567 ElimStorePlain]: treesize reduction 40, result has 58.3 percent of original size [2019-09-08 02:28:37,249 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-08 02:28:37,249 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:56 [2019-09-08 02:28:37,465 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:28:37,467 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:28:37,468 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:28:37,469 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:28:37,470 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:28:37,479 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:28:37,480 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 58 treesize of output 92 [2019-09-08 02:28:37,480 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:28:37,528 INFO L567 ElimStorePlain]: treesize reduction 25, result has 77.1 percent of original size [2019-09-08 02:28:37,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:37,531 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-08 02:28:37,531 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:75, output treesize:94 [2019-09-08 02:28:37,795 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:28:37,796 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 26 treesize of output 10 [2019-09-08 02:28:37,796 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:28:37,797 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:28:37,797 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-08 02:28:37,798 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2019-09-08 02:28:37,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:37,865 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:28:37,870 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:28:37,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 43 [2019-09-08 02:28:37,872 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-08 02:28:37,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-08 02:28:37,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1646, Unknown=0, NotChecked=0, Total=1806 [2019-09-08 02:28:37,874 INFO L87 Difference]: Start difference. First operand 301 states and 371 transitions. Second operand 43 states. [2019-09-08 02:28:56,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:28:56,028 INFO L93 Difference]: Finished difference Result 344 states and 418 transitions. [2019-09-08 02:28:56,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-08 02:28:56,029 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2019-09-08 02:28:56,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:28:56,034 INFO L225 Difference]: With dead ends: 344 [2019-09-08 02:28:56,034 INFO L226 Difference]: Without dead ends: 327 [2019-09-08 02:28:56,037 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 20 SyntacticMatches, 6 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1422 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=393, Invalid=3897, Unknown=0, NotChecked=0, Total=4290 [2019-09-08 02:28:56,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2019-09-08 02:28:56,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 314. [2019-09-08 02:28:56,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-09-08 02:28:56,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 385 transitions. [2019-09-08 02:28:56,088 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 385 transitions. Word has length 43 [2019-09-08 02:28:56,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:28:56,088 INFO L475 AbstractCegarLoop]: Abstraction has 314 states and 385 transitions. [2019-09-08 02:28:56,088 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-08 02:28:56,088 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 385 transitions. [2019-09-08 02:28:56,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-08 02:28:56,089 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:28:56,089 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 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-08 02:28:56,089 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:28:56,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:28:56,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1316368837, now seen corresponding path program 1 times [2019-09-08 02:28:56,090 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:28:56,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:28:56,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:28:56,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:28:56,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:28:56,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:28:56,280 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:28:56,280 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:28:56,280 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-08 02:28:56,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:28:56,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:28:56,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-08 02:28:56,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:28:56,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:56,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:56,598 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:28:56,599 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 28 treesize of output 27 [2019-09-08 02:28:56,599 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:28:56,608 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:28:56,609 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-08 02:28:56,609 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2019-09-08 02:28:56,896 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-08 02:28:56,897 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:28:56,897 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:28:56,898 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-08 02:28:56,901 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:28:56,902 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 32 treesize of output 16 [2019-09-08 02:28:56,902 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:28:56,906 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:28:56,907 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-08 02:28:56,907 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:3 [2019-09-08 02:28:56,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:28:56,950 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:28:56,953 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:28:56,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 20] total 32 [2019-09-08 02:28:56,954 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-08 02:28:56,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-08 02:28:56,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=890, Unknown=0, NotChecked=0, Total=992 [2019-09-08 02:28:56,954 INFO L87 Difference]: Start difference. First operand 314 states and 385 transitions. Second operand 32 states. [2019-09-08 02:29:16,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:29:16,840 INFO L93 Difference]: Finished difference Result 705 states and 866 transitions. [2019-09-08 02:29:16,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-08 02:29:16,841 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 44 [2019-09-08 02:29:16,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:29:16,844 INFO L225 Difference]: With dead ends: 705 [2019-09-08 02:29:16,844 INFO L226 Difference]: Without dead ends: 568 [2019-09-08 02:29:16,846 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1046 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=495, Invalid=3537, Unknown=0, NotChecked=0, Total=4032 [2019-09-08 02:29:16,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2019-09-08 02:29:16,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 341. [2019-09-08 02:29:16,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2019-09-08 02:29:16,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 419 transitions. [2019-09-08 02:29:16,892 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 419 transitions. Word has length 44 [2019-09-08 02:29:16,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:29:16,892 INFO L475 AbstractCegarLoop]: Abstraction has 341 states and 419 transitions. [2019-09-08 02:29:16,893 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-08 02:29:16,893 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 419 transitions. [2019-09-08 02:29:16,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-08 02:29:16,894 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:29:16,894 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 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-08 02:29:16,894 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:29:16,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:29:16,894 INFO L82 PathProgramCache]: Analyzing trace with hash -2095999155, now seen corresponding path program 2 times [2019-09-08 02:29:16,894 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:29:16,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:29:16,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:29:16,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:29:16,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:29:16,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:29:17,565 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:29:17,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:29:17,565 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-08 02:29:17,579 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 02:29:17,607 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 02:29:17,607 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:29:17,609 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-08 02:29:17,610 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:29:17,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:29:17,801 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:29:17,801 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 38 treesize of output 29 [2019-09-08 02:29:17,802 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:29:17,813 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:29:17,814 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:29:17,814 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:49, output treesize:45 [2019-09-08 02:29:18,008 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:29:18,009 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-08 02:29:18,010 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:29:18,011 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 51 treesize of output 44 [2019-09-08 02:29:18,011 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:29:18,038 INFO L567 ElimStorePlain]: treesize reduction 12, result has 76.9 percent of original size [2019-09-08 02:29:18,039 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-08 02:29:18,039 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:65, output treesize:37 [2019-09-08 02:29:18,180 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:29:18,181 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:29:18,182 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:29:18,183 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:29:18,183 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36 [2019-09-08 02:29:18,184 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:29:18,193 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:29:18,193 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-08 02:29:18,194 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:30 [2019-09-08 02:29:18,469 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:29:18,469 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-08 02:29:18,471 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:29:18,471 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 15 [2019-09-08 02:29:18,471 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:29:18,477 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:29:18,478 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-08 02:29:18,478 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:5 [2019-09-08 02:29:18,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:29:18,567 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:29:18,570 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:29:18,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 23] total 41 [2019-09-08 02:29:18,570 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-08 02:29:18,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-08 02:29:18,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1475, Unknown=0, NotChecked=0, Total=1640 [2019-09-08 02:29:18,571 INFO L87 Difference]: Start difference. First operand 341 states and 419 transitions. Second operand 41 states. [2019-09-08 02:29:19,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:29:19,919 INFO L93 Difference]: Finished difference Result 383 states and 465 transitions. [2019-09-08 02:29:19,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-08 02:29:19,920 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 44 [2019-09-08 02:29:19,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:29:19,922 INFO L225 Difference]: With dead ends: 383 [2019-09-08 02:29:19,922 INFO L226 Difference]: Without dead ends: 381 [2019-09-08 02:29:19,923 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 974 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=333, Invalid=2973, Unknown=0, NotChecked=0, Total=3306 [2019-09-08 02:29:19,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2019-09-08 02:29:19,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 341. [2019-09-08 02:29:19,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2019-09-08 02:29:19,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 419 transitions. [2019-09-08 02:29:19,963 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 419 transitions. Word has length 44 [2019-09-08 02:29:19,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:29:19,963 INFO L475 AbstractCegarLoop]: Abstraction has 341 states and 419 transitions. [2019-09-08 02:29:19,963 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-09-08 02:29:19,963 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 419 transitions. [2019-09-08 02:29:19,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-09-08 02:29:19,964 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:29:19,964 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:29:19,965 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:29:19,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:29:19,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1588085580, now seen corresponding path program 5 times [2019-09-08 02:29:19,965 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:29:19,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:29:19,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:29:19,966 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:29:19,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:29:19,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:29:20,254 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 4 proven. 29 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-08 02:29:20,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:29:20,255 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) [2019-09-08 02:29:20,269 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:29:20,309 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-09-08 02:29:20,310 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:29:20,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-08 02:29:20,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:29:20,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:29:20,483 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-09-08 02:29:20,483 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:29:20,491 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:29:20,491 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-08 02:29:20,491 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:10 [2019-09-08 02:29:20,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:29:20,632 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:29:20,633 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 28 treesize of output 27 [2019-09-08 02:29:20,633 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:29:20,643 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:29:20,643 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-08 02:29:20,643 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2019-09-08 02:29:21,124 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:29:21,125 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-08 02:29:21,126 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:29:21,126 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-08 02:29:21,131 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:29:21,131 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 32 treesize of output 16 [2019-09-08 02:29:21,132 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:29:21,136 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:29:21,137 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-08 02:29:21,137 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:3 [2019-09-08 02:29:21,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:29:21,192 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-08 02:29:21,196 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:29:21,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 22] total 36 [2019-09-08 02:29:21,196 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-08 02:29:21,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-08 02:29:21,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1151, Unknown=0, NotChecked=0, Total=1260 [2019-09-08 02:29:21,197 INFO L87 Difference]: Start difference. First operand 341 states and 419 transitions. Second operand 36 states. [2019-09-08 02:29:41,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:29:41,830 INFO L93 Difference]: Finished difference Result 468 states and 568 transitions. [2019-09-08 02:29:41,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-08 02:29:41,830 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 47 [2019-09-08 02:29:41,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:29:41,833 INFO L225 Difference]: With dead ends: 468 [2019-09-08 02:29:41,833 INFO L226 Difference]: Without dead ends: 466 [2019-09-08 02:29:41,833 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 26 SyntacticMatches, 4 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 729 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=285, Invalid=2471, Unknown=0, NotChecked=0, Total=2756 [2019-09-08 02:29:41,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2019-09-08 02:29:41,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 385. [2019-09-08 02:29:41,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2019-09-08 02:29:41,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 468 transitions. [2019-09-08 02:29:41,892 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 468 transitions. Word has length 47 [2019-09-08 02:29:41,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:29:41,892 INFO L475 AbstractCegarLoop]: Abstraction has 385 states and 468 transitions. [2019-09-08 02:29:41,892 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-08 02:29:41,892 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 468 transitions. [2019-09-08 02:29:41,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-09-08 02:29:41,893 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:29:41,894 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:29:41,894 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:29:41,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:29:41,894 INFO L82 PathProgramCache]: Analyzing trace with hash 907149979, now seen corresponding path program 1 times [2019-09-08 02:29:41,894 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:29:41,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:29:41,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:29:41,895 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:29:41,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:29:41,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:29:42,322 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 14 proven. 51 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-08 02:29:42,322 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:29:42,322 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) [2019-09-08 02:29:42,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:29:42,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:29:42,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-08 02:29:42,364 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:29:42,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:29:42,718 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:29:42,719 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 28 treesize of output 27 [2019-09-08 02:29:42,719 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:29:42,735 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:29:42,736 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-08 02:29:42,736 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:35 [2019-09-08 02:29:42,898 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:29:42,899 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:29:42,900 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:29:42,901 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:29:42,902 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 39 [2019-09-08 02:29:42,902 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:29:42,925 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:29:42,926 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-08 02:29:42,926 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:51, output treesize:30 [2019-09-08 02:29:42,970 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:29:42,970 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 26 treesize of output 10 [2019-09-08 02:29:42,971 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:29:42,972 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:29:42,972 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-08 02:29:42,972 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2019-09-08 02:29:42,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:29:43,033 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 11 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:29:43,038 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:29:43,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 31 [2019-09-08 02:29:43,038 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-08 02:29:43,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-08 02:29:43,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=785, Unknown=0, NotChecked=0, Total=930 [2019-09-08 02:29:43,039 INFO L87 Difference]: Start difference. First operand 385 states and 468 transitions. Second operand 31 states. [2019-09-08 02:29:45,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:29:45,144 INFO L93 Difference]: Finished difference Result 712 states and 877 transitions. [2019-09-08 02:29:45,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-08 02:29:45,145 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 47 [2019-09-08 02:29:45,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:29:45,147 INFO L225 Difference]: With dead ends: 712 [2019-09-08 02:29:45,147 INFO L226 Difference]: Without dead ends: 591 [2019-09-08 02:29:45,148 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 32 SyntacticMatches, 3 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 788 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=502, Invalid=2468, Unknown=0, NotChecked=0, Total=2970 [2019-09-08 02:29:45,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2019-09-08 02:29:45,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 437. [2019-09-08 02:29:45,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437 states. [2019-09-08 02:29:45,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 537 transitions. [2019-09-08 02:29:45,225 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 537 transitions. Word has length 47 [2019-09-08 02:29:45,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:29:45,225 INFO L475 AbstractCegarLoop]: Abstraction has 437 states and 537 transitions. [2019-09-08 02:29:45,225 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-08 02:29:45,226 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 537 transitions. [2019-09-08 02:29:45,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-09-08 02:29:45,227 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:29:45,227 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:29:45,227 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:29:45,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:29:45,228 INFO L82 PathProgramCache]: Analyzing trace with hash -681197923, now seen corresponding path program 2 times [2019-09-08 02:29:45,228 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:29:45,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:29:45,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:29:45,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:29:45,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:29:45,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:29:45,269 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 48 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-08 02:29:45,269 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:29:45,270 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-08 02:29:45,285 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 02:29:45,309 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 02:29:45,309 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:29:45,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-08 02:29:45,311 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:29:45,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:29:45,315 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 48 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-08 02:29:45,319 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:29:45,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-09-08 02:29:45,319 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 02:29:45,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 02:29:45,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-08 02:29:45,320 INFO L87 Difference]: Start difference. First operand 437 states and 537 transitions. Second operand 6 states. [2019-09-08 02:29:45,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:29:45,450 INFO L93 Difference]: Finished difference Result 615 states and 758 transitions. [2019-09-08 02:29:45,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 02:29:45,451 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2019-09-08 02:29:45,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:29:45,453 INFO L225 Difference]: With dead ends: 615 [2019-09-08 02:29:45,453 INFO L226 Difference]: Without dead ends: 476 [2019-09-08 02:29:45,454 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-09-08 02:29:45,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2019-09-08 02:29:45,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 423. [2019-09-08 02:29:45,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2019-09-08 02:29:45,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 513 transitions. [2019-09-08 02:29:45,518 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 513 transitions. Word has length 47 [2019-09-08 02:29:45,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:29:45,518 INFO L475 AbstractCegarLoop]: Abstraction has 423 states and 513 transitions. [2019-09-08 02:29:45,518 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 02:29:45,518 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 513 transitions. [2019-09-08 02:29:45,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-09-08 02:29:45,520 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:29:45,520 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:29:45,520 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:29:45,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:29:45,520 INFO L82 PathProgramCache]: Analyzing trace with hash 595421449, now seen corresponding path program 3 times [2019-09-08 02:29:45,521 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:29:45,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:29:45,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:29:45,521 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:29:45,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:29:45,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:29:46,461 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 3 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:29:46,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:29:46,461 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 02:29:46,473 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:29:46,516 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-09-08 02:29:46,516 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:29:46,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-08 02:29:46,519 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:29:46,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:29:46,534 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:29:46,535 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 38 treesize of output 29 [2019-09-08 02:29:46,535 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:29:46,549 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:29:46,549 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:29:46,550 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:56, output treesize:52 [2019-09-08 02:29:46,626 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:29:46,627 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-08 02:29:46,628 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:29:46,628 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 51 treesize of output 44 [2019-09-08 02:29:46,629 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:29:46,650 INFO L567 ElimStorePlain]: treesize reduction 12, result has 74.5 percent of original size [2019-09-08 02:29:46,650 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-08 02:29:46,650 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:60, output treesize:32 [2019-09-08 02:29:46,723 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:29:46,724 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:29:46,727 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:29:46,729 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:29:46,729 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36 [2019-09-08 02:29:46,729 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:29:46,739 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:29:46,739 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-08 02:29:46,739 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:27 [2019-09-08 02:29:46,851 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:29:46,853 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:29:46,859 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:29:46,860 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:29:46,860 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2019-09-08 02:29:46,860 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:29:46,869 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:29:46,870 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-08 02:29:46,870 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:22 [2019-09-08 02:29:46,996 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:29:46,997 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:29:46,998 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:29:46,999 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:29:47,000 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 41 treesize of output 34 [2019-09-08 02:29:47,000 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:29:47,006 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:29:47,006 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-08 02:29:47,007 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:19 [2019-09-08 02:29:47,027 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:29:47,027 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 28 treesize of output 12 [2019-09-08 02:29:47,027 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:29:47,029 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:29:47,029 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-08 02:29:47,029 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:5 [2019-09-08 02:29:47,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:29:47,077 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 5 proven. 62 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 02:29:47,080 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:29:47,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23] total 36 [2019-09-08 02:29:47,081 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-08 02:29:47,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-08 02:29:47,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1081, Unknown=0, NotChecked=0, Total=1260 [2019-09-08 02:29:47,082 INFO L87 Difference]: Start difference. First operand 423 states and 513 transitions. Second operand 36 states. [2019-09-08 02:29:50,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:29:50,001 INFO L93 Difference]: Finished difference Result 669 states and 813 transitions. [2019-09-08 02:29:50,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-08 02:29:50,002 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 47 [2019-09-08 02:29:50,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:29:50,005 INFO L225 Difference]: With dead ends: 669 [2019-09-08 02:29:50,005 INFO L226 Difference]: Without dead ends: 585 [2019-09-08 02:29:50,006 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 30 SyntacticMatches, 9 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1714 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=607, Invalid=4085, Unknown=0, NotChecked=0, Total=4692 [2019-09-08 02:29:50,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2019-09-08 02:29:50,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 436. [2019-09-08 02:29:50,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2019-09-08 02:29:50,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 530 transitions. [2019-09-08 02:29:50,073 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 530 transitions. Word has length 47 [2019-09-08 02:29:50,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:29:50,073 INFO L475 AbstractCegarLoop]: Abstraction has 436 states and 530 transitions. [2019-09-08 02:29:50,073 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-08 02:29:50,073 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 530 transitions. [2019-09-08 02:29:50,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-08 02:29:50,075 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:29:50,075 INFO L399 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:29:50,075 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:29:50,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:29:50,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1128146500, now seen corresponding path program 2 times [2019-09-08 02:29:50,076 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:29:50,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:29:50,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:29:50,076 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:29:50,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:29:50,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:29:51,288 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 6 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:29:51,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:29:51,288 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:29:51,300 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 02:29:51,323 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 02:29:51,323 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:29:51,324 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-08 02:29:51,325 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:29:51,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:29:51,408 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:29:51,409 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 38 treesize of output 29 [2019-09-08 02:29:51,409 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:29:51,420 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:29:51,420 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:29:51,421 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:56, output treesize:52 [2019-09-08 02:29:51,588 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:29:51,589 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-08 02:29:51,591 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:29:51,591 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 51 treesize of output 44 [2019-09-08 02:29:51,592 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:29:51,613 INFO L567 ElimStorePlain]: treesize reduction 12, result has 74.5 percent of original size [2019-09-08 02:29:51,613 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-08 02:29:51,613 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:60, output treesize:32 [2019-09-08 02:29:51,672 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:29:51,673 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:29:51,674 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:29:51,676 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:29:51,676 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-08 02:29:51,678 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:29:51,678 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 40 treesize of output 48 [2019-09-08 02:29:51,678 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:29:51,700 INFO L567 ElimStorePlain]: treesize reduction 18, result has 72.7 percent of original size [2019-09-08 02:29:51,700 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:29:51,700 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:49, output treesize:48 [2019-09-08 02:29:51,945 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:29:51,947 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:29:51,947 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:29:51,948 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-08 02:29:51,950 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:29:51,951 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-08 02:29:51,955 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:29:51,955 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 63 treesize of output 65 [2019-09-08 02:29:51,955 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:29:51,997 INFO L567 ElimStorePlain]: treesize reduction 20, result has 79.4 percent of original size [2019-09-08 02:29:51,998 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-08 02:29:51,999 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:83, output treesize:77 [2019-09-08 02:29:52,240 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:29:52,242 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:29:52,244 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:29:52,247 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:29:52,248 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:29:52,252 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:29:52,285 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:29:52,285 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 78 treesize of output 159 [2019-09-08 02:29:52,286 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:29:52,349 INFO L567 ElimStorePlain]: treesize reduction 60, result has 63.6 percent of original size [2019-09-08 02:29:52,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:29:52,352 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-08 02:29:52,352 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:96, output treesize:137 [2019-09-08 02:29:52,607 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:29:52,608 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 28 treesize of output 12 [2019-09-08 02:29:52,608 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:29:52,609 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:29:52,609 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-08 02:29:52,609 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:5 [2019-09-08 02:29:52,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:29:52,685 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 2 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:29:52,688 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:29:52,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 29] total 46 [2019-09-08 02:29:52,688 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-09-08 02:29:52,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-09-08 02:29:52,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=1862, Unknown=0, NotChecked=0, Total=2070 [2019-09-08 02:29:52,689 INFO L87 Difference]: Start difference. First operand 436 states and 530 transitions. Second operand 46 states. [2019-09-08 02:29:55,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:29:55,279 INFO L93 Difference]: Finished difference Result 460 states and 554 transitions. [2019-09-08 02:29:55,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-08 02:29:55,279 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 48 [2019-09-08 02:29:55,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:29:55,281 INFO L225 Difference]: With dead ends: 460 [2019-09-08 02:29:55,281 INFO L226 Difference]: Without dead ends: 443 [2019-09-08 02:29:55,281 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 25 SyntacticMatches, 8 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1573 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=437, Invalid=4119, Unknown=0, NotChecked=0, Total=4556 [2019-09-08 02:29:55,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2019-09-08 02:29:55,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 403. [2019-09-08 02:29:55,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2019-09-08 02:29:55,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 492 transitions. [2019-09-08 02:29:55,340 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 492 transitions. Word has length 48 [2019-09-08 02:29:55,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:29:55,340 INFO L475 AbstractCegarLoop]: Abstraction has 403 states and 492 transitions. [2019-09-08 02:29:55,340 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-09-08 02:29:55,340 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 492 transitions. [2019-09-08 02:29:55,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-08 02:29:55,341 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:29:55,342 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:29:55,342 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:29:55,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:29:55,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1834674623, now seen corresponding path program 1 times [2019-09-08 02:29:55,342 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:29:55,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:29:55,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:29:55,343 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:29:55,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:29:55,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:29:55,637 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 11 proven. 35 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 02:29:55,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:29:55,638 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 02:29:55,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:29:55,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:29:55,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-08 02:29:55,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:29:55,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:29:55,904 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:29:55,905 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 38 treesize of output 29 [2019-09-08 02:29:55,905 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:29:55,916 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:29:55,917 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:29:55,917 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:43 [2019-09-08 02:29:56,110 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-08 02:29:56,111 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:29:56,112 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:29:56,112 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 50 treesize of output 44 [2019-09-08 02:29:56,113 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:29:56,140 INFO L567 ElimStorePlain]: treesize reduction 14, result has 74.5 percent of original size [2019-09-08 02:29:56,141 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-08 02:29:56,141 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:67, output treesize:38 [2019-09-08 02:29:56,450 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:29:56,451 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-08 02:29:56,452 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-08 02:29:56,456 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:29:56,457 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 36 treesize of output 18 [2019-09-08 02:29:56,457 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:29:56,463 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:29:56,464 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:29:56,464 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:47, output treesize:5 [2019-09-08 02:29:56,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:29:56,521 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 7 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:29:56,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:29:56,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 23] total 37 [2019-09-08 02:29:56,525 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-08 02:29:56,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-08 02:29:56,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1204, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 02:29:56,526 INFO L87 Difference]: Start difference. First operand 403 states and 492 transitions. Second operand 37 states. [2019-09-08 02:30:01,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:30:01,231 INFO L93 Difference]: Finished difference Result 596 states and 723 transitions. [2019-09-08 02:30:01,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-09-08 02:30:01,231 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 49 [2019-09-08 02:30:01,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:30:01,233 INFO L225 Difference]: With dead ends: 596 [2019-09-08 02:30:01,233 INFO L226 Difference]: Without dead ends: 594 [2019-09-08 02:30:01,234 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4184 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=1243, Invalid=10967, Unknown=0, NotChecked=0, Total=12210 [2019-09-08 02:30:01,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2019-09-08 02:30:01,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 415. [2019-09-08 02:30:01,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 415 states. [2019-09-08 02:30:01,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 507 transitions. [2019-09-08 02:30:01,306 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 507 transitions. Word has length 49 [2019-09-08 02:30:01,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:30:01,306 INFO L475 AbstractCegarLoop]: Abstraction has 415 states and 507 transitions. [2019-09-08 02:30:01,306 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-08 02:30:01,306 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 507 transitions. [2019-09-08 02:30:01,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-08 02:30:01,308 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:30:01,308 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:30:01,308 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:30:01,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:30:01,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1831939583, now seen corresponding path program 3 times [2019-09-08 02:30:01,309 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:30:01,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:30:01,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:30:01,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:30:01,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:30:01,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:30:02,764 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 2 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:30:02,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:30:02,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 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:30:02,777 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 02:30:02,820 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-09-08 02:30:02,821 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:30:02,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 43 conjunts are in the unsatisfiable core [2019-09-08 02:30:02,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:30:02,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:30:02,972 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:30:02,972 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 28 treesize of output 27 [2019-09-08 02:30:02,973 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:30:02,982 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:30:02,982 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-08 02:30:02,983 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:30 [2019-09-08 02:30:03,012 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2019-09-08 02:30:03,014 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:30:03,016 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:30:03,017 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:30:03,019 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:30:03,026 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:30:03,027 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:30:03,028 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:30:03,029 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 34 [2019-09-08 02:30:03,029 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:30:03,037 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:30:03,038 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:30:03,050 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:30:03,050 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-08 02:30:03,051 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:70, output treesize:50 [2019-09-08 02:30:03,226 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:30:03,227 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:30:03,229 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:30:03,231 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:30:03,234 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:30:03,281 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:30:03,282 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 60 treesize of output 184 [2019-09-08 02:30:03,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:30:03,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:30:03,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:30:03,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:30:03,286 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:30:03,404 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2019-09-08 02:30:03,405 INFO L567 ElimStorePlain]: treesize reduction 329, result has 21.1 percent of original size [2019-09-08 02:30:03,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:30:03,407 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-08 02:30:03,407 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:77, output treesize:87 [2019-09-08 02:30:03,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:30:03,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:30:03,785 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2019-09-08 02:30:03,851 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:30:03,853 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:30:03,853 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-08 02:30:03,854 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:30:03,856 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:30:03,856 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 54 treesize of output 53 [2019-09-08 02:30:03,857 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:30:03,886 INFO L567 ElimStorePlain]: treesize reduction 7, result has 87.7 percent of original size [2019-09-08 02:30:03,887 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-08 02:30:03,887 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:70, output treesize:38 [2019-09-08 02:30:03,997 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:30:03,998 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:30:04,000 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:30:04,001 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:30:04,001 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2019-09-08 02:30:04,001 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:30:04,011 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:30:04,012 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-08 02:30:04,012 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:19 [2019-09-08 02:30:04,234 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:30:04,235 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 26 treesize of output 10 [2019-09-08 02:30:04,235 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:30:04,236 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:30:04,236 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-08 02:30:04,237 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2019-09-08 02:30:04,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:30:04,320 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:30:04,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:30:04,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 45 [2019-09-08 02:30:04,324 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-09-08 02:30:04,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-09-08 02:30:04,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=1784, Unknown=0, NotChecked=0, Total=1980 [2019-09-08 02:30:04,325 INFO L87 Difference]: Start difference. First operand 415 states and 507 transitions. Second operand 45 states. [2019-09-08 02:30:21,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:30:21,144 INFO L93 Difference]: Finished difference Result 521 states and 623 transitions. [2019-09-08 02:30:21,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-08 02:30:21,145 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 49 [2019-09-08 02:30:21,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:30:21,147 INFO L225 Difference]: With dead ends: 521 [2019-09-08 02:30:21,147 INFO L226 Difference]: Without dead ends: 519 [2019-09-08 02:30:21,148 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 26 SyntacticMatches, 8 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1682 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=482, Invalid=4630, Unknown=0, NotChecked=0, Total=5112 [2019-09-08 02:30:21,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2019-09-08 02:30:21,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 449. [2019-09-08 02:30:21,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2019-09-08 02:30:21,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 546 transitions. [2019-09-08 02:30:21,215 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 546 transitions. Word has length 49 [2019-09-08 02:30:21,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:30:21,215 INFO L475 AbstractCegarLoop]: Abstraction has 449 states and 546 transitions. [2019-09-08 02:30:21,215 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-09-08 02:30:21,215 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 546 transitions. [2019-09-08 02:30:21,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-08 02:30:21,216 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:30:21,217 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:30:21,217 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:30:21,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:30:21,217 INFO L82 PathProgramCache]: Analyzing trace with hash -1264339310, now seen corresponding path program 2 times [2019-09-08 02:30:21,217 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:30:21,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:30:21,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:30:21,218 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:30:21,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:30:21,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:30:21,752 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 2 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:30:21,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:30:21,752 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:30:21,771 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 02:30:21,803 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 02:30:21,803 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:30:21,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-08 02:30:21,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:30:21,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:30:22,019 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:30:22,020 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 28 treesize of output 27 [2019-09-08 02:30:22,020 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:30:22,028 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:30:22,028 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-08 02:30:22,028 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2019-09-08 02:30:22,141 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:30:22,142 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:30:22,143 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:30:22,144 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:30:22,145 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 33 [2019-09-08 02:30:22,145 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:30:22,153 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:30:22,154 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-08 02:30:22,154 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:22 [2019-09-08 02:30:22,267 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:30:22,268 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:30:22,269 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:30:22,270 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:30:22,270 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 31 [2019-09-08 02:30:22,271 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:30:22,276 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:30:22,277 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-08 02:30:22,277 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:19 [2019-09-08 02:30:22,519 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:30:22,520 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 26 treesize of output 10 [2019-09-08 02:30:22,520 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:30:22,521 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:30:22,521 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-08 02:30:22,522 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2019-09-08 02:30:22,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:30:22,597 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:30:22,600 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:30:22,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22] total 39 [2019-09-08 02:30:22,600 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-08 02:30:22,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-08 02:30:22,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1339, Unknown=0, NotChecked=0, Total=1482 [2019-09-08 02:30:22,601 INFO L87 Difference]: Start difference. First operand 449 states and 546 transitions. Second operand 39 states. [2019-09-08 02:30:46,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:30:46,357 INFO L93 Difference]: Finished difference Result 611 states and 732 transitions. [2019-09-08 02:30:46,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-08 02:30:46,358 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 50 [2019-09-08 02:30:46,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:30:46,361 INFO L225 Difference]: With dead ends: 611 [2019-09-08 02:30:46,361 INFO L226 Difference]: Without dead ends: 609 [2019-09-08 02:30:46,362 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1180 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=416, Invalid=3744, Unknown=0, NotChecked=0, Total=4160 [2019-09-08 02:30:46,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2019-09-08 02:30:46,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 463. [2019-09-08 02:30:46,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 463 states. [2019-09-08 02:30:46,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 564 transitions. [2019-09-08 02:30:46,437 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 564 transitions. Word has length 50 [2019-09-08 02:30:46,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:30:46,437 INFO L475 AbstractCegarLoop]: Abstraction has 463 states and 564 transitions. [2019-09-08 02:30:46,437 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-08 02:30:46,437 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 564 transitions. [2019-09-08 02:30:46,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-08 02:30:46,438 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:30:46,439 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:30:46,439 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:30:46,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:30:46,439 INFO L82 PathProgramCache]: Analyzing trace with hash -891213096, now seen corresponding path program 3 times [2019-09-08 02:30:46,439 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:30:46,439 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:30:46,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:30:46,440 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:30:46,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:30:46,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:30:46,744 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 5 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:30:46,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:30:46,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 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:30:46,755 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 02:30:46,810 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-09-08 02:30:46,810 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:30:46,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 43 conjunts are in the unsatisfiable core [2019-09-08 02:30:46,812 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:30:46,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:30:47,002 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:30:47,002 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 29 treesize of output 28 [2019-09-08 02:30:47,002 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:30:47,012 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:30:47,012 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-08 02:30:47,013 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:28 [2019-09-08 02:30:47,159 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:30:47,161 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:30:47,162 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:30:47,163 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:30:47,163 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 33 [2019-09-08 02:30:47,164 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:30:47,171 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:30:47,171 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-08 02:30:47,172 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:22 [2019-09-08 02:30:47,433 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:30:47,433 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 26 treesize of output 10 [2019-09-08 02:30:47,434 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:30:47,435 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:30:47,436 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-08 02:30:47,436 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2019-09-08 02:30:47,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:30:47,487 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 1 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:30:47,490 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:30:47,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 23] total 39 [2019-09-08 02:30:47,491 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-08 02:30:47,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-08 02:30:47,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1318, Unknown=0, NotChecked=0, Total=1482 [2019-09-08 02:30:47,492 INFO L87 Difference]: Start difference. First operand 463 states and 564 transitions. Second operand 39 states. [2019-09-08 02:31:15,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:31:15,709 INFO L93 Difference]: Finished difference Result 766 states and 930 transitions. [2019-09-08 02:31:15,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-08 02:31:15,709 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 50 [2019-09-08 02:31:15,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:31:15,712 INFO L225 Difference]: With dead ends: 766 [2019-09-08 02:31:15,712 INFO L226 Difference]: Without dead ends: 764 [2019-09-08 02:31:15,712 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1166 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=496, Invalid=3536, Unknown=0, NotChecked=0, Total=4032 [2019-09-08 02:31:15,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2019-09-08 02:31:15,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 512. [2019-09-08 02:31:15,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2019-09-08 02:31:15,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 626 transitions. [2019-09-08 02:31:15,794 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 626 transitions. Word has length 50 [2019-09-08 02:31:15,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:31:15,794 INFO L475 AbstractCegarLoop]: Abstraction has 512 states and 626 transitions. [2019-09-08 02:31:15,794 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-08 02:31:15,794 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 626 transitions. [2019-09-08 02:31:15,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-08 02:31:15,795 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:31:15,796 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:31:15,796 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:31:15,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:31:15,796 INFO L82 PathProgramCache]: Analyzing trace with hash -823375264, now seen corresponding path program 3 times [2019-09-08 02:31:15,796 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:31:15,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:31:15,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:31:15,797 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:31:15,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:31:15,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:31:16,434 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 2 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:31:16,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:31:16,435 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:31:16,447 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 02:31:16,503 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-09-08 02:31:16,503 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:31:16,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-08 02:31:16,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:31:16,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:31:16,668 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:31:16,669 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 38 treesize of output 29 [2019-09-08 02:31:16,669 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:31:16,677 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:31:16,678 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:31:16,678 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:49, output treesize:45 [2019-09-08 02:31:16,776 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:31:16,777 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:31:16,778 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 51 treesize of output 32 [2019-09-08 02:31:16,778 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:31:16,787 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:31:16,788 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-08 02:31:16,788 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:57, output treesize:29 [2019-09-08 02:31:16,915 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:31:16,916 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:31:16,917 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:31:16,918 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:31:16,918 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36 [2019-09-08 02:31:16,919 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:31:16,927 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:31:16,927 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-08 02:31:16,927 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:24 [2019-09-08 02:31:16,996 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:31:16,997 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:31:17,004 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:31:17,004 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:31:17,005 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36 [2019-09-08 02:31:17,005 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:31:17,013 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:31:17,013 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-08 02:31:17,014 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:21 [2019-09-08 02:31:17,258 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:31:17,258 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 28 treesize of output 12 [2019-09-08 02:31:17,259 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:31:17,260 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:31:17,260 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-08 02:31:17,260 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:5 [2019-09-08 02:31:17,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:31:17,348 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 1 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:31:17,352 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:31:17,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 43 [2019-09-08 02:31:17,352 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-08 02:31:17,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-08 02:31:17,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1636, Unknown=0, NotChecked=0, Total=1806 [2019-09-08 02:31:17,353 INFO L87 Difference]: Start difference. First operand 512 states and 626 transitions. Second operand 43 states. [2019-09-08 02:31:19,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:31:19,616 INFO L93 Difference]: Finished difference Result 612 states and 739 transitions. [2019-09-08 02:31:19,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-08 02:31:19,617 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 50 [2019-09-08 02:31:19,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:31:19,619 INFO L225 Difference]: With dead ends: 612 [2019-09-08 02:31:19,620 INFO L226 Difference]: Without dead ends: 610 [2019-09-08 02:31:19,620 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1739 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=556, Invalid=4994, Unknown=0, NotChecked=0, Total=5550 [2019-09-08 02:31:19,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2019-09-08 02:31:19,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 545. [2019-09-08 02:31:19,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 545 states. [2019-09-08 02:31:19,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 664 transitions. [2019-09-08 02:31:19,720 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 664 transitions. Word has length 50 [2019-09-08 02:31:19,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:31:19,721 INFO L475 AbstractCegarLoop]: Abstraction has 545 states and 664 transitions. [2019-09-08 02:31:19,721 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-08 02:31:19,721 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 664 transitions. [2019-09-08 02:31:19,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-08 02:31:19,723 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:31:19,724 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:31:19,724 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:31:19,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:31:19,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1007295364, now seen corresponding path program 4 times [2019-09-08 02:31:19,725 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:31:19,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:31:19,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:31:19,726 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:31:19,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:31:19,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:31:19,953 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 38 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-08 02:31:19,953 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:31:19,953 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 02:31:19,966 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:31:19,991 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 02:31:19,992 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:31:19,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-08 02:31:19,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:31:20,101 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:31:20,101 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 23 treesize of output 22 [2019-09-08 02:31:20,102 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:31:20,109 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:31:20,110 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-08 02:31:20,110 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-09-08 02:31:20,370 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:31:20,370 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 26 treesize of output 10 [2019-09-08 02:31:20,371 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:31:20,372 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:31:20,372 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-08 02:31:20,372 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2019-09-08 02:31:20,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:31:20,419 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-08 02:31:20,422 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:31:20,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 29 [2019-09-08 02:31:20,423 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-08 02:31:20,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-08 02:31:20,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=730, Unknown=0, NotChecked=0, Total=812 [2019-09-08 02:31:20,423 INFO L87 Difference]: Start difference. First operand 545 states and 664 transitions. Second operand 29 states. [2019-09-08 02:31:39,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:31:39,504 INFO L93 Difference]: Finished difference Result 681 states and 823 transitions. [2019-09-08 02:31:39,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-08 02:31:39,504 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 52 [2019-09-08 02:31:39,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:31:39,507 INFO L225 Difference]: With dead ends: 681 [2019-09-08 02:31:39,507 INFO L226 Difference]: Without dead ends: 679 [2019-09-08 02:31:39,507 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 433 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=207, Invalid=1599, Unknown=0, NotChecked=0, Total=1806 [2019-09-08 02:31:39,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2019-09-08 02:31:39,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 554. [2019-09-08 02:31:39,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 554 states. [2019-09-08 02:31:39,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 676 transitions. [2019-09-08 02:31:39,612 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 676 transitions. Word has length 52 [2019-09-08 02:31:39,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:31:39,612 INFO L475 AbstractCegarLoop]: Abstraction has 554 states and 676 transitions. [2019-09-08 02:31:39,612 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-08 02:31:39,613 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 676 transitions. [2019-09-08 02:31:39,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-09-08 02:31:39,614 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:31:39,614 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:31:39,615 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:31:39,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:31:39,615 INFO L82 PathProgramCache]: Analyzing trace with hash 745072839, now seen corresponding path program 6 times [2019-09-08 02:31:39,615 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:31:39,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:31:39,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:31:39,616 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:31:39,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:31:39,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:31:39,964 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 4 proven. 48 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-08 02:31:39,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:31:39,965 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:31:39,975 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 02:31:40,043 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-09-08 02:31:40,044 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:31:40,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-08 02:31:40,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:31:40,126 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-09-08 02:31:40,127 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:31:40,133 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:31:40,134 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-08 02:31:40,134 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2019-09-08 02:31:40,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:31:40,285 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:31:40,286 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 28 treesize of output 27 [2019-09-08 02:31:40,286 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:31:40,294 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:31:40,294 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-08 02:31:40,295 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2019-09-08 02:31:40,390 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:31:40,391 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:31:40,395 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:31:40,395 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:31:40,395 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2019-09-08 02:31:40,396 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:31:40,405 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:31:40,405 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-08 02:31:40,406 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:19 [2019-09-08 02:31:40,715 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:31:40,716 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 26 treesize of output 10 [2019-09-08 02:31:40,716 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:31:40,719 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:31:40,719 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-08 02:31:40,719 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2019-09-08 02:31:40,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:31:40,773 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 3 proven. 52 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-08 02:31:40,776 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:31:40,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 22] total 38 [2019-09-08 02:31:40,777 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-08 02:31:40,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-08 02:31:40,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1275, Unknown=0, NotChecked=0, Total=1406 [2019-09-08 02:31:40,778 INFO L87 Difference]: Start difference. First operand 554 states and 676 transitions. Second operand 38 states. [2019-09-08 02:32:04,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:32:04,912 INFO L93 Difference]: Finished difference Result 756 states and 910 transitions. [2019-09-08 02:32:04,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-08 02:32:04,913 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 53 [2019-09-08 02:32:04,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:32:04,916 INFO L225 Difference]: With dead ends: 756 [2019-09-08 02:32:04,916 INFO L226 Difference]: Without dead ends: 754 [2019-09-08 02:32:04,916 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 33 SyntacticMatches, 4 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1142 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=444, Invalid=3588, Unknown=0, NotChecked=0, Total=4032 [2019-09-08 02:32:04,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2019-09-08 02:32:05,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 614. [2019-09-08 02:32:05,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 614 states. [2019-09-08 02:32:05,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 749 transitions. [2019-09-08 02:32:05,019 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 749 transitions. Word has length 53 [2019-09-08 02:32:05,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:32:05,020 INFO L475 AbstractCegarLoop]: Abstraction has 614 states and 749 transitions. [2019-09-08 02:32:05,020 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-08 02:32:05,020 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 749 transitions. [2019-09-08 02:32:05,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-08 02:32:05,022 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:32:05,022 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:32:05,022 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:32:05,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:32:05,022 INFO L82 PathProgramCache]: Analyzing trace with hash -175042453, now seen corresponding path program 7 times [2019-09-08 02:32:05,022 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:32:05,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:32:05,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:32:05,023 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:32:05,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:32:05,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:32:05,209 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 9 proven. 36 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-08 02:32:05,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:32:05,209 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 02:32:05,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:32:05,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:32:05,273 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-08 02:32:05,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:32:05,416 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 9 proven. 36 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-08 02:32:05,420 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:32:05,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 16 [2019-09-08 02:32:05,421 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 02:32:05,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 02:32:05,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2019-09-08 02:32:05,422 INFO L87 Difference]: Start difference. First operand 614 states and 749 transitions. Second operand 16 states. [2019-09-08 02:32:05,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:32:05,816 INFO L93 Difference]: Finished difference Result 865 states and 1044 transitions. [2019-09-08 02:32:05,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 02:32:05,816 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 55 [2019-09-08 02:32:05,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:32:05,818 INFO L225 Difference]: With dead ends: 865 [2019-09-08 02:32:05,818 INFO L226 Difference]: Without dead ends: 815 [2019-09-08 02:32:05,819 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2019-09-08 02:32:05,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 815 states. [2019-09-08 02:32:05,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 815 to 630. [2019-09-08 02:32:05,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 630 states. [2019-09-08 02:32:05,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 761 transitions. [2019-09-08 02:32:05,911 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 761 transitions. Word has length 55 [2019-09-08 02:32:05,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:32:05,912 INFO L475 AbstractCegarLoop]: Abstraction has 630 states and 761 transitions. [2019-09-08 02:32:05,912 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 02:32:05,912 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 761 transitions. [2019-09-08 02:32:05,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-08 02:32:05,914 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:32:05,914 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:32:05,914 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:32:05,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:32:05,914 INFO L82 PathProgramCache]: Analyzing trace with hash 892264603, now seen corresponding path program 3 times [2019-09-08 02:32:05,914 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:32:05,915 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:32:05,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:32:05,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:32:05,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:32:05,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:32:05,989 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 43 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:32:05,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:32:05,990 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 02:32:06,002 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:32:06,042 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-09-08 02:32:06,042 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:32:06,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 02:32:06,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:32:06,049 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 43 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:32:06,053 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:32:06,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-09-08 02:32:06,053 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 02:32:06,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 02:32:06,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-08 02:32:06,054 INFO L87 Difference]: Start difference. First operand 630 states and 761 transitions. Second operand 9 states. [2019-09-08 02:32:06,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:32:06,397 INFO L93 Difference]: Finished difference Result 1128 states and 1395 transitions. [2019-09-08 02:32:06,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 02:32:06,398 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 52 [2019-09-08 02:32:06,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:32:06,401 INFO L225 Difference]: With dead ends: 1128 [2019-09-08 02:32:06,401 INFO L226 Difference]: Without dead ends: 943 [2019-09-08 02:32:06,402 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-09-08 02:32:06,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2019-09-08 02:32:06,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 732. [2019-09-08 02:32:06,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 732 states. [2019-09-08 02:32:06,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 891 transitions. [2019-09-08 02:32:06,531 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 891 transitions. Word has length 52 [2019-09-08 02:32:06,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:32:06,531 INFO L475 AbstractCegarLoop]: Abstraction has 732 states and 891 transitions. [2019-09-08 02:32:06,531 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 02:32:06,531 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 891 transitions. [2019-09-08 02:32:06,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-09-08 02:32:06,533 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:32:06,533 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 5, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:32:06,533 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:32:06,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:32:06,534 INFO L82 PathProgramCache]: Analyzing trace with hash 441671596, now seen corresponding path program 4 times [2019-09-08 02:32:06,534 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:32:06,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:32:06,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:32:06,534 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:32:06,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:32:06,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:32:07,481 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 13 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:32:07,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:32:07,481 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:32:07,491 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 02:32:07,523 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 02:32:07,523 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:32:07,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-08 02:32:07,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:32:07,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:32:07,579 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:32:07,581 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 34 treesize of output 33 [2019-09-08 02:32:07,581 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:32:07,617 INFO L567 ElimStorePlain]: treesize reduction 7, result has 86.3 percent of original size [2019-09-08 02:32:07,618 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-08 02:32:07,618 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:41 [2019-09-08 02:32:07,722 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:32:07,724 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:32:07,725 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:32:07,726 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:32:07,726 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2019-09-08 02:32:07,727 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:32:07,738 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:32:07,738 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-08 02:32:07,739 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:26 [2019-09-08 02:32:07,836 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:32:07,837 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:32:07,838 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:32:07,839 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:32:07,840 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2019-09-08 02:32:07,840 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:32:07,851 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:32:07,852 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-08 02:32:07,852 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:26 [2019-09-08 02:32:07,959 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:32:07,960 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:32:07,961 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:32:07,962 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:32:07,963 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2019-09-08 02:32:07,963 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:32:07,975 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:32:07,975 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-08 02:32:07,975 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:26 [2019-09-08 02:32:08,204 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:32:08,206 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:32:08,210 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:32:08,211 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:32:08,211 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 35 [2019-09-08 02:32:08,212 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:32:08,227 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:32:08,228 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-08 02:32:08,229 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:26 [2019-09-08 02:32:08,309 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:32:08,310 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 26 treesize of output 10 [2019-09-08 02:32:08,311 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:32:08,313 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:32:08,313 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-08 02:32:08,314 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2019-09-08 02:32:08,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:32:08,477 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:32:08,491 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:32:08,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22] total 36 [2019-09-08 02:32:08,492 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-08 02:32:08,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-08 02:32:08,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=1101, Unknown=0, NotChecked=0, Total=1260 [2019-09-08 02:32:08,493 INFO L87 Difference]: Start difference. First operand 732 states and 891 transitions. Second operand 36 states. [2019-09-08 02:32:12,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:32:12,179 INFO L93 Difference]: Finished difference Result 1151 states and 1418 transitions. [2019-09-08 02:32:12,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-08 02:32:12,179 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 53 [2019-09-08 02:32:12,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:32:12,182 INFO L225 Difference]: With dead ends: 1151 [2019-09-08 02:32:12,183 INFO L226 Difference]: Without dead ends: 1091 [2019-09-08 02:32:12,183 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 35 SyntacticMatches, 9 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1568 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=702, Invalid=4410, Unknown=0, NotChecked=0, Total=5112 [2019-09-08 02:32:12,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1091 states. [2019-09-08 02:32:12,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1091 to 797. [2019-09-08 02:32:12,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2019-09-08 02:32:12,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 971 transitions. [2019-09-08 02:32:12,295 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 971 transitions. Word has length 53 [2019-09-08 02:32:12,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:32:12,295 INFO L475 AbstractCegarLoop]: Abstraction has 797 states and 971 transitions. [2019-09-08 02:32:12,295 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-08 02:32:12,295 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 971 transitions. [2019-09-08 02:32:12,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-08 02:32:12,297 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:32:12,297 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:32:12,297 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:32:12,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:32:12,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1983848057, now seen corresponding path program 1 times [2019-09-08 02:32:12,298 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:32:12,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:32:12,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:32:12,299 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:32:12,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:32:12,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:32:13,576 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 11 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:32:13,577 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:32:13,577 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:32:13,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:32:13,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:32:13,615 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 48 conjunts are in the unsatisfiable core [2019-09-08 02:32:13,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:32:13,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:32:13,801 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:32:13,802 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 28 treesize of output 27 [2019-09-08 02:32:13,802 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:32:13,816 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:32:13,816 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-08 02:32:13,817 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:35 [2019-09-08 02:32:13,871 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2019-09-08 02:32:13,873 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:32:13,874 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:32:13,876 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:32:13,877 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:32:13,882 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:32:13,883 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:32:13,884 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:32:13,886 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 29 [2019-09-08 02:32:13,887 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:32:13,891 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:32:13,891 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:32:13,901 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:32:13,901 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-08 02:32:13,902 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:23 [2019-09-08 02:32:14,087 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:32:14,088 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:32:14,089 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:32:14,090 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-08 02:32:14,091 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:32:14,093 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:32:14,093 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 41 treesize of output 49 [2019-09-08 02:32:14,094 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:32:14,122 INFO L567 ElimStorePlain]: treesize reduction 23, result has 68.5 percent of original size [2019-09-08 02:32:14,123 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-08 02:32:14,123 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:58, output treesize:45 [2019-09-08 02:32:14,305 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:32:14,306 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:32:14,307 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:32:14,308 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:32:14,312 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:32:14,313 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-08 02:32:14,314 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:32:14,315 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 62 treesize of output 52 [2019-09-08 02:32:14,315 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:32:14,337 INFO L567 ElimStorePlain]: treesize reduction 18, result has 71.9 percent of original size [2019-09-08 02:32:14,338 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-08 02:32:14,338 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:74, output treesize:46 [2019-09-08 02:32:14,522 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:32:14,523 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:32:14,524 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-08 02:32:14,526 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:32:14,527 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:32:14,529 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:32:14,558 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:32:14,558 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 53 treesize of output 128 [2019-09-08 02:32:14,559 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:32:14,607 INFO L567 ElimStorePlain]: treesize reduction 75, result has 48.6 percent of original size [2019-09-08 02:32:14,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:32:14,610 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-08 02:32:14,610 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:65, output treesize:92 [2019-09-08 02:32:14,919 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:32:14,919 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 26 treesize of output 10 [2019-09-08 02:32:14,920 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:32:14,921 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:32:14,921 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-08 02:32:14,921 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2019-09-08 02:32:14,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:32:14,992 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 9 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:32:14,995 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:32:14,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 29] total 48 [2019-09-08 02:32:14,996 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-09-08 02:32:14,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-09-08 02:32:14,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=299, Invalid=1957, Unknown=0, NotChecked=0, Total=2256 [2019-09-08 02:32:14,996 INFO L87 Difference]: Start difference. First operand 797 states and 971 transitions. Second operand 48 states. [2019-09-08 02:32:52,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:32:52,865 INFO L93 Difference]: Finished difference Result 1017 states and 1233 transitions. [2019-09-08 02:32:52,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-09-08 02:32:52,865 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 54 [2019-09-08 02:32:52,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:32:52,869 INFO L225 Difference]: With dead ends: 1017 [2019-09-08 02:32:52,869 INFO L226 Difference]: Without dead ends: 1015 [2019-09-08 02:32:52,869 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 25 SyntacticMatches, 11 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3155 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=1161, Invalid=7029, Unknown=0, NotChecked=0, Total=8190 [2019-09-08 02:32:52,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2019-09-08 02:32:53,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 857. [2019-09-08 02:32:53,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 857 states. [2019-09-08 02:32:53,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 1038 transitions. [2019-09-08 02:32:53,007 INFO L78 Accepts]: Start accepts. Automaton has 857 states and 1038 transitions. Word has length 54 [2019-09-08 02:32:53,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:32:53,007 INFO L475 AbstractCegarLoop]: Abstraction has 857 states and 1038 transitions. [2019-09-08 02:32:53,007 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-09-08 02:32:53,007 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 1038 transitions. [2019-09-08 02:32:53,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-08 02:32:53,009 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:32:53,009 INFO L399 BasicCegarLoop]: trace histogram [6, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:32:53,010 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:32:53,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:32:53,010 INFO L82 PathProgramCache]: Analyzing trace with hash 2098824215, now seen corresponding path program 4 times [2019-09-08 02:32:53,010 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:32:53,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:32:53,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:32:53,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:32:53,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:32:53,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:32:54,577 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 3 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:32:54,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:32:54,578 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:32:54,588 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 02:32:54,615 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 02:32:54,615 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:32:54,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 49 conjunts are in the unsatisfiable core [2019-09-08 02:32:54,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:32:54,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:32:54,754 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:32:54,755 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 38 treesize of output 29 [2019-09-08 02:32:54,755 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:32:54,766 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:32:54,766 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:32:54,766 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:50, output treesize:46 [2019-09-08 02:32:54,978 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:32:54,980 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:32:54,980 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 52 treesize of output 33 [2019-09-08 02:32:54,980 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:32:54,996 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:32:54,997 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-08 02:32:54,997 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:69, output treesize:41 [2019-09-08 02:32:55,061 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:32:55,072 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:32:55,115 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:32:55,116 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 5 case distinctions, treesize of input 43 treesize of output 144 [2019-09-08 02:32:55,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:32:55,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:32:55,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:32:55,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:32:55,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:32:55,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:32:55,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:32:55,122 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:32:55,234 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 32 [2019-09-08 02:32:55,234 INFO L567 ElimStorePlain]: treesize reduction 220, result has 25.2 percent of original size [2019-09-08 02:32:55,234 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:32:55,235 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:55, output treesize:73 [2019-09-08 02:32:55,542 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:32:55,542 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:32:55,546 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:32:55,547 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-08 02:32:55,548 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:32:55,549 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:32:55,549 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-08 02:32:55,554 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:32:55,554 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 64 treesize of output 69 [2019-09-08 02:32:55,555 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:32:55,588 INFO L567 ElimStorePlain]: treesize reduction 37, result has 59.3 percent of original size [2019-09-08 02:32:55,588 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:32:55,588 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:79, output treesize:54 [2019-09-08 02:32:55,715 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:32:55,716 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:32:55,717 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-08 02:32:55,718 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:32:55,720 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:32:55,721 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 56 treesize of output 55 [2019-09-08 02:32:55,721 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:32:55,757 INFO L567 ElimStorePlain]: treesize reduction 7, result has 88.3 percent of original size [2019-09-08 02:32:55,757 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-08 02:32:55,758 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:73, output treesize:41 [2019-09-08 02:32:55,882 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:32:55,885 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:32:55,886 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:32:55,889 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:32:55,890 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 38 [2019-09-08 02:32:55,890 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:32:55,900 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:32:55,901 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-08 02:32:55,901 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:29 [2019-09-08 02:32:56,156 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:32:56,156 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 28 treesize of output 12 [2019-09-08 02:32:56,157 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:32:56,158 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:32:56,158 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-08 02:32:56,158 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:5 [2019-09-08 02:32:56,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:32:56,242 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 6 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:32:56,246 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:32:56,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 30] total 51 [2019-09-08 02:32:56,248 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-09-08 02:32:56,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-09-08 02:32:56,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=2322, Unknown=0, NotChecked=0, Total=2550 [2019-09-08 02:32:56,248 INFO L87 Difference]: Start difference. First operand 857 states and 1038 transitions. Second operand 51 states. [2019-09-08 02:32:59,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:32:59,426 INFO L93 Difference]: Finished difference Result 915 states and 1100 transitions. [2019-09-08 02:32:59,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-08 02:32:59,426 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 54 [2019-09-08 02:32:59,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:32:59,429 INFO L225 Difference]: With dead ends: 915 [2019-09-08 02:32:59,429 INFO L226 Difference]: Without dead ends: 902 [2019-09-08 02:32:59,430 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 27 SyntacticMatches, 8 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2150 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=518, Invalid=5644, Unknown=0, NotChecked=0, Total=6162 [2019-09-08 02:32:59,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 902 states. [2019-09-08 02:32:59,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 902 to 788. [2019-09-08 02:32:59,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2019-09-08 02:32:59,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 960 transitions. [2019-09-08 02:32:59,557 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 960 transitions. Word has length 54 [2019-09-08 02:32:59,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:32:59,557 INFO L475 AbstractCegarLoop]: Abstraction has 788 states and 960 transitions. [2019-09-08 02:32:59,557 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-09-08 02:32:59,558 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 960 transitions. [2019-09-08 02:32:59,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-08 02:32:59,559 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:32:59,559 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:32:59,559 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:32:59,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:32:59,560 INFO L82 PathProgramCache]: Analyzing trace with hash -2049125808, now seen corresponding path program 5 times [2019-09-08 02:32:59,560 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:32:59,560 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:32:59,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:32:59,561 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:32:59,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:32:59,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:32:59,953 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 2 proven. 71 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:32:59,953 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:32:59,953 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:32:59,963 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 02:33:00,004 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-09-08 02:33:00,004 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:33:00,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 45 conjunts are in the unsatisfiable core [2019-09-08 02:33:00,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:33:00,113 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-09-08 02:33:00,113 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:33:00,121 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:33:00,122 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-08 02:33:00,122 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:10 [2019-09-08 02:33:00,225 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-09-08 02:33:00,226 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:33:00,236 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:33:00,237 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-08 02:33:00,237 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:10 [2019-09-08 02:33:00,296 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-09-08 02:33:00,297 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:33:00,305 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:33:00,306 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-08 02:33:00,306 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:10 [2019-09-08 02:33:00,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:33:00,510 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:33:00,510 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 28 treesize of output 27 [2019-09-08 02:33:00,510 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:33:00,520 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:33:00,521 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-08 02:33:00,521 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2019-09-08 02:33:00,865 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-08 02:33:00,866 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:33:00,867 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:33:00,867 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-08 02:33:00,871 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:33:00,871 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 32 treesize of output 16 [2019-09-08 02:33:00,871 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:33:00,876 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:33:00,876 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-08 02:33:00,876 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:3 [2019-09-08 02:33:00,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:33:00,934 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 73 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:33:00,940 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:33:00,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 26] total 42 [2019-09-08 02:33:00,941 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-09-08 02:33:00,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-09-08 02:33:00,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1593, Unknown=0, NotChecked=0, Total=1722 [2019-09-08 02:33:00,941 INFO L87 Difference]: Start difference. First operand 788 states and 960 transitions. Second operand 42 states. [2019-09-08 02:33:38,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:33:38,600 INFO L93 Difference]: Finished difference Result 1331 states and 1617 transitions. [2019-09-08 02:33:38,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-09-08 02:33:38,601 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 55 [2019-09-08 02:33:38,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:33:38,605 INFO L225 Difference]: With dead ends: 1331 [2019-09-08 02:33:38,605 INFO L226 Difference]: Without dead ends: 1174 [2019-09-08 02:33:38,606 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2955 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=743, Invalid=8569, Unknown=0, NotChecked=0, Total=9312 [2019-09-08 02:33:38,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2019-09-08 02:33:38,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 829. [2019-09-08 02:33:38,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 829 states. [2019-09-08 02:33:38,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 1003 transitions. [2019-09-08 02:33:38,752 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 1003 transitions. Word has length 55 [2019-09-08 02:33:38,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:33:38,753 INFO L475 AbstractCegarLoop]: Abstraction has 829 states and 1003 transitions. [2019-09-08 02:33:38,753 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-09-08 02:33:38,753 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1003 transitions. [2019-09-08 02:33:38,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-08 02:33:38,754 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:33:38,754 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:33:38,754 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:33:38,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:33:38,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1811316562, now seen corresponding path program 2 times [2019-09-08 02:33:38,755 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:33:38,755 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:33:38,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:33:38,756 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:33:38,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:33:38,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:33:39,169 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 5 proven. 66 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 02:33:39,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:33:39,170 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:33:39,180 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 02:33:39,207 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 02:33:39,207 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:33:39,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-08 02:33:39,210 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:33:39,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:33:39,471 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:33:39,472 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 38 treesize of output 29 [2019-09-08 02:33:39,473 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:33:39,493 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:33:39,494 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:33:39,494 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:52, output treesize:49 [2019-09-08 02:33:39,865 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-08 02:33:39,866 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:33:39,867 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:33:39,868 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 51 treesize of output 44 [2019-09-08 02:33:39,868 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:33:39,899 INFO L567 ElimStorePlain]: treesize reduction 14, result has 76.7 percent of original size [2019-09-08 02:33:39,900 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-08 02:33:39,900 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:73, output treesize:43 [2019-09-08 02:33:40,117 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:33:40,119 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:33:40,121 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:33:40,122 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:33:40,122 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2019-09-08 02:33:40,123 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:33:40,146 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:33:40,146 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-08 02:33:40,147 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:57, output treesize:38 [2019-09-08 02:33:40,760 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:33:40,762 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-08 02:33:40,763 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-08 02:33:40,768 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:33:40,769 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 36 treesize of output 18 [2019-09-08 02:33:40,769 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:33:40,778 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:33:40,778 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:33:40,779 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:47, output treesize:5 [2019-09-08 02:33:40,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:33:40,870 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 7 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:33:40,882 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:33:40,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 26] total 43 [2019-09-08 02:33:40,883 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-08 02:33:40,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-08 02:33:40,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=1626, Unknown=0, NotChecked=0, Total=1806 [2019-09-08 02:33:40,884 INFO L87 Difference]: Start difference. First operand 829 states and 1003 transitions. Second operand 43 states. [2019-09-08 02:33:46,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:33:46,028 INFO L93 Difference]: Finished difference Result 1127 states and 1364 transitions. [2019-09-08 02:33:46,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-09-08 02:33:46,029 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 55 [2019-09-08 02:33:46,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:33:46,032 INFO L225 Difference]: With dead ends: 1127 [2019-09-08 02:33:46,032 INFO L226 Difference]: Without dead ends: 1036 [2019-09-08 02:33:46,033 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3222 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=1018, Invalid=9082, Unknown=0, NotChecked=0, Total=10100 [2019-09-08 02:33:46,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036 states. [2019-09-08 02:33:46,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036 to 860. [2019-09-08 02:33:46,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 860 states. [2019-09-08 02:33:46,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 860 states to 860 states and 1037 transitions. [2019-09-08 02:33:46,184 INFO L78 Accepts]: Start accepts. Automaton has 860 states and 1037 transitions. Word has length 55 [2019-09-08 02:33:46,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:33:46,184 INFO L475 AbstractCegarLoop]: Abstraction has 860 states and 1037 transitions. [2019-09-08 02:33:46,184 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-08 02:33:46,185 INFO L276 IsEmpty]: Start isEmpty. Operand 860 states and 1037 transitions. [2019-09-08 02:33:46,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-08 02:33:46,186 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:33:46,186 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 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] [2019-09-08 02:33:46,186 INFO L418 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:33:46,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:33:46,187 INFO L82 PathProgramCache]: Analyzing trace with hash 402369951, now seen corresponding path program 6 times [2019-09-08 02:33:46,187 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:33:46,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:33:46,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:33:46,188 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:33:46,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:33:46,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:33:46,738 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 10 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:33:46,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:33:46,738 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:33:46,747 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 02:33:46,791 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-09-08 02:33:46,791 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:33:46,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 49 conjunts are in the unsatisfiable core [2019-09-08 02:33:46,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:33:46,846 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-09-08 02:33:46,847 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:33:46,852 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:33:46,852 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-08 02:33:46,853 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2019-09-08 02:33:46,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:33:47,009 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:33:47,010 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-08 02:33:47,011 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:33:47,011 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 44 treesize of output 38 [2019-09-08 02:33:47,011 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:33:47,027 INFO L567 ElimStorePlain]: treesize reduction 19, result has 58.7 percent of original size [2019-09-08 02:33:47,027 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:33:47,027 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:50, output treesize:27 [2019-09-08 02:33:47,138 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:33:47,139 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:33:47,140 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:33:47,141 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:33:47,141 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 39 [2019-09-08 02:33:47,142 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:33:47,149 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:33:47,150 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-08 02:33:47,150 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:28 [2019-09-08 02:33:47,231 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:33:47,232 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:33:47,234 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:33:47,235 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:33:47,235 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 33 [2019-09-08 02:33:47,235 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:33:47,243 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:33:47,244 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-08 02:33:47,244 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:22 [2019-09-08 02:33:47,380 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:33:47,381 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:33:47,382 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:33:47,383 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:33:47,384 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2019-09-08 02:33:47,384 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:33:47,394 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:33:47,394 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-08 02:33:47,394 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:19 [2019-09-08 02:33:47,667 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:33:47,668 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 26 treesize of output 10 [2019-09-08 02:33:47,668 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:33:47,672 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:33:47,672 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-08 02:33:47,673 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2019-09-08 02:33:47,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:33:47,736 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:33:47,739 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:33:47,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 25] total 45 [2019-09-08 02:33:47,740 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-09-08 02:33:47,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-09-08 02:33:47,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=1783, Unknown=0, NotChecked=0, Total=1980 [2019-09-08 02:33:47,740 INFO L87 Difference]: Start difference. First operand 860 states and 1037 transitions. Second operand 45 states. [2019-09-08 02:34:16,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:34:16,645 INFO L93 Difference]: Finished difference Result 1093 states and 1310 transitions. [2019-09-08 02:34:16,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-08 02:34:16,645 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 56 [2019-09-08 02:34:16,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:34:16,649 INFO L225 Difference]: With dead ends: 1093 [2019-09-08 02:34:16,650 INFO L226 Difference]: Without dead ends: 1091 [2019-09-08 02:34:16,650 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1682 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=713, Invalid=4987, Unknown=0, NotChecked=0, Total=5700 [2019-09-08 02:34:16,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1091 states. [2019-09-08 02:34:16,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1091 to 909. [2019-09-08 02:34:16,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-09-08 02:34:16,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1098 transitions. [2019-09-08 02:34:16,804 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1098 transitions. Word has length 56 [2019-09-08 02:34:16,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:34:16,804 INFO L475 AbstractCegarLoop]: Abstraction has 909 states and 1098 transitions. [2019-09-08 02:34:16,804 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-09-08 02:34:16,804 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1098 transitions. [2019-09-08 02:34:16,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-08 02:34:16,806 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:34:16,806 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:34:16,806 INFO L418 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:34:16,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:34:16,806 INFO L82 PathProgramCache]: Analyzing trace with hash 1963459190, now seen corresponding path program 3 times [2019-09-08 02:34:16,806 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:34:16,806 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:34:16,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:34:16,807 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:34:16,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:34:16,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-08 02:34:16,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-08 02:34:16,864 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-09-08 02:34:16,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.09 02:34:16 BoogieIcfgContainer [2019-09-08 02:34:16,909 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-08 02:34:16,910 INFO L168 Benchmark]: Toolchain (without parser) took 420909.24 ms. Allocated memory was 142.6 MB in the beginning and 348.1 MB in the end (delta: 205.5 MB). Free memory was 90.7 MB in the beginning and 145.9 MB in the end (delta: -55.2 MB). Peak memory consumption was 150.3 MB. Max. memory is 7.1 GB. [2019-09-08 02:34:16,911 INFO L168 Benchmark]: CDTParser took 0.36 ms. Allocated memory is still 142.6 MB. Free memory was 108.8 MB in the beginning and 108.6 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-08 02:34:16,911 INFO L168 Benchmark]: CACSL2BoogieTranslator took 241.11 ms. Allocated memory is still 142.6 MB. Free memory was 90.4 MB in the beginning and 80.4 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. [2019-09-08 02:34:16,911 INFO L168 Benchmark]: Boogie Preprocessor took 142.60 ms. Allocated memory was 142.6 MB in the beginning and 202.4 MB in the end (delta: 59.8 MB). Free memory was 80.4 MB in the beginning and 179.4 MB in the end (delta: -99.0 MB). Peak memory consumption was 11.3 MB. Max. memory is 7.1 GB. [2019-09-08 02:34:16,912 INFO L168 Benchmark]: RCFGBuilder took 326.35 ms. Allocated memory is still 202.4 MB. Free memory was 179.4 MB in the beginning and 164.2 MB in the end (delta: 15.2 MB). Peak memory consumption was 15.2 MB. Max. memory is 7.1 GB. [2019-09-08 02:34:16,912 INFO L168 Benchmark]: TraceAbstraction took 420195.21 ms. Allocated memory was 202.4 MB in the beginning and 348.1 MB in the end (delta: 145.8 MB). Free memory was 163.6 MB in the beginning and 145.9 MB in the end (delta: 17.8 MB). Peak memory consumption was 163.5 MB. Max. memory is 7.1 GB. [2019-09-08 02:34:16,914 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.36 ms. Allocated memory is still 142.6 MB. Free memory was 108.8 MB in the beginning and 108.6 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 241.11 ms. Allocated memory is still 142.6 MB. Free memory was 90.4 MB in the beginning and 80.4 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 142.60 ms. Allocated memory was 142.6 MB in the beginning and 202.4 MB in the end (delta: 59.8 MB). Free memory was 80.4 MB in the beginning and 179.4 MB in the end (delta: -99.0 MB). Peak memory consumption was 11.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 326.35 ms. Allocated memory is still 202.4 MB. Free memory was 179.4 MB in the beginning and 164.2 MB in the end (delta: 15.2 MB). Peak memory consumption was 15.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 420195.21 ms. Allocated memory was 202.4 MB in the beginning and 348.1 MB in the end (delta: 145.8 MB). Free memory was 163.6 MB in the beginning and 145.9 MB in the end (delta: 17.8 MB). Peak memory consumption was 163.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L11] unsigned int SIZE=__VERIFIER_nondet_uint(); [L12] int i, j, k, key; [L13] int v[SIZE]; [L14] j=1 VAL [j=1, SIZE=4, v={2:0}] [L14] COND TRUE j=0) && (v[i]>key) [L17] EXPR v[i] [L17] (i>=0) && (v[i]>key) VAL [(i>=0) && (v[i]>key)=0, i=0, j=1, k=14, SIZE=4, v={2:0}, v[i]=5] [L17] COND FALSE !((i>=0) && (v[i]>key)) [L22] v[i+1] = key VAL [i=0, j=1, k=14, SIZE=4, v={2:0}] [L14] j++ VAL [i=0, j=2, k=14, SIZE=4, v={2:0}] [L14] COND TRUE j=0) && (v[i]>key) [L17] EXPR v[i] [L17] (i>=0) && (v[i]>key) VAL [(i>=0) && (v[i]>key)=0, i=1, j=2, k=15, SIZE=4, v={2:0}, v[i]=14] [L17] COND FALSE !((i>=0) && (v[i]>key)) [L22] v[i+1] = key VAL [i=1, j=2, k=15, SIZE=4, v={2:0}] [L14] j++ VAL [i=1, j=3, k=15, SIZE=4, v={2:0}] [L14] COND TRUE j=0) && (v[i]>key) [L17] EXPR v[i] [L17] (i>=0) && (v[i]>key) VAL [(i>=0) && (v[i]>key)=1, i=2, j=3, k=13, SIZE=4, v={2:0}, v[i]=15] [L17] COND TRUE (i>=0) && (v[i]>key) [L18] COND FALSE !(i<2) VAL [i=2, j=3, k=13, SIZE=4, v={2:0}] [L20] i = i - 1 VAL [i=1, j=3, k=13, SIZE=4, v={2:0}] [L17] (i>=0) && (v[i]>key) [L17] EXPR v[i] [L17] (i>=0) && (v[i]>key) VAL [(i>=0) && (v[i]>key)=1, i=1, j=3, k=13, SIZE=4, v={2:0}, v[i]=14] [L17] COND TRUE (i>=0) && (v[i]>key) [L18] COND TRUE i<2 [L19] EXPR v[i] [L19] v[i+1] = v[i] [L20] i = i - 1 VAL [i=0, j=3, k=13, SIZE=4, v={2:0}] [L17] (i>=0) && (v[i]>key) [L17] EXPR v[i] [L17] (i>=0) && (v[i]>key) VAL [(i>=0) && (v[i]>key)=0, i=0, j=3, k=13, SIZE=4, v={2:0}, v[i]=5] [L17] COND FALSE !((i>=0) && (v[i]>key)) [L22] v[i+1] = key VAL [i=0, j=3, k=13, SIZE=4, v={2:0}] [L14] j++ VAL [i=0, j=4, k=13, SIZE=4, v={2:0}] [L14] COND FALSE !(j