/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/mbpr3.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 20:44:51,004 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 20:44:51,006 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 20:44:51,019 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 20:44:51,019 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 20:44:51,020 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 20:44:51,022 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 20:44:51,024 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 20:44:51,025 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 20:44:51,026 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 20:44:51,027 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 20:44:51,029 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 20:44:51,029 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 20:44:51,030 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 20:44:51,031 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 20:44:51,032 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 20:44:51,033 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 20:44:51,034 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 20:44:51,035 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 20:44:51,037 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 20:44:51,039 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 20:44:51,040 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 20:44:51,041 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 20:44:51,042 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 20:44:51,044 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 20:44:51,044 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 20:44:51,045 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 20:44:51,045 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 20:44:51,046 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 20:44:51,047 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 20:44:51,047 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 20:44:51,048 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 20:44:51,049 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 20:44:51,050 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 20:44:51,051 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 20:44:51,051 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 20:44:51,051 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 20:44:51,052 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 20:44:51,052 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 20:44:51,053 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 20:44:51,053 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 20:44:51,054 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:44:51,068 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 20:44:51,068 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 20:44:51,069 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 20:44:51,070 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 20:44:51,070 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 20:44:51,070 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 20:44:51,070 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 20:44:51,070 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 20:44:51,071 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 20:44:51,071 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 20:44:51,071 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 20:44:51,071 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 20:44:51,071 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 20:44:51,072 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 20:44:51,072 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 20:44:51,072 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 20:44:51,072 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 20:44:51,072 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 20:44:51,073 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 20:44:51,073 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 20:44:51,073 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 20:44:51,073 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 20:44:51,073 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 20:44:51,074 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 20:44:51,074 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 20:44:51,074 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 20:44:51,074 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 20:44:51,075 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 20:44:51,075 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 20:44:51,075 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 20:44:51,381 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 20:44:51,397 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 20:44:51,402 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 20:44:51,403 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 20:44:51,403 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 20:44:51,404 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/mbpr3.c [2019-11-23 20:44:51,478 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66f9cb5dd/fe06ade86ee64b82af79bf7db0bc8466/FLAG549445473 [2019-11-23 20:44:51,930 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 20:44:51,931 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/mbpr3.c [2019-11-23 20:44:51,937 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66f9cb5dd/fe06ade86ee64b82af79bf7db0bc8466/FLAG549445473 [2019-11-23 20:44:52,313 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66f9cb5dd/fe06ade86ee64b82af79bf7db0bc8466 [2019-11-23 20:44:52,322 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 20:44:52,323 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 20:44:52,324 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 20:44:52,324 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 20:44:52,328 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 20:44:52,329 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:44:52" (1/1) ... [2019-11-23 20:44:52,333 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f03c8df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:44:52, skipping insertion in model container [2019-11-23 20:44:52,333 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:44:52" (1/1) ... [2019-11-23 20:44:52,341 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 20:44:52,360 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 20:44:52,610 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 20:44:52,615 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 20:44:52,732 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 20:44:52,751 INFO L208 MainTranslator]: Completed translation [2019-11-23 20:44:52,752 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:44:52 WrapperNode [2019-11-23 20:44:52,752 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 20:44:52,753 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 20:44:52,753 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 20:44:52,753 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 20:44:52,762 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:44:52" (1/1) ... [2019-11-23 20:44:52,772 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:44:52" (1/1) ... [2019-11-23 20:44:52,805 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 20:44:52,806 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 20:44:52,806 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 20:44:52,806 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 20:44:52,813 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:44:52" (1/1) ... [2019-11-23 20:44:52,814 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:44:52" (1/1) ... [2019-11-23 20:44:52,816 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:44:52" (1/1) ... [2019-11-23 20:44:52,817 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:44:52" (1/1) ... [2019-11-23 20:44:52,825 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:44:52" (1/1) ... [2019-11-23 20:44:52,830 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:44:52" (1/1) ... [2019-11-23 20:44:52,832 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:44:52" (1/1) ... [2019-11-23 20:44:52,835 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 20:44:52,836 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 20:44:52,836 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 20:44:52,836 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 20:44:52,837 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:44:52" (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:44:52,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-23 20:44:52,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 20:44:52,896 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 20:44:52,896 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-23 20:44:52,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-23 20:44:52,897 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-23 20:44:53,263 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 20:44:53,264 INFO L284 CfgBuilder]: Removed 10 assume(true) statements. [2019-11-23 20:44:53,265 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:44:53 BoogieIcfgContainer [2019-11-23 20:44:53,265 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 20:44:53,267 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 20:44:53,268 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 20:44:53,271 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 20:44:53,271 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 08:44:52" (1/3) ... [2019-11-23 20:44:53,272 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ad52289 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:44:53, skipping insertion in model container [2019-11-23 20:44:53,272 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:44:52" (2/3) ... [2019-11-23 20:44:53,273 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ad52289 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:44:53, skipping insertion in model container [2019-11-23 20:44:53,273 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:44:53" (3/3) ... [2019-11-23 20:44:53,275 INFO L109 eAbstractionObserver]: Analyzing ICFG mbpr3.c [2019-11-23 20:44:53,286 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 20:44:53,291 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 20:44:53,303 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 20:44:53,327 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 20:44:53,328 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 20:44:53,328 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 20:44:53,328 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 20:44:53,328 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 20:44:53,328 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 20:44:53,329 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 20:44:53,329 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 20:44:53,345 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2019-11-23 20:44:53,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-23 20:44:53,352 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:44:53,353 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:44:53,353 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:44:53,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:44:53,360 INFO L82 PathProgramCache]: Analyzing trace with hash -1172251972, now seen corresponding path program 1 times [2019-11-23 20:44:53,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:44:53,370 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091837743] [2019-11-23 20:44:53,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:44:53,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:44:53,519 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:44:53,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091837743] [2019-11-23 20:44:53,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:44:53,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 20:44:53,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750921896] [2019-11-23 20:44:53,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-23 20:44:53,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:44:53,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-23 20:44:53,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-23 20:44:53,542 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 2 states. [2019-11-23 20:44:53,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:44:53,559 INFO L93 Difference]: Finished difference Result 56 states and 79 transitions. [2019-11-23 20:44:53,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-23 20:44:53,560 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2019-11-23 20:44:53,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:44:53,569 INFO L225 Difference]: With dead ends: 56 [2019-11-23 20:44:53,569 INFO L226 Difference]: Without dead ends: 27 [2019-11-23 20:44:53,573 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-23 20:44:53,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-11-23 20:44:53,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-11-23 20:44:53,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-23 20:44:53,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2019-11-23 20:44:53,606 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 15 [2019-11-23 20:44:53,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:44:53,607 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2019-11-23 20:44:53,607 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-23 20:44:53,607 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2019-11-23 20:44:53,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-23 20:44:53,608 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:44:53,608 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:44:53,608 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:44:53,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:44:53,609 INFO L82 PathProgramCache]: Analyzing trace with hash -2097793694, now seen corresponding path program 1 times [2019-11-23 20:44:53,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:44:53,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015118739] [2019-11-23 20:44:53,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:44:53,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:44:53,699 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:44:53,700 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015118739] [2019-11-23 20:44:53,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:44:53,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 20:44:53,701 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546595694] [2019-11-23 20:44:53,702 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:44:53,703 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:44:53,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:44:53,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:44:53,704 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand 4 states. [2019-11-23 20:44:53,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:44:53,785 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2019-11-23 20:44:53,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 20:44:53,786 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-23 20:44:53,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:44:53,787 INFO L225 Difference]: With dead ends: 36 [2019-11-23 20:44:53,787 INFO L226 Difference]: Without dead ends: 34 [2019-11-23 20:44:53,788 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:44:53,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-11-23 20:44:53,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 29. [2019-11-23 20:44:53,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-23 20:44:53,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2019-11-23 20:44:53,797 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 15 [2019-11-23 20:44:53,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:44:53,798 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2019-11-23 20:44:53,798 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:44:53,798 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2019-11-23 20:44:53,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-23 20:44:53,799 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:44:53,799 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:44:53,800 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:44:53,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:44:53,800 INFO L82 PathProgramCache]: Analyzing trace with hash -2097734112, now seen corresponding path program 1 times [2019-11-23 20:44:53,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:44:53,801 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788498925] [2019-11-23 20:44:53,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:44:53,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:44:54,033 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:44:54,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788498925] [2019-11-23 20:44:54,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:44:54,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 20:44:54,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937714945] [2019-11-23 20:44:54,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:44:54,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:44:54,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:44:54,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:44:54,036 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand 4 states. [2019-11-23 20:44:54,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:44:54,144 INFO L93 Difference]: Finished difference Result 54 states and 68 transitions. [2019-11-23 20:44:54,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:44:54,145 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-23 20:44:54,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:44:54,146 INFO L225 Difference]: With dead ends: 54 [2019-11-23 20:44:54,146 INFO L226 Difference]: Without dead ends: 33 [2019-11-23 20:44:54,147 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:44:54,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-11-23 20:44:54,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2019-11-23 20:44:54,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-23 20:44:54,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2019-11-23 20:44:54,153 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 15 [2019-11-23 20:44:54,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:44:54,153 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2019-11-23 20:44:54,153 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:44:54,154 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2019-11-23 20:44:54,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-23 20:44:54,155 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:44:54,155 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:44:54,155 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:44:54,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:44:54,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1357199269, now seen corresponding path program 1 times [2019-11-23 20:44:54,156 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:44:54,156 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935457016] [2019-11-23 20:44:54,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:44:54,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:44:54,456 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-23 20:44:54,458 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935457016] [2019-11-23 20:44:54,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:44:54,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 20:44:54,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611559877] [2019-11-23 20:44:54,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 20:44:54,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:44:54,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 20:44:54,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 20:44:54,461 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 5 states. [2019-11-23 20:44:54,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:44:54,603 INFO L93 Difference]: Finished difference Result 57 states and 72 transitions. [2019-11-23 20:44:54,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 20:44:54,604 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-11-23 20:44:54,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:44:54,605 INFO L225 Difference]: With dead ends: 57 [2019-11-23 20:44:54,605 INFO L226 Difference]: Without dead ends: 41 [2019-11-23 20:44:54,606 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 20:44:54,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-11-23 20:44:54,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 32. [2019-11-23 20:44:54,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-23 20:44:54,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2019-11-23 20:44:54,616 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 19 [2019-11-23 20:44:54,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:44:54,617 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2019-11-23 20:44:54,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 20:44:54,618 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2019-11-23 20:44:54,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-23 20:44:54,619 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:44:54,619 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:44:54,620 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:44:54,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:44:54,620 INFO L82 PathProgramCache]: Analyzing trace with hash -27892337, now seen corresponding path program 1 times [2019-11-23 20:44:54,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:44:54,621 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146559952] [2019-11-23 20:44:54,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:44:54,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:44:55,608 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:44:55,609 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146559952] [2019-11-23 20:44:55,609 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [42097190] [2019-11-23 20:44:55,609 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:44:55,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:44:55,678 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-23 20:44:55,685 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:44:55,790 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:44:55,791 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:44:55,801 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:44:55,802 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:44:55,802 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2019-11-23 20:44:55,849 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 0 case distinctions, treesize of input 49 treesize of output 38 [2019-11-23 20:44:55,852 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:44:55,853 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:44:55,854 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:44:55,858 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:44:55,862 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:44:55,863 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:44:55,864 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:44:55,867 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 29 treesize of output 29 [2019-11-23 20:44:55,868 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 20:44:55,870 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:44:55,870 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:44:55,876 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:44:55,877 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:44:55,877 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:55, output treesize:14 [2019-11-23 20:44:55,945 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:44:55,946 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 24 treesize of output 23 [2019-11-23 20:44:55,947 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:44:55,959 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:44:55,960 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:44:55,960 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:17 [2019-11-23 20:44:55,970 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 0 case distinctions, treesize of input 67 treesize of output 56 [2019-11-23 20:44:55,984 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:44:55,986 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:44:55,989 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:44:55,996 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:44:55,998 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:44:56,019 INFO L343 Elim1Store]: treesize reduction 26, result has 44.7 percent of original size [2019-11-23 20:44:56,019 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 41 treesize of output 48 [2019-11-23 20:44:56,020 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 20:44:56,033 INFO L567 ElimStorePlain]: treesize reduction 27, result has 20.6 percent of original size [2019-11-23 20:44:56,033 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:44:56,040 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:44:56,041 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:44:56,041 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:76, output treesize:14 [2019-11-23 20:44:56,060 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:44:56,061 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 24 treesize of output 23 [2019-11-23 20:44:56,062 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:44:56,071 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:44:56,072 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:44:56,072 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2019-11-23 20:44:56,119 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 0 case distinctions, treesize of input 79 treesize of output 66 [2019-11-23 20:44:56,124 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:44:56,125 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:44:56,127 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:44:56,128 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:44:56,129 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:44:56,135 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:44:56,142 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:44:56,144 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:44:56,146 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:44:56,147 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:44:56,148 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:44:56,173 INFO L343 Elim1Store]: treesize reduction 22, result has 53.2 percent of original size [2019-11-23 20:44:56,173 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 51 treesize of output 67 [2019-11-23 20:44:56,174 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 20:44:56,185 INFO L567 ElimStorePlain]: treesize reduction 26, result has 43.5 percent of original size [2019-11-23 20:44:56,185 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:44:56,196 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:44:56,197 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:44:56,198 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:88, output treesize:29 [2019-11-23 20:44:56,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:44:56,315 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:44:56,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:44:56,316 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 25 [2019-11-23 20:44:56,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829781123] [2019-11-23 20:44:56,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-23 20:44:56,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:44:56,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-23 20:44:56,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=491, Unknown=0, NotChecked=0, Total=600 [2019-11-23 20:44:56,319 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand 25 states. [2019-11-23 20:44:59,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:44:59,595 INFO L93 Difference]: Finished difference Result 255 states and 303 transitions. [2019-11-23 20:44:59,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-11-23 20:44:59,595 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 27 [2019-11-23 20:44:59,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:44:59,599 INFO L225 Difference]: With dead ends: 255 [2019-11-23 20:44:59,599 INFO L226 Difference]: Without dead ends: 228 [2019-11-23 20:44:59,601 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 19 SyntacticMatches, 5 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1009 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=942, Invalid=3218, Unknown=0, NotChecked=0, Total=4160 [2019-11-23 20:44:59,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2019-11-23 20:44:59,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 34. [2019-11-23 20:44:59,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-23 20:44:59,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2019-11-23 20:44:59,612 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 27 [2019-11-23 20:44:59,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:44:59,612 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2019-11-23 20:44:59,612 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-23 20:44:59,613 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2019-11-23 20:44:59,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-23 20:44:59,613 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:44:59,614 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:44:59,816 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:44:59,819 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:44:59,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:44:59,820 INFO L82 PathProgramCache]: Analyzing trace with hash -1637457854, now seen corresponding path program 1 times [2019-11-23 20:44:59,820 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:44:59,820 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216881201] [2019-11-23 20:44:59,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:44:59,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:45:00,400 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:45:00,401 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216881201] [2019-11-23 20:45:00,401 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1250644221] [2019-11-23 20:45:00,401 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:45:00,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:45:00,439 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-23 20:45:00,441 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:45:00,508 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:45:00,508 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:45:00,516 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:45:00,517 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:45:00,517 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2019-11-23 20:45:00,552 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 0 case distinctions, treesize of input 43 treesize of output 32 [2019-11-23 20:45:00,555 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:00,556 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:00,557 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:00,560 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:00,563 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:00,564 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:00,565 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:00,567 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 27 treesize of output 29 [2019-11-23 20:45:00,568 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 20:45:00,571 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:45:00,572 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:45:00,577 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:45:00,578 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:45:00,578 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:49, output treesize:16 [2019-11-23 20:45:00,635 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:00,638 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 26 treesize of output 25 [2019-11-23 20:45:00,639 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:45:00,648 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:45:00,649 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:45:00,649 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2019-11-23 20:45:00,683 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 0 case distinctions, treesize of input 81 treesize of output 68 [2019-11-23 20:45:00,684 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:00,686 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:00,688 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:00,689 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:00,690 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:00,693 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:00,696 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:00,697 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:00,697 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:00,698 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:00,700 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:00,721 INFO L343 Elim1Store]: treesize reduction 26, result has 54.4 percent of original size [2019-11-23 20:45:00,722 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 53 treesize of output 73 [2019-11-23 20:45:00,723 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 20:45:00,733 INFO L567 ElimStorePlain]: treesize reduction 30, result has 42.3 percent of original size [2019-11-23 20:45:00,733 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:45:00,754 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:45:00,755 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:45:00,755 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:90, output treesize:31 [2019-11-23 20:45:00,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:45:00,894 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-23 20:45:00,894 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:45:00,894 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12] total 25 [2019-11-23 20:45:00,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602059357] [2019-11-23 20:45:00,895 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-23 20:45:00,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:45:00,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-23 20:45:00,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=503, Unknown=0, NotChecked=0, Total=600 [2019-11-23 20:45:00,896 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand 25 states. [2019-11-23 20:45:04,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:45:04,125 INFO L93 Difference]: Finished difference Result 232 states and 272 transitions. [2019-11-23 20:45:04,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-11-23 20:45:04,125 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 33 [2019-11-23 20:45:04,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:45:04,128 INFO L225 Difference]: With dead ends: 232 [2019-11-23 20:45:04,128 INFO L226 Difference]: Without dead ends: 209 [2019-11-23 20:45:04,130 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 25 SyntacticMatches, 4 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1128 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=920, Invalid=3502, Unknown=0, NotChecked=0, Total=4422 [2019-11-23 20:45:04,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-11-23 20:45:04,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 40. [2019-11-23 20:45:04,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-23 20:45:04,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2019-11-23 20:45:04,140 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 33 [2019-11-23 20:45:04,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:45:04,140 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2019-11-23 20:45:04,140 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-23 20:45:04,140 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2019-11-23 20:45:04,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-23 20:45:04,141 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:45:04,142 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:45:04,347 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:45:04,347 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:45:04,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:45:04,348 INFO L82 PathProgramCache]: Analyzing trace with hash -1978775371, now seen corresponding path program 2 times [2019-11-23 20:45:04,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:45:04,348 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134956212] [2019-11-23 20:45:04,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:45:04,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:45:05,350 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:45:05,350 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134956212] [2019-11-23 20:45:05,351 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [300484765] [2019-11-23 20:45:05,351 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 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:45:05,414 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 20:45:05,415 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:45:05,416 INFO L255 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-23 20:45:05,418 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:45:05,452 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:45:05,453 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:45:05,460 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:45:05,460 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:45:05,460 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-11-23 20:45:05,491 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 0 case distinctions, treesize of input 47 treesize of output 36 [2019-11-23 20:45:05,493 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:05,494 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:05,495 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:05,497 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:05,498 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:05,500 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:05,501 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:05,503 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 27 treesize of output 29 [2019-11-23 20:45:05,503 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 20:45:05,507 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:45:05,507 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:45:05,511 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:45:05,511 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:45:05,511 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:50, output treesize:13 [2019-11-23 20:45:05,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:45:05,627 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-23 20:45:05,628 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:45:05,628 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 10] total 26 [2019-11-23 20:45:05,628 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780321969] [2019-11-23 20:45:05,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-11-23 20:45:05,629 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:45:05,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-11-23 20:45:05,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=571, Unknown=0, NotChecked=0, Total=650 [2019-11-23 20:45:05,630 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand 26 states. [2019-11-23 20:45:09,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:45:09,142 INFO L93 Difference]: Finished difference Result 216 states and 248 transitions. [2019-11-23 20:45:09,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-11-23 20:45:09,143 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 39 [2019-11-23 20:45:09,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:45:09,145 INFO L225 Difference]: With dead ends: 216 [2019-11-23 20:45:09,145 INFO L226 Difference]: Without dead ends: 155 [2019-11-23 20:45:09,148 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2127 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=1190, Invalid=5616, Unknown=0, NotChecked=0, Total=6806 [2019-11-23 20:45:09,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-11-23 20:45:09,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 84. [2019-11-23 20:45:09,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-11-23 20:45:09,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 98 transitions. [2019-11-23 20:45:09,162 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 98 transitions. Word has length 39 [2019-11-23 20:45:09,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:45:09,162 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 98 transitions. [2019-11-23 20:45:09,162 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-11-23 20:45:09,162 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 98 transitions. [2019-11-23 20:45:09,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-23 20:45:09,163 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:45:09,164 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:45:09,369 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:45:09,370 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:45:09,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:45:09,370 INFO L82 PathProgramCache]: Analyzing trace with hash 2097337207, now seen corresponding path program 1 times [2019-11-23 20:45:09,370 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:45:09,371 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677102431] [2019-11-23 20:45:09,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:45:09,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:45:09,409 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-23 20:45:09,410 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677102431] [2019-11-23 20:45:09,410 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:45:09,410 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:45:09,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199787378] [2019-11-23 20:45:09,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:45:09,411 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:45:09,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:45:09,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:45:09,411 INFO L87 Difference]: Start difference. First operand 84 states and 98 transitions. Second operand 3 states. [2019-11-23 20:45:09,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:45:09,423 INFO L93 Difference]: Finished difference Result 114 states and 132 transitions. [2019-11-23 20:45:09,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:45:09,424 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-11-23 20:45:09,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:45:09,424 INFO L225 Difference]: With dead ends: 114 [2019-11-23 20:45:09,425 INFO L226 Difference]: Without dead ends: 55 [2019-11-23 20:45:09,425 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:45:09,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-11-23 20:45:09,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 50. [2019-11-23 20:45:09,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-23 20:45:09,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2019-11-23 20:45:09,432 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 39 [2019-11-23 20:45:09,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:45:09,432 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2019-11-23 20:45:09,433 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:45:09,433 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2019-11-23 20:45:09,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-23 20:45:09,434 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:45:09,434 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1] [2019-11-23 20:45:09,434 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:45:09,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:45:09,435 INFO L82 PathProgramCache]: Analyzing trace with hash 957947875, now seen corresponding path program 3 times [2019-11-23 20:45:09,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:45:09,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667082767] [2019-11-23 20:45:09,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:45:09,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:45:09,609 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-11-23 20:45:09,609 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667082767] [2019-11-23 20:45:09,610 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [50459185] [2019-11-23 20:45:09,610 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 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:45:09,664 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-23 20:45:09,664 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:45:09,665 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-23 20:45:09,667 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:45:09,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:45:09,737 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-11-23 20:45:09,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:45:09,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2019-11-23 20:45:09,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376044547] [2019-11-23 20:45:09,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-23 20:45:09,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:45:09,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-23 20:45:09,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-11-23 20:45:09,740 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 12 states. [2019-11-23 20:45:09,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:45:09,984 INFO L93 Difference]: Finished difference Result 95 states and 105 transitions. [2019-11-23 20:45:09,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-23 20:45:09,984 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 49 [2019-11-23 20:45:09,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:45:09,985 INFO L225 Difference]: With dead ends: 95 [2019-11-23 20:45:09,986 INFO L226 Difference]: Without dead ends: 64 [2019-11-23 20:45:09,987 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 46 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2019-11-23 20:45:09,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-23 20:45:09,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 58. [2019-11-23 20:45:09,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-11-23 20:45:09,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2019-11-23 20:45:09,994 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 49 [2019-11-23 20:45:09,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:45:09,995 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2019-11-23 20:45:09,995 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-23 20:45:09,995 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2019-11-23 20:45:09,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-23 20:45:09,996 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:45:09,996 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:45:10,199 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:45:10,200 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:45:10,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:45:10,200 INFO L82 PathProgramCache]: Analyzing trace with hash -599046121, now seen corresponding path program 4 times [2019-11-23 20:45:10,201 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:45:10,201 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309385042] [2019-11-23 20:45:10,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:45:10,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:45:10,901 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 18 proven. 28 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-23 20:45:10,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309385042] [2019-11-23 20:45:10,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1783366524] [2019-11-23 20:45:10,902 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:45:10,953 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-23 20:45:10,954 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:45:10,955 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-23 20:45:10,958 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:45:11,016 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:45:11,016 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:45:11,021 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:45:11,022 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:45:11,022 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-23 20:45:11,061 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 0 case distinctions, treesize of input 72 treesize of output 61 [2019-11-23 20:45:11,064 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:11,064 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:11,065 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:11,066 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:11,069 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:11,070 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:11,072 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:11,074 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 46 treesize of output 40 [2019-11-23 20:45:11,075 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 20:45:11,076 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:45:11,077 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:45:11,082 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:45:11,083 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:45:11,083 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:81, output treesize:22 [2019-11-23 20:45:11,114 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:11,115 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 26 treesize of output 25 [2019-11-23 20:45:11,115 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:45:11,125 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:45:11,126 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:45:11,126 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2019-11-23 20:45:11,165 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 0 case distinctions, treesize of input 81 treesize of output 68 [2019-11-23 20:45:11,168 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:11,168 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:11,169 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:11,170 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:11,171 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:11,172 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:11,174 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:11,177 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:11,178 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:11,179 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:11,181 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:11,182 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:11,183 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:11,185 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 53 treesize of output 52 [2019-11-23 20:45:11,185 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 20:45:11,190 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:45:11,191 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:45:11,200 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:45:11,201 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:45:11,201 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:90, output treesize:31 [2019-11-23 20:45:11,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:45:11,581 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 18 proven. 16 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-23 20:45:11,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:45:11,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 12] total 28 [2019-11-23 20:45:11,582 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903255506] [2019-11-23 20:45:11,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-11-23 20:45:11,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:45:11,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-11-23 20:45:11,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=637, Unknown=0, NotChecked=0, Total=756 [2019-11-23 20:45:11,583 INFO L87 Difference]: Start difference. First operand 58 states and 63 transitions. Second operand 28 states. [2019-11-23 20:45:16,261 WARN L192 SmtUtils]: Spent 585.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 33 [2019-11-23 20:45:16,999 WARN L192 SmtUtils]: Spent 712.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 33 [2019-11-23 20:45:18,080 WARN L192 SmtUtils]: Spent 473.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 34 [2019-11-23 20:45:20,165 WARN L192 SmtUtils]: Spent 692.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 31 [2019-11-23 20:45:20,353 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 28 [2019-11-23 20:45:20,780 WARN L192 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2019-11-23 20:45:20,954 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2019-11-23 20:45:22,124 WARN L192 SmtUtils]: Spent 761.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 31 [2019-11-23 20:45:22,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:45:22,719 INFO L93 Difference]: Finished difference Result 163 states and 178 transitions. [2019-11-23 20:45:22,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-11-23 20:45:22,720 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 57 [2019-11-23 20:45:22,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:45:22,722 INFO L225 Difference]: With dead ends: 163 [2019-11-23 20:45:22,722 INFO L226 Difference]: Without dead ends: 153 [2019-11-23 20:45:22,724 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 736 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=655, Invalid=2642, Unknown=9, NotChecked=0, Total=3306 [2019-11-23 20:45:22,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-11-23 20:45:22,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 58. [2019-11-23 20:45:22,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-11-23 20:45:22,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2019-11-23 20:45:22,732 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 57 [2019-11-23 20:45:22,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:45:22,732 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2019-11-23 20:45:22,732 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-11-23 20:45:22,733 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2019-11-23 20:45:22,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-23 20:45:22,733 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:45:22,734 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:45:22,934 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:45:22,935 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:45:22,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:45:22,935 INFO L82 PathProgramCache]: Analyzing trace with hash -992073131, now seen corresponding path program 5 times [2019-11-23 20:45:22,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:45:22,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711097194] [2019-11-23 20:45:22,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:45:22,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:45:23,725 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 38 [2019-11-23 20:45:24,377 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 41 [2019-11-23 20:45:24,664 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 6 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:45:24,665 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711097194] [2019-11-23 20:45:24,665 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1092300871] [2019-11-23 20:45:24,665 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:45:24,734 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-11-23 20:45:24,735 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:45:24,736 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 35 conjunts are in the unsatisfiable core [2019-11-23 20:45:24,739 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:45:24,837 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:45:24,837 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:45:24,846 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:45:24,847 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:45:24,847 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2019-11-23 20:45:24,911 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 0 case distinctions, treesize of input 51 treesize of output 40 [2019-11-23 20:45:24,912 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:24,913 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:24,914 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:24,916 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:24,919 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:24,920 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:24,921 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:24,923 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 31 treesize of output 31 [2019-11-23 20:45:24,924 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 20:45:24,925 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:45:24,925 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:45:24,930 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:45:24,930 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:45:24,930 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:57, output treesize:16 [2019-11-23 20:45:25,001 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:25,002 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 26 treesize of output 25 [2019-11-23 20:45:25,003 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:45:25,027 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:45:25,027 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:45:25,027 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2019-11-23 20:45:25,072 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 0 case distinctions, treesize of input 81 treesize of output 68 [2019-11-23 20:45:25,074 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:25,075 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:25,076 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:25,077 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:25,078 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:25,079 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:25,082 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:25,083 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:25,084 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:25,085 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:25,086 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:25,087 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:25,088 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:25,090 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 53 treesize of output 52 [2019-11-23 20:45:25,090 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 20:45:25,095 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:45:25,096 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:45:25,106 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:45:25,107 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:45:25,107 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:90, output treesize:31 [2019-11-23 20:45:25,159 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:25,160 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:25,161 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:25,162 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:45:25,162 INFO L377 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-11-23 20:45:25,163 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:45:25,176 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:45:25,177 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:45:25,177 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:37 [2019-11-23 20:45:25,226 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 0 case distinctions, treesize of input 87 treesize of output 72 [2019-11-23 20:45:25,234 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:25,235 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:25,235 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:25,236 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:25,237 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:25,237 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:25,240 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:25,241 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:25,242 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:25,245 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:25,246 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:25,247 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:25,248 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:25,249 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:25,250 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:25,251 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:25,252 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:25,253 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:25,255 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:25,277 INFO L343 Elim1Store]: treesize reduction 32, result has 43.9 percent of original size [2019-11-23 20:45:25,278 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 76 [2019-11-23 20:45:25,279 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 20:45:25,289 INFO L567 ElimStorePlain]: treesize reduction 30, result has 48.3 percent of original size [2019-11-23 20:45:25,290 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:45:25,310 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:45:25,311 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:45:25,311 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:96, output treesize:37 [2019-11-23 20:45:25,421 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:25,421 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:25,422 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:25,424 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:25,425 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:25,426 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:25,427 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:45:25,428 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 49 [2019-11-23 20:45:25,428 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:45:25,444 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:45:25,445 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:45:25,445 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:56, output treesize:52 [2019-11-23 20:45:25,515 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 0 case distinctions, treesize of input 99 treesize of output 82 [2019-11-23 20:45:25,517 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:25,518 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:25,519 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:25,520 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-23 20:45:25,521 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:25,522 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:25,524 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:25,525 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:25,526 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:25,527 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:25,528 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:25,529 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:25,531 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:25,534 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:25,536 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:25,537 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:25,544 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:25,545 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:25,545 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-23 20:45:25,546 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:25,546 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:25,547 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:25,548 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:25,549 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:25,551 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:25,554 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 67 [2019-11-23 20:45:25,555 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 20:45:25,570 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:45:25,571 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:45:25,585 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:45:25,586 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:45:25,586 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:111, output treesize:55 [2019-11-23 20:45:25,731 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:25,733 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:25,735 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:25,736 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:25,737 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:25,738 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:25,739 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:25,740 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:25,741 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:25,742 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:25,743 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:45:25,744 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 61 [2019-11-23 20:45:25,745 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:45:25,766 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:45:25,767 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:45:25,768 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:65, output treesize:61 [2019-11-23 20:45:25,865 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 0 case distinctions, treesize of input 108 treesize of output 89 [2019-11-23 20:45:25,868 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:25,870 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:25,872 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:25,874 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:25,875 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:25,876 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:25,877 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:25,878 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:25,879 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:25,879 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:25,880 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:25,881 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:25,882 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:25,883 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:25,884 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:25,886 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:25,887 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:25,890 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:25,891 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:25,895 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:25,898 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:25,901 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:25,902 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:25,904 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:25,905 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:25,908 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:25,909 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:25,910 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:25,911 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:25,912 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:25,912 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:25,913 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:25,914 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:25,915 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:25,916 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:25,918 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:25,919 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:25,920 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:25,922 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:25,985 INFO L343 Elim1Store]: treesize reduction 73, result has 43.0 percent of original size [2019-11-23 20:45:25,985 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 19 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 74 treesize of output 121 [2019-11-23 20:45:25,986 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 20:45:26,006 INFO L567 ElimStorePlain]: treesize reduction 66, result has 42.6 percent of original size [2019-11-23 20:45:26,007 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:45:26,022 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:45:26,023 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-11-23 20:45:26,023 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:120, output treesize:61 [2019-11-23 20:45:26,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:45:26,550 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 6 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:45:26,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:45:26,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22] total 43 [2019-11-23 20:45:26,551 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797740083] [2019-11-23 20:45:26,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-11-23 20:45:26,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:45:26,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-11-23 20:45:26,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1628, Unknown=0, NotChecked=0, Total=1806 [2019-11-23 20:45:26,552 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand 43 states. [2019-11-23 20:45:27,267 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 36 [2019-11-23 20:45:28,539 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 51 [2019-11-23 20:45:33,404 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 51 [2019-11-23 20:45:33,699 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 52 [2019-11-23 20:45:34,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:45:34,284 INFO L93 Difference]: Finished difference Result 185 states and 200 transitions. [2019-11-23 20:45:34,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-11-23 20:45:34,285 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 57 [2019-11-23 20:45:34,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:45:34,286 INFO L225 Difference]: With dead ends: 185 [2019-11-23 20:45:34,287 INFO L226 Difference]: Without dead ends: 146 [2019-11-23 20:45:34,291 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 38 SyntacticMatches, 11 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3261 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=1637, Invalid=10135, Unknown=0, NotChecked=0, Total=11772 [2019-11-23 20:45:34,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-11-23 20:45:34,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 92. [2019-11-23 20:45:34,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-11-23 20:45:34,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 98 transitions. [2019-11-23 20:45:34,303 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 98 transitions. Word has length 57 [2019-11-23 20:45:34,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:45:34,303 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 98 transitions. [2019-11-23 20:45:34,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-11-23 20:45:34,303 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 98 transitions. [2019-11-23 20:45:34,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-23 20:45:34,304 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:45:34,304 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:45:34,507 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:45:34,508 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:45:34,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:45:34,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1394407560, now seen corresponding path program 6 times [2019-11-23 20:45:34,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:45:34,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074886039] [2019-11-23 20:45:34,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:45:34,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:45:35,334 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 41 [2019-11-23 20:45:35,519 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 8 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:45:35,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074886039] [2019-11-23 20:45:35,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2039960715] [2019-11-23 20:45:35,520 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:45:35,567 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-11-23 20:45:35,567 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:45:35,568 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 30 conjunts are in the unsatisfiable core [2019-11-23 20:45:35,571 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:45:35,657 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:45:35,657 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:45:35,666 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:45:35,667 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:45:35,667 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2019-11-23 20:45:35,703 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 0 case distinctions, treesize of input 72 treesize of output 61 [2019-11-23 20:45:35,706 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:35,707 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:35,708 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:35,713 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:35,715 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:35,716 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:35,718 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:35,719 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 46 treesize of output 40 [2019-11-23 20:45:35,720 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 20:45:35,724 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:45:35,725 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:45:35,735 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:45:35,736 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:45:35,736 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:81, output treesize:22 [2019-11-23 20:45:35,800 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:35,801 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 26 treesize of output 25 [2019-11-23 20:45:35,802 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:45:35,813 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:45:35,813 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:45:35,814 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2019-11-23 20:45:35,858 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 0 case distinctions, treesize of input 81 treesize of output 68 [2019-11-23 20:45:35,860 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:35,861 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:35,862 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:35,862 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:35,863 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:35,864 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:35,866 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:35,869 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:35,870 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:35,878 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:35,879 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:35,879 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:35,880 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:35,882 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 53 treesize of output 52 [2019-11-23 20:45:35,883 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 20:45:35,886 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:45:35,886 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:45:35,897 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:45:35,898 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:45:35,898 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:90, output treesize:31 [2019-11-23 20:45:35,941 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:35,975 INFO L343 Elim1Store]: treesize reduction 32, result has 66.3 percent of original size [2019-11-23 20:45:35,976 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 3 case distinctions, treesize of input 38 treesize of output 81 [2019-11-23 20:45:35,976 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:45:36,009 INFO L567 ElimStorePlain]: treesize reduction 41, result has 51.2 percent of original size [2019-11-23 20:45:36,009 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:45:36,010 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:47, output treesize:43 [2019-11-23 20:45:36,060 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 0 case distinctions, treesize of input 93 treesize of output 78 [2019-11-23 20:45:36,062 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:36,070 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:36,234 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 36 [2019-11-23 20:45:36,235 INFO L343 Elim1Store]: treesize reduction 729, result has 9.3 percent of original size [2019-11-23 20:45:36,236 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 19 case distinctions, treesize of input 128 treesize of output 144 [2019-11-23 20:45:36,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:45:36,246 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:45:36,246 INFO L392 ElimStorePlain]: Different costs {5=[v_arrayElimArr_2], 9=[v_arrayElimArr_1]} [2019-11-23 20:45:36,449 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:45:36,450 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: This case should habe been handled by DER at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:192) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.(DerPreprocessor.java:95) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:291) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:256) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:256) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:246) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:201) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:333) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:171) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-23 20:45:36,454 INFO L168 Benchmark]: Toolchain (without parser) took 44131.68 ms. Allocated memory was 141.6 MB in the beginning and 461.4 MB in the end (delta: 319.8 MB). Free memory was 99.6 MB in the beginning and 88.7 MB in the end (delta: 10.9 MB). Peak memory consumption was 330.7 MB. Max. memory is 7.1 GB. [2019-11-23 20:45:36,455 INFO L168 Benchmark]: CDTParser took 0.52 ms. Allocated memory is still 141.6 MB. Free memory was 117.9 MB in the beginning and 117.7 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-11-23 20:45:36,456 INFO L168 Benchmark]: CACSL2BoogieTranslator took 428.27 ms. Allocated memory was 141.6 MB in the beginning and 198.7 MB in the end (delta: 57.1 MB). Free memory was 99.1 MB in the beginning and 176.4 MB in the end (delta: -77.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 7.1 GB. [2019-11-23 20:45:36,456 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.59 ms. Allocated memory is still 198.7 MB. Free memory was 176.4 MB in the beginning and 174.2 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. [2019-11-23 20:45:36,457 INFO L168 Benchmark]: Boogie Preprocessor took 29.48 ms. Allocated memory is still 198.7 MB. Free memory was 174.2 MB in the beginning and 172.8 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2019-11-23 20:45:36,457 INFO L168 Benchmark]: RCFGBuilder took 430.07 ms. Allocated memory is still 198.7 MB. Free memory was 172.8 MB in the beginning and 153.7 MB in the end (delta: 19.1 MB). Peak memory consumption was 19.1 MB. Max. memory is 7.1 GB. [2019-11-23 20:45:36,458 INFO L168 Benchmark]: TraceAbstraction took 43186.85 ms. Allocated memory was 198.7 MB in the beginning and 461.4 MB in the end (delta: 262.7 MB). Free memory was 153.7 MB in the beginning and 88.7 MB in the end (delta: 65.0 MB). Peak memory consumption was 327.7 MB. Max. memory is 7.1 GB. [2019-11-23 20:45:36,459 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.52 ms. Allocated memory is still 141.6 MB. Free memory was 117.9 MB in the beginning and 117.7 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 428.27 ms. Allocated memory was 141.6 MB in the beginning and 198.7 MB in the end (delta: 57.1 MB). Free memory was 99.1 MB in the beginning and 176.4 MB in the end (delta: -77.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 52.59 ms. Allocated memory is still 198.7 MB. Free memory was 176.4 MB in the beginning and 174.2 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 29.48 ms. Allocated memory is still 198.7 MB. Free memory was 174.2 MB in the beginning and 172.8 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 430.07 ms. Allocated memory is still 198.7 MB. Free memory was 172.8 MB in the beginning and 153.7 MB in the end (delta: 19.1 MB). Peak memory consumption was 19.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 43186.85 ms. Allocated memory was 198.7 MB in the beginning and 461.4 MB in the end (delta: 262.7 MB). Free memory was 153.7 MB in the beginning and 88.7 MB in the end (delta: 65.0 MB). Peak memory consumption was 327.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: This case should habe been handled by DER de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: This case should habe been handled by DER: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...