/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-tiling/nr2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 20:46:09,261 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 20:46:09,264 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 20:46:09,281 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 20:46:09,282 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 20:46:09,284 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 20:46:09,286 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 20:46:09,292 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 20:46:09,294 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 20:46:09,295 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 20:46:09,296 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 20:46:09,298 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 20:46:09,298 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 20:46:09,300 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 20:46:09,301 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 20:46:09,303 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 20:46:09,304 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 20:46:09,304 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 20:46:09,309 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 20:46:09,312 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 20:46:09,315 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 20:46:09,316 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 20:46:09,318 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 20:46:09,319 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 20:46:09,322 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 20:46:09,322 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 20:46:09,322 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 20:46:09,323 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 20:46:09,324 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 20:46:09,325 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 20:46:09,325 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 20:46:09,326 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 20:46:09,326 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 20:46:09,327 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 20:46:09,328 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 20:46:09,328 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 20:46:09,329 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 20:46:09,329 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 20:46:09,329 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 20:46:09,330 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 20:46:09,331 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 20:46:09,332 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-11-23 20:46:09,345 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 20:46:09,345 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 20:46:09,347 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 20:46:09,347 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 20:46:09,347 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 20:46:09,347 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 20:46:09,347 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 20:46:09,348 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 20:46:09,348 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 20:46:09,348 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 20:46:09,348 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 20:46:09,348 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 20:46:09,349 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 20:46:09,349 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 20:46:09,349 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 20:46:09,349 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 20:46:09,349 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 20:46:09,350 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 20:46:09,350 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 20:46:09,350 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 20:46:09,350 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 20:46:09,350 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 20:46:09,351 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 20:46:09,351 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 20:46:09,351 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 20:46:09,351 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 20:46:09,351 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 20:46:09,352 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 20:46:09,352 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 20:46:09,352 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 20:46:09,615 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 20:46:09,631 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 20:46:09,635 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 20:46:09,636 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 20:46:09,637 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 20:46:09,638 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/nr2.c [2019-11-23 20:46:09,701 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b0c91fe4/1862f08a2356499dbaf472b4ae11b970/FLAG2da584937 [2019-11-23 20:46:10,154 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 20:46:10,156 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/nr2.c [2019-11-23 20:46:10,163 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b0c91fe4/1862f08a2356499dbaf472b4ae11b970/FLAG2da584937 [2019-11-23 20:46:10,537 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b0c91fe4/1862f08a2356499dbaf472b4ae11b970 [2019-11-23 20:46:10,547 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 20:46:10,549 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 20:46:10,550 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 20:46:10,550 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 20:46:10,554 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 20:46:10,556 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:46:10" (1/1) ... [2019-11-23 20:46:10,559 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ee337c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:46:10, skipping insertion in model container [2019-11-23 20:46:10,560 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:46:10" (1/1) ... [2019-11-23 20:46:10,568 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 20:46:10,589 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 20:46:10,764 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 20:46:10,768 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 20:46:10,793 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 20:46:10,813 INFO L208 MainTranslator]: Completed translation [2019-11-23 20:46:10,814 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:46:10 WrapperNode [2019-11-23 20:46:10,814 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 20:46:10,815 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 20:46:10,815 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 20:46:10,815 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 20:46:10,824 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:46:10" (1/1) ... [2019-11-23 20:46:10,910 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:46:10" (1/1) ... [2019-11-23 20:46:10,932 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 20:46:10,932 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 20:46:10,932 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 20:46:10,933 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 20:46:10,942 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:46:10" (1/1) ... [2019-11-23 20:46:10,942 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:46:10" (1/1) ... [2019-11-23 20:46:10,944 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:46:10" (1/1) ... [2019-11-23 20:46:10,944 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:46:10" (1/1) ... [2019-11-23 20:46:10,950 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:46:10" (1/1) ... [2019-11-23 20:46:10,955 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:46:10" (1/1) ... [2019-11-23 20:46:10,956 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:46:10" (1/1) ... [2019-11-23 20:46:10,962 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 20:46:10,962 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 20:46:10,962 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 20:46:10,963 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 20:46:10,965 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:46:10" (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-11-23 20:46:11,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-23 20:46:11,020 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 20:46:11,021 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 20:46:11,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-23 20:46:11,021 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-23 20:46:11,021 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-23 20:46:11,305 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 20:46:11,306 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-11-23 20:46:11,307 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:46:11 BoogieIcfgContainer [2019-11-23 20:46:11,307 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 20:46:11,308 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 20:46:11,308 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 20:46:11,317 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 20:46:11,317 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 08:46:10" (1/3) ... [2019-11-23 20:46:11,318 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b25eab7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:46:11, skipping insertion in model container [2019-11-23 20:46:11,318 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:46:10" (2/3) ... [2019-11-23 20:46:11,318 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b25eab7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:46:11, skipping insertion in model container [2019-11-23 20:46:11,319 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:46:11" (3/3) ... [2019-11-23 20:46:11,320 INFO L109 eAbstractionObserver]: Analyzing ICFG nr2.c [2019-11-23 20:46:11,331 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 20:46:11,352 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 20:46:11,363 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 20:46:11,384 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 20:46:11,384 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 20:46:11,384 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 20:46:11,384 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 20:46:11,384 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 20:46:11,385 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 20:46:11,385 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 20:46:11,385 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 20:46:11,400 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2019-11-23 20:46:11,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-23 20:46:11,407 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:46:11,408 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:46:11,408 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:46:11,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:46:11,414 INFO L82 PathProgramCache]: Analyzing trace with hash 2072761718, now seen corresponding path program 1 times [2019-11-23 20:46:11,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:46:11,424 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293913279] [2019-11-23 20:46:11,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:46:11,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:46:11,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:46:11,666 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293913279] [2019-11-23 20:46:11,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:46:11,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 20:46:11,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068452947] [2019-11-23 20:46:11,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:46:11,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:46:11,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:46:11,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:46:11,695 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 4 states. [2019-11-23 20:46:11,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:46:11,792 INFO L93 Difference]: Finished difference Result 54 states and 75 transitions. [2019-11-23 20:46:11,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 20:46:11,795 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-23 20:46:11,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:46:11,810 INFO L225 Difference]: With dead ends: 54 [2019-11-23 20:46:11,810 INFO L226 Difference]: Without dead ends: 25 [2019-11-23 20:46:11,816 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 20:46:11,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-11-23 20:46:11,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 20. [2019-11-23 20:46:11,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-23 20:46:11,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2019-11-23 20:46:11,866 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 11 [2019-11-23 20:46:11,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:46:11,867 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2019-11-23 20:46:11,867 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:46:11,868 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2019-11-23 20:46:11,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-23 20:46:11,869 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:46:11,869 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:46:11,872 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:46:11,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:46:11,872 INFO L82 PathProgramCache]: Analyzing trace with hash 2072821300, now seen corresponding path program 1 times [2019-11-23 20:46:11,873 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:46:11,873 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4325240] [2019-11-23 20:46:11,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:46:11,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:46:11,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:46:11,970 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4325240] [2019-11-23 20:46:11,971 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:46:11,971 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 20:46:11,971 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930742936] [2019-11-23 20:46:11,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:46:11,973 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:46:11,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:46:11,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:46:11,974 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand 4 states. [2019-11-23 20:46:12,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:46:12,031 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2019-11-23 20:46:12,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:46:12,032 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-23 20:46:12,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:46:12,033 INFO L225 Difference]: With dead ends: 36 [2019-11-23 20:46:12,033 INFO L226 Difference]: Without dead ends: 25 [2019-11-23 20:46:12,034 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:46:12,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-11-23 20:46:12,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2019-11-23 20:46:12,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-23 20:46:12,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2019-11-23 20:46:12,040 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 11 [2019-11-23 20:46:12,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:46:12,040 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2019-11-23 20:46:12,040 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:46:12,041 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2019-11-23 20:46:12,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-23 20:46:12,041 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:46:12,041 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:46:12,042 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:46:12,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:46:12,042 INFO L82 PathProgramCache]: Analyzing trace with hash -594620155, now seen corresponding path program 1 times [2019-11-23 20:46:12,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:46:12,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089944132] [2019-11-23 20:46:12,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:46:12,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:46:12,076 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:46:12,076 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089944132] [2019-11-23 20:46:12,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:46:12,077 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:46:12,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386848470] [2019-11-23 20:46:12,078 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:46:12,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:46:12,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:46:12,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:46:12,079 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 3 states. [2019-11-23 20:46:12,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:46:12,107 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2019-11-23 20:46:12,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:46:12,108 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-11-23 20:46:12,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:46:12,109 INFO L225 Difference]: With dead ends: 40 [2019-11-23 20:46:12,109 INFO L226 Difference]: Without dead ends: 24 [2019-11-23 20:46:12,110 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:46:12,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-11-23 20:46:12,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2019-11-23 20:46:12,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-23 20:46:12,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2019-11-23 20:46:12,116 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 14 [2019-11-23 20:46:12,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:46:12,116 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2019-11-23 20:46:12,116 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:46:12,117 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2019-11-23 20:46:12,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-23 20:46:12,117 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:46:12,118 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:46:12,118 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:46:12,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:46:12,119 INFO L82 PathProgramCache]: Analyzing trace with hash -2056923621, now seen corresponding path program 1 times [2019-11-23 20:46:12,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:46:12,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011256059] [2019-11-23 20:46:12,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:46:12,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:46:12,192 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:46:12,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011256059] [2019-11-23 20:46:12,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1729692160] [2019-11-23 20:46:12,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:46:12,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:46:12,265 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-23 20:46:12,271 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:46:12,291 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:46:12,292 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:46:12,292 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-23 20:46:12,292 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845021117] [2019-11-23 20:46:12,293 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:46:12,293 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:46:12,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:46:12,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:46:12,294 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand 4 states. [2019-11-23 20:46:12,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:46:12,329 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2019-11-23 20:46:12,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:46:12,330 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-11-23 20:46:12,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:46:12,331 INFO L225 Difference]: With dead ends: 42 [2019-11-23 20:46:12,331 INFO L226 Difference]: Without dead ends: 25 [2019-11-23 20:46:12,331 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:46:12,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-11-23 20:46:12,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-11-23 20:46:12,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-23 20:46:12,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2019-11-23 20:46:12,337 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 17 [2019-11-23 20:46:12,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:46:12,338 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2019-11-23 20:46:12,338 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:46:12,338 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2019-11-23 20:46:12,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-23 20:46:12,339 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:46:12,339 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:46:12,544 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:46:12,544 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:46:12,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:46:12,545 INFO L82 PathProgramCache]: Analyzing trace with hash -1686195899, now seen corresponding path program 2 times [2019-11-23 20:46:12,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:46:12,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197644427] [2019-11-23 20:46:12,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:46:12,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:46:12,639 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:46:12,640 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197644427] [2019-11-23 20:46:12,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:46:12,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 20:46:12,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347317553] [2019-11-23 20:46:12,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 20:46:12,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:46:12,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 20:46:12,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-23 20:46:12,643 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand 5 states. [2019-11-23 20:46:12,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:46:12,703 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2019-11-23 20:46:12,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 20:46:12,705 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-11-23 20:46:12,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:46:12,706 INFO L225 Difference]: With dead ends: 46 [2019-11-23 20:46:12,706 INFO L226 Difference]: Without dead ends: 26 [2019-11-23 20:46:12,707 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-23 20:46:12,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-11-23 20:46:12,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2019-11-23 20:46:12,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-23 20:46:12,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2019-11-23 20:46:12,713 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 20 [2019-11-23 20:46:12,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:46:12,713 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2019-11-23 20:46:12,713 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 20:46:12,714 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2019-11-23 20:46:12,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-23 20:46:12,714 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:46:12,715 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:46:12,715 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:46:12,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:46:12,715 INFO L82 PathProgramCache]: Analyzing trace with hash -985131321, now seen corresponding path program 1 times [2019-11-23 20:46:12,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:46:12,716 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409131636] [2019-11-23 20:46:12,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:46:12,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:46:13,757 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:46:13,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409131636] [2019-11-23 20:46:13,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1189360601] [2019-11-23 20:46:13,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:46:13,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:46:13,813 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-23 20:46:13,815 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:46:13,962 INFO L377 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-11-23 20:46:13,962 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:46:13,971 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:46:13,972 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:46:13,972 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-23 20:46:14,026 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:46:14,027 INFO L377 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 24 treesize of output 49 [2019-11-23 20:46:14,028 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:46:14,051 INFO L567 ElimStorePlain]: treesize reduction 17, result has 67.3 percent of original size [2019-11-23 20:46:14,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:14,055 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-11-23 20:46:14,056 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:35 [2019-11-23 20:46:14,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:14,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:14,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:14,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:14,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:14,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:14,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:14,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:14,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:14,475 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:46:14,476 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:46:14,476 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2019-11-23 20:46:14,476 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882420614] [2019-11-23 20:46:14,477 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-23 20:46:14,477 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:46:14,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-23 20:46:14,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2019-11-23 20:46:14,478 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand 21 states. [2019-11-23 20:46:17,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:46:17,890 INFO L93 Difference]: Finished difference Result 157 states and 184 transitions. [2019-11-23 20:46:17,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-11-23 20:46:17,891 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 20 [2019-11-23 20:46:17,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:46:17,892 INFO L225 Difference]: With dead ends: 157 [2019-11-23 20:46:17,892 INFO L226 Difference]: Without dead ends: 137 [2019-11-23 20:46:17,895 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 799 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=584, Invalid=2608, Unknown=0, NotChecked=0, Total=3192 [2019-11-23 20:46:17,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-11-23 20:46:17,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 49. [2019-11-23 20:46:17,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-11-23 20:46:17,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 59 transitions. [2019-11-23 20:46:17,906 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 59 transitions. Word has length 20 [2019-11-23 20:46:17,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:46:17,907 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 59 transitions. [2019-11-23 20:46:17,907 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-23 20:46:17,907 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 59 transitions. [2019-11-23 20:46:17,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-23 20:46:17,908 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:46:17,908 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:46:18,120 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:46:18,121 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:46:18,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:46:18,122 INFO L82 PathProgramCache]: Analyzing trace with hash 897530746, now seen corresponding path program 1 times [2019-11-23 20:46:18,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:46:18,123 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631566215] [2019-11-23 20:46:18,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:46:18,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:46:18,258 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:46:18,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631566215] [2019-11-23 20:46:18,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1056765880] [2019-11-23 20:46:18,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:46:18,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:46:18,304 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-23 20:46:18,306 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:46:18,317 INFO L377 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-11-23 20:46:18,317 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:46:18,322 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:46:18,323 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-11-23 20:46:18,324 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:19 [2019-11-23 20:46:18,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:18,356 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:46:18,356 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:46:18,356 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 14 [2019-11-23 20:46:18,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771793955] [2019-11-23 20:46:18,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-23 20:46:18,357 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:46:18,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-23 20:46:18,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-11-23 20:46:18,358 INFO L87 Difference]: Start difference. First operand 49 states and 59 transitions. Second operand 14 states. [2019-11-23 20:46:18,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:46:18,714 INFO L93 Difference]: Finished difference Result 98 states and 114 transitions. [2019-11-23 20:46:18,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-11-23 20:46:18,714 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2019-11-23 20:46:18,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:46:18,715 INFO L225 Difference]: With dead ends: 98 [2019-11-23 20:46:18,716 INFO L226 Difference]: Without dead ends: 96 [2019-11-23 20:46:18,718 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=175, Invalid=637, Unknown=0, NotChecked=0, Total=812 [2019-11-23 20:46:18,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-11-23 20:46:18,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 55. [2019-11-23 20:46:18,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-11-23 20:46:18,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2019-11-23 20:46:18,754 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 66 transitions. Word has length 26 [2019-11-23 20:46:18,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:46:18,754 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 66 transitions. [2019-11-23 20:46:18,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-23 20:46:18,754 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2019-11-23 20:46:18,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-23 20:46:18,756 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:46:18,756 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:46:18,957 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:46:18,957 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:46:18,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:46:18,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1023691884, now seen corresponding path program 2 times [2019-11-23 20:46:18,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:46:18,959 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892340001] [2019-11-23 20:46:18,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:46:18,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:46:19,504 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:46:19,504 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892340001] [2019-11-23 20:46:19,504 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [935569850] [2019-11-23 20:46:19,504 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:46:19,544 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 20:46:19,545 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:46:19,546 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 29 conjunts are in the unsatisfiable core [2019-11-23 20:46:19,550 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:46:19,578 INFO L377 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-11-23 20:46:19,578 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:46:19,584 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:46:19,584 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:46:19,584 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-23 20:46:19,625 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:46:19,626 INFO L377 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 31 treesize of output 75 [2019-11-23 20:46:19,627 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:46:19,658 INFO L567 ElimStorePlain]: treesize reduction 29, result has 64.2 percent of original size [2019-11-23 20:46:19,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:19,660 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-11-23 20:46:19,660 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:52 [2019-11-23 20:46:19,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:19,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:19,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:19,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:19,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:19,877 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:46:19,904 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:46:19,905 INFO L377 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 2 case distinctions, treesize of input 50 treesize of output 110 [2019-11-23 20:46:19,906 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:46:19,916 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:46:19,920 INFO L377 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 37 [2019-11-23 20:46:19,920 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 20:46:20,008 INFO L567 ElimStorePlain]: treesize reduction 35, result has 73.5 percent of original size [2019-11-23 20:46:20,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:20,012 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-11-23 20:46:20,012 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:89, output treesize:97 [2019-11-23 20:46:20,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:20,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:22,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:22,302 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:46:22,346 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:46:22,347 INFO L377 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 2 case distinctions, treesize of input 52 treesize of output 135 [2019-11-23 20:46:22,348 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:46:22,353 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:46:22,388 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:46:22,389 INFO L377 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 2 case distinctions, treesize of input 52 treesize of output 135 [2019-11-23 20:46:22,390 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 20:46:22,516 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 43 [2019-11-23 20:46:22,518 INFO L567 ElimStorePlain]: treesize reduction 115, result has 55.6 percent of original size [2019-11-23 20:46:22,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:22,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:22,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:22,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:22,526 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2019-11-23 20:46:22,527 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:105, output treesize:144 [2019-11-23 20:46:22,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:22,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:22,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:22,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:31,246 WARN L192 SmtUtils]: Spent 8.62 s on a formula simplification that was a NOOP. DAG size: 61 [2019-11-23 20:46:31,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:31,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:31,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:31,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:47:10,304 WARN L192 SmtUtils]: Spent 34.96 s on a formula simplification. DAG size of input: 62 DAG size of output: 51 [2019-11-23 20:47:30,937 WARN L192 SmtUtils]: Spent 12.26 s on a formula simplification that was a NOOP. DAG size: 68 [2019-11-23 20:47:48,390 WARN L192 SmtUtils]: Spent 15.35 s on a formula simplification that was a NOOP. DAG size: 70 [2019-11-23 20:47:48,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:47:48,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-23 20:47:48,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms