./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext/tree_of_cslls.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c3fed411 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-ext/tree_of_cslls.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e174a1790a7df4dcba920aa7097618d66c8703aa13de1aa6af1a2c5f7cb0971c --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-18 20:38:15,722 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-18 20:38:15,724 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-18 20:38:15,748 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-18 20:38:15,749 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-18 20:38:15,751 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-18 20:38:15,752 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-18 20:38:15,754 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-18 20:38:15,756 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-18 20:38:15,759 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-18 20:38:15,760 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-18 20:38:15,761 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-18 20:38:15,761 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-18 20:38:15,763 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-18 20:38:15,765 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-18 20:38:15,765 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-18 20:38:15,766 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-18 20:38:15,766 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-18 20:38:15,767 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-18 20:38:15,768 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-18 20:38:15,769 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-18 20:38:15,770 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-18 20:38:15,771 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-18 20:38:15,771 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-18 20:38:15,776 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-18 20:38:15,778 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-18 20:38:15,778 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-18 20:38:15,779 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-18 20:38:15,780 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-18 20:38:15,781 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-18 20:38:15,782 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-18 20:38:15,782 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-18 20:38:15,783 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-18 20:38:15,784 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-18 20:38:15,785 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-18 20:38:15,785 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-18 20:38:15,786 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-18 20:38:15,786 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-18 20:38:15,787 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-18 20:38:15,787 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-18 20:38:15,788 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-18 20:38:15,788 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-18 20:38:15,816 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-18 20:38:15,816 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-18 20:38:15,817 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-18 20:38:15,817 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-18 20:38:15,818 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-18 20:38:15,818 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-18 20:38:15,818 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-18 20:38:15,818 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-18 20:38:15,818 INFO L138 SettingsManager]: * Use SBE=true [2021-12-18 20:38:15,819 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-18 20:38:15,819 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-18 20:38:15,820 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-18 20:38:15,820 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-18 20:38:15,820 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-18 20:38:15,820 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-18 20:38:15,820 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-18 20:38:15,820 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-18 20:38:15,820 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-18 20:38:15,821 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-18 20:38:15,821 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-18 20:38:15,821 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-18 20:38:15,821 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-18 20:38:15,821 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-18 20:38:15,821 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-18 20:38:15,822 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-18 20:38:15,822 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-18 20:38:15,822 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-18 20:38:15,822 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-18 20:38:15,822 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-18 20:38:15,822 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-18 20:38:15,822 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-18 20:38:15,822 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e174a1790a7df4dcba920aa7097618d66c8703aa13de1aa6af1a2c5f7cb0971c [2021-12-18 20:38:16,042 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-18 20:38:16,076 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-18 20:38:16,079 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-18 20:38:16,080 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-18 20:38:16,081 INFO L275 PluginConnector]: CDTParser initialized [2021-12-18 20:38:16,082 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext/tree_of_cslls.i [2021-12-18 20:38:16,154 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c91a81d21/a7d0001d70ed41ac9031bac45bcfa756/FLAGc67f55f1e [2021-12-18 20:38:16,642 INFO L306 CDTParser]: Found 1 translation units. [2021-12-18 20:38:16,643 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext/tree_of_cslls.i [2021-12-18 20:38:16,649 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c91a81d21/a7d0001d70ed41ac9031bac45bcfa756/FLAGc67f55f1e [2021-12-18 20:38:17,005 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c91a81d21/a7d0001d70ed41ac9031bac45bcfa756 [2021-12-18 20:38:17,007 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-18 20:38:17,009 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-18 20:38:17,012 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-18 20:38:17,012 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-18 20:38:17,014 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-18 20:38:17,015 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 08:38:17" (1/1) ... [2021-12-18 20:38:17,016 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41758141 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:38:17, skipping insertion in model container [2021-12-18 20:38:17,016 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 08:38:17" (1/1) ... [2021-12-18 20:38:17,020 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-18 20:38:17,062 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-18 20:38:17,365 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-18 20:38:17,390 INFO L203 MainTranslator]: Completed pre-run [2021-12-18 20:38:17,439 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-18 20:38:17,458 INFO L208 MainTranslator]: Completed translation [2021-12-18 20:38:17,458 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:38:17 WrapperNode [2021-12-18 20:38:17,458 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-18 20:38:17,459 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-18 20:38:17,459 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-18 20:38:17,460 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-18 20:38:17,465 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:38:17" (1/1) ... [2021-12-18 20:38:17,487 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:38:17" (1/1) ... [2021-12-18 20:38:17,515 INFO L137 Inliner]: procedures = 123, calls = 63, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 216 [2021-12-18 20:38:17,516 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-18 20:38:17,518 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-18 20:38:17,518 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-18 20:38:17,518 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-18 20:38:17,525 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:38:17" (1/1) ... [2021-12-18 20:38:17,525 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:38:17" (1/1) ... [2021-12-18 20:38:17,528 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:38:17" (1/1) ... [2021-12-18 20:38:17,528 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:38:17" (1/1) ... [2021-12-18 20:38:17,535 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:38:17" (1/1) ... [2021-12-18 20:38:17,538 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:38:17" (1/1) ... [2021-12-18 20:38:17,539 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:38:17" (1/1) ... [2021-12-18 20:38:17,541 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-18 20:38:17,542 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-18 20:38:17,542 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-18 20:38:17,542 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-18 20:38:17,543 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:38:17" (1/1) ... [2021-12-18 20:38:17,557 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-18 20:38:17,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 20:38:17,578 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-18 20:38:17,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-18 20:38:17,602 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-18 20:38:17,603 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-18 20:38:17,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-18 20:38:17,603 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-18 20:38:17,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-18 20:38:17,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-18 20:38:17,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-18 20:38:17,603 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-18 20:38:17,698 INFO L236 CfgBuilder]: Building ICFG [2021-12-18 20:38:17,699 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-18 20:38:18,072 INFO L277 CfgBuilder]: Performing block encoding [2021-12-18 20:38:18,077 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-18 20:38:18,077 INFO L301 CfgBuilder]: Removed 7 assume(true) statements. [2021-12-18 20:38:18,079 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 08:38:18 BoogieIcfgContainer [2021-12-18 20:38:18,079 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-18 20:38:18,080 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-18 20:38:18,080 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-18 20:38:18,082 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-18 20:38:18,082 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 08:38:17" (1/3) ... [2021-12-18 20:38:18,083 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2971e3e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 08:38:18, skipping insertion in model container [2021-12-18 20:38:18,083 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:38:17" (2/3) ... [2021-12-18 20:38:18,083 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2971e3e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 08:38:18, skipping insertion in model container [2021-12-18 20:38:18,083 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 08:38:18" (3/3) ... [2021-12-18 20:38:18,084 INFO L111 eAbstractionObserver]: Analyzing ICFG tree_of_cslls.i [2021-12-18 20:38:18,087 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-18 20:38:18,087 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 104 error locations. [2021-12-18 20:38:18,122 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-18 20:38:18,126 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-18 20:38:18,127 INFO L340 AbstractCegarLoop]: Starting to check reachability of 104 error locations. [2021-12-18 20:38:18,137 INFO L276 IsEmpty]: Start isEmpty. Operand has 210 states, 105 states have (on average 2.219047619047619) internal successors, (233), 209 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:38:18,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-18 20:38:18,141 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:38:18,141 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-18 20:38:18,142 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-18 20:38:18,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:38:18,145 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2021-12-18 20:38:18,151 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:38:18,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316861767] [2021-12-18 20:38:18,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:38:18,159 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:38:18,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:38:18,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:38:18,300 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:38:18,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316861767] [2021-12-18 20:38:18,301 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316861767] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:38:18,301 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:38:18,301 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-18 20:38:18,303 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866524794] [2021-12-18 20:38:18,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:38:18,306 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 20:38:18,306 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:38:18,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 20:38:18,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 20:38:18,326 INFO L87 Difference]: Start difference. First operand has 210 states, 105 states have (on average 2.219047619047619) internal successors, (233), 209 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:38:18,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:38:18,532 INFO L93 Difference]: Finished difference Result 282 states and 304 transitions. [2021-12-18 20:38:18,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 20:38:18,534 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-12-18 20:38:18,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:38:18,541 INFO L225 Difference]: With dead ends: 282 [2021-12-18 20:38:18,541 INFO L226 Difference]: Without dead ends: 278 [2021-12-18 20:38:18,542 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 20:38:18,544 INFO L933 BasicCegarLoop]: 151 mSDtfsCounter, 200 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 20:38:18,545 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [200 Valid, 199 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 20:38:18,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2021-12-18 20:38:18,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 199. [2021-12-18 20:38:18,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 104 states have (on average 2.0673076923076925) internal successors, (215), 198 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:38:18,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 215 transitions. [2021-12-18 20:38:18,571 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 215 transitions. Word has length 3 [2021-12-18 20:38:18,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:38:18,571 INFO L470 AbstractCegarLoop]: Abstraction has 199 states and 215 transitions. [2021-12-18 20:38:18,571 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:38:18,572 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 215 transitions. [2021-12-18 20:38:18,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-18 20:38:18,572 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:38:18,572 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-18 20:38:18,572 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-18 20:38:18,572 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-18 20:38:18,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:38:18,573 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2021-12-18 20:38:18,573 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:38:18,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984546694] [2021-12-18 20:38:18,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:38:18,574 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:38:18,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:38:18,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:38:18,598 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:38:18,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984546694] [2021-12-18 20:38:18,599 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984546694] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:38:18,599 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:38:18,599 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-18 20:38:18,599 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645572860] [2021-12-18 20:38:18,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:38:18,600 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 20:38:18,600 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:38:18,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 20:38:18,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 20:38:18,601 INFO L87 Difference]: Start difference. First operand 199 states and 215 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:38:18,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:38:18,697 INFO L93 Difference]: Finished difference Result 197 states and 213 transitions. [2021-12-18 20:38:18,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 20:38:18,697 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-12-18 20:38:18,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:38:18,698 INFO L225 Difference]: With dead ends: 197 [2021-12-18 20:38:18,698 INFO L226 Difference]: Without dead ends: 197 [2021-12-18 20:38:18,698 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 20:38:18,699 INFO L933 BasicCegarLoop]: 210 mSDtfsCounter, 2 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 20:38:18,700 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 319 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 20:38:18,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2021-12-18 20:38:18,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2021-12-18 20:38:18,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 104 states have (on average 2.048076923076923) internal successors, (213), 196 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:38:18,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 213 transitions. [2021-12-18 20:38:18,706 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 213 transitions. Word has length 3 [2021-12-18 20:38:18,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:38:18,706 INFO L470 AbstractCegarLoop]: Abstraction has 197 states and 213 transitions. [2021-12-18 20:38:18,706 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:38:18,706 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 213 transitions. [2021-12-18 20:38:18,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-18 20:38:18,707 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:38:18,707 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-18 20:38:18,707 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-18 20:38:18,707 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-18 20:38:18,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:38:18,708 INFO L85 PathProgramCache]: Analyzing trace with hash 889446153, now seen corresponding path program 1 times [2021-12-18 20:38:18,708 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:38:18,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496923958] [2021-12-18 20:38:18,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:38:18,709 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:38:18,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:38:18,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:38:18,787 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:38:18,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496923958] [2021-12-18 20:38:18,788 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496923958] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:38:18,788 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:38:18,788 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-18 20:38:18,788 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057491971] [2021-12-18 20:38:18,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:38:18,789 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-18 20:38:18,790 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:38:18,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-18 20:38:18,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-18 20:38:18,791 INFO L87 Difference]: Start difference. First operand 197 states and 213 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:38:19,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:38:19,080 INFO L93 Difference]: Finished difference Result 354 states and 382 transitions. [2021-12-18 20:38:19,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-18 20:38:19,081 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-12-18 20:38:19,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:38:19,083 INFO L225 Difference]: With dead ends: 354 [2021-12-18 20:38:19,083 INFO L226 Difference]: Without dead ends: 354 [2021-12-18 20:38:19,084 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-18 20:38:19,088 INFO L933 BasicCegarLoop]: 118 mSDtfsCounter, 279 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-18 20:38:19,089 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [279 Valid, 232 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-18 20:38:19,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2021-12-18 20:38:19,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 190. [2021-12-18 20:38:19,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 104 states have (on average 1.9807692307692308) internal successors, (206), 189 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:38:19,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 206 transitions. [2021-12-18 20:38:19,102 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 206 transitions. Word has length 6 [2021-12-18 20:38:19,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:38:19,103 INFO L470 AbstractCegarLoop]: Abstraction has 190 states and 206 transitions. [2021-12-18 20:38:19,103 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:38:19,103 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 206 transitions. [2021-12-18 20:38:19,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-18 20:38:19,104 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:38:19,104 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:38:19,104 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-18 20:38:19,104 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-18 20:38:19,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:38:19,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1113924364, now seen corresponding path program 1 times [2021-12-18 20:38:19,105 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:38:19,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651131721] [2021-12-18 20:38:19,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:38:19,105 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:38:19,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:38:19,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:38:19,150 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:38:19,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651131721] [2021-12-18 20:38:19,150 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651131721] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:38:19,150 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:38:19,150 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-18 20:38:19,150 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664321826] [2021-12-18 20:38:19,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:38:19,151 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-18 20:38:19,151 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:38:19,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-18 20:38:19,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-18 20:38:19,152 INFO L87 Difference]: Start difference. First operand 190 states and 206 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:38:19,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:38:19,310 INFO L93 Difference]: Finished difference Result 189 states and 205 transitions. [2021-12-18 20:38:19,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 20:38:19,310 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-12-18 20:38:19,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:38:19,311 INFO L225 Difference]: With dead ends: 189 [2021-12-18 20:38:19,311 INFO L226 Difference]: Without dead ends: 189 [2021-12-18 20:38:19,311 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-18 20:38:19,312 INFO L933 BasicCegarLoop]: 200 mSDtfsCounter, 5 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 20:38:19,312 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 508 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 20:38:19,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2021-12-18 20:38:19,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2021-12-18 20:38:19,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 104 states have (on average 1.9711538461538463) internal successors, (205), 188 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:38:19,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 205 transitions. [2021-12-18 20:38:19,316 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 205 transitions. Word has length 10 [2021-12-18 20:38:19,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:38:19,316 INFO L470 AbstractCegarLoop]: Abstraction has 189 states and 205 transitions. [2021-12-18 20:38:19,316 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:38:19,316 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 205 transitions. [2021-12-18 20:38:19,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-18 20:38:19,316 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:38:19,316 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:38:19,316 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-18 20:38:19,316 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-18 20:38:19,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:38:19,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1113924365, now seen corresponding path program 1 times [2021-12-18 20:38:19,317 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:38:19,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147107764] [2021-12-18 20:38:19,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:38:19,317 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:38:19,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:38:19,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:38:19,389 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:38:19,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147107764] [2021-12-18 20:38:19,389 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147107764] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:38:19,390 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:38:19,390 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-18 20:38:19,390 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968025050] [2021-12-18 20:38:19,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:38:19,390 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-18 20:38:19,391 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:38:19,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-18 20:38:19,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-18 20:38:19,392 INFO L87 Difference]: Start difference. First operand 189 states and 205 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:38:19,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:38:19,567 INFO L93 Difference]: Finished difference Result 188 states and 204 transitions. [2021-12-18 20:38:19,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 20:38:19,568 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-12-18 20:38:19,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:38:19,568 INFO L225 Difference]: With dead ends: 188 [2021-12-18 20:38:19,568 INFO L226 Difference]: Without dead ends: 188 [2021-12-18 20:38:19,569 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-18 20:38:19,569 INFO L933 BasicCegarLoop]: 200 mSDtfsCounter, 3 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 20:38:19,569 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 529 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 20:38:19,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2021-12-18 20:38:19,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2021-12-18 20:38:19,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 104 states have (on average 1.9615384615384615) internal successors, (204), 187 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:38:19,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 204 transitions. [2021-12-18 20:38:19,573 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 204 transitions. Word has length 10 [2021-12-18 20:38:19,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:38:19,573 INFO L470 AbstractCegarLoop]: Abstraction has 188 states and 204 transitions. [2021-12-18 20:38:19,573 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:38:19,573 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 204 transitions. [2021-12-18 20:38:19,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-18 20:38:19,573 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:38:19,573 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:38:19,573 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-18 20:38:19,574 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-18 20:38:19,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:38:19,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1114596085, now seen corresponding path program 1 times [2021-12-18 20:38:19,574 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:38:19,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597750018] [2021-12-18 20:38:19,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:38:19,574 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:38:19,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:38:19,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:38:19,655 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:38:19,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597750018] [2021-12-18 20:38:19,655 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597750018] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:38:19,655 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:38:19,656 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-18 20:38:19,656 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516385918] [2021-12-18 20:38:19,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:38:19,656 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-18 20:38:19,656 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:38:19,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-18 20:38:19,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-18 20:38:19,657 INFO L87 Difference]: Start difference. First operand 188 states and 204 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:38:20,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:38:20,054 INFO L93 Difference]: Finished difference Result 353 states and 389 transitions. [2021-12-18 20:38:20,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-18 20:38:20,055 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-12-18 20:38:20,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:38:20,056 INFO L225 Difference]: With dead ends: 353 [2021-12-18 20:38:20,056 INFO L226 Difference]: Without dead ends: 353 [2021-12-18 20:38:20,056 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2021-12-18 20:38:20,057 INFO L933 BasicCegarLoop]: 148 mSDtfsCounter, 467 mSDsluCounter, 705 mSDsCounter, 0 mSdLazyCounter, 706 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 853 SdHoareTripleChecker+Invalid, 730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-18 20:38:20,057 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [467 Valid, 853 Invalid, 730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 706 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-18 20:38:20,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2021-12-18 20:38:20,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 192. [2021-12-18 20:38:20,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 108 states have (on average 1.9444444444444444) internal successors, (210), 191 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:38:20,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 210 transitions. [2021-12-18 20:38:20,061 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 210 transitions. Word has length 15 [2021-12-18 20:38:20,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:38:20,061 INFO L470 AbstractCegarLoop]: Abstraction has 192 states and 210 transitions. [2021-12-18 20:38:20,061 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:38:20,061 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 210 transitions. [2021-12-18 20:38:20,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-18 20:38:20,061 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:38:20,061 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:38:20,061 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-18 20:38:20,061 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-18 20:38:20,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:38:20,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1114596086, now seen corresponding path program 1 times [2021-12-18 20:38:20,062 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:38:20,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650850077] [2021-12-18 20:38:20,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:38:20,062 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:38:20,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:38:20,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:38:20,158 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:38:20,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650850077] [2021-12-18 20:38:20,159 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650850077] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:38:20,159 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:38:20,159 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-18 20:38:20,159 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124216406] [2021-12-18 20:38:20,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:38:20,160 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-18 20:38:20,160 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:38:20,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-18 20:38:20,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-18 20:38:20,160 INFO L87 Difference]: Start difference. First operand 192 states and 210 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:38:20,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:38:20,552 INFO L93 Difference]: Finished difference Result 347 states and 383 transitions. [2021-12-18 20:38:20,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-18 20:38:20,553 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-12-18 20:38:20,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:38:20,554 INFO L225 Difference]: With dead ends: 347 [2021-12-18 20:38:20,554 INFO L226 Difference]: Without dead ends: 347 [2021-12-18 20:38:20,554 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2021-12-18 20:38:20,554 INFO L933 BasicCegarLoop]: 134 mSDtfsCounter, 452 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 674 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 452 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-18 20:38:20,554 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [452 Valid, 490 Invalid, 692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 674 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-18 20:38:20,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2021-12-18 20:38:20,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 192. [2021-12-18 20:38:20,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 108 states have (on average 1.9351851851851851) internal successors, (209), 191 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:38:20,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 209 transitions. [2021-12-18 20:38:20,571 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 209 transitions. Word has length 15 [2021-12-18 20:38:20,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:38:20,572 INFO L470 AbstractCegarLoop]: Abstraction has 192 states and 209 transitions. [2021-12-18 20:38:20,572 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:38:20,572 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 209 transitions. [2021-12-18 20:38:20,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-18 20:38:20,572 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:38:20,572 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:38:20,572 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-18 20:38:20,572 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-18 20:38:20,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:38:20,573 INFO L85 PathProgramCache]: Analyzing trace with hash 192740277, now seen corresponding path program 1 times [2021-12-18 20:38:20,573 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:38:20,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634914477] [2021-12-18 20:38:20,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:38:20,573 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:38:20,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:38:20,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:38:20,600 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:38:20,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634914477] [2021-12-18 20:38:20,600 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634914477] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:38:20,600 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:38:20,600 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-18 20:38:20,601 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691666719] [2021-12-18 20:38:20,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:38:20,601 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 20:38:20,601 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:38:20,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 20:38:20,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 20:38:20,602 INFO L87 Difference]: Start difference. First operand 192 states and 209 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:38:20,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:38:20,752 INFO L93 Difference]: Finished difference Result 316 states and 348 transitions. [2021-12-18 20:38:20,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 20:38:20,753 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-12-18 20:38:20,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:38:20,754 INFO L225 Difference]: With dead ends: 316 [2021-12-18 20:38:20,754 INFO L226 Difference]: Without dead ends: 316 [2021-12-18 20:38:20,754 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 20:38:20,754 INFO L933 BasicCegarLoop]: 261 mSDtfsCounter, 168 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 20:38:20,754 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [168 Valid, 348 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 20:38:20,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2021-12-18 20:38:20,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 189. [2021-12-18 20:38:20,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 108 states have (on average 1.9074074074074074) internal successors, (206), 188 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:38:20,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 206 transitions. [2021-12-18 20:38:20,762 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 206 transitions. Word has length 16 [2021-12-18 20:38:20,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:38:20,762 INFO L470 AbstractCegarLoop]: Abstraction has 189 states and 206 transitions. [2021-12-18 20:38:20,763 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:38:20,763 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 206 transitions. [2021-12-18 20:38:20,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-18 20:38:20,763 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:38:20,763 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:38:20,763 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-18 20:38:20,764 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-18 20:38:20,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:38:20,764 INFO L85 PathProgramCache]: Analyzing trace with hash 192740278, now seen corresponding path program 1 times [2021-12-18 20:38:20,764 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:38:20,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895350035] [2021-12-18 20:38:20,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:38:20,764 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:38:20,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:38:20,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:38:20,811 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:38:20,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895350035] [2021-12-18 20:38:20,811 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895350035] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:38:20,811 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:38:20,812 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-18 20:38:20,812 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553218216] [2021-12-18 20:38:20,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:38:20,812 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 20:38:20,813 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:38:20,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 20:38:20,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 20:38:20,813 INFO L87 Difference]: Start difference. First operand 189 states and 206 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:38:20,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:38:20,954 INFO L93 Difference]: Finished difference Result 293 states and 325 transitions. [2021-12-18 20:38:20,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 20:38:20,954 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-12-18 20:38:20,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:38:20,955 INFO L225 Difference]: With dead ends: 293 [2021-12-18 20:38:20,955 INFO L226 Difference]: Without dead ends: 293 [2021-12-18 20:38:20,955 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 20:38:20,956 INFO L933 BasicCegarLoop]: 265 mSDtfsCounter, 139 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 20:38:20,956 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 359 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 20:38:20,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2021-12-18 20:38:20,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 187. [2021-12-18 20:38:20,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 108 states have (on average 1.8888888888888888) internal successors, (204), 186 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:38:20,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 204 transitions. [2021-12-18 20:38:20,959 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 204 transitions. Word has length 16 [2021-12-18 20:38:20,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:38:20,959 INFO L470 AbstractCegarLoop]: Abstraction has 187 states and 204 transitions. [2021-12-18 20:38:20,959 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:38:20,959 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 204 transitions. [2021-12-18 20:38:20,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-18 20:38:20,959 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:38:20,959 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:38:20,959 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-18 20:38:20,959 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-18 20:38:20,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:38:20,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1678809590, now seen corresponding path program 1 times [2021-12-18 20:38:20,960 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:38:20,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520326399] [2021-12-18 20:38:20,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:38:20,960 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:38:20,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:38:21,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:38:21,010 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:38:21,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520326399] [2021-12-18 20:38:21,010 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520326399] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:38:21,010 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:38:21,011 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-18 20:38:21,011 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417635466] [2021-12-18 20:38:21,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:38:21,011 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-18 20:38:21,011 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:38:21,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-18 20:38:21,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-18 20:38:21,012 INFO L87 Difference]: Start difference. First operand 187 states and 204 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:38:21,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:38:21,170 INFO L93 Difference]: Finished difference Result 254 states and 278 transitions. [2021-12-18 20:38:21,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-18 20:38:21,171 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-12-18 20:38:21,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:38:21,171 INFO L225 Difference]: With dead ends: 254 [2021-12-18 20:38:21,171 INFO L226 Difference]: Without dead ends: 254 [2021-12-18 20:38:21,172 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-18 20:38:21,172 INFO L933 BasicCegarLoop]: 104 mSDtfsCounter, 327 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 20:38:21,172 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [327 Valid, 153 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 20:38:21,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2021-12-18 20:38:21,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 176. [2021-12-18 20:38:21,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 112 states have (on average 1.7589285714285714) internal successors, (197), 175 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:38:21,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 197 transitions. [2021-12-18 20:38:21,175 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 197 transitions. Word has length 17 [2021-12-18 20:38:21,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:38:21,175 INFO L470 AbstractCegarLoop]: Abstraction has 176 states and 197 transitions. [2021-12-18 20:38:21,175 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:38:21,175 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 197 transitions. [2021-12-18 20:38:21,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-18 20:38:21,175 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:38:21,175 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:38:21,175 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-18 20:38:21,176 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-18 20:38:21,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:38:21,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1678809591, now seen corresponding path program 1 times [2021-12-18 20:38:21,176 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:38:21,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514397942] [2021-12-18 20:38:21,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:38:21,176 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:38:21,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:38:21,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:38:21,241 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:38:21,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514397942] [2021-12-18 20:38:21,242 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514397942] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:38:21,242 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:38:21,242 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-18 20:38:21,242 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58283256] [2021-12-18 20:38:21,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:38:21,242 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-18 20:38:21,243 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:38:21,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-18 20:38:21,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-18 20:38:21,243 INFO L87 Difference]: Start difference. First operand 176 states and 197 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:38:21,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:38:21,493 INFO L93 Difference]: Finished difference Result 438 states and 492 transitions. [2021-12-18 20:38:21,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-18 20:38:21,494 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-12-18 20:38:21,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:38:21,495 INFO L225 Difference]: With dead ends: 438 [2021-12-18 20:38:21,495 INFO L226 Difference]: Without dead ends: 438 [2021-12-18 20:38:21,495 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-12-18 20:38:21,496 INFO L933 BasicCegarLoop]: 124 mSDtfsCounter, 712 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 712 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 20:38:21,496 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [712 Valid, 293 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 20:38:21,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2021-12-18 20:38:21,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 318. [2021-12-18 20:38:21,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 254 states have (on average 1.7598425196850394) internal successors, (447), 317 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:38:21,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 447 transitions. [2021-12-18 20:38:21,501 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 447 transitions. Word has length 17 [2021-12-18 20:38:21,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:38:21,501 INFO L470 AbstractCegarLoop]: Abstraction has 318 states and 447 transitions. [2021-12-18 20:38:21,501 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:38:21,501 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 447 transitions. [2021-12-18 20:38:21,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-18 20:38:21,501 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:38:21,501 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:38:21,501 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-18 20:38:21,501 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-18 20:38:21,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:38:21,502 INFO L85 PathProgramCache]: Analyzing trace with hash -445669701, now seen corresponding path program 1 times [2021-12-18 20:38:21,502 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:38:21,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379770370] [2021-12-18 20:38:21,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:38:21,502 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:38:21,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:38:21,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:38:21,588 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:38:21,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379770370] [2021-12-18 20:38:21,588 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379770370] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:38:21,588 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:38:21,588 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-18 20:38:21,589 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927369471] [2021-12-18 20:38:21,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:38:21,589 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-18 20:38:21,589 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:38:21,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-18 20:38:21,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-18 20:38:21,590 INFO L87 Difference]: Start difference. First operand 318 states and 447 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:38:21,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:38:21,978 INFO L93 Difference]: Finished difference Result 784 states and 1126 transitions. [2021-12-18 20:38:21,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-18 20:38:21,979 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-12-18 20:38:21,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:38:21,981 INFO L225 Difference]: With dead ends: 784 [2021-12-18 20:38:21,981 INFO L226 Difference]: Without dead ends: 784 [2021-12-18 20:38:21,981 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2021-12-18 20:38:21,981 INFO L933 BasicCegarLoop]: 224 mSDtfsCounter, 368 mSDsluCounter, 805 mSDsCounter, 0 mSdLazyCounter, 732 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 1029 SdHoareTripleChecker+Invalid, 752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-18 20:38:21,981 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [368 Valid, 1029 Invalid, 752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 732 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-18 20:38:21,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2021-12-18 20:38:21,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 317. [2021-12-18 20:38:21,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 254 states have (on average 1.7559055118110236) internal successors, (446), 316 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:38:21,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 446 transitions. [2021-12-18 20:38:21,988 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 446 transitions. Word has length 19 [2021-12-18 20:38:21,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:38:21,988 INFO L470 AbstractCegarLoop]: Abstraction has 317 states and 446 transitions. [2021-12-18 20:38:21,989 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:38:21,989 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 446 transitions. [2021-12-18 20:38:21,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-18 20:38:21,989 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:38:21,989 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:38:21,990 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-18 20:38:21,990 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-18 20:38:21,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:38:21,990 INFO L85 PathProgramCache]: Analyzing trace with hash -445669700, now seen corresponding path program 1 times [2021-12-18 20:38:21,990 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:38:21,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28588726] [2021-12-18 20:38:21,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:38:21,992 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:38:22,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:38:22,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:38:22,150 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:38:22,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28588726] [2021-12-18 20:38:22,150 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28588726] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:38:22,150 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:38:22,150 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-18 20:38:22,150 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845671510] [2021-12-18 20:38:22,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:38:22,151 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-18 20:38:22,151 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:38:22,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-18 20:38:22,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-12-18 20:38:22,151 INFO L87 Difference]: Start difference. First operand 317 states and 446 transitions. Second operand has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:38:22,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:38:22,682 INFO L93 Difference]: Finished difference Result 603 states and 842 transitions. [2021-12-18 20:38:22,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-18 20:38:22,683 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-12-18 20:38:22,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:38:22,685 INFO L225 Difference]: With dead ends: 603 [2021-12-18 20:38:22,685 INFO L226 Difference]: Without dead ends: 603 [2021-12-18 20:38:22,685 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=355, Unknown=0, NotChecked=0, Total=462 [2021-12-18 20:38:22,700 INFO L933 BasicCegarLoop]: 142 mSDtfsCounter, 389 mSDsluCounter, 815 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 957 SdHoareTripleChecker+Invalid, 931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-18 20:38:22,700 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [389 Valid, 957 Invalid, 931 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-18 20:38:22,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2021-12-18 20:38:22,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 321. [2021-12-18 20:38:22,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 258 states have (on average 1.744186046511628) internal successors, (450), 320 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:38:22,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 450 transitions. [2021-12-18 20:38:22,706 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 450 transitions. Word has length 19 [2021-12-18 20:38:22,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:38:22,707 INFO L470 AbstractCegarLoop]: Abstraction has 321 states and 450 transitions. [2021-12-18 20:38:22,707 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:38:22,707 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 450 transitions. [2021-12-18 20:38:22,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-18 20:38:22,710 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:38:22,710 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:38:22,710 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-18 20:38:22,710 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr103ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-18 20:38:22,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:38:22,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1571609538, now seen corresponding path program 1 times [2021-12-18 20:38:22,711 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:38:22,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837805580] [2021-12-18 20:38:22,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:38:22,711 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:38:22,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:38:22,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:38:22,729 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:38:22,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837805580] [2021-12-18 20:38:22,729 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837805580] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:38:22,729 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:38:22,729 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-18 20:38:22,729 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388570636] [2021-12-18 20:38:22,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:38:22,730 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 20:38:22,730 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:38:22,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 20:38:22,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 20:38:22,730 INFO L87 Difference]: Start difference. First operand 321 states and 450 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:38:22,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:38:22,743 INFO L93 Difference]: Finished difference Result 395 states and 528 transitions. [2021-12-18 20:38:22,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 20:38:22,743 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-12-18 20:38:22,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:38:22,745 INFO L225 Difference]: With dead ends: 395 [2021-12-18 20:38:22,745 INFO L226 Difference]: Without dead ends: 395 [2021-12-18 20:38:22,745 INFO L932 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 [2021-12-18 20:38:22,745 INFO L933 BasicCegarLoop]: 216 mSDtfsCounter, 163 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 20:38:22,746 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 296 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 20:38:22,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2021-12-18 20:38:22,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 361. [2021-12-18 20:38:22,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 298 states have (on average 1.7718120805369129) internal successors, (528), 360 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:38:22,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 528 transitions. [2021-12-18 20:38:22,750 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 528 transitions. Word has length 19 [2021-12-18 20:38:22,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:38:22,750 INFO L470 AbstractCegarLoop]: Abstraction has 361 states and 528 transitions. [2021-12-18 20:38:22,750 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:38:22,750 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 528 transitions. [2021-12-18 20:38:22,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-18 20:38:22,751 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:38:22,751 INFO L514 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] [2021-12-18 20:38:22,751 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-18 20:38:22,751 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-18 20:38:22,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:38:22,752 INFO L85 PathProgramCache]: Analyzing trace with hash -727311539, now seen corresponding path program 1 times [2021-12-18 20:38:22,752 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:38:22,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254574802] [2021-12-18 20:38:22,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:38:22,752 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:38:22,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:38:22,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:38:22,772 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:38:22,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254574802] [2021-12-18 20:38:22,772 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254574802] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:38:22,772 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:38:22,772 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-18 20:38:22,772 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395584801] [2021-12-18 20:38:22,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:38:22,772 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 20:38:22,773 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:38:22,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 20:38:22,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 20:38:22,773 INFO L87 Difference]: Start difference. First operand 361 states and 528 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:38:22,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:38:22,779 INFO L93 Difference]: Finished difference Result 365 states and 532 transitions. [2021-12-18 20:38:22,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 20:38:22,779 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-12-18 20:38:22,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:38:22,781 INFO L225 Difference]: With dead ends: 365 [2021-12-18 20:38:22,781 INFO L226 Difference]: Without dead ends: 365 [2021-12-18 20:38:22,781 INFO L932 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 [2021-12-18 20:38:22,781 INFO L933 BasicCegarLoop]: 182 mSDtfsCounter, 0 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 20:38:22,781 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 358 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 20:38:22,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2021-12-18 20:38:22,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 365. [2021-12-18 20:38:22,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 302 states have (on average 1.7615894039735098) internal successors, (532), 364 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:38:22,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 532 transitions. [2021-12-18 20:38:22,786 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 532 transitions. Word has length 23 [2021-12-18 20:38:22,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:38:22,786 INFO L470 AbstractCegarLoop]: Abstraction has 365 states and 532 transitions. [2021-12-18 20:38:22,786 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:38:22,786 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 532 transitions. [2021-12-18 20:38:22,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-18 20:38:22,787 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:38:22,787 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:38:22,787 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-18 20:38:22,787 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-18 20:38:22,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:38:22,787 INFO L85 PathProgramCache]: Analyzing trace with hash 97933121, now seen corresponding path program 1 times [2021-12-18 20:38:22,787 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:38:22,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538971565] [2021-12-18 20:38:22,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:38:22,788 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:38:22,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:38:22,905 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:38:22,905 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:38:22,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538971565] [2021-12-18 20:38:22,905 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538971565] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 20:38:22,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [842478639] [2021-12-18 20:38:22,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:38:22,906 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:38:22,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 20:38:22,907 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 20:38:22,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-18 20:38:23,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:38:23,002 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 28 conjunts are in the unsatisfiable core [2021-12-18 20:38:23,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:38:23,033 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2021-12-18 20:38:23,048 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 20:38:23,049 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-18 20:38:23,068 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:38:23,156 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 20:38:23,157 INFO L388 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2021-12-18 20:38:23,176 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 20:38:23,177 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-18 20:38:23,205 INFO L388 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 17 treesize of output 19 [2021-12-18 20:38:23,246 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 20:38:23,246 INFO L388 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2021-12-18 20:38:23,302 INFO L354 Elim1Store]: treesize reduction 36, result has 37.9 percent of original size [2021-12-18 20:38:23,302 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 33 [2021-12-18 20:38:23,349 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2021-12-18 20:38:23,358 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:38:23,358 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 20:38:23,470 INFO L354 Elim1Store]: treesize reduction 10, result has 76.7 percent of original size [2021-12-18 20:38:23,470 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 74 [2021-12-18 20:38:23,500 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_462 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem11#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_462) |c_ULTIMATE.start_main_~tree~0#1.base|) (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8)))) is different from false [2021-12-18 20:38:23,505 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_462 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1))) (= .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_462) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1))))) is different from false [2021-12-18 20:38:23,514 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_461 (Array Int Int)) (v_ArrVal_462 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_461)) (.cse2 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_462) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2))))) is different from false [2021-12-18 20:38:24,045 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_22| Int) (v_ArrVal_461 (Array Int Int)) (v_ArrVal_460 (Array Int Int)) (v_ArrVal_462 (Array Int Int))) (or (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_460) |v_ULTIMATE.start_main_~tmpList~0#1.base_22| v_ArrVal_461)) (.cse2 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_462) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2)))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_22|))))) is different from false [2021-12-18 20:38:24,102 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:38:24,102 INFO L388 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 53 [2021-12-18 20:38:24,104 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:38:24,106 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 244 treesize of output 190 [2021-12-18 20:38:24,112 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 109 [2021-12-18 20:38:24,115 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 93 [2021-12-18 20:38:24,120 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-18 20:38:24,121 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2021-12-18 20:38:24,183 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2021-12-18 20:38:24,184 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [842478639] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 20:38:24,184 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 20:38:24,184 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 12] total 25 [2021-12-18 20:38:24,184 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012141479] [2021-12-18 20:38:24,184 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 20:38:24,184 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-12-18 20:38:24,185 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:38:24,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-12-18 20:38:24,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=390, Unknown=10, NotChecked=172, Total=650 [2021-12-18 20:38:24,185 INFO L87 Difference]: Start difference. First operand 365 states and 532 transitions. Second operand has 26 states, 25 states have (on average 2.72) internal successors, (68), 26 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:38:25,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:38:25,144 INFO L93 Difference]: Finished difference Result 955 states and 1346 transitions. [2021-12-18 20:38:25,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-18 20:38:25,144 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.72) internal successors, (68), 26 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-12-18 20:38:25,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:38:25,147 INFO L225 Difference]: With dead ends: 955 [2021-12-18 20:38:25,147 INFO L226 Difference]: Without dead ends: 955 [2021-12-18 20:38:25,147 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 30 SyntacticMatches, 9 SemanticMatches, 34 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=213, Invalid=785, Unknown=10, NotChecked=252, Total=1260 [2021-12-18 20:38:25,148 INFO L933 BasicCegarLoop]: 225 mSDtfsCounter, 941 mSDsluCounter, 2755 mSDsCounter, 0 mSdLazyCounter, 1433 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 941 SdHoareTripleChecker+Valid, 2980 SdHoareTripleChecker+Invalid, 3329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1840 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-18 20:38:25,148 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [941 Valid, 2980 Invalid, 3329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1433 Invalid, 0 Unknown, 1840 Unchecked, 0.7s Time] [2021-12-18 20:38:25,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2021-12-18 20:38:25,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 364. [2021-12-18 20:38:25,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 302 states have (on average 1.7582781456953642) internal successors, (531), 363 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:38:25,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 531 transitions. [2021-12-18 20:38:25,154 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 531 transitions. Word has length 24 [2021-12-18 20:38:25,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:38:25,154 INFO L470 AbstractCegarLoop]: Abstraction has 364 states and 531 transitions. [2021-12-18 20:38:25,154 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.72) internal successors, (68), 26 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:38:25,154 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 531 transitions. [2021-12-18 20:38:25,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-18 20:38:25,155 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:38:25,155 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:38:25,174 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-18 20:38:25,371 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-12-18 20:38:25,372 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-18 20:38:25,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:38:25,372 INFO L85 PathProgramCache]: Analyzing trace with hash 97933122, now seen corresponding path program 1 times [2021-12-18 20:38:25,372 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:38:25,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680277919] [2021-12-18 20:38:25,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:38:25,372 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:38:25,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:38:25,609 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:38:25,609 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:38:25,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680277919] [2021-12-18 20:38:25,609 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680277919] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 20:38:25,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [3854208] [2021-12-18 20:38:25,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:38:25,609 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:38:25,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 20:38:25,627 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 20:38:25,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-18 20:38:25,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:38:25,747 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 44 conjunts are in the unsatisfiable core [2021-12-18 20:38:25,751 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:38:25,756 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2021-12-18 20:38:25,769 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 20:38:25,769 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-18 20:38:25,786 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:38:25,792 INFO L388 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 13 treesize of output 9 [2021-12-18 20:38:25,848 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 20:38:25,848 INFO L388 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2021-12-18 20:38:25,851 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-12-18 20:38:25,869 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 20:38:25,869 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-18 20:38:25,962 INFO L388 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 47 treesize of output 45 [2021-12-18 20:38:25,966 INFO L388 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 28 [2021-12-18 20:38:26,053 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 20:38:26,055 INFO L388 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 71 [2021-12-18 20:38:26,060 INFO L388 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 52 treesize of output 39 [2021-12-18 20:38:26,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:38:26,159 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2021-12-18 20:38:26,166 INFO L354 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2021-12-18 20:38:26,167 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2021-12-18 20:38:26,235 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 28 [2021-12-18 20:38:26,267 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2021-12-18 20:38:26,286 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:38:26,286 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 20:38:27,484 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:38:27,485 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 211 treesize of output 215 [2021-12-18 20:38:27,494 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-18 20:38:27,495 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2021-12-18 20:38:28,083 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_561 Int) (|v_ULTIMATE.start_main_#t~mem11#1.offset_10| Int) (v_ArrVal_560 (Array Int Int))) (or (and (forall ((v_ArrVal_559 (Array Int Int))) (<= 0 (let ((.cse2 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_560)) (.cse1 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_559) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2))) (store .cse0 .cse1 (store (select .cse0 .cse1) |v_ULTIMATE.start_main_#t~mem11#1.offset_10| v_ArrVal_561))) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2)))) (forall ((v_prenex_9 (Array Int Int))) (<= (let ((.cse5 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (select (select (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_560)) (.cse4 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_9) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse5))) (store .cse3 .cse4 (store (select .cse3 .cse4) |v_ULTIMATE.start_main_#t~mem11#1.offset_10| v_ArrVal_561))) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse5)) |c_ULTIMATE.start_main_#t~mem9#1.offset|)) (forall ((v_prenex_9 (Array Int Int)) (v_ArrVal_563 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem9#1.base| (let ((.cse7 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (select (select (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_9))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse7) v_ArrVal_563)) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse7)))) (forall ((v_prenex_9 (Array Int Int)) (v_ArrVal_563 (Array Int Int))) (= (let ((.cse9 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (select (select (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_9))) (store .cse8 (select (select .cse8 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse9) v_ArrVal_563)) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse9)) |c_ULTIMATE.start_main_#t~mem9#1.base|))) (< v_ArrVal_561 |c_ULTIMATE.start_main_~tmpList~0#1.offset|) (< (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_560) |c_ULTIMATE.start_main_~tree~0#1.base|) (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8)) |v_ULTIMATE.start_main_#t~mem11#1.offset_10|) (< |v_ULTIMATE.start_main_#t~mem11#1.offset_10| 0))) is different from false [2021-12-18 20:38:28,693 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_561 Int) (|v_ULTIMATE.start_main_#t~mem11#1.offset_10| Int) (v_ArrVal_560 (Array Int Int))) (or (and (forall ((v_ArrVal_559 (Array Int Int))) (<= 0 (let ((.cse2 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_560)) (.cse1 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_559) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2))) (store .cse0 .cse1 (store (select .cse0 .cse1) |v_ULTIMATE.start_main_#t~mem11#1.offset_10| v_ArrVal_561))) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2)))) (forall ((v_prenex_9 (Array Int Int)) (v_ArrVal_563 (Array Int Int))) (let ((.cse4 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (= (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_9))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse4) v_ArrVal_563)) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse4) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse4)))) (forall ((v_prenex_9 (Array Int Int)) (v_ArrVal_563 (Array Int Int))) (let ((.cse5 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse5) (select (select (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_9))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse5) v_ArrVal_563)) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse5)))) (forall ((v_prenex_9 (Array Int Int))) (let ((.cse9 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (<= (select (select (let ((.cse7 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_560)) (.cse8 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_9) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse9))) (store .cse7 .cse8 (store (select .cse7 .cse8) |v_ULTIMATE.start_main_#t~mem11#1.offset_10| v_ArrVal_561))) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse9) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse9))))) (< v_ArrVal_561 |c_ULTIMATE.start_main_~tmpList~0#1.offset|) (< (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_560) |c_ULTIMATE.start_main_~tree~0#1.base|) (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8)) |v_ULTIMATE.start_main_#t~mem11#1.offset_10|) (< |v_ULTIMATE.start_main_#t~mem11#1.offset_10| 0))) is different from false [2021-12-18 20:38:30,463 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_557 (Array Int Int)) (|v_ULTIMATE.start_main_~tmpList~0#1.base_25| Int) (v_ArrVal_561 Int) (|v_ULTIMATE.start_main_#t~mem11#1.offset_10| Int) (v_ArrVal_560 (Array Int Int))) (or (and (forall ((v_prenex_9 (Array Int Int)) (v_ArrVal_558 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_557)) (.cse2 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (<= (select (select (let ((.cse0 (store .cse3 |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_ArrVal_560)) (.cse1 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_558) |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_prenex_9) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2))) (store .cse0 .cse1 (store (select .cse0 .cse1) |v_ULTIMATE.start_main_#t~mem11#1.offset_10| v_ArrVal_561))) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2) (select (select .cse3 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2)))) (forall ((v_prenex_9 (Array Int Int)) (v_ArrVal_558 (Array Int Int)) (v_ArrVal_563 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_558)) (.cse5 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (= (select (select .cse4 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse5) (select (select (let ((.cse6 (store .cse4 |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_prenex_9))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse5) v_ArrVal_563)) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse5)))) (forall ((v_prenex_9 (Array Int Int)) (v_ArrVal_558 (Array Int Int)) (v_ArrVal_563 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_558)) (.cse8 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (= (select (select (let ((.cse7 (store .cse9 |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_prenex_9))) (store .cse7 (select (select .cse7 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse8) v_ArrVal_563)) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse8) (select (select .cse9 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse8))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_25|))) (< (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_557) |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_ArrVal_560) |c_ULTIMATE.start_main_~tree~0#1.base|) (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8)) |v_ULTIMATE.start_main_#t~mem11#1.offset_10|) (< |v_ULTIMATE.start_main_#t~mem11#1.offset_10| 0) (< v_ArrVal_561 0))) is different from false [2021-12-18 20:38:31,109 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_557 (Array Int Int)) (|v_ULTIMATE.start_main_~tmpList~0#1.base_25| Int) (v_ArrVal_561 Int) (|v_ULTIMATE.start_main_#t~mem11#1.offset_10| Int) (v_ArrVal_560 (Array Int Int))) (or (and (forall ((v_prenex_9 (Array Int Int)) (v_ArrVal_558 (Array Int Int)) (v_ArrVal_563 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) v_ArrVal_558))) (= (select (select .cse0 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) (select (select (let ((.cse2 (store .cse0 |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_prenex_9))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) v_ArrVal_563)) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1))))) (forall ((v_prenex_9 (Array Int Int)) (v_ArrVal_558 (Array Int Int))) (let ((.cse6 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse6))) (let ((.cse7 (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_557))) (<= (select (select (let ((.cse3 (store .cse7 |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_ArrVal_560)) (.cse4 (select (select (store (store |c_#memory_$Pointer$.base| .cse5 v_ArrVal_558) |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_prenex_9) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse6))) (store .cse3 .cse4 (store (select .cse3 .cse4) |v_ULTIMATE.start_main_#t~mem11#1.offset_10| v_ArrVal_561))) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse6) (select (select .cse7 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse6)))))) (forall ((v_prenex_9 (Array Int Int)) (v_ArrVal_558 (Array Int Int)) (v_ArrVal_563 (Array Int Int))) (let ((.cse9 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (let ((.cse10 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse9) v_ArrVal_558))) (= (select (select (let ((.cse8 (store .cse10 |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_prenex_9))) (store .cse8 (select (select .cse8 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse9) v_ArrVal_563)) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse9) (select (select .cse10 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse9)))))) (< (let ((.cse11 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (select (select (store (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse11) v_ArrVal_557) |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_ArrVal_560) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse11)) |v_ULTIMATE.start_main_#t~mem11#1.offset_10|) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_25|))) (< |v_ULTIMATE.start_main_#t~mem11#1.offset_10| 0) (< v_ArrVal_561 0))) is different from false [2021-12-18 20:38:31,450 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:38:31,450 INFO L388 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 277 treesize of output 247 [2021-12-18 20:38:31,456 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:38:31,457 INFO L388 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 247 treesize of output 177 [2021-12-18 20:38:31,459 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:38:31,462 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 947 treesize of output 761 [2021-12-18 20:38:31,490 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:38:31,521 INFO L354 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2021-12-18 20:38:31,522 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 3720 treesize of output 3548 [2021-12-18 20:38:31,654 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3928 treesize of output 3800 [2021-12-18 20:38:31,689 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 4034 treesize of output 3670 [2021-12-18 20:38:31,799 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Should have been eliminated by DER [2021-12-18 20:38:31,800 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-12-18 20:38:31,800 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2021-12-18 20:38:31,800 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031640261] [2021-12-18 20:38:31,800 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-12-18 20:38:31,800 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-18 20:38:31,800 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:38:31,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-18 20:38:31,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=761, Unknown=14, NotChecked=236, Total=1122 [2021-12-18 20:38:31,801 INFO L87 Difference]: Start difference. First operand 364 states and 531 transitions. Second operand has 13 states, 12 states have (on average 2.0) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:38:31,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-18 20:38:31,802 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=111, Invalid=761, Unknown=14, NotChecked=236, Total=1122 [2021-12-18 20:38:31,803 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 20:38:31,803 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 20:38:31,823 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-12-18 20:38:32,019 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-12-18 20:38:32,020 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@3fc3c4d2 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.assertCodeBlock(IncrementalHoareTripleChecker.java:360) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.prepareAssertionStackAndAddTransition(IncrementalHoareTripleChecker.java:206) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkInternal(IncrementalHoareTripleChecker.java:131) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker$ProtectedHtc.checkInternal(ChainingHoareTripleChecker.java:455) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker.checkInternal(ChainingHoareTripleChecker.java:103) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:95) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:357) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1058) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:960) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:182) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:868) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:784) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:462) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:420) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-12-18 20:38:32,023 INFO L158 Benchmark]: Toolchain (without parser) took 15014.40ms. Allocated memory was 90.2MB in the beginning and 283.1MB in the end (delta: 192.9MB). Free memory was 66.3MB in the beginning and 240.7MB in the end (delta: -174.4MB). Peak memory consumption was 18.5MB. Max. memory is 16.1GB. [2021-12-18 20:38:32,023 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 90.2MB. Free memory was 65.1MB in the beginning and 65.0MB in the end (delta: 42.0kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-18 20:38:32,023 INFO L158 Benchmark]: CACSL2BoogieTranslator took 446.64ms. Allocated memory is still 90.2MB. Free memory was 66.1MB in the beginning and 58.0MB in the end (delta: 8.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-18 20:38:32,023 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.04ms. Allocated memory is still 90.2MB. Free memory was 58.0MB in the beginning and 55.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-18 20:38:32,024 INFO L158 Benchmark]: Boogie Preprocessor took 23.72ms. Allocated memory is still 90.2MB. Free memory was 55.4MB in the beginning and 53.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-18 20:38:32,024 INFO L158 Benchmark]: RCFGBuilder took 536.84ms. Allocated memory was 90.2MB in the beginning and 109.1MB in the end (delta: 18.9MB). Free memory was 53.2MB in the beginning and 67.3MB in the end (delta: -14.1MB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. [2021-12-18 20:38:32,024 INFO L158 Benchmark]: TraceAbstraction took 13942.98ms. Allocated memory was 109.1MB in the beginning and 283.1MB in the end (delta: 174.1MB). Free memory was 66.8MB in the beginning and 240.7MB in the end (delta: -173.9MB). Peak memory consumption was 820.6kB. Max. memory is 16.1GB. [2021-12-18 20:38:32,025 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 90.2MB. Free memory was 65.1MB in the beginning and 65.0MB in the end (delta: 42.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 446.64ms. Allocated memory is still 90.2MB. Free memory was 66.1MB in the beginning and 58.0MB in the end (delta: 8.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.04ms. Allocated memory is still 90.2MB. Free memory was 58.0MB in the beginning and 55.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 23.72ms. Allocated memory is still 90.2MB. Free memory was 55.4MB in the beginning and 53.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 536.84ms. Allocated memory was 90.2MB in the beginning and 109.1MB in the end (delta: 18.9MB). Free memory was 53.2MB in the beginning and 67.3MB in the end (delta: -14.1MB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. * TraceAbstraction took 13942.98ms. Allocated memory was 109.1MB in the beginning and 283.1MB in the end (delta: 174.1MB). Free memory was 66.8MB in the beginning and 240.7MB in the end (delta: -173.9MB). Peak memory consumption was 820.6kB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@3fc3c4d2 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@3fc3c4d2: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-12-18 20:38:32,059 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-ext/tree_of_cslls.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e174a1790a7df4dcba920aa7097618d66c8703aa13de1aa6af1a2c5f7cb0971c --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-18 20:38:34,234 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-18 20:38:34,236 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-18 20:38:34,265 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-18 20:38:34,266 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-18 20:38:34,268 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-18 20:38:34,269 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-18 20:38:34,273 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-18 20:38:34,278 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-18 20:38:34,282 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-18 20:38:34,282 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-18 20:38:34,283 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-18 20:38:34,284 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-18 20:38:34,285 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-18 20:38:34,286 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-18 20:38:34,289 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-18 20:38:34,290 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-18 20:38:34,290 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-18 20:38:34,292 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-18 20:38:34,296 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-18 20:38:34,297 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-18 20:38:34,298 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-18 20:38:34,299 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-18 20:38:34,300 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-18 20:38:34,305 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-18 20:38:34,305 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-18 20:38:34,305 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-18 20:38:34,307 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-18 20:38:34,307 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-18 20:38:34,308 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-18 20:38:34,308 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-18 20:38:34,308 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-18 20:38:34,309 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-18 20:38:34,310 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-18 20:38:34,311 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-18 20:38:34,311 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-18 20:38:34,312 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-18 20:38:34,312 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-18 20:38:34,312 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-18 20:38:34,313 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-18 20:38:34,313 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-18 20:38:34,314 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2021-12-18 20:38:34,344 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-18 20:38:34,344 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-18 20:38:34,345 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-18 20:38:34,345 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-18 20:38:34,346 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-18 20:38:34,346 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-18 20:38:34,347 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-18 20:38:34,347 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-18 20:38:34,348 INFO L138 SettingsManager]: * Use SBE=true [2021-12-18 20:38:34,348 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-18 20:38:34,348 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-18 20:38:34,349 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-18 20:38:34,349 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-18 20:38:34,349 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-18 20:38:34,349 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-18 20:38:34,349 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-18 20:38:34,349 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-18 20:38:34,350 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-18 20:38:34,350 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-18 20:38:34,350 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-18 20:38:34,350 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-18 20:38:34,350 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-18 20:38:34,350 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-18 20:38:34,351 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-18 20:38:34,351 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-18 20:38:34,351 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-18 20:38:34,351 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-18 20:38:34,351 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-18 20:38:34,351 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-18 20:38:34,351 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-18 20:38:34,352 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-18 20:38:34,352 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-18 20:38:34,352 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-18 20:38:34,352 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-18 20:38:34,352 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e174a1790a7df4dcba920aa7097618d66c8703aa13de1aa6af1a2c5f7cb0971c [2021-12-18 20:38:34,620 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-18 20:38:34,633 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-18 20:38:34,635 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-18 20:38:34,635 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-18 20:38:34,636 INFO L275 PluginConnector]: CDTParser initialized [2021-12-18 20:38:34,637 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext/tree_of_cslls.i [2021-12-18 20:38:34,678 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee7a3c008/b1861b17a96f4ee58af7fe3a3a237603/FLAGbd580f3ea [2021-12-18 20:38:35,028 INFO L306 CDTParser]: Found 1 translation units. [2021-12-18 20:38:35,029 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext/tree_of_cslls.i [2021-12-18 20:38:35,044 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee7a3c008/b1861b17a96f4ee58af7fe3a3a237603/FLAGbd580f3ea [2021-12-18 20:38:35,431 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee7a3c008/b1861b17a96f4ee58af7fe3a3a237603 [2021-12-18 20:38:35,434 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-18 20:38:35,435 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-18 20:38:35,438 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-18 20:38:35,438 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-18 20:38:35,444 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-18 20:38:35,445 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 08:38:35" (1/1) ... [2021-12-18 20:38:35,446 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20c72869 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:38:35, skipping insertion in model container [2021-12-18 20:38:35,447 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 08:38:35" (1/1) ... [2021-12-18 20:38:35,451 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-18 20:38:35,491 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-18 20:38:35,757 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-18 20:38:35,764 INFO L203 MainTranslator]: Completed pre-run [2021-12-18 20:38:35,815 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-18 20:38:35,836 INFO L208 MainTranslator]: Completed translation [2021-12-18 20:38:35,837 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:38:35 WrapperNode [2021-12-18 20:38:35,837 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-18 20:38:35,838 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-18 20:38:35,838 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-18 20:38:35,838 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-18 20:38:35,842 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:38:35" (1/1) ... [2021-12-18 20:38:35,860 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:38:35" (1/1) ... [2021-12-18 20:38:35,877 INFO L137 Inliner]: procedures = 124, calls = 63, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 201 [2021-12-18 20:38:35,877 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-18 20:38:35,878 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-18 20:38:35,878 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-18 20:38:35,878 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-18 20:38:35,886 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:38:35" (1/1) ... [2021-12-18 20:38:35,887 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:38:35" (1/1) ... [2021-12-18 20:38:35,894 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:38:35" (1/1) ... [2021-12-18 20:38:35,901 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:38:35" (1/1) ... [2021-12-18 20:38:35,911 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:38:35" (1/1) ... [2021-12-18 20:38:35,925 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:38:35" (1/1) ... [2021-12-18 20:38:35,929 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:38:35" (1/1) ... [2021-12-18 20:38:35,932 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-18 20:38:35,936 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-18 20:38:35,936 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-18 20:38:35,936 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-18 20:38:35,947 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:38:35" (1/1) ... [2021-12-18 20:38:35,958 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-18 20:38:35,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 20:38:35,986 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-18 20:38:35,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-18 20:38:36,018 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-18 20:38:36,018 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-18 20:38:36,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-18 20:38:36,018 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-18 20:38:36,018 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-18 20:38:36,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-18 20:38:36,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-18 20:38:36,019 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-18 20:38:36,094 INFO L236 CfgBuilder]: Building ICFG [2021-12-18 20:38:36,095 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-18 20:38:36,655 INFO L277 CfgBuilder]: Performing block encoding [2021-12-18 20:38:36,660 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-18 20:38:36,662 INFO L301 CfgBuilder]: Removed 7 assume(true) statements. [2021-12-18 20:38:36,663 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 08:38:36 BoogieIcfgContainer [2021-12-18 20:38:36,664 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-18 20:38:36,665 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-18 20:38:36,665 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-18 20:38:36,667 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-18 20:38:36,667 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 08:38:35" (1/3) ... [2021-12-18 20:38:36,668 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@95a3d40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 08:38:36, skipping insertion in model container [2021-12-18 20:38:36,668 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:38:35" (2/3) ... [2021-12-18 20:38:36,668 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@95a3d40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 08:38:36, skipping insertion in model container [2021-12-18 20:38:36,668 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 08:38:36" (3/3) ... [2021-12-18 20:38:36,669 INFO L111 eAbstractionObserver]: Analyzing ICFG tree_of_cslls.i [2021-12-18 20:38:36,673 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-18 20:38:36,673 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 104 error locations. [2021-12-18 20:38:36,707 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-18 20:38:36,727 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-18 20:38:36,727 INFO L340 AbstractCegarLoop]: Starting to check reachability of 104 error locations. [2021-12-18 20:38:36,749 INFO L276 IsEmpty]: Start isEmpty. Operand has 203 states, 98 states have (on average 2.2857142857142856) internal successors, (224), 202 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:38:36,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-18 20:38:36,755 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:38:36,755 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-18 20:38:36,755 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-18 20:38:36,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:38:36,761 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2021-12-18 20:38:36,768 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 20:38:36,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1935017649] [2021-12-18 20:38:36,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:38:36,769 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 20:38:36,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 20:38:36,771 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 20:38:36,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-12-18 20:38:36,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:38:36,826 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-18 20:38:36,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:38:36,879 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2021-12-18 20:38:36,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:38:36,889 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 20:38:36,889 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 20:38:36,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1935017649] [2021-12-18 20:38:36,890 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1935017649] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:38:36,890 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:38:36,890 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-18 20:38:36,891 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105011526] [2021-12-18 20:38:36,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:38:36,895 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 20:38:36,895 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 20:38:36,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 20:38:36,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 20:38:36,916 INFO L87 Difference]: Start difference. First operand has 203 states, 98 states have (on average 2.2857142857142856) internal successors, (224), 202 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:38:37,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:38:37,219 INFO L93 Difference]: Finished difference Result 275 states and 295 transitions. [2021-12-18 20:38:37,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 20:38:37,221 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-12-18 20:38:37,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:38:37,230 INFO L225 Difference]: With dead ends: 275 [2021-12-18 20:38:37,231 INFO L226 Difference]: Without dead ends: 271 [2021-12-18 20:38:37,232 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 20:38:37,234 INFO L933 BasicCegarLoop]: 142 mSDtfsCounter, 191 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-18 20:38:37,234 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [191 Valid, 190 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-18 20:38:37,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2021-12-18 20:38:37,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 192. [2021-12-18 20:38:37,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 97 states have (on average 2.1237113402061856) internal successors, (206), 191 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:38:37,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 206 transitions. [2021-12-18 20:38:37,293 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 206 transitions. Word has length 3 [2021-12-18 20:38:37,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:38:37,293 INFO L470 AbstractCegarLoop]: Abstraction has 192 states and 206 transitions. [2021-12-18 20:38:37,294 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:38:37,294 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 206 transitions. [2021-12-18 20:38:37,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-18 20:38:37,294 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:38:37,294 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-18 20:38:37,316 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-12-18 20:38:37,501 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 20:38:37,501 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-18 20:38:37,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:38:37,503 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2021-12-18 20:38:37,504 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 20:38:37,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1614778494] [2021-12-18 20:38:37,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:38:37,505 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 20:38:37,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 20:38:37,506 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 20:38:37,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-12-18 20:38:37,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:38:37,594 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-18 20:38:37,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:38:37,613 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2021-12-18 20:38:37,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:38:37,621 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 20:38:37,622 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 20:38:37,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1614778494] [2021-12-18 20:38:37,622 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1614778494] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:38:37,622 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:38:37,622 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-18 20:38:37,622 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921782532] [2021-12-18 20:38:37,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:38:37,623 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 20:38:37,624 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 20:38:37,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 20:38:37,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 20:38:37,624 INFO L87 Difference]: Start difference. First operand 192 states and 206 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:38:37,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:38:37,932 INFO L93 Difference]: Finished difference Result 190 states and 204 transitions. [2021-12-18 20:38:37,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 20:38:37,933 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-12-18 20:38:37,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:38:37,934 INFO L225 Difference]: With dead ends: 190 [2021-12-18 20:38:37,934 INFO L226 Difference]: Without dead ends: 190 [2021-12-18 20:38:37,934 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 20:38:37,935 INFO L933 BasicCegarLoop]: 201 mSDtfsCounter, 2 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-18 20:38:37,935 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 301 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-18 20:38:37,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2021-12-18 20:38:37,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2021-12-18 20:38:37,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 97 states have (on average 2.1030927835051547) internal successors, (204), 189 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:38:37,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 204 transitions. [2021-12-18 20:38:37,941 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 204 transitions. Word has length 3 [2021-12-18 20:38:37,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:38:37,941 INFO L470 AbstractCegarLoop]: Abstraction has 190 states and 204 transitions. [2021-12-18 20:38:37,941 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:38:37,941 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 204 transitions. [2021-12-18 20:38:37,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-18 20:38:37,942 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:38:37,942 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-18 20:38:37,950 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2021-12-18 20:38:38,150 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 20:38:38,151 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-18 20:38:38,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:38:38,151 INFO L85 PathProgramCache]: Analyzing trace with hash 889446153, now seen corresponding path program 1 times [2021-12-18 20:38:38,152 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 20:38:38,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1323274424] [2021-12-18 20:38:38,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:38:38,152 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 20:38:38,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 20:38:38,153 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 20:38:38,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-12-18 20:38:38,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:38:38,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-18 20:38:38,213 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:38:38,227 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2021-12-18 20:38:38,231 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2021-12-18 20:38:38,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:38:38,279 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2021-12-18 20:38:38,287 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 20:38:38,287 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2021-12-18 20:38:38,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:38:38,299 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 20:38:38,299 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 20:38:38,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1323274424] [2021-12-18 20:38:38,299 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1323274424] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:38:38,299 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:38:38,299 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-18 20:38:38,300 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910696198] [2021-12-18 20:38:38,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:38:38,300 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-18 20:38:38,300 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 20:38:38,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-18 20:38:38,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-18 20:38:38,301 INFO L87 Difference]: Start difference. First operand 190 states and 204 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:38:38,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:38:38,793 INFO L93 Difference]: Finished difference Result 347 states and 373 transitions. [2021-12-18 20:38:38,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-18 20:38:38,793 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-12-18 20:38:38,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:38:38,795 INFO L225 Difference]: With dead ends: 347 [2021-12-18 20:38:38,795 INFO L226 Difference]: Without dead ends: 347 [2021-12-18 20:38:38,795 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-18 20:38:38,795 INFO L933 BasicCegarLoop]: 109 mSDtfsCounter, 270 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-18 20:38:38,796 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [270 Valid, 223 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-18 20:38:38,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2021-12-18 20:38:38,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 183. [2021-12-18 20:38:38,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 97 states have (on average 2.0309278350515463) internal successors, (197), 182 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:38:38,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 197 transitions. [2021-12-18 20:38:38,801 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 197 transitions. Word has length 6 [2021-12-18 20:38:38,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:38:38,801 INFO L470 AbstractCegarLoop]: Abstraction has 183 states and 197 transitions. [2021-12-18 20:38:38,801 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:38:38,802 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 197 transitions. [2021-12-18 20:38:38,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-18 20:38:38,802 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:38:38,802 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:38:38,811 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-12-18 20:38:39,011 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 20:38:39,011 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-18 20:38:39,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:38:39,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1113924364, now seen corresponding path program 1 times [2021-12-18 20:38:39,012 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 20:38:39,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [655044835] [2021-12-18 20:38:39,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:38:39,012 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 20:38:39,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 20:38:39,016 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 20:38:39,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-12-18 20:38:39,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:38:39,101 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-18 20:38:39,103 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:38:39,122 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2021-12-18 20:38:39,144 INFO L388 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 13 treesize of output 9 [2021-12-18 20:38:39,165 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2021-12-18 20:38:39,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:38:39,175 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 20:38:39,175 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 20:38:39,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [655044835] [2021-12-18 20:38:39,176 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [655044835] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:38:39,176 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:38:39,176 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-18 20:38:39,176 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371133950] [2021-12-18 20:38:39,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:38:39,176 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-18 20:38:39,177 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 20:38:39,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-18 20:38:39,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-18 20:38:39,177 INFO L87 Difference]: Start difference. First operand 183 states and 197 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:38:39,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:38:39,689 INFO L93 Difference]: Finished difference Result 182 states and 196 transitions. [2021-12-18 20:38:39,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 20:38:39,690 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-12-18 20:38:39,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:38:39,690 INFO L225 Difference]: With dead ends: 182 [2021-12-18 20:38:39,690 INFO L226 Difference]: Without dead ends: 182 [2021-12-18 20:38:39,691 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-18 20:38:39,691 INFO L933 BasicCegarLoop]: 191 mSDtfsCounter, 5 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-18 20:38:39,692 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 472 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-18 20:38:39,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2021-12-18 20:38:39,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2021-12-18 20:38:39,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 97 states have (on average 2.020618556701031) internal successors, (196), 181 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:38:39,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 196 transitions. [2021-12-18 20:38:39,702 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 196 transitions. Word has length 10 [2021-12-18 20:38:39,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:38:39,704 INFO L470 AbstractCegarLoop]: Abstraction has 182 states and 196 transitions. [2021-12-18 20:38:39,704 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:38:39,705 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 196 transitions. [2021-12-18 20:38:39,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-18 20:38:39,705 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:38:39,705 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:38:39,722 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-12-18 20:38:39,906 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 20:38:39,906 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-18 20:38:39,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:38:39,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1113924365, now seen corresponding path program 1 times [2021-12-18 20:38:39,907 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 20:38:39,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1510213569] [2021-12-18 20:38:39,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:38:39,907 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 20:38:39,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 20:38:39,910 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 20:38:39,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-12-18 20:38:39,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:38:39,994 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-18 20:38:39,996 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:38:40,008 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2021-12-18 20:38:40,035 INFO L388 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 13 treesize of output 9 [2021-12-18 20:38:40,043 INFO L388 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 13 treesize of output 9 [2021-12-18 20:38:40,080 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-18 20:38:40,100 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2021-12-18 20:38:40,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:38:40,116 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 20:38:40,116 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 20:38:40,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1510213569] [2021-12-18 20:38:40,116 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1510213569] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:38:40,116 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:38:40,116 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-18 20:38:40,129 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349687716] [2021-12-18 20:38:40,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:38:40,130 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-18 20:38:40,130 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 20:38:40,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-18 20:38:40,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-18 20:38:40,131 INFO L87 Difference]: Start difference. First operand 182 states and 196 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:38:40,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:38:40,671 INFO L93 Difference]: Finished difference Result 181 states and 195 transitions. [2021-12-18 20:38:40,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 20:38:40,671 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-12-18 20:38:40,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:38:40,672 INFO L225 Difference]: With dead ends: 181 [2021-12-18 20:38:40,672 INFO L226 Difference]: Without dead ends: 181 [2021-12-18 20:38:40,672 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-18 20:38:40,673 INFO L933 BasicCegarLoop]: 191 mSDtfsCounter, 3 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-18 20:38:40,673 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 493 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-18 20:38:40,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2021-12-18 20:38:40,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2021-12-18 20:38:40,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 97 states have (on average 2.0103092783505154) internal successors, (195), 180 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:38:40,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 195 transitions. [2021-12-18 20:38:40,676 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 195 transitions. Word has length 10 [2021-12-18 20:38:40,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:38:40,676 INFO L470 AbstractCegarLoop]: Abstraction has 181 states and 195 transitions. [2021-12-18 20:38:40,676 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:38:40,677 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 195 transitions. [2021-12-18 20:38:40,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-18 20:38:40,677 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:38:40,677 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:38:40,686 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2021-12-18 20:38:40,881 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 20:38:40,882 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-18 20:38:40,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:38:40,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1975621208, now seen corresponding path program 1 times [2021-12-18 20:38:40,883 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 20:38:40,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2056343401] [2021-12-18 20:38:40,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:38:40,883 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 20:38:40,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 20:38:40,884 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 20:38:40,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-12-18 20:38:40,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:38:40,980 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-18 20:38:40,981 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:38:41,005 INFO L354 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2021-12-18 20:38:41,006 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 21 [2021-12-18 20:38:41,083 INFO L354 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2021-12-18 20:38:41,084 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 30 treesize of output 47 [2021-12-18 20:38:41,139 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:38:41,294 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 20:38:41,295 INFO L388 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 56 [2021-12-18 20:38:41,382 INFO L354 Elim1Store]: treesize reduction 41, result has 60.6 percent of original size [2021-12-18 20:38:41,383 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 50 treesize of output 99 [2021-12-18 20:38:41,516 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 17 [2021-12-18 20:38:41,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:38:41,535 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 20:38:41,536 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 20:38:41,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2056343401] [2021-12-18 20:38:41,536 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2056343401] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:38:41,536 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:38:41,536 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-18 20:38:41,536 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484387155] [2021-12-18 20:38:41,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:38:41,536 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-18 20:38:41,536 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 20:38:41,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-18 20:38:41,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-12-18 20:38:41,537 INFO L87 Difference]: Start difference. First operand 181 states and 195 transitions. Second operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:38:42,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:38:42,302 INFO L93 Difference]: Finished difference Result 334 states and 366 transitions. [2021-12-18 20:38:42,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-18 20:38:42,302 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-12-18 20:38:42,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:38:42,303 INFO L225 Difference]: With dead ends: 334 [2021-12-18 20:38:42,304 INFO L226 Difference]: Without dead ends: 334 [2021-12-18 20:38:42,304 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2021-12-18 20:38:42,304 INFO L933 BasicCegarLoop]: 115 mSDtfsCounter, 726 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 726 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 156 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-18 20:38:42,304 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [726 Valid, 545 Invalid, 655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 455 Invalid, 0 Unknown, 156 Unchecked, 0.6s Time] [2021-12-18 20:38:42,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2021-12-18 20:38:42,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 185. [2021-12-18 20:38:42,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 101 states have (on average 1.99009900990099) internal successors, (201), 184 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:38:42,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 201 transitions. [2021-12-18 20:38:42,308 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 201 transitions. Word has length 14 [2021-12-18 20:38:42,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:38:42,308 INFO L470 AbstractCegarLoop]: Abstraction has 185 states and 201 transitions. [2021-12-18 20:38:42,308 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:38:42,309 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 201 transitions. [2021-12-18 20:38:42,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-18 20:38:42,309 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:38:42,309 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:38:42,316 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-12-18 20:38:42,516 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 20:38:42,516 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-18 20:38:42,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:38:42,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1975621209, now seen corresponding path program 1 times [2021-12-18 20:38:42,517 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 20:38:42,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [887615920] [2021-12-18 20:38:42,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:38:42,517 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 20:38:42,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 20:38:42,518 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 20:38:42,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-12-18 20:38:42,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:38:42,604 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-18 20:38:42,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:38:42,612 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2021-12-18 20:38:42,635 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 20:38:42,635 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2021-12-18 20:38:42,640 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-18 20:38:42,657 INFO L388 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 13 treesize of output 9 [2021-12-18 20:38:42,672 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:38:42,766 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 20:38:42,768 INFO L388 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2021-12-18 20:38:42,775 INFO L388 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 22 treesize of output 24 [2021-12-18 20:38:42,811 INFO L354 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2021-12-18 20:38:42,812 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 18 treesize of output 20 [2021-12-18 20:38:42,831 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-18 20:38:42,837 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2021-12-18 20:38:42,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:38:42,849 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 20:38:42,849 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 20:38:42,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [887615920] [2021-12-18 20:38:42,849 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [887615920] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:38:42,849 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:38:42,849 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-18 20:38:42,849 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813442587] [2021-12-18 20:38:42,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:38:42,850 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-18 20:38:42,850 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 20:38:42,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-18 20:38:42,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-18 20:38:42,850 INFO L87 Difference]: Start difference. First operand 185 states and 201 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:38:44,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:38:44,227 INFO L93 Difference]: Finished difference Result 328 states and 360 transitions. [2021-12-18 20:38:44,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-18 20:38:44,227 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-12-18 20:38:44,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:38:44,228 INFO L225 Difference]: With dead ends: 328 [2021-12-18 20:38:44,228 INFO L226 Difference]: Without dead ends: 328 [2021-12-18 20:38:44,228 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2021-12-18 20:38:44,229 INFO L933 BasicCegarLoop]: 127 mSDtfsCounter, 329 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-12-18 20:38:44,229 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [329 Valid, 503 Invalid, 785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 770 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2021-12-18 20:38:44,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2021-12-18 20:38:44,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 185. [2021-12-18 20:38:44,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 101 states have (on average 1.9801980198019802) internal successors, (200), 184 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:38:44,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 200 transitions. [2021-12-18 20:38:44,232 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 200 transitions. Word has length 14 [2021-12-18 20:38:44,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:38:44,232 INFO L470 AbstractCegarLoop]: Abstraction has 185 states and 200 transitions. [2021-12-18 20:38:44,232 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:38:44,232 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 200 transitions. [2021-12-18 20:38:44,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-18 20:38:44,232 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:38:44,232 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:38:44,251 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2021-12-18 20:38:44,448 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 20:38:44,448 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-18 20:38:44,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:38:44,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1114715313, now seen corresponding path program 1 times [2021-12-18 20:38:44,448 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 20:38:44,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1305177238] [2021-12-18 20:38:44,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:38:44,449 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 20:38:44,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 20:38:44,450 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 20:38:44,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-12-18 20:38:44,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:38:44,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-18 20:38:44,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:38:44,550 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2021-12-18 20:38:44,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:38:44,557 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 20:38:44,557 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 20:38:44,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1305177238] [2021-12-18 20:38:44,557 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1305177238] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:38:44,557 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:38:44,557 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-18 20:38:44,557 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864775102] [2021-12-18 20:38:44,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:38:44,564 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 20:38:44,568 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 20:38:44,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 20:38:44,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 20:38:44,569 INFO L87 Difference]: Start difference. First operand 185 states and 200 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:38:44,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:38:44,944 INFO L93 Difference]: Finished difference Result 300 states and 328 transitions. [2021-12-18 20:38:44,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 20:38:44,945 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-12-18 20:38:44,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:38:44,946 INFO L225 Difference]: With dead ends: 300 [2021-12-18 20:38:44,946 INFO L226 Difference]: Without dead ends: 300 [2021-12-18 20:38:44,946 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 20:38:44,947 INFO L933 BasicCegarLoop]: 241 mSDtfsCounter, 156 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-18 20:38:44,947 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [156 Valid, 319 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-18 20:38:44,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2021-12-18 20:38:44,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 182. [2021-12-18 20:38:44,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 101 states have (on average 1.9504950495049505) internal successors, (197), 181 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:38:44,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 197 transitions. [2021-12-18 20:38:44,951 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 197 transitions. Word has length 15 [2021-12-18 20:38:44,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:38:44,951 INFO L470 AbstractCegarLoop]: Abstraction has 182 states and 197 transitions. [2021-12-18 20:38:44,951 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:38:44,951 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 197 transitions. [2021-12-18 20:38:44,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-18 20:38:44,952 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:38:44,952 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:38:44,959 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-12-18 20:38:45,152 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 20:38:45,153 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-18 20:38:45,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:38:45,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1114715314, now seen corresponding path program 1 times [2021-12-18 20:38:45,153 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 20:38:45,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1448427617] [2021-12-18 20:38:45,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:38:45,154 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 20:38:45,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 20:38:45,155 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 20:38:45,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-12-18 20:38:45,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:38:45,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-18 20:38:45,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:38:45,299 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2021-12-18 20:38:45,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:38:45,316 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 20:38:45,316 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 20:38:45,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1448427617] [2021-12-18 20:38:45,317 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1448427617] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:38:45,317 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:38:45,317 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-18 20:38:45,317 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098875821] [2021-12-18 20:38:45,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:38:45,318 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 20:38:45,318 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 20:38:45,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 20:38:45,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 20:38:45,318 INFO L87 Difference]: Start difference. First operand 182 states and 197 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:38:45,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:38:45,685 INFO L93 Difference]: Finished difference Result 281 states and 309 transitions. [2021-12-18 20:38:45,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 20:38:45,686 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-12-18 20:38:45,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:38:45,687 INFO L225 Difference]: With dead ends: 281 [2021-12-18 20:38:45,687 INFO L226 Difference]: Without dead ends: 281 [2021-12-18 20:38:45,687 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 20:38:45,689 INFO L933 BasicCegarLoop]: 247 mSDtfsCounter, 130 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-18 20:38:45,689 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [130 Valid, 332 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-18 20:38:45,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2021-12-18 20:38:45,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 180. [2021-12-18 20:38:45,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 101 states have (on average 1.9306930693069306) internal successors, (195), 179 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:38:45,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 195 transitions. [2021-12-18 20:38:45,693 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 195 transitions. Word has length 15 [2021-12-18 20:38:45,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:38:45,693 INFO L470 AbstractCegarLoop]: Abstraction has 180 states and 195 transitions. [2021-12-18 20:38:45,693 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:38:45,693 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 195 transitions. [2021-12-18 20:38:45,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-18 20:38:45,694 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:38:45,694 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:38:45,703 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-12-18 20:38:45,901 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 20:38:45,902 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-18 20:38:45,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:38:45,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1114677643, now seen corresponding path program 1 times [2021-12-18 20:38:45,902 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 20:38:45,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [142835398] [2021-12-18 20:38:45,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:38:45,903 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 20:38:45,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 20:38:45,904 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 20:38:45,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-12-18 20:38:45,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:38:45,965 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-18 20:38:45,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:38:45,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:38:45,988 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 20:38:45,989 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 20:38:45,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [142835398] [2021-12-18 20:38:45,989 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [142835398] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:38:45,989 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:38:45,989 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-18 20:38:45,989 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698296470] [2021-12-18 20:38:45,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:38:45,989 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-18 20:38:45,990 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 20:38:45,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-18 20:38:45,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-18 20:38:45,990 INFO L87 Difference]: Start difference. First operand 180 states and 195 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:38:46,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:38:46,353 INFO L93 Difference]: Finished difference Result 239 states and 261 transitions. [2021-12-18 20:38:46,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-18 20:38:46,354 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-12-18 20:38:46,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:38:46,354 INFO L225 Difference]: With dead ends: 239 [2021-12-18 20:38:46,354 INFO L226 Difference]: Without dead ends: 239 [2021-12-18 20:38:46,354 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-18 20:38:46,355 INFO L933 BasicCegarLoop]: 95 mSDtfsCounter, 306 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-18 20:38:46,355 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [306 Valid, 143 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-18 20:38:46,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2021-12-18 20:38:46,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 168. [2021-12-18 20:38:46,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 104 states have (on average 1.7884615384615385) internal successors, (186), 167 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:38:46,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 186 transitions. [2021-12-18 20:38:46,357 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 186 transitions. Word has length 15 [2021-12-18 20:38:46,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:38:46,358 INFO L470 AbstractCegarLoop]: Abstraction has 168 states and 186 transitions. [2021-12-18 20:38:46,358 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:38:46,358 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 186 transitions. [2021-12-18 20:38:46,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-18 20:38:46,358 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:38:46,358 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:38:46,365 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-12-18 20:38:46,558 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 20:38:46,559 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-18 20:38:46,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:38:46,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1114677644, now seen corresponding path program 1 times [2021-12-18 20:38:46,559 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 20:38:46,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [499793005] [2021-12-18 20:38:46,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:38:46,559 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 20:38:46,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 20:38:46,566 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 20:38:46,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-12-18 20:38:46,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:38:46,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-18 20:38:46,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:38:46,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:38:46,738 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 20:38:46,738 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 20:38:46,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [499793005] [2021-12-18 20:38:46,738 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [499793005] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:38:46,738 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:38:46,739 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-18 20:38:46,739 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321966999] [2021-12-18 20:38:46,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:38:46,739 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-18 20:38:46,739 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 20:38:46,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-18 20:38:46,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-18 20:38:46,739 INFO L87 Difference]: Start difference. First operand 168 states and 186 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:38:47,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:38:47,443 INFO L93 Difference]: Finished difference Result 419 states and 464 transitions. [2021-12-18 20:38:47,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-18 20:38:47,443 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-12-18 20:38:47,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:38:47,444 INFO L225 Difference]: With dead ends: 419 [2021-12-18 20:38:47,444 INFO L226 Difference]: Without dead ends: 419 [2021-12-18 20:38:47,444 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-12-18 20:38:47,445 INFO L933 BasicCegarLoop]: 113 mSDtfsCounter, 667 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 667 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-18 20:38:47,445 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [667 Valid, 266 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-12-18 20:38:47,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2021-12-18 20:38:47,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 300. [2021-12-18 20:38:47,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 236 states have (on average 1.7838983050847457) internal successors, (421), 299 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:38:47,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 421 transitions. [2021-12-18 20:38:47,450 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 421 transitions. Word has length 15 [2021-12-18 20:38:47,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:38:47,450 INFO L470 AbstractCegarLoop]: Abstraction has 300 states and 421 transitions. [2021-12-18 20:38:47,450 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:38:47,450 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 421 transitions. [2021-12-18 20:38:47,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-18 20:38:47,450 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:38:47,450 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:38:47,457 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-12-18 20:38:47,657 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 20:38:47,657 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-18 20:38:47,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:38:47,657 INFO L85 PathProgramCache]: Analyzing trace with hash -203231137, now seen corresponding path program 1 times [2021-12-18 20:38:47,658 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 20:38:47,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1182089726] [2021-12-18 20:38:47,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:38:47,658 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 20:38:47,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 20:38:47,659 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 20:38:47,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-12-18 20:38:47,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:38:47,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 23 conjunts are in the unsatisfiable core [2021-12-18 20:38:47,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:38:47,783 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2021-12-18 20:38:47,798 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 20:38:47,798 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2021-12-18 20:38:47,816 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:38:47,822 INFO L388 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 13 treesize of output 9 [2021-12-18 20:38:47,889 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 20:38:47,889 INFO L388 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2021-12-18 20:38:47,893 INFO L388 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 22 treesize of output 24 [2021-12-18 20:38:47,931 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 20:38:47,932 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2021-12-18 20:38:48,029 INFO L388 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 36 treesize of output 36 [2021-12-18 20:38:48,033 INFO L388 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 35 treesize of output 35 [2021-12-18 20:38:48,081 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2021-12-18 20:38:48,086 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2021-12-18 20:38:48,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:38:48,102 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 20:38:48,102 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 20:38:48,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1182089726] [2021-12-18 20:38:48,103 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1182089726] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:38:48,103 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:38:48,103 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-18 20:38:48,103 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098034457] [2021-12-18 20:38:48,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:38:48,103 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-18 20:38:48,103 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 20:38:48,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-18 20:38:48,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2021-12-18 20:38:48,103 INFO L87 Difference]: Start difference. First operand 300 states and 421 transitions. Second operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:38:49,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:38:49,359 INFO L93 Difference]: Finished difference Result 528 states and 743 transitions. [2021-12-18 20:38:49,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-18 20:38:49,359 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-12-18 20:38:49,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:38:49,361 INFO L225 Difference]: With dead ends: 528 [2021-12-18 20:38:49,361 INFO L226 Difference]: Without dead ends: 528 [2021-12-18 20:38:49,361 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2021-12-18 20:38:49,362 INFO L933 BasicCegarLoop]: 119 mSDtfsCounter, 365 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 681 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-12-18 20:38:49,362 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [365 Valid, 673 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 681 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-12-18 20:38:49,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2021-12-18 20:38:49,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 304. [2021-12-18 20:38:49,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 240 states have (on average 1.775) internal successors, (426), 303 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:38:49,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 426 transitions. [2021-12-18 20:38:49,368 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 426 transitions. Word has length 18 [2021-12-18 20:38:49,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:38:49,368 INFO L470 AbstractCegarLoop]: Abstraction has 304 states and 426 transitions. [2021-12-18 20:38:49,368 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:38:49,368 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 426 transitions. [2021-12-18 20:38:49,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-18 20:38:49,368 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:38:49,368 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:38:49,387 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-12-18 20:38:49,569 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 20:38:49,569 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-18 20:38:49,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:38:49,570 INFO L85 PathProgramCache]: Analyzing trace with hash -203231138, now seen corresponding path program 1 times [2021-12-18 20:38:49,570 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 20:38:49,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1084487313] [2021-12-18 20:38:49,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:38:49,571 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 20:38:49,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 20:38:49,588 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 20:38:49,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-12-18 20:38:49,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:38:49,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-18 20:38:49,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:38:49,755 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2021-12-18 20:38:49,772 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 20:38:49,772 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2021-12-18 20:38:49,788 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:38:49,856 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 20:38:49,856 INFO L388 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2021-12-18 20:38:49,885 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 20:38:49,885 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2021-12-18 20:38:49,967 INFO L388 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 30 treesize of output 30 [2021-12-18 20:38:49,994 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2021-12-18 20:38:50,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:38:50,004 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 20:38:50,004 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 20:38:50,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1084487313] [2021-12-18 20:38:50,005 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1084487313] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:38:50,005 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:38:50,005 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-18 20:38:50,005 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637954585] [2021-12-18 20:38:50,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:38:50,005 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-18 20:38:50,005 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 20:38:50,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-18 20:38:50,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2021-12-18 20:38:50,006 INFO L87 Difference]: Start difference. First operand 304 states and 426 transitions. Second operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:38:51,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:38:51,159 INFO L93 Difference]: Finished difference Result 615 states and 857 transitions. [2021-12-18 20:38:51,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-18 20:38:51,159 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-12-18 20:38:51,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:38:51,161 INFO L225 Difference]: With dead ends: 615 [2021-12-18 20:38:51,161 INFO L226 Difference]: Without dead ends: 615 [2021-12-18 20:38:51,161 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=346, Unknown=0, NotChecked=0, Total=462 [2021-12-18 20:38:51,162 INFO L933 BasicCegarLoop]: 179 mSDtfsCounter, 637 mSDsluCounter, 917 mSDsCounter, 0 mSdLazyCounter, 766 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 637 SdHoareTripleChecker+Valid, 1096 SdHoareTripleChecker+Invalid, 813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-12-18 20:38:51,162 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [637 Valid, 1096 Invalid, 813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 766 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-12-18 20:38:51,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2021-12-18 20:38:51,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 303. [2021-12-18 20:38:51,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 240 states have (on average 1.7666666666666666) internal successors, (424), 302 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:38:51,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 424 transitions. [2021-12-18 20:38:51,167 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 424 transitions. Word has length 18 [2021-12-18 20:38:51,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:38:51,167 INFO L470 AbstractCegarLoop]: Abstraction has 303 states and 424 transitions. [2021-12-18 20:38:51,168 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:38:51,168 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 424 transitions. [2021-12-18 20:38:51,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-18 20:38:51,168 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:38:51,168 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:38:51,178 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-12-18 20:38:51,369 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 20:38:51,369 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-18 20:38:51,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:38:51,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1227749363, now seen corresponding path program 1 times [2021-12-18 20:38:51,369 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 20:38:51,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [799414085] [2021-12-18 20:38:51,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:38:51,370 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 20:38:51,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 20:38:51,384 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 20:38:51,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-12-18 20:38:51,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:38:51,457 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-18 20:38:51,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:38:51,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:38:51,483 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 20:38:51,483 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 20:38:51,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [799414085] [2021-12-18 20:38:51,483 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [799414085] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:38:51,483 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:38:51,483 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-18 20:38:51,483 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910970788] [2021-12-18 20:38:51,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:38:51,484 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 20:38:51,484 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 20:38:51,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 20:38:51,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 20:38:51,484 INFO L87 Difference]: Start difference. First operand 303 states and 424 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:38:51,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:38:51,492 INFO L93 Difference]: Finished difference Result 306 states and 427 transitions. [2021-12-18 20:38:51,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 20:38:51,492 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-12-18 20:38:51,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:38:51,493 INFO L225 Difference]: With dead ends: 306 [2021-12-18 20:38:51,493 INFO L226 Difference]: Without dead ends: 306 [2021-12-18 20:38:51,494 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 20:38:51,494 INFO L933 BasicCegarLoop]: 173 mSDtfsCounter, 0 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 20:38:51,494 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 340 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 20:38:51,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2021-12-18 20:38:51,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 306. [2021-12-18 20:38:51,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 243 states have (on average 1.757201646090535) internal successors, (427), 305 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:38:51,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 427 transitions. [2021-12-18 20:38:51,499 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 427 transitions. Word has length 21 [2021-12-18 20:38:51,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:38:51,499 INFO L470 AbstractCegarLoop]: Abstraction has 306 states and 427 transitions. [2021-12-18 20:38:51,499 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:38:51,500 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 427 transitions. [2021-12-18 20:38:51,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-18 20:38:51,501 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:38:51,501 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:38:51,516 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2021-12-18 20:38:51,707 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 20:38:51,708 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-18 20:38:51,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:38:51,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1847606352, now seen corresponding path program 1 times [2021-12-18 20:38:51,709 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 20:38:51,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [216452674] [2021-12-18 20:38:51,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:38:51,709 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 20:38:51,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 20:38:51,710 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 20:38:51,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-12-18 20:38:51,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:38:51,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 21 conjunts are in the unsatisfiable core [2021-12-18 20:38:51,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:38:51,880 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2021-12-18 20:38:51,894 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 20:38:51,895 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2021-12-18 20:38:51,914 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:38:51,967 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 20:38:51,967 INFO L388 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2021-12-18 20:38:52,004 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-18 20:38:52,004 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 26 [2021-12-18 20:38:52,087 INFO L388 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 30 treesize of output 30 [2021-12-18 20:38:52,156 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 20:38:52,157 INFO L388 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2021-12-18 20:38:52,208 INFO L354 Elim1Store]: treesize reduction 40, result has 36.5 percent of original size [2021-12-18 20:38:52,208 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 39 [2021-12-18 20:38:52,235 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2021-12-18 20:38:52,255 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:38:52,255 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 20:38:52,324 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_435 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_435) |c_ULTIMATE.start_main_~tree~0#1.base|) (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (_ bv1 1)))) is different from false [2021-12-18 20:38:52,331 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_435 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0) v_ArrVal_435) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2021-12-18 20:38:52,342 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_434 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_435 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_434))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) v_ArrVal_435)) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2021-12-18 20:38:52,438 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_434 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_433 (_ BitVec 1)) (v_ArrVal_435 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~tmpList~0#1.base_22| (_ BitVec 32))) (let ((.cse0 (store |c_#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_22| v_ArrVal_433)) (.cse1 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (or (not (= (_ bv0 1) (bvadd (select .cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1)) (_ bv1 1)))) (= (_ bv0 1) (bvadd (select .cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~tmpList~0#1.base_22| v_ArrVal_434))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) v_ArrVal_435)) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1)) (_ bv1 1))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_22|)))))) is different from false [2021-12-18 20:38:52,510 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_432 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_434 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_433 (_ BitVec 1)) (v_ArrVal_435 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~tmpList~0#1.base_22| (_ BitVec 32))) (let ((.cse0 (store |c_#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_22| v_ArrVal_433)) (.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_432)) (.cse2 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (or (not (= (_ bv0 1) (bvadd (select .cse0 (select (select .cse1 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2)) (_ bv1 1)))) (= (_ bv0 1) (bvadd (select .cse0 (select (select (let ((.cse3 (store .cse1 |v_ULTIMATE.start_main_~tmpList~0#1.base_22| v_ArrVal_434))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2) v_ArrVal_435)) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2)) (_ bv1 1))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_22|)))))) is different from false [2021-12-18 20:38:52,579 INFO L354 Elim1Store]: treesize reduction 143, result has 32.2 percent of original size [2021-12-18 20:38:52,580 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 222 treesize of output 227 [2021-12-18 20:38:52,645 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_432 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_434 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_435 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~tmpList~0#1.base_22| (_ BitVec 32))) (or (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) v_ArrVal_432))) (= (select (select .cse0 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) (select (select (let ((.cse2 (store .cse0 |v_ULTIMATE.start_main_~tmpList~0#1.base_22| v_ArrVal_434))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) v_ArrVal_435)) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1)))) (= |v_ULTIMATE.start_main_~tmpList~0#1.base_22| |c_ULTIMATE.start_main_~tree~0#1.base|))) is different from false [2021-12-18 20:38:52,665 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:38:52,665 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 50 [2021-12-18 20:38:52,667 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:38:52,668 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 442 treesize of output 352 [2021-12-18 20:38:52,683 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 121 [2021-12-18 20:38:52,685 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 97 [2021-12-18 20:38:52,710 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-12-18 20:38:52,710 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 20:38:52,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [216452674] [2021-12-18 20:38:52,710 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [216452674] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 20:38:52,710 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 20:38:52,710 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 22 [2021-12-18 20:38:52,710 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464734029] [2021-12-18 20:38:52,711 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 20:38:52,711 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-12-18 20:38:52,711 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 20:38:52,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-12-18 20:38:52,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=210, Unknown=6, NotChecked=210, Total=506 [2021-12-18 20:38:52,712 INFO L87 Difference]: Start difference. First operand 306 states and 427 transitions. Second operand has 23 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 23 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:38:52,791 WARN L838 $PredicateComparison]: unable to prove that (and (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32))) |c_ULTIMATE.start_main_~tree~0#1.base|)) (not (= |c_ULTIMATE.start_main_#t~malloc4#1.base| |c_ULTIMATE.start_main_~tree~0#1.base|)) (= (_ bv0 1) (bvadd (select |c_#valid| |c_ULTIMATE.start_main_~tree~0#1.base|) (_ bv1 1))) (forall ((v_ArrVal_432 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_434 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_435 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~tmpList~0#1.base_22| (_ BitVec 32))) (or (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) v_ArrVal_432))) (= (select (select .cse0 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) (select (select (let ((.cse2 (store .cse0 |v_ULTIMATE.start_main_~tmpList~0#1.base_22| v_ArrVal_434))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) v_ArrVal_435)) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1)))) (= |v_ULTIMATE.start_main_~tmpList~0#1.base_22| |c_ULTIMATE.start_main_~tree~0#1.base|)))) is different from false [2021-12-18 20:38:52,795 WARN L838 $PredicateComparison]: unable to prove that (and (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32))) |c_ULTIMATE.start_main_~tree~0#1.base|)) (forall ((v_ArrVal_432 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_434 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_435 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~tmpList~0#1.base_22| (_ BitVec 32))) (or (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) v_ArrVal_432))) (= (select (select .cse0 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) (select (select (let ((.cse2 (store .cse0 |v_ULTIMATE.start_main_~tmpList~0#1.base_22| v_ArrVal_434))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) v_ArrVal_435)) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1)))) (= |v_ULTIMATE.start_main_~tmpList~0#1.base_22| |c_ULTIMATE.start_main_~tree~0#1.base|)))) is different from false [2021-12-18 20:38:54,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:38:54,111 INFO L93 Difference]: Finished difference Result 624 states and 866 transitions. [2021-12-18 20:38:54,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-18 20:38:54,111 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 23 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-12-18 20:38:54,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:38:54,113 INFO L225 Difference]: With dead ends: 624 [2021-12-18 20:38:54,113 INFO L226 Difference]: Without dead ends: 624 [2021-12-18 20:38:54,113 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 11 SemanticMatches, 26 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=110, Invalid=290, Unknown=12, NotChecked=344, Total=756 [2021-12-18 20:38:54,113 INFO L933 BasicCegarLoop]: 178 mSDtfsCounter, 563 mSDsluCounter, 1312 mSDsCounter, 0 mSdLazyCounter, 868 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 563 SdHoareTripleChecker+Valid, 1490 SdHoareTripleChecker+Invalid, 2817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 868 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1917 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-12-18 20:38:54,114 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [563 Valid, 1490 Invalid, 2817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 868 Invalid, 0 Unknown, 1917 Unchecked, 1.2s Time] [2021-12-18 20:38:54,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2021-12-18 20:38:54,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 305. [2021-12-18 20:38:54,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 243 states have (on average 1.7530864197530864) internal successors, (426), 304 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:38:54,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 426 transitions. [2021-12-18 20:38:54,118 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 426 transitions. Word has length 22 [2021-12-18 20:38:54,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:38:54,118 INFO L470 AbstractCegarLoop]: Abstraction has 305 states and 426 transitions. [2021-12-18 20:38:54,119 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 23 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:38:54,119 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 426 transitions. [2021-12-18 20:38:54,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-18 20:38:54,120 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:38:54,121 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:38:54,130 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2021-12-18 20:38:54,323 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 20:38:54,324 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-18 20:38:54,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:38:54,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1847606353, now seen corresponding path program 1 times [2021-12-18 20:38:54,324 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 20:38:54,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1894309877] [2021-12-18 20:38:54,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:38:54,325 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 20:38:54,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 20:38:54,327 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 20:38:54,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-12-18 20:38:54,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:38:54,487 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 31 conjunts are in the unsatisfiable core [2021-12-18 20:38:54,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:38:54,494 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2021-12-18 20:38:54,511 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 20:38:54,511 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2021-12-18 20:38:54,533 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:38:54,538 INFO L388 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 13 treesize of output 9 [2021-12-18 20:38:54,605 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 20:38:54,605 INFO L388 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2021-12-18 20:38:54,608 INFO L388 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 22 treesize of output 24 [2021-12-18 20:38:54,641 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2021-12-18 20:38:54,649 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 20:38:54,649 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2021-12-18 20:38:54,764 INFO L388 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 49 treesize of output 47 [2021-12-18 20:38:54,770 INFO L388 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 35 treesize of output 35 [2021-12-18 20:38:54,874 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 20:38:54,875 INFO L388 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 64 [2021-12-18 20:38:54,878 INFO L388 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 41 treesize of output 41 [2021-12-18 20:38:54,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:38:54,929 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2021-12-18 20:38:54,938 INFO L354 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2021-12-18 20:38:54,938 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2021-12-18 20:38:54,978 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2021-12-18 20:38:54,981 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2021-12-18 20:38:55,002 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:38:55,002 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 20:38:56,480 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-18 20:38:56,480 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 14 [2021-12-18 20:38:57,070 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:38:57,071 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 386 treesize of output 390 [2021-12-18 20:39:24,753 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_25| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_25|))) (and (forall ((v_ArrVal_487 (Array (_ BitVec 32) (_ BitVec 32)))) (or (and (forall ((v_ArrVal_488 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_493 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_490 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_491 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_488)) (.cse2 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (let ((.cse0 (bvadd (select (select (store (store .cse1 |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_ArrVal_491) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_487) |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_ArrVal_490) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2) v_ArrVal_493) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2) (_ bv4 32)))) (or (and (bvule .cse0 (bvadd (select (select .cse1 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2) (_ bv4 32))) (forall ((v_ArrVal_492 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_487)) (.cse4 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (= (select (select .cse3 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse4) (select (select (let ((.cse5 (store .cse3 |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_ArrVal_490))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse4) v_ArrVal_492)) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse4))))) (= (_ bv0 32) .cse0))))) (forall ((v_ArrVal_488 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_493 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_490 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_491 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_492 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_487) |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_ArrVal_490)) (.cse7 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (let ((.cse6 (select (select .cse8 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse7))) (or (= (_ bv0 32) (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_488) |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_ArrVal_491) .cse6 v_ArrVal_493) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse7) (_ bv4 32))) (= (select (select (store .cse8 .cse6 v_ArrVal_492) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse7) |v_ULTIMATE.start_main_~tmpList~0#1.base_25|))))) (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_4 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_488 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_3 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (let ((.cse10 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_488) |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_prenex_5) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_487) |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_prenex_4) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse10) v_prenex_3) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse10)))) (bvule .cse9 (bvadd .cse9 (_ bv4 32)))))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_487) |c_ULTIMATE.start_main_~tree~0#1.base|) (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32))) |v_ULTIMATE.start_main_~tmpList~0#1.base_25|)))) (forall ((v_ArrVal_487 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_487) |c_ULTIMATE.start_main_~tree~0#1.base|) (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32))) |v_ULTIMATE.start_main_~tmpList~0#1.base_25|) (and (forall ((v_ArrVal_488 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_493 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_490 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_491 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_488)) (.cse13 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (let ((.cse11 (bvadd (select (select (store (store .cse12 |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_ArrVal_491) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_487) |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_ArrVal_490) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse13) v_ArrVal_493) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse13) (_ bv4 32)))) (or (and (bvule .cse11 (bvadd (select (select .cse12 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse13) (_ bv4 32))) (forall ((v_ArrVal_492 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse14 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_487)) (.cse15 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (= (select (select .cse14 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse15) (select (select (let ((.cse16 (store .cse14 |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_ArrVal_490))) (store .cse16 (select (select .cse16 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse15) v_ArrVal_492)) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse15)))) (forall ((v_ArrVal_492 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (let ((.cse18 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse17 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_487) |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_ArrVal_490))) (store .cse17 (select (select .cse17 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse18) v_ArrVal_492)) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse18)) |v_ULTIMATE.start_main_~tmpList~0#1.base_25|)))) (= (_ bv0 32) .cse11))))) (forall ((v_ArrVal_488 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_493 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_490 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_491 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_492 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse19 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_487))) (let ((.cse24 (store .cse19 |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_ArrVal_490)) (.cse20 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (let ((.cse23 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_488)) (.cse25 (select (select .cse24 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse20))) (let ((.cse22 (bvadd (select (select (store (store .cse23 |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_ArrVal_491) .cse25 v_ArrVal_493) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse20) (_ bv4 32))) (.cse21 (select (select (store .cse24 .cse25 v_ArrVal_492) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse20))) (or (and (= (select (select .cse19 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse20) .cse21) (bvule .cse22 (bvadd (select (select .cse23 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse20) (_ bv4 32)))) (= (_ bv0 32) .cse22) (= .cse21 |v_ULTIMATE.start_main_~tmpList~0#1.base_25|))))))) (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_4 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_488 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_3 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse26 (let ((.cse27 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_488) |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_prenex_5) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_487) |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_prenex_4) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse27) v_prenex_3) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse27)))) (bvule .cse26 (bvadd .cse26 (_ bv4 32))))))))))) is different from false [2021-12-18 20:39:35,530 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-18 20:39:35,530 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 14 [2021-12-18 20:39:45,338 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_25| (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~tree~0#1.base| |v_ULTIMATE.start_main_~tmpList~0#1.base_25|) (and (forall ((v_ArrVal_487 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0) v_ArrVal_487) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0)) |v_ULTIMATE.start_main_~tmpList~0#1.base_25|)) (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_4 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_488 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_3 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (let ((.cse3 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_488) |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_prenex_5) (select (select (store (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_487) |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_prenex_4) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3) v_prenex_3)) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3)))) (bvule .cse1 (bvadd .cse1 (_ bv4 32))))))) (forall ((v_ArrVal_487 (Array (_ BitVec 32) (_ BitVec 32)))) (or (and (forall ((v_ArrVal_488 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_493 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_490 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_491 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_492 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (let ((.cse11 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse5))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse11 v_ArrVal_487))) (let ((.cse9 (store .cse4 |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_ArrVal_490))) (let ((.cse8 (store |c_#memory_$Pointer$.offset| .cse11 v_ArrVal_488)) (.cse10 (select (select .cse9 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse5))) (let ((.cse7 (bvadd (select (select (store (store .cse8 |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_ArrVal_491) .cse10 v_ArrVal_493) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse5) (_ bv4 32))) (.cse6 (select (select (store .cse9 .cse10 v_ArrVal_492) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse5))) (or (and (= (select (select .cse4 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse5) .cse6) (bvule .cse7 (bvadd (select (select .cse8 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse5) (_ bv4 32)))) (= (_ bv0 32) .cse7) (= .cse6 |v_ULTIMATE.start_main_~tmpList~0#1.base_25|))))))))) (forall ((v_ArrVal_488 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_493 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_490 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_491 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse16 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (let ((.cse20 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse16))) (let ((.cse15 (store |c_#memory_$Pointer$.offset| .cse20 v_ArrVal_488))) (let ((.cse14 (bvadd (select (select (store (store .cse15 |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_ArrVal_491) (select (select (store (store |c_#memory_$Pointer$.base| .cse20 v_ArrVal_487) |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_ArrVal_490) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse16) v_ArrVal_493) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse16) (_ bv4 32)))) (or (and (forall ((v_ArrVal_492 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (let ((.cse13 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse12 (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse13) v_ArrVal_487) |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_ArrVal_490))) (store .cse12 (select (select .cse12 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse13) v_ArrVal_492)) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse13)) |v_ULTIMATE.start_main_~tmpList~0#1.base_25|))) (bvule .cse14 (bvadd (select (select .cse15 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse16) (_ bv4 32))) (forall ((v_ArrVal_492 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse18 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (let ((.cse17 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse18) v_ArrVal_487))) (= (select (select .cse17 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse18) (select (select (let ((.cse19 (store .cse17 |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_ArrVal_490))) (store .cse19 (select (select .cse19 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse18) v_ArrVal_492)) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse18)))))) (= (_ bv0 32) .cse14))))))) (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_4 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_488 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_3 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse21 (let ((.cse23 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse22 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse23))) (store (store (store |c_#memory_$Pointer$.offset| .cse22 v_ArrVal_488) |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_prenex_5) (select (select (store (store |c_#memory_$Pointer$.base| .cse22 v_ArrVal_487) |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_prenex_4) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse23) v_prenex_3)) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse23)))) (bvule .cse21 (bvadd .cse21 (_ bv4 32)))))) (= (let ((.cse24 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse24) v_ArrVal_487) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse24)) |v_ULTIMATE.start_main_~tmpList~0#1.base_25|)))))) is different from false [2021-12-18 20:39:56,570 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:39:56,571 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 740 treesize of output 651 [2021-12-18 20:39:56,612 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:39:56,612 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 651 treesize of output 461 [2021-12-18 20:39:56,638 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:39:56,654 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 1925 treesize of output 1571 [2021-12-18 20:39:56,697 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:39:56,711 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 3490 treesize of output 3160 [2021-12-18 20:39:56,808 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2709 treesize of output 2661 [2021-12-18 20:39:56,828 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2661 treesize of output 2605 [2021-12-18 20:39:56,846 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2605 treesize of output 2337 [2021-12-18 20:39:56,863 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2337 treesize of output 2321 [2021-12-18 20:39:56,880 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2321 treesize of output 2297 [2021-12-18 20:39:56,902 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2297 treesize of output 2249 [2021-12-18 20:39:56,923 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2249 treesize of output 2137 [2021-12-18 20:39:56,941 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2137 treesize of output 2041 [2021-12-18 20:39:56,957 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2041 treesize of output 2017 [2021-12-18 20:39:56,979 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2017 treesize of output 1993 [2021-12-18 20:39:56,996 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1993 treesize of output 1973 [2021-12-18 20:39:57,013 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1973 treesize of output 1925 [2021-12-18 20:39:57,029 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1925 treesize of output 1901 [2021-12-18 20:39:57,048 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 20:39:57,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1894309877] [2021-12-18 20:39:57,049 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-12-18 20:39:57,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [691702100] [2021-12-18 20:39:57,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:39:57,049 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-18 20:39:57,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-18 20:39:57,051 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-18 20:39:57,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Waiting until timeout for monitored process [2021-12-18 20:39:57,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:39:57,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 32 conjunts are in the unsatisfiable core [2021-12-18 20:39:57,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:39:57,302 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2021-12-18 20:39:57,332 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2021-12-18 20:39:57,397 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-18 20:39:57,397 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 27 [2021-12-18 20:39:57,616 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:39:57,645 INFO L388 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 13 treesize of output 9 [2021-12-18 20:39:58,183 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 20:39:58,184 INFO L388 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 57 [2021-12-18 20:39:58,192 INFO L388 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 22 treesize of output 24 [2021-12-18 20:39:58,429 INFO L354 Elim1Store]: treesize reduction 23, result has 47.7 percent of original size [2021-12-18 20:39:58,429 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 18 treesize of output 30 [2021-12-18 20:39:58,545 INFO L354 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2021-12-18 20:39:58,546 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 31 [2021-12-18 20:39:59,505 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2021-12-18 20:39:59,518 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-18 20:40:00,549 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 20:40:00,550 INFO L388 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 56 [2021-12-18 20:40:00,561 INFO L388 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 22 treesize of output 24 [2021-12-18 20:40:00,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:40:00,840 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-18 20:40:00,872 INFO L354 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2021-12-18 20:40:00,872 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2021-12-18 20:40:00,906 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-18 20:40:00,914 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2021-12-18 20:40:01,521 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:40:01,521 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 20:40:03,901 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-18 20:40:03,902 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 14 [2021-12-18 20:40:04,018 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_24| (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_#t~mem11#1.base| |v_ULTIMATE.start_main_~tmpList~0#1.base_24|) (and (forall ((v_ArrVal_553 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_553) |c_ULTIMATE.start_main_~tree~0#1.base|) (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32))))) (bvule .cse0 (bvadd .cse0 (_ bv4 32))))) (forall ((v_ArrVal_552 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_553 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_495 (_ BitVec 32))) (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_553) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) (_ bv4 32)) (select (store |c_#length| |v_ULTIMATE.start_main_~tmpList~0#1.base_24| v_ArrVal_495) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_552) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1)))))))) is different from false [2021-12-18 20:40:04,095 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_24| (_ BitVec 32))) (or (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32))) |v_ULTIMATE.start_main_~tmpList~0#1.base_24|) (and (forall ((v_ArrVal_553 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) v_ArrVal_553) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1)))) (bvule .cse0 (bvadd .cse0 (_ bv4 32))))) (forall ((v_ArrVal_552 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_553 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_495 (_ BitVec 32))) (let ((.cse3 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_553) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3) (_ bv4 32)) (select (store |c_#length| |v_ULTIMATE.start_main_~tmpList~0#1.base_24| v_ArrVal_495) (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_552) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3))))))))) is different from false [2021-12-18 20:40:04,261 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_551 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~tmpList~0#1.base_24| (_ BitVec 32))) (or (and (forall ((v_ArrVal_553 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_550 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_550) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_551) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) v_ArrVal_553) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1)))) (bvule .cse0 (bvadd .cse0 (_ bv4 32))))) (forall ((v_ArrVal_552 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_553 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_550 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_495 (_ BitVec 32))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_551)) (.cse3 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_550) .cse2 v_ArrVal_553) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3) (_ bv4 32)) (select (store |c_#length| |v_ULTIMATE.start_main_~tmpList~0#1.base_24| v_ArrVal_495) (select (select (store .cse4 .cse2 v_ArrVal_552) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3))))))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_551) |c_ULTIMATE.start_main_~tree~0#1.base|) (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32))) |v_ULTIMATE.start_main_~tmpList~0#1.base_24|))) is different from false [2021-12-18 20:40:04,741 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_27| (_ BitVec 32)) (v_ArrVal_551 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~tmpList~0#1.base_24| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_27|))) (and (forall ((v_ArrVal_552 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_553 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_549 (_ BitVec 32)) (v_ArrVal_550 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_495 (_ BitVec 32))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~tmpList~0#1.base_27| v_ArrVal_551)) (.cse1 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~tmpList~0#1.base_27| v_ArrVal_550) .cse0 v_ArrVal_553) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) (_ bv4 32)) (select (store (store |c_#length| |v_ULTIMATE.start_main_~tmpList~0#1.base_27| v_ArrVal_549) |v_ULTIMATE.start_main_~tmpList~0#1.base_24| v_ArrVal_495) (select (select (store .cse2 .cse0 v_ArrVal_552) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1)))))) (forall ((v_ArrVal_553 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_550 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (let ((.cse4 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (select (select (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~tmpList~0#1.base_27| v_ArrVal_550) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~tmpList~0#1.base_27| v_ArrVal_551) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse4) v_ArrVal_553) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse4)))) (bvule .cse3 (bvadd .cse3 (_ bv4 32)))))) (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~tmpList~0#1.base_27| v_ArrVal_551) |c_ULTIMATE.start_main_~tree~0#1.base|) (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32))) |v_ULTIMATE.start_main_~tmpList~0#1.base_24|))) is different from false [2021-12-18 20:40:05,335 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_27| (_ BitVec 32)) (v_ArrVal_551 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~tmpList~0#1.base_24| (_ BitVec 32)) (v_ArrVal_548 (Array (_ BitVec 32) (_ BitVec 32)))) (or (and (forall ((v_ArrVal_553 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_550 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_547 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_547) |v_ULTIMATE.start_main_~tmpList~0#1.base_27| v_ArrVal_550) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_548) |v_ULTIMATE.start_main_~tmpList~0#1.base_27| v_ArrVal_551) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) v_ArrVal_553) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1)))) (bvule .cse0 (bvadd .cse0 (_ bv4 32))))) (forall ((v_ArrVal_552 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_553 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_549 (_ BitVec 32)) (v_ArrVal_550 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_495 (_ BitVec 32)) (v_ArrVal_547 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_548) |v_ULTIMATE.start_main_~tmpList~0#1.base_27| v_ArrVal_551)) (.cse3 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_547) |v_ULTIMATE.start_main_~tmpList~0#1.base_27| v_ArrVal_550) .cse2 v_ArrVal_553) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3) (_ bv4 32)) (select (store (store |c_#length| |v_ULTIMATE.start_main_~tmpList~0#1.base_27| v_ArrVal_549) |v_ULTIMATE.start_main_~tmpList~0#1.base_24| v_ArrVal_495) (select (select (store .cse4 .cse2 v_ArrVal_552) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_27|))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_548) |v_ULTIMATE.start_main_~tmpList~0#1.base_27| v_ArrVal_551) |c_ULTIMATE.start_main_~tree~0#1.base|) (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32))) |v_ULTIMATE.start_main_~tmpList~0#1.base_24|))) is different from false [2021-12-18 20:40:07,733 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:40:07,733 INFO L388 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 207 treesize of output 188 [2021-12-18 20:40:07,761 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:40:07,761 INFO L388 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 213 treesize of output 163 [2021-12-18 20:40:07,765 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:40:07,769 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 751 treesize of output 661 [2021-12-18 20:40:07,791 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:40:07,797 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2431 treesize of output 2293 [2021-12-18 20:40:07,828 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2293 treesize of output 2049 [2021-12-18 20:40:07,862 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2025 treesize of output 1897 [2021-12-18 20:40:07,880 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1897 treesize of output 1833 [2021-12-18 20:40:07,905 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1833 treesize of output 1705 [2021-12-18 20:40:07,917 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1705 treesize of output 1681 [2021-12-18 20:40:07,941 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1681 treesize of output 1633 [2021-12-18 20:40:07,961 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-12-18 20:40:07,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [415457356] [2021-12-18 20:40:07,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:40:07,975 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:40:07,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 20:40:07,987 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 20:40:08,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-12-18 20:40:08,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:40:08,136 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 29 conjunts are in the unsatisfiable core [2021-12-18 20:40:08,140 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:40:08,149 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2021-12-18 20:40:08,202 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 20:40:08,202 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2021-12-18 20:40:08,220 INFO L388 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 13 treesize of output 9 [2021-12-18 20:40:08,233 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:40:08,385 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 20:40:08,385 INFO L388 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2021-12-18 20:40:08,396 INFO L388 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 22 treesize of output 24 [2021-12-18 20:40:08,465 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 20:40:08,466 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2021-12-18 20:40:08,591 INFO L388 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 49 treesize of output 47 [2021-12-18 20:40:08,599 INFO L388 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 35 treesize of output 35 [2021-12-18 20:40:09,186 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 20:40:09,186 INFO L388 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 64 [2021-12-18 20:40:09,220 INFO L388 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 41 treesize of output 41 [2021-12-18 20:40:09,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:40:09,391 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2021-12-18 20:40:09,419 INFO L354 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2021-12-18 20:40:09,419 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2021-12-18 20:40:09,437 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2021-12-18 20:40:09,466 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2021-12-18 20:40:09,480 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:40:09,480 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 20:40:09,920 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_24| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_24|))) (and (forall ((v_ArrVal_608 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_609 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_495 (_ BitVec 32))) (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_609) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0) (_ bv4 32)) (select (store |c_#length| |v_ULTIMATE.start_main_~tmpList~0#1.base_24| v_ArrVal_495) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_608) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0))))) (forall ((v_ArrVal_609 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_609) |c_ULTIMATE.start_main_~tree~0#1.base|) (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32))))) (bvule .cse1 (bvadd .cse1 (_ bv4 32)))))))) is different from false [2021-12-18 20:40:18,032 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:40:18,033 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 184 treesize of output 188 [2021-12-18 20:40:18,059 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-18 20:40:18,059 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 14 [2021-12-18 20:40:19,105 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_738 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_737 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_736 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_737) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_738) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) v_prenex_736) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1)))) (bvule .cse0 (bvadd .cse0 (_ bv4 32))))) (forall ((v_ArrVal_609 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_606 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_607 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (let ((.cse7 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_606) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_607) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse7) v_ArrVal_609) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse7)) (_ bv4 32)))) (or (= (_ bv0 32) .cse2) (and (forall ((v_ArrVal_608 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_#t~mem9#1.base| (let ((.cse4 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_607))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse4) v_ArrVal_608)) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse4)))) (forall ((v_ArrVal_608 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse6 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_607))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse6) v_ArrVal_608)) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse6)) |c_ULTIMATE.start_main_#t~mem9#1.base|)) (bvule .cse2 (bvadd |c_ULTIMATE.start_main_#t~mem9#1.offset| (_ bv4 32)))))))) is different from false [2021-12-18 20:40:19,290 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_738 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_737 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_736 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_737) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_738) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) v_prenex_736) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1)))) (bvule .cse0 (bvadd .cse0 (_ bv4 32))))) (forall ((v_ArrVal_609 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_606 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_607 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (let ((.cse2 (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_606) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_607) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse5) v_ArrVal_609) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse5) (_ bv4 32)))) (or (= (_ bv0 32) .cse2) (and (forall ((v_ArrVal_608 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (= (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_607))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse4) v_ArrVal_608)) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse4) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse4)))) (bvule .cse2 (bvadd (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse5) (_ bv4 32))) (forall ((v_ArrVal_608 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse6) (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_607))) (store .cse7 (select (select .cse7 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse6) v_ArrVal_608)) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse6)))))))))) is different from false [2021-12-18 20:40:36,808 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_29| (_ BitVec 32))) (or (and (forall ((v_ArrVal_604 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_605 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_738 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_737 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_736 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse2 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_604) |v_ULTIMATE.start_main_~tmpList~0#1.base_29| v_prenex_737) (select (select (store (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_605) |v_ULTIMATE.start_main_~tmpList~0#1.base_29| v_prenex_738) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2) v_prenex_736)) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2)))) (bvule .cse0 (bvadd .cse0 (_ bv4 32))))) (forall ((v_ArrVal_609 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_604 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_605 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_606 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_607 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (let ((.cse12 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse5))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| .cse12 v_ArrVal_604))) (let ((.cse3 (bvadd (select (select (store (store .cse4 |v_ULTIMATE.start_main_~tmpList~0#1.base_29| v_ArrVal_606) (select (select (store (store |c_#memory_$Pointer$.base| .cse12 v_ArrVal_605) |v_ULTIMATE.start_main_~tmpList~0#1.base_29| v_ArrVal_607) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse5) v_ArrVal_609) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse5) (_ bv4 32)))) (or (= (_ bv0 32) .cse3) (and (bvule .cse3 (bvadd (select (select .cse4 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse5) (_ bv4 32))) (forall ((v_ArrVal_608 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (let ((.cse8 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse7) v_ArrVal_605))) (= (select (select (let ((.cse6 (store .cse8 |v_ULTIMATE.start_main_~tmpList~0#1.base_29| v_ArrVal_607))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse7) v_ArrVal_608)) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse7) (select (select .cse8 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse7))))) (forall ((v_ArrVal_608 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (let ((.cse9 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse10) v_ArrVal_605))) (= (select (select .cse9 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse10) (select (select (let ((.cse11 (store .cse9 |v_ULTIMATE.start_main_~tmpList~0#1.base_29| v_ArrVal_607))) (store .cse11 (select (select .cse11 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse10) v_ArrVal_608)) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse10))))))))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_29|))))) is different from false [2021-12-18 20:40:37,729 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:40:37,729 INFO L388 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 365 treesize of output 326 [2021-12-18 20:40:37,807 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:40:37,807 INFO L388 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 326 treesize of output 236 [2021-12-18 20:40:37,811 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:40:37,819 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1341 treesize of output 1047 [2021-12-18 20:40:37,854 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:40:37,860 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1582 treesize of output 1468 [2021-12-18 20:40:37,890 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-18 20:40:37,890 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 14 [2021-12-18 20:40:37,933 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 663 treesize of output 551 [2021-12-18 20:40:37,946 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 618 treesize of output 562 [2021-12-18 20:40:37,954 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 562 treesize of output 514 [2021-12-18 20:40:37,964 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 404 treesize of output 388 [2021-12-18 20:40:37,973 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 388 treesize of output 380 [2021-12-18 20:40:38,210 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 78 [2021-12-18 20:40:38,217 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 158 treesize of output 126 [2021-12-18 20:40:38,223 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 110 [2021-12-18 20:40:38,824 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2021-12-18 20:40:38,824 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [415457356] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 20:40:38,824 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 20:40:38,824 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 24 [2021-12-18 20:40:38,824 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29017475] [2021-12-18 20:40:38,824 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 20:40:38,824 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-12-18 20:40:38,824 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 20:40:38,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-12-18 20:40:38,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=1215, Unknown=92, NotChecked=924, Total=2450 [2021-12-18 20:40:38,825 INFO L87 Difference]: Start difference. First operand 305 states and 426 transitions. Second operand has 25 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 25 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:40:39,640 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse13 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (and (forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_29| (_ BitVec 32))) (or (and (forall ((v_ArrVal_604 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_605 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_738 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_737 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_736 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse2 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_604) |v_ULTIMATE.start_main_~tmpList~0#1.base_29| v_prenex_737) (select (select (store (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_605) |v_ULTIMATE.start_main_~tmpList~0#1.base_29| v_prenex_738) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2) v_prenex_736)) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2)))) (bvule .cse0 (bvadd .cse0 (_ bv4 32))))) (forall ((v_ArrVal_609 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_604 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_605 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_606 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_607 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (let ((.cse12 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse5))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| .cse12 v_ArrVal_604))) (let ((.cse3 (bvadd (select (select (store (store .cse4 |v_ULTIMATE.start_main_~tmpList~0#1.base_29| v_ArrVal_606) (select (select (store (store |c_#memory_$Pointer$.base| .cse12 v_ArrVal_605) |v_ULTIMATE.start_main_~tmpList~0#1.base_29| v_ArrVal_607) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse5) v_ArrVal_609) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse5) (_ bv4 32)))) (or (= (_ bv0 32) .cse3) (and (bvule .cse3 (bvadd (select (select .cse4 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse5) (_ bv4 32))) (forall ((v_ArrVal_608 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (let ((.cse8 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse7) v_ArrVal_605))) (= (select (select (let ((.cse6 (store .cse8 |v_ULTIMATE.start_main_~tmpList~0#1.base_29| v_ArrVal_607))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse7) v_ArrVal_608)) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse7) (select (select .cse8 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse7))))) (forall ((v_ArrVal_608 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (let ((.cse9 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse10) v_ArrVal_605))) (= (select (select .cse9 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse10) (select (select (let ((.cse11 (store .cse9 |v_ULTIMATE.start_main_~tmpList~0#1.base_29| v_ArrVal_607))) (store .cse11 (select (select .cse11 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse10) v_ArrVal_608)) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse10))))))))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_29|))))) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse13) |c_ULTIMATE.start_main_~tree~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse13) (_ bv0 32)) (not (= |c_ULTIMATE.start_main_#t~malloc4#1.base| |c_ULTIMATE.start_main_~tree~0#1.base|)) (= (_ bv0 1) (bvadd (select |c_#valid| |c_ULTIMATE.start_main_~tree~0#1.base|) (_ bv1 1))) (= (_ bv0 32) |c_ULTIMATE.start_main_#t~malloc4#1.offset|))) is different from false [2021-12-18 20:40:52,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:40:52,376 INFO L93 Difference]: Finished difference Result 721 states and 991 transitions. [2021-12-18 20:40:52,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-18 20:40:52,377 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 25 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-12-18 20:40:52,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:40:52,379 INFO L225 Difference]: With dead ends: 721 [2021-12-18 20:40:52,379 INFO L226 Difference]: Without dead ends: 721 [2021-12-18 20:40:52,379 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 59 SyntacticMatches, 11 SemanticMatches, 56 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 867 ImplicationChecksByTransitivity, 45.5s TimeCoverageRelationStatistics Valid=318, Invalid=1704, Unknown=96, NotChecked=1188, Total=3306 [2021-12-18 20:40:52,380 INFO L933 BasicCegarLoop]: 148 mSDtfsCounter, 543 mSDsluCounter, 1682 mSDsCounter, 0 mSdLazyCounter, 1463 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 543 SdHoareTripleChecker+Valid, 1830 SdHoareTripleChecker+Invalid, 3365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1869 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2021-12-18 20:40:52,380 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [543 Valid, 1830 Invalid, 3365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1463 Invalid, 0 Unknown, 1869 Unchecked, 6.9s Time] [2021-12-18 20:40:52,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2021-12-18 20:40:52,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 309. [2021-12-18 20:40:52,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 247 states have (on average 1.7449392712550607) internal successors, (431), 308 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:40:52,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 431 transitions. [2021-12-18 20:40:52,405 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 431 transitions. Word has length 22 [2021-12-18 20:40:52,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:40:52,405 INFO L470 AbstractCegarLoop]: Abstraction has 309 states and 431 transitions. [2021-12-18 20:40:52,405 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 25 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:40:52,405 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 431 transitions. [2021-12-18 20:40:52,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-18 20:40:52,409 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:40:52,409 INFO L514 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] [2021-12-18 20:40:52,417 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2021-12-18 20:40:52,613 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Forceful destruction successful, exit code 0 [2021-12-18 20:40:52,828 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2021-12-18 20:40:53,010 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:40:53,010 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-18 20:40:53,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:40:53,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1366383817, now seen corresponding path program 1 times [2021-12-18 20:40:53,011 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 20:40:53,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1135339231] [2021-12-18 20:40:53,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:40:53,011 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 20:40:53,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 20:40:53,013 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 20:40:53,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2021-12-18 20:40:53,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:40:53,096 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-18 20:40:53,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:40:53,130 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:40:53,130 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 20:40:53,130 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 20:40:53,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1135339231] [2021-12-18 20:40:53,131 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1135339231] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:40:53,131 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:40:53,131 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-18 20:40:53,131 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114065633] [2021-12-18 20:40:53,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:40:53,131 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 20:40:53,131 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 20:40:53,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 20:40:53,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 20:40:53,131 INFO L87 Difference]: Start difference. First operand 309 states and 431 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:40:53,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:40:53,147 INFO L93 Difference]: Finished difference Result 312 states and 434 transitions. [2021-12-18 20:40:53,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 20:40:53,148 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-12-18 20:40:53,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:40:53,148 INFO L225 Difference]: With dead ends: 312 [2021-12-18 20:40:53,148 INFO L226 Difference]: Without dead ends: 312 [2021-12-18 20:40:53,149 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 20:40:53,149 INFO L933 BasicCegarLoop]: 172 mSDtfsCounter, 0 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 20:40:53,149 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 338 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 20:40:53,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2021-12-18 20:40:53,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 312. [2021-12-18 20:40:53,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 250 states have (on average 1.736) internal successors, (434), 311 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:40:53,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 434 transitions. [2021-12-18 20:40:53,152 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 434 transitions. Word has length 22 [2021-12-18 20:40:53,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:40:53,153 INFO L470 AbstractCegarLoop]: Abstraction has 312 states and 434 transitions. [2021-12-18 20:40:53,153 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:40:53,153 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 434 transitions. [2021-12-18 20:40:53,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-18 20:40:53,153 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:40:53,153 INFO L514 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] [2021-12-18 20:40:53,164 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2021-12-18 20:40:53,360 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 20:40:53,360 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-18 20:40:53,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:40:53,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1198957394, now seen corresponding path program 1 times [2021-12-18 20:40:53,361 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 20:40:53,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [472355833] [2021-12-18 20:40:53,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:40:53,361 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 20:40:53,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 20:40:53,362 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 20:40:53,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2021-12-18 20:40:53,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:40:53,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-18 20:40:53,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:40:53,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:40:53,541 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 20:40:53,541 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 20:40:53,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [472355833] [2021-12-18 20:40:53,541 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [472355833] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:40:53,542 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:40:53,542 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-18 20:40:53,542 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21122229] [2021-12-18 20:40:53,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:40:53,542 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 20:40:53,542 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 20:40:53,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 20:40:53,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 20:40:53,542 INFO L87 Difference]: Start difference. First operand 312 states and 434 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:40:53,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:40:53,603 INFO L93 Difference]: Finished difference Result 347 states and 450 transitions. [2021-12-18 20:40:53,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 20:40:53,604 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-12-18 20:40:53,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:40:53,604 INFO L225 Difference]: With dead ends: 347 [2021-12-18 20:40:53,604 INFO L226 Difference]: Without dead ends: 347 [2021-12-18 20:40:53,605 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 20:40:53,605 INFO L933 BasicCegarLoop]: 176 mSDtfsCounter, 52 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 20:40:53,605 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 335 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 20:40:53,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2021-12-18 20:40:53,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 295. [2021-12-18 20:40:53,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 233 states have (on average 1.7124463519313304) internal successors, (399), 294 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:40:53,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 399 transitions. [2021-12-18 20:40:53,608 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 399 transitions. Word has length 23 [2021-12-18 20:40:53,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:40:53,609 INFO L470 AbstractCegarLoop]: Abstraction has 295 states and 399 transitions. [2021-12-18 20:40:53,609 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:40:53,609 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 399 transitions. [2021-12-18 20:40:53,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-18 20:40:53,609 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:40:53,609 INFO L514 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] [2021-12-18 20:40:53,619 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2021-12-18 20:40:53,810 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 20:40:53,811 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-18 20:40:53,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:40:53,811 INFO L85 PathProgramCache]: Analyzing trace with hash -634715490, now seen corresponding path program 1 times [2021-12-18 20:40:53,811 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 20:40:53,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1982931462] [2021-12-18 20:40:53,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:40:53,811 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 20:40:53,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 20:40:53,827 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 20:40:53,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2021-12-18 20:40:53,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:40:53,935 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-18 20:40:53,936 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:40:53,963 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2021-12-18 20:40:53,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:40:53,983 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 20:40:53,983 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 20:40:53,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1982931462] [2021-12-18 20:40:53,984 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1982931462] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:40:53,984 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:40:53,984 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-18 20:40:53,984 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070095193] [2021-12-18 20:40:53,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:40:53,984 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 20:40:53,984 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 20:40:53,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 20:40:53,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 20:40:53,984 INFO L87 Difference]: Start difference. First operand 295 states and 399 transitions. Second operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:40:54,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:40:54,512 INFO L93 Difference]: Finished difference Result 477 states and 661 transitions. [2021-12-18 20:40:54,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 20:40:54,513 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-12-18 20:40:54,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:40:54,521 INFO L225 Difference]: With dead ends: 477 [2021-12-18 20:40:54,522 INFO L226 Difference]: Without dead ends: 477 [2021-12-18 20:40:54,522 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 20:40:54,522 INFO L933 BasicCegarLoop]: 207 mSDtfsCounter, 122 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-18 20:40:54,522 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [122 Valid, 285 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-18 20:40:54,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2021-12-18 20:40:54,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 290. [2021-12-18 20:40:54,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 233 states have (on average 1.6909871244635193) internal successors, (394), 289 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:40:54,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 394 transitions. [2021-12-18 20:40:54,529 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 394 transitions. Word has length 23 [2021-12-18 20:40:54,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:40:54,529 INFO L470 AbstractCegarLoop]: Abstraction has 290 states and 394 transitions. [2021-12-18 20:40:54,529 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:40:54,529 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 394 transitions. [2021-12-18 20:40:54,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-18 20:40:54,530 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:40:54,530 INFO L514 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] [2021-12-18 20:40:54,540 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2021-12-18 20:40:54,736 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 20:40:54,737 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-18 20:40:54,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:40:54,737 INFO L85 PathProgramCache]: Analyzing trace with hash -634715489, now seen corresponding path program 1 times [2021-12-18 20:40:54,737 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 20:40:54,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [735764001] [2021-12-18 20:40:54,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:40:54,738 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 20:40:54,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 20:40:54,739 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 20:40:54,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2021-12-18 20:40:54,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:40:54,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-18 20:40:54,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:40:54,863 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2021-12-18 20:40:54,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:40:54,900 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 20:40:54,900 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 20:40:54,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [735764001] [2021-12-18 20:40:54,900 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [735764001] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:40:54,900 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:40:54,900 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-18 20:40:54,900 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818211494] [2021-12-18 20:40:54,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:40:54,900 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 20:40:54,900 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 20:40:54,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 20:40:54,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 20:40:54,901 INFO L87 Difference]: Start difference. First operand 290 states and 394 transitions. Second operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:40:55,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:40:55,381 INFO L93 Difference]: Finished difference Result 288 states and 392 transitions. [2021-12-18 20:40:55,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 20:40:55,382 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-12-18 20:40:55,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:40:55,383 INFO L225 Difference]: With dead ends: 288 [2021-12-18 20:40:55,383 INFO L226 Difference]: Without dead ends: 288 [2021-12-18 20:40:55,383 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 20:40:55,383 INFO L933 BasicCegarLoop]: 159 mSDtfsCounter, 5 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-18 20:40:55,383 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 236 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-18 20:40:55,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2021-12-18 20:40:55,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2021-12-18 20:40:55,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 233 states have (on average 1.6824034334763949) internal successors, (392), 287 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:40:55,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 392 transitions. [2021-12-18 20:40:55,386 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 392 transitions. Word has length 23 [2021-12-18 20:40:55,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:40:55,387 INFO L470 AbstractCegarLoop]: Abstraction has 288 states and 392 transitions. [2021-12-18 20:40:55,387 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:40:55,387 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 392 transitions. [2021-12-18 20:40:55,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-18 20:40:55,387 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:40:55,387 INFO L514 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] [2021-12-18 20:40:55,401 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Ended with exit code 0 [2021-12-18 20:40:55,587 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 20:40:55,587 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-18 20:40:55,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:40:55,588 INFO L85 PathProgramCache]: Analyzing trace with hash -23631227, now seen corresponding path program 1 times [2021-12-18 20:40:55,588 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 20:40:55,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [929310851] [2021-12-18 20:40:55,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:40:55,588 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 20:40:55,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 20:40:55,589 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 20:40:55,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2021-12-18 20:40:55,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:40:55,730 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 27 conjunts are in the unsatisfiable core [2021-12-18 20:40:55,731 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:40:55,741 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2021-12-18 20:40:55,765 INFO L388 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 11 treesize of output 7 [2021-12-18 20:40:55,775 INFO L388 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 11 treesize of output 7 [2021-12-18 20:40:55,833 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-18 20:40:55,833 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2021-12-18 20:40:55,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:40:55,848 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-18 20:40:55,875 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 20:40:55,876 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2021-12-18 20:40:55,948 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-18 20:40:55,949 INFO L388 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 1 case distinctions, treesize of input 21 treesize of output 20 [2021-12-18 20:40:55,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:40:55,967 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-18 20:40:56,170 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 20:40:56,171 INFO L388 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2021-12-18 20:40:56,178 INFO L388 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 20 treesize of output 22 [2021-12-18 20:40:56,398 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-18 20:40:56,407 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-18 20:40:56,407 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 11 [2021-12-18 20:40:56,548 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:40:56,548 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 20:40:56,548 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 20:40:56,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [929310851] [2021-12-18 20:40:56,548 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [929310851] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:40:56,548 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:40:56,548 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-18 20:40:56,548 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041472725] [2021-12-18 20:40:56,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:40:56,549 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-18 20:40:56,549 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 20:40:56,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-18 20:40:56,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-12-18 20:40:56,549 INFO L87 Difference]: Start difference. First operand 288 states and 392 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:41:00,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:41:00,345 INFO L93 Difference]: Finished difference Result 567 states and 740 transitions. [2021-12-18 20:41:00,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-18 20:41:00,345 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-12-18 20:41:00,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:41:00,347 INFO L225 Difference]: With dead ends: 567 [2021-12-18 20:41:00,347 INFO L226 Difference]: Without dead ends: 567 [2021-12-18 20:41:00,347 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=92, Invalid=288, Unknown=0, NotChecked=0, Total=380 [2021-12-18 20:41:00,348 INFO L933 BasicCegarLoop]: 118 mSDtfsCounter, 440 mSDsluCounter, 756 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 874 SdHoareTripleChecker+Invalid, 789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2021-12-18 20:41:00,348 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [440 Valid, 874 Invalid, 789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 753 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2021-12-18 20:41:00,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2021-12-18 20:41:00,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 326. [2021-12-18 20:41:00,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 271 states have (on average 1.6531365313653137) internal successors, (448), 325 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:41:00,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 448 transitions. [2021-12-18 20:41:00,353 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 448 transitions. Word has length 24 [2021-12-18 20:41:00,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:41:00,355 INFO L470 AbstractCegarLoop]: Abstraction has 326 states and 448 transitions. [2021-12-18 20:41:00,356 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:41:00,356 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 448 transitions. [2021-12-18 20:41:00,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-18 20:41:00,356 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:41:00,356 INFO L514 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] [2021-12-18 20:41:00,363 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2021-12-18 20:41:00,563 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 20:41:00,563 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-18 20:41:00,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:41:00,563 INFO L85 PathProgramCache]: Analyzing trace with hash -228421332, now seen corresponding path program 1 times [2021-12-18 20:41:00,563 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 20:41:00,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1866561406] [2021-12-18 20:41:00,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:41:00,564 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 20:41:00,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 20:41:00,565 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 20:41:00,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2021-12-18 20:41:00,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:41:00,678 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 27 conjunts are in the unsatisfiable core [2021-12-18 20:41:00,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:41:00,689 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2021-12-18 20:41:00,706 INFO L388 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 11 treesize of output 7 [2021-12-18 20:41:00,719 INFO L388 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 11 treesize of output 7 [2021-12-18 20:41:00,785 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-18 20:41:00,786 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2021-12-18 20:41:00,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:41:00,800 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-18 20:41:00,831 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 20:41:00,831 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2021-12-18 20:41:00,893 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-18 20:41:00,894 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2021-12-18 20:41:00,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:41:00,905 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-18 20:41:01,073 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 20:41:01,073 INFO L388 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2021-12-18 20:41:01,079 INFO L388 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 20 treesize of output 22 [2021-12-18 20:41:01,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:41:01,242 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 11 [2021-12-18 20:41:01,247 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-18 20:41:01,344 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:41:01,345 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 20:41:01,345 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 20:41:01,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1866561406] [2021-12-18 20:41:01,345 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1866561406] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:41:01,345 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:41:01,345 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-18 20:41:01,345 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622542803] [2021-12-18 20:41:01,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:41:01,345 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-18 20:41:01,345 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 20:41:01,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-18 20:41:01,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-12-18 20:41:01,346 INFO L87 Difference]: Start difference. First operand 326 states and 448 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:41:05,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:41:05,270 INFO L93 Difference]: Finished difference Result 531 states and 696 transitions. [2021-12-18 20:41:05,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-18 20:41:05,272 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-12-18 20:41:05,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:41:05,273 INFO L225 Difference]: With dead ends: 531 [2021-12-18 20:41:05,273 INFO L226 Difference]: Without dead ends: 531 [2021-12-18 20:41:05,274 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2021-12-18 20:41:05,274 INFO L933 BasicCegarLoop]: 117 mSDtfsCounter, 427 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2021-12-18 20:41:05,274 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [427 Valid, 817 Invalid, 756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 715 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2021-12-18 20:41:05,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2021-12-18 20:41:05,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 303. [2021-12-18 20:41:05,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 248 states have (on average 1.653225806451613) internal successors, (410), 302 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:41:05,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 410 transitions. [2021-12-18 20:41:05,278 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 410 transitions. Word has length 24 [2021-12-18 20:41:05,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:41:05,278 INFO L470 AbstractCegarLoop]: Abstraction has 303 states and 410 transitions. [2021-12-18 20:41:05,278 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:41:05,278 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 410 transitions. [2021-12-18 20:41:05,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-18 20:41:05,278 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:41:05,278 INFO L514 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] [2021-12-18 20:41:05,297 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2021-12-18 20:41:05,487 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 20:41:05,487 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-18 20:41:05,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:41:05,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1146286443, now seen corresponding path program 1 times [2021-12-18 20:41:05,488 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 20:41:05,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [800508232] [2021-12-18 20:41:05,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:41:05,489 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 20:41:05,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 20:41:05,490 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 20:41:05,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2021-12-18 20:41:05,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:41:05,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-18 20:41:05,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:41:05,635 INFO L354 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2021-12-18 20:41:05,635 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 21 [2021-12-18 20:41:05,748 INFO L354 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2021-12-18 20:41:05,748 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 30 treesize of output 47 [2021-12-18 20:41:05,886 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:41:06,271 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 20:41:06,271 INFO L388 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 56 [2021-12-18 20:41:07,215 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 30 [2021-12-18 20:41:07,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:41:07,378 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 20:41:07,378 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 20:41:07,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [800508232] [2021-12-18 20:41:07,378 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [800508232] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:41:07,378 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:41:07,378 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-18 20:41:07,378 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386304416] [2021-12-18 20:41:07,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:41:07,379 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-18 20:41:07,379 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 20:41:07,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-18 20:41:07,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-12-18 20:41:07,379 INFO L87 Difference]: Start difference. First operand 303 states and 410 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:41:10,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:41:10,785 INFO L93 Difference]: Finished difference Result 491 states and 655 transitions. [2021-12-18 20:41:10,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-18 20:41:10,785 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-12-18 20:41:10,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:41:10,787 INFO L225 Difference]: With dead ends: 491 [2021-12-18 20:41:10,787 INFO L226 Difference]: Without dead ends: 491 [2021-12-18 20:41:10,787 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2021-12-18 20:41:10,787 INFO L933 BasicCegarLoop]: 112 mSDtfsCounter, 548 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 125 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2021-12-18 20:41:10,788 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [548 Valid, 595 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 479 Invalid, 0 Unknown, 125 Unchecked, 2.4s Time] [2021-12-18 20:41:10,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2021-12-18 20:41:10,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 310. [2021-12-18 20:41:10,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 255 states have (on average 1.6431372549019607) internal successors, (419), 309 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:41:10,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 419 transitions. [2021-12-18 20:41:10,810 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 419 transitions. Word has length 25 [2021-12-18 20:41:10,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:41:10,810 INFO L470 AbstractCegarLoop]: Abstraction has 310 states and 419 transitions. [2021-12-18 20:41:10,810 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:41:10,810 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 419 transitions. [2021-12-18 20:41:10,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-18 20:41:10,811 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:41:10,811 INFO L514 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] [2021-12-18 20:41:10,824 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2021-12-18 20:41:11,018 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 20:41:11,018 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-18 20:41:11,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:41:11,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1146286442, now seen corresponding path program 1 times [2021-12-18 20:41:11,019 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 20:41:11,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1624163084] [2021-12-18 20:41:11,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:41:11,019 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 20:41:11,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 20:41:11,020 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 20:41:11,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2021-12-18 20:41:11,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:41:11,145 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 21 conjunts are in the unsatisfiable core [2021-12-18 20:41:11,147 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:41:11,155 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2021-12-18 20:41:11,212 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2021-12-18 20:41:11,237 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 20:41:11,237 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2021-12-18 20:41:11,293 INFO L388 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 13 treesize of output 9 [2021-12-18 20:41:11,302 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:41:11,515 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 20:41:11,515 INFO L388 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2021-12-18 20:41:11,522 INFO L388 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 22 treesize of output 24 [2021-12-18 20:41:11,909 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-12-18 20:41:11,915 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2021-12-18 20:41:11,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:41:11,960 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 20:41:11,960 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 20:41:11,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1624163084] [2021-12-18 20:41:11,961 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1624163084] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:41:11,961 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:41:11,961 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-18 20:41:11,961 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763052670] [2021-12-18 20:41:11,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:41:11,961 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-18 20:41:11,961 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 20:41:11,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-18 20:41:11,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-18 20:41:11,961 INFO L87 Difference]: Start difference. First operand 310 states and 419 transitions. Second operand has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:41:15,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:41:15,109 INFO L93 Difference]: Finished difference Result 496 states and 660 transitions. [2021-12-18 20:41:15,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-18 20:41:15,110 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-12-18 20:41:15,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:41:15,111 INFO L225 Difference]: With dead ends: 496 [2021-12-18 20:41:15,111 INFO L226 Difference]: Without dead ends: 496 [2021-12-18 20:41:15,112 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2021-12-18 20:41:15,112 INFO L933 BasicCegarLoop]: 109 mSDtfsCounter, 296 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 812 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2021-12-18 20:41:15,112 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [296 Valid, 512 Invalid, 828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 812 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2021-12-18 20:41:15,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2021-12-18 20:41:15,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 310. [2021-12-18 20:41:15,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 255 states have (on average 1.6392156862745098) internal successors, (418), 309 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:41:15,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 418 transitions. [2021-12-18 20:41:15,115 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 418 transitions. Word has length 25 [2021-12-18 20:41:15,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:41:15,115 INFO L470 AbstractCegarLoop]: Abstraction has 310 states and 418 transitions. [2021-12-18 20:41:15,116 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:41:15,116 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 418 transitions. [2021-12-18 20:41:15,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-18 20:41:15,116 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:41:15,116 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:41:15,145 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2021-12-18 20:41:15,347 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 20:41:15,347 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-18 20:41:15,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:41:15,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1341269417, now seen corresponding path program 1 times [2021-12-18 20:41:15,348 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 20:41:15,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1097028094] [2021-12-18 20:41:15,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:41:15,348 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 20:41:15,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 20:41:15,352 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 20:41:15,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2021-12-18 20:41:15,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:41:15,552 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 32 conjunts are in the unsatisfiable core [2021-12-18 20:41:15,554 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:41:15,563 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2021-12-18 20:41:15,600 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 20:41:15,600 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2021-12-18 20:41:15,634 INFO L388 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 13 treesize of output 9 [2021-12-18 20:41:15,646 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:41:15,808 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 20:41:15,808 INFO L388 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2021-12-18 20:41:15,817 INFO L388 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 22 treesize of output 24 [2021-12-18 20:41:15,923 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 20:41:15,924 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2021-12-18 20:41:16,159 INFO L388 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 17 treesize of output 19 [2021-12-18 20:41:16,184 INFO L388 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 16 treesize of output 18 [2021-12-18 20:41:16,405 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 20:41:16,405 INFO L388 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2021-12-18 20:41:16,415 INFO L388 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 22 treesize of output 24 [2021-12-18 20:41:16,537 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 20:41:16,538 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2021-12-18 20:41:16,754 INFO L388 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 36 treesize of output 36 [2021-12-18 20:41:16,764 INFO L388 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 35 treesize of output 35 [2021-12-18 20:41:17,030 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2021-12-18 20:41:17,036 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2021-12-18 20:41:17,137 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-18 20:41:17,137 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 20:41:17,421 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_958 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_958) |c_ULTIMATE.start_main_~tree~0#1.base|) (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32))))) (bvule .cse0 (bvadd .cse0 (_ bv4 32))))) (forall ((v_ArrVal_958 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_959 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_958) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) (_ bv4 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_959) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1)))))) is different from false [2021-12-18 20:41:17,475 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:41:17,476 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 62 [2021-12-18 20:41:17,745 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_958 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_958) |c_ULTIMATE.start_main_~tree~0#1.base|) (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32))))) (bvule .cse1 (bvadd .cse1 (_ bv4 32))))))) (and .cse0 (or (and .cse0 (forall ((v_prenex_874 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_874) |c_ULTIMATE.start_main_~tree~0#1.base|) (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32))) (_ bv4 32))))) (forall ((v_ArrVal_959 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_959) |c_ULTIMATE.start_main_~tree~0#1.base|) (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32))) |c_ULTIMATE.start_main_#t~mem9#1.base|))) (forall ((v_prenex_874 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_874) |c_ULTIMATE.start_main_~tree~0#1.base|) (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32))) (_ bv4 32)) (bvadd |c_ULTIMATE.start_main_#t~mem9#1.offset| (_ bv4 32)))))) is different from false [2021-12-18 20:41:17,826 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_958 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_958) |c_ULTIMATE.start_main_~tree~0#1.base|) (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32))))) (bvule .cse3 (bvadd .cse3 (_ bv4 32))))))) (and .cse0 (forall ((v_prenex_874 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_874) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) (_ bv4 32)) (bvadd (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) (_ bv4 32))))) (or (and .cse0 (forall ((v_prenex_874 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_874) |c_ULTIMATE.start_main_~tree~0#1.base|) (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32))) (_ bv4 32))))) (forall ((v_ArrVal_959 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_959) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2))))))) is different from false [2021-12-18 20:41:27,060 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-18 20:41:27,060 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 14 [2021-12-18 20:41:27,141 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_31| (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_~tmpList~0#1.base_31| |c_ULTIMATE.start_main_~tree~0#1.base|) (forall ((v_ArrVal_956 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_958 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_953 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_954 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_953) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_954) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) v_ArrVal_956) |v_ULTIMATE.start_main_~tmpList~0#1.base_31| v_ArrVal_958) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1)))) (bvule .cse0 (bvadd .cse0 (_ bv4 32))))))) is different from false [2021-12-18 20:41:28,843 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_951 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~tmpList~0#1.base_32| (_ BitVec 32)) (|v_ULTIMATE.start_main_~tmpList~0#1.base_31| (_ BitVec 32)) (v_ArrVal_952 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |v_ULTIMATE.start_main_~tmpList~0#1.base_31| |c_ULTIMATE.start_main_~tree~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_32|))) (forall ((v_ArrVal_956 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_958 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_953 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_954 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_952) |v_ULTIMATE.start_main_~tmpList~0#1.base_32| v_ArrVal_953) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_951) |v_ULTIMATE.start_main_~tmpList~0#1.base_32| v_ArrVal_954) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) v_ArrVal_956) |v_ULTIMATE.start_main_~tmpList~0#1.base_31| v_ArrVal_958) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1)))) (bvule .cse0 (bvadd .cse0 (_ bv4 32))))))) is different from false [2021-12-18 20:41:28,968 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-18 20:41:28,968 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 14 [2021-12-18 20:41:29,060 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_951 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~tmpList~0#1.base_32| (_ BitVec 32)) (v_ArrVal_956 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~tmpList~0#1.base_31| (_ BitVec 32)) (v_ArrVal_958 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_952 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_953 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_954 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |v_ULTIMATE.start_main_~tmpList~0#1.base_32| |c_ULTIMATE.start_main_~tree~0#1.base|) (= |v_ULTIMATE.start_main_~tmpList~0#1.base_31| |c_ULTIMATE.start_main_~tree~0#1.base|) (let ((.cse0 (let ((.cse2 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (select (select (store (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_952) |v_ULTIMATE.start_main_~tmpList~0#1.base_32| v_ArrVal_953) (select (select (store (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_951) |v_ULTIMATE.start_main_~tmpList~0#1.base_32| v_ArrVal_954) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2) v_ArrVal_956)) |v_ULTIMATE.start_main_~tmpList~0#1.base_31| v_ArrVal_958) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2)))) (bvule .cse0 (bvadd .cse0 (_ bv4 32)))))) is different from false [2021-12-18 20:41:29,182 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:41:29,182 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 96 [2021-12-18 20:41:29,197 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:41:29,198 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 76 [2021-12-18 20:41:29,202 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:41:29,206 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 104 [2021-12-18 20:41:29,210 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:41:29,210 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:41:29,213 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 408 treesize of output 354 [2021-12-18 20:41:29,220 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 350 treesize of output 318 [2021-12-18 20:41:29,224 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 318 treesize of output 254 [2021-12-18 20:41:29,247 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 114 [2021-12-18 20:41:29,541 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 1 times theorem prover too weak. 0 trivial. 3 not checked. [2021-12-18 20:41:29,542 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 20:41:29,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1097028094] [2021-12-18 20:41:29,542 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1097028094] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 20:41:29,542 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 20:41:29,542 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16] total 27 [2021-12-18 20:41:29,542 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094738000] [2021-12-18 20:41:29,542 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 20:41:29,543 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2021-12-18 20:41:29,543 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 20:41:29,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-12-18 20:41:29,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=343, Unknown=46, NotChecked=270, Total=756 [2021-12-18 20:41:29,546 INFO L87 Difference]: Start difference. First operand 310 states and 418 transitions. Second operand has 28 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 28 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:41:32,061 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (and (forall ((v_ArrVal_951 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~tmpList~0#1.base_32| (_ BitVec 32)) (v_ArrVal_956 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~tmpList~0#1.base_31| (_ BitVec 32)) (v_ArrVal_958 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_952 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_953 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_954 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |v_ULTIMATE.start_main_~tmpList~0#1.base_32| |c_ULTIMATE.start_main_~tree~0#1.base|) (= |v_ULTIMATE.start_main_~tmpList~0#1.base_31| |c_ULTIMATE.start_main_~tree~0#1.base|) (let ((.cse0 (let ((.cse2 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (select (select (store (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_952) |v_ULTIMATE.start_main_~tmpList~0#1.base_32| v_ArrVal_953) (select (select (store (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_951) |v_ULTIMATE.start_main_~tmpList~0#1.base_32| v_ArrVal_954) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2) v_ArrVal_956)) |v_ULTIMATE.start_main_~tmpList~0#1.base_31| v_ArrVal_958) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2)))) (bvule .cse0 (bvadd .cse0 (_ bv4 32)))))) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| |c_ULTIMATE.start_main_~tree~0#1.base|)) (_ bv1 1))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3) (_ bv0 32)) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3) |c_ULTIMATE.start_main_~tree~0#1.base|)) (not (= |c_ULTIMATE.start_main_#t~malloc4#1.base| |c_ULTIMATE.start_main_~tree~0#1.base|)) (= (_ bv0 32) |c_ULTIMATE.start_main_#t~malloc4#1.offset|))) is different from false [2021-12-18 20:41:32,079 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (and (forall ((v_ArrVal_951 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~tmpList~0#1.base_32| (_ BitVec 32)) (v_ArrVal_956 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~tmpList~0#1.base_31| (_ BitVec 32)) (v_ArrVal_958 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_952 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_953 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_954 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |v_ULTIMATE.start_main_~tmpList~0#1.base_32| |c_ULTIMATE.start_main_~tree~0#1.base|) (= |v_ULTIMATE.start_main_~tmpList~0#1.base_31| |c_ULTIMATE.start_main_~tree~0#1.base|) (let ((.cse0 (let ((.cse2 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (select (select (store (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_952) |v_ULTIMATE.start_main_~tmpList~0#1.base_32| v_ArrVal_953) (select (select (store (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_951) |v_ULTIMATE.start_main_~tmpList~0#1.base_32| v_ArrVal_954) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2) v_ArrVal_956)) |v_ULTIMATE.start_main_~tmpList~0#1.base_31| v_ArrVal_958) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2)))) (bvule .cse0 (bvadd .cse0 (_ bv4 32)))))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3) (_ bv0 32)) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3) |c_ULTIMATE.start_main_~tree~0#1.base|)))) is different from false [2021-12-18 20:41:36,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:41:36,847 INFO L93 Difference]: Finished difference Result 554 states and 735 transitions. [2021-12-18 20:41:36,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-18 20:41:36,848 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 28 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-12-18 20:41:36,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:41:36,849 INFO L225 Difference]: With dead ends: 554 [2021-12-18 20:41:36,849 INFO L226 Difference]: Without dead ends: 554 [2021-12-18 20:41:36,849 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 26 SyntacticMatches, 5 SemanticMatches, 33 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=168, Invalid=515, Unknown=51, NotChecked=456, Total=1190 [2021-12-18 20:41:36,849 INFO L933 BasicCegarLoop]: 136 mSDtfsCounter, 477 mSDsluCounter, 1731 mSDsCounter, 0 mSdLazyCounter, 1088 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 477 SdHoareTripleChecker+Valid, 1867 SdHoareTripleChecker+Invalid, 2995 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1088 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1875 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2021-12-18 20:41:36,850 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [477 Valid, 1867 Invalid, 2995 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1088 Invalid, 0 Unknown, 1875 Unchecked, 3.9s Time] [2021-12-18 20:41:36,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2021-12-18 20:41:36,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 309. [2021-12-18 20:41:36,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 255 states have (on average 1.6352941176470588) internal successors, (417), 308 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:41:36,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 417 transitions. [2021-12-18 20:41:36,853 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 417 transitions. Word has length 26 [2021-12-18 20:41:36,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:41:36,853 INFO L470 AbstractCegarLoop]: Abstraction has 309 states and 417 transitions. [2021-12-18 20:41:36,853 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 28 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:41:36,853 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 417 transitions. [2021-12-18 20:41:36,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-18 20:41:36,853 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:41:36,853 INFO L514 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] [2021-12-18 20:41:36,876 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2021-12-18 20:41:37,074 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 20:41:37,074 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-18 20:41:37,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:41:37,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1155102742, now seen corresponding path program 1 times [2021-12-18 20:41:37,075 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 20:41:37,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [816583383] [2021-12-18 20:41:37,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:41:37,075 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 20:41:37,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 20:41:37,077 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 20:41:37,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2021-12-18 20:41:37,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:41:37,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-18 20:41:37,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:41:37,353 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-18 20:41:37,358 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-18 20:41:37,394 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:41:37,394 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 20:41:37,394 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 20:41:37,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [816583383] [2021-12-18 20:41:37,394 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [816583383] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:41:37,394 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:41:37,394 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-18 20:41:37,394 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123438129] [2021-12-18 20:41:37,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:41:37,395 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 20:41:37,395 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 20:41:37,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 20:41:37,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-18 20:41:37,396 INFO L87 Difference]: Start difference. First operand 309 states and 417 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:41:38,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:41:38,756 INFO L93 Difference]: Finished difference Result 392 states and 534 transitions. [2021-12-18 20:41:38,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-18 20:41:38,757 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-12-18 20:41:38,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:41:38,758 INFO L225 Difference]: With dead ends: 392 [2021-12-18 20:41:38,758 INFO L226 Difference]: Without dead ends: 392 [2021-12-18 20:41:38,758 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-12-18 20:41:38,758 INFO L933 BasicCegarLoop]: 132 mSDtfsCounter, 66 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-12-18 20:41:38,758 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 480 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-12-18 20:41:38,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2021-12-18 20:41:38,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 315. [2021-12-18 20:41:38,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 261 states have (on average 1.628352490421456) internal successors, (425), 314 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:41:38,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 425 transitions. [2021-12-18 20:41:38,762 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 425 transitions. Word has length 26 [2021-12-18 20:41:38,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:41:38,762 INFO L470 AbstractCegarLoop]: Abstraction has 315 states and 425 transitions. [2021-12-18 20:41:38,762 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:41:38,762 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 425 transitions. [2021-12-18 20:41:38,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-18 20:41:38,763 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:41:38,763 INFO L514 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] [2021-12-18 20:41:38,772 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2021-12-18 20:41:38,970 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 20:41:38,970 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-18 20:41:38,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:41:38,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1154918044, now seen corresponding path program 1 times [2021-12-18 20:41:38,971 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 20:41:38,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1066323049] [2021-12-18 20:41:38,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:41:38,971 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 20:41:38,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 20:41:38,972 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 20:41:38,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2021-12-18 20:41:39,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:41:39,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 23 conjunts are in the unsatisfiable core [2021-12-18 20:41:39,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:41:39,100 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2021-12-18 20:41:39,129 INFO L388 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 13 treesize of output 9 [2021-12-18 20:41:39,140 INFO L388 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 13 treesize of output 9 [2021-12-18 20:41:39,184 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 20:41:39,184 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2021-12-18 20:41:39,240 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-12-18 20:41:39,240 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2021-12-18 20:41:39,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:41:39,251 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-18 20:41:39,415 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 20:41:39,415 INFO L388 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2021-12-18 20:41:39,423 INFO L388 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 22 treesize of output 24 [2021-12-18 20:41:39,665 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-18 20:41:39,671 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-18 20:41:39,671 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 11 [2021-12-18 20:41:39,777 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:41:39,777 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 20:41:39,777 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 20:41:39,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1066323049] [2021-12-18 20:41:39,778 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1066323049] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:41:39,778 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:41:39,778 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-18 20:41:39,778 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602983154] [2021-12-18 20:41:39,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:41:39,778 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-18 20:41:39,778 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 20:41:39,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-18 20:41:39,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-12-18 20:41:39,779 INFO L87 Difference]: Start difference. First operand 315 states and 425 transitions. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:41:42,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:41:42,489 INFO L93 Difference]: Finished difference Result 474 states and 635 transitions. [2021-12-18 20:41:42,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-18 20:41:42,490 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-12-18 20:41:42,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:41:42,491 INFO L225 Difference]: With dead ends: 474 [2021-12-18 20:41:42,491 INFO L226 Difference]: Without dead ends: 474 [2021-12-18 20:41:42,491 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2021-12-18 20:41:42,492 INFO L933 BasicCegarLoop]: 117 mSDtfsCounter, 252 mSDsluCounter, 774 mSDsCounter, 0 mSdLazyCounter, 754 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 891 SdHoareTripleChecker+Invalid, 796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2021-12-18 20:41:42,492 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [252 Valid, 891 Invalid, 796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 754 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2021-12-18 20:41:42,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2021-12-18 20:41:42,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 315. [2021-12-18 20:41:42,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 261 states have (on average 1.6245210727969348) internal successors, (424), 314 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:41:42,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 424 transitions. [2021-12-18 20:41:42,495 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 424 transitions. Word has length 26 [2021-12-18 20:41:42,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:41:42,495 INFO L470 AbstractCegarLoop]: Abstraction has 315 states and 424 transitions. [2021-12-18 20:41:42,495 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:41:42,495 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 424 transitions. [2021-12-18 20:41:42,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-18 20:41:42,495 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:41:42,495 INFO L514 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] [2021-12-18 20:41:42,504 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Forceful destruction successful, exit code 0 [2021-12-18 20:41:42,702 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 20:41:42,703 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-18 20:41:42,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:41:42,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1931939110, now seen corresponding path program 1 times [2021-12-18 20:41:42,703 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 20:41:42,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1771225723] [2021-12-18 20:41:42,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:41:42,703 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 20:41:42,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 20:41:42,704 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 20:41:42,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2021-12-18 20:41:42,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:41:42,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-18 20:41:42,851 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:41:42,879 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2021-12-18 20:41:42,890 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2021-12-18 20:41:42,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:41:42,952 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2021-12-18 20:41:42,965 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 20:41:42,966 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2021-12-18 20:41:42,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:41:42,983 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 20:41:42,983 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 20:41:42,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1771225723] [2021-12-18 20:41:42,983 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1771225723] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:41:42,983 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:41:42,983 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-18 20:41:42,983 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889188780] [2021-12-18 20:41:42,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:41:42,984 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-18 20:41:42,984 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 20:41:42,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-18 20:41:42,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-18 20:41:42,984 INFO L87 Difference]: Start difference. First operand 315 states and 424 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:41:43,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:41:43,740 INFO L93 Difference]: Finished difference Result 669 states and 935 transitions. [2021-12-18 20:41:43,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-18 20:41:43,741 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-12-18 20:41:43,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:41:43,743 INFO L225 Difference]: With dead ends: 669 [2021-12-18 20:41:43,743 INFO L226 Difference]: Without dead ends: 669 [2021-12-18 20:41:43,743 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-18 20:41:43,743 INFO L933 BasicCegarLoop]: 190 mSDtfsCounter, 315 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-18 20:41:43,743 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [315 Valid, 292 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-12-18 20:41:43,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2021-12-18 20:41:43,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 312. [2021-12-18 20:41:43,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 261 states have (on average 1.6130268199233717) internal successors, (421), 311 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:41:43,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 421 transitions. [2021-12-18 20:41:43,747 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 421 transitions. Word has length 26 [2021-12-18 20:41:43,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:41:43,747 INFO L470 AbstractCegarLoop]: Abstraction has 312 states and 421 transitions. [2021-12-18 20:41:43,748 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:41:43,748 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 421 transitions. [2021-12-18 20:41:43,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-18 20:41:43,748 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:41:43,748 INFO L514 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, 1] [2021-12-18 20:41:43,758 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Forceful destruction successful, exit code 0 [2021-12-18 20:41:43,948 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 20:41:43,949 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr97ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-18 20:41:43,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:41:43,949 INFO L85 PathProgramCache]: Analyzing trace with hash 265780375, now seen corresponding path program 1 times [2021-12-18 20:41:43,949 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 20:41:43,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [907246225] [2021-12-18 20:41:43,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:41:43,949 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 20:41:43,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 20:41:43,951 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 20:41:43,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2021-12-18 20:41:44,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:41:44,078 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 16 conjunts are in the unsatisfiable core [2021-12-18 20:41:44,079 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:41:44,086 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2021-12-18 20:41:44,122 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 20:41:44,122 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2021-12-18 20:41:44,150 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:41:44,159 INFO L388 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 13 treesize of output 9 [2021-12-18 20:41:44,205 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2021-12-18 20:41:44,251 INFO L388 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 16 treesize of output 18 [2021-12-18 20:41:44,378 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-18 20:41:44,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:41:44,407 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 20:41:44,407 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 20:41:44,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [907246225] [2021-12-18 20:41:44,407 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [907246225] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:41:44,407 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:41:44,408 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-18 20:41:44,408 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13250069] [2021-12-18 20:41:44,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:41:44,408 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-18 20:41:44,408 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 20:41:44,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-18 20:41:44,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-12-18 20:41:44,408 INFO L87 Difference]: Start difference. First operand 312 states and 421 transitions. Second operand has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:41:46,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:41:46,609 INFO L93 Difference]: Finished difference Result 473 states and 634 transitions. [2021-12-18 20:41:46,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-18 20:41:46,610 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-12-18 20:41:46,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:41:46,611 INFO L225 Difference]: With dead ends: 473 [2021-12-18 20:41:46,611 INFO L226 Difference]: Without dead ends: 473 [2021-12-18 20:41:46,612 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2021-12-18 20:41:46,612 INFO L933 BasicCegarLoop]: 115 mSDtfsCounter, 230 mSDsluCounter, 670 mSDsCounter, 0 mSdLazyCounter, 683 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 785 SdHoareTripleChecker+Invalid, 715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2021-12-18 20:41:46,612 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [230 Valid, 785 Invalid, 715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 683 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2021-12-18 20:41:46,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2021-12-18 20:41:46,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 315. [2021-12-18 20:41:46,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 264 states have (on average 1.6098484848484849) internal successors, (425), 314 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:41:46,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 425 transitions. [2021-12-18 20:41:46,619 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 425 transitions. Word has length 28 [2021-12-18 20:41:46,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:41:46,619 INFO L470 AbstractCegarLoop]: Abstraction has 315 states and 425 transitions. [2021-12-18 20:41:46,620 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:41:46,620 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 425 transitions. [2021-12-18 20:41:46,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-18 20:41:46,621 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:41:46,621 INFO L514 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, 1] [2021-12-18 20:41:46,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (32)] Forceful destruction successful, exit code 0 [2021-12-18 20:41:46,827 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 20:41:46,827 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-18 20:41:46,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:41:46,828 INFO L85 PathProgramCache]: Analyzing trace with hash 265781467, now seen corresponding path program 1 times [2021-12-18 20:41:46,828 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 20:41:46,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [13191594] [2021-12-18 20:41:46,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:41:46,828 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 20:41:46,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 20:41:46,829 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 20:41:46,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2021-12-18 20:41:46,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:41:46,980 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-18 20:41:46,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:41:47,117 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2021-12-18 20:41:47,122 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 16 [2021-12-18 20:41:47,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:41:47,180 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 20:41:47,180 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 20:41:47,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [13191594] [2021-12-18 20:41:47,180 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [13191594] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:41:47,180 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:41:47,180 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-18 20:41:47,180 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218615612] [2021-12-18 20:41:47,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:41:47,180 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-18 20:41:47,180 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 20:41:47,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-18 20:41:47,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-18 20:41:47,181 INFO L87 Difference]: Start difference. First operand 315 states and 425 transitions. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:41:48,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:41:48,644 INFO L93 Difference]: Finished difference Result 314 states and 422 transitions. [2021-12-18 20:41:48,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-18 20:41:48,645 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-12-18 20:41:48,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:41:48,645 INFO L225 Difference]: With dead ends: 314 [2021-12-18 20:41:48,645 INFO L226 Difference]: Without dead ends: 314 [2021-12-18 20:41:48,646 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-18 20:41:48,646 INFO L933 BasicCegarLoop]: 141 mSDtfsCounter, 35 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-12-18 20:41:48,646 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 325 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2021-12-18 20:41:48,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2021-12-18 20:41:48,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 314. [2021-12-18 20:41:48,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 264 states have (on average 1.5984848484848484) internal successors, (422), 313 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:41:48,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 422 transitions. [2021-12-18 20:41:48,649 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 422 transitions. Word has length 28 [2021-12-18 20:41:48,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:41:48,649 INFO L470 AbstractCegarLoop]: Abstraction has 314 states and 422 transitions. [2021-12-18 20:41:48,649 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:41:48,649 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 422 transitions. [2021-12-18 20:41:48,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-18 20:41:48,649 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:41:48,649 INFO L514 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, 1] [2021-12-18 20:41:48,660 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (33)] Forceful destruction successful, exit code 0 [2021-12-18 20:41:48,850 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 20:41:48,850 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-18 20:41:48,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:41:48,851 INFO L85 PathProgramCache]: Analyzing trace with hash 265781466, now seen corresponding path program 1 times [2021-12-18 20:41:48,851 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 20:41:48,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [984525495] [2021-12-18 20:41:48,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:41:48,851 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 20:41:48,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 20:41:48,852 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 20:41:48,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2021-12-18 20:41:48,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:41:48,958 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-18 20:41:48,958 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:41:49,024 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-12-18 20:41:49,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:41:49,041 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 20:41:49,041 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 20:41:49,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [984525495] [2021-12-18 20:41:49,041 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [984525495] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:41:49,041 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:41:49,041 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-18 20:41:49,042 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662803716] [2021-12-18 20:41:49,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:41:49,042 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-18 20:41:49,042 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 20:41:49,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-18 20:41:49,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-18 20:41:49,042 INFO L87 Difference]: Start difference. First operand 314 states and 422 transitions. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:41:49,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:41:49,956 INFO L93 Difference]: Finished difference Result 313 states and 419 transitions. [2021-12-18 20:41:49,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-18 20:41:49,957 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-12-18 20:41:49,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:41:49,957 INFO L225 Difference]: With dead ends: 313 [2021-12-18 20:41:49,957 INFO L226 Difference]: Without dead ends: 313 [2021-12-18 20:41:49,958 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-18 20:41:49,958 INFO L933 BasicCegarLoop]: 144 mSDtfsCounter, 23 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-12-18 20:41:49,958 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 340 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2021-12-18 20:41:49,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2021-12-18 20:41:49,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 313. [2021-12-18 20:41:49,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 264 states have (on average 1.5871212121212122) internal successors, (419), 312 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:41:49,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 419 transitions. [2021-12-18 20:41:49,961 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 419 transitions. Word has length 28 [2021-12-18 20:41:49,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:41:49,961 INFO L470 AbstractCegarLoop]: Abstraction has 313 states and 419 transitions. [2021-12-18 20:41:49,961 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:41:49,961 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 419 transitions. [2021-12-18 20:41:49,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-18 20:41:49,961 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:41:49,961 INFO L514 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, 1, 1] [2021-12-18 20:41:49,968 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (34)] Forceful destruction successful, exit code 0 [2021-12-18 20:41:50,169 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 20:41:50,169 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr98ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-18 20:41:50,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:41:50,170 INFO L85 PathProgramCache]: Analyzing trace with hash -350742638, now seen corresponding path program 1 times [2021-12-18 20:41:50,170 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 20:41:50,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [273952162] [2021-12-18 20:41:50,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:41:50,170 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 20:41:50,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 20:41:50,171 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 20:41:50,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (35)] Waiting until timeout for monitored process [2021-12-18 20:41:50,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:41:50,323 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-18 20:41:50,324 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:41:50,331 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2021-12-18 20:41:50,362 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 20:41:50,362 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2021-12-18 20:41:50,388 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:41:50,503 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 20:41:50,503 INFO L388 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2021-12-18 20:41:50,683 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 11 [2021-12-18 20:41:50,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:41:50,713 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 20:41:50,713 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 20:41:50,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [273952162] [2021-12-18 20:41:50,713 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [273952162] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:41:50,713 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:41:50,713 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-18 20:41:50,713 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656724715] [2021-12-18 20:41:50,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:41:50,713 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-18 20:41:50,713 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 20:41:50,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-18 20:41:50,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-18 20:41:50,714 INFO L87 Difference]: Start difference. First operand 313 states and 419 transitions. Second operand has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:41:52,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:41:52,610 INFO L93 Difference]: Finished difference Result 463 states and 618 transitions. [2021-12-18 20:41:52,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-18 20:41:52,611 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-12-18 20:41:52,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:41:52,612 INFO L225 Difference]: With dead ends: 463 [2021-12-18 20:41:52,612 INFO L226 Difference]: Without dead ends: 463 [2021-12-18 20:41:52,612 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2021-12-18 20:41:52,612 INFO L933 BasicCegarLoop]: 110 mSDtfsCounter, 215 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2021-12-18 20:41:52,613 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [215 Valid, 530 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 558 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2021-12-18 20:41:52,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2021-12-18 20:41:52,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 314. [2021-12-18 20:41:52,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 265 states have (on average 1.5849056603773586) internal successors, (420), 313 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:41:52,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 420 transitions. [2021-12-18 20:41:52,616 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 420 transitions. Word has length 29 [2021-12-18 20:41:52,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:41:52,616 INFO L470 AbstractCegarLoop]: Abstraction has 314 states and 420 transitions. [2021-12-18 20:41:52,616 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:41:52,616 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 420 transitions. [2021-12-18 20:41:52,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-18 20:41:52,616 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:41:52,616 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:41:52,623 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (35)] Ended with exit code 0 [2021-12-18 20:41:52,823 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 20:41:52,823 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-18 20:41:52,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:41:52,823 INFO L85 PathProgramCache]: Analyzing trace with hash -430609847, now seen corresponding path program 2 times [2021-12-18 20:41:52,823 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 20:41:52,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2138479388] [2021-12-18 20:41:52,823 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-18 20:41:52,824 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 20:41:52,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 20:41:52,825 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 20:41:52,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (36)] Waiting until timeout for monitored process [2021-12-18 20:41:53,081 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-18 20:41:53,081 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 20:41:53,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 38 conjunts are in the unsatisfiable core [2021-12-18 20:41:53,101 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:41:53,116 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2021-12-18 20:41:53,170 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 20:41:53,170 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2021-12-18 20:41:53,204 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:41:53,219 INFO L388 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 13 treesize of output 9 [2021-12-18 20:41:53,365 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 20:41:53,365 INFO L388 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2021-12-18 20:41:53,371 INFO L388 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 22 treesize of output 24 [2021-12-18 20:41:53,477 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 20:41:53,477 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2021-12-18 20:41:53,590 INFO L388 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 17 treesize of output 19 [2021-12-18 20:41:53,595 INFO L388 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 16 treesize of output 18 [2021-12-18 20:41:53,708 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 20:41:53,708 INFO L388 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2021-12-18 20:41:53,713 INFO L388 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 22 treesize of output 24 [2021-12-18 20:41:53,765 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 20:41:53,765 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2021-12-18 20:41:53,924 INFO L388 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 30 treesize of output 30 [2021-12-18 20:41:53,930 INFO L388 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 16 treesize of output 18 [2021-12-18 20:41:54,111 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 20:41:54,111 INFO L388 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 64 [2021-12-18 20:41:54,117 INFO L388 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 41 treesize of output 41 [2021-12-18 20:41:54,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:41:54,231 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2021-12-18 20:41:54,249 INFO L354 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2021-12-18 20:41:54,249 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2021-12-18 20:41:54,310 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2021-12-18 20:41:54,315 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 14 [2021-12-18 20:41:54,370 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-18 20:41:54,370 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 20:41:54,863 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:41:54,863 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 104 [2021-12-18 20:41:58,518 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-18 20:41:58,518 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 14 [2021-12-18 20:41:59,035 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1272 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1273 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1271 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1271) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1272) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) v_ArrVal_1273) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1)))) (bvule .cse0 (bvadd .cse0 (_ bv4 32))))) (forall ((v_ArrVal_1272 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1273 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1271 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1271)) (.cse4 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (let ((.cse2 (bvadd (select (select (store .cse3 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1272) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse4) v_ArrVal_1273) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse4) (_ bv4 32)))) (or (and (bvule .cse2 (bvadd (select (select .cse3 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse4) (_ bv4 32))) (forall ((v_ArrVal_1274 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse6 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1272))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse6) v_ArrVal_1274)) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse6)) |c_ULTIMATE.start_main_#t~mem9#1.base|)) (forall ((v_ArrVal_1274 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1272)) (.cse9 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse9))) (= .cse7 (select (select (store .cse8 .cse7 v_ArrVal_1274) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse9)))))) (= (_ bv0 32) .cse2)))))) is different from false [2021-12-18 20:41:59,214 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1272 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1273 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1271 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1271) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1272) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) v_ArrVal_1273) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1)))) (bvule .cse0 (bvadd .cse0 (_ bv4 32))))) (forall ((v_ArrVal_1272 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1273 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1271 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1271)) (.cse4 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (let ((.cse2 (bvadd (select (select (store .cse3 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1272) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse4) v_ArrVal_1273) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse4) (_ bv4 32)))) (or (and (bvule .cse2 (bvadd (select (select .cse3 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse4) (_ bv4 32))) (forall ((v_ArrVal_1274 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (= (select (select (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1272))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse6) v_ArrVal_1274)) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse6) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse6)))) (forall ((v_ArrVal_1274 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1272)) (.cse9 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse9))) (= .cse7 (select (select (store .cse8 .cse7 v_ArrVal_1274) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse9)))))) (= (_ bv0 32) .cse2)))))) is different from false [2021-12-18 20:41:59,857 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_35| (_ BitVec 32))) (or (and (forall ((v_ArrVal_1272 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1273 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1271 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~tmpList~0#1.base_35| v_ArrVal_1271)) (.cse7 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (let ((.cse0 (bvadd (select (select (store .cse6 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~tmpList~0#1.base_35| v_ArrVal_1272) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse7) v_ArrVal_1273) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse7) (_ bv4 32)))) (or (= (_ bv0 32) .cse0) (and (forall ((v_ArrVal_1274 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~tmpList~0#1.base_35| v_ArrVal_1272))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2) v_ArrVal_1274)) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2)))) (forall ((v_ArrVal_1274 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~tmpList~0#1.base_35| v_ArrVal_1272)) (.cse5 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse5))) (= .cse3 (select (select (store .cse4 .cse3 v_ArrVal_1274) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse5))))) (bvule .cse0 (bvadd (select (select .cse6 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse7) (_ bv4 32)))))))) (forall ((v_ArrVal_1272 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1273 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1271 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (let ((.cse9 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (select (select (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~tmpList~0#1.base_35| v_ArrVal_1271) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~tmpList~0#1.base_35| v_ArrVal_1272) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse9) v_ArrVal_1273) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse9)))) (bvule .cse8 (bvadd .cse8 (_ bv4 32)))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_35|))))) is different from false [2021-12-18 20:42:07,393 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_35| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_35|))) (and (forall ((v_ArrVal_1272 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1273 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1270 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1271 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1269 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1267 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1268 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse3 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1268))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1267) .cse1 v_ArrVal_1269) |v_ULTIMATE.start_main_~tmpList~0#1.base_35| v_ArrVal_1271) (select (select (store (store .cse2 .cse1 v_ArrVal_1270) |v_ULTIMATE.start_main_~tmpList~0#1.base_35| v_ArrVal_1272) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3) v_ArrVal_1273))) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3)))) (bvule .cse0 (bvadd .cse0 (_ bv4 32))))) (forall ((v_ArrVal_1272 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1273 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1270 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1271 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1269 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1267 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1268 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse15 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1268)) (.cse6 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (let ((.cse16 (select (select .cse15 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse6))) (let ((.cse5 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1267) .cse16 v_ArrVal_1269) |v_ULTIMATE.start_main_~tmpList~0#1.base_35| v_ArrVal_1271))) (let ((.cse4 (bvadd (select (select (store .cse5 (select (select (store (store .cse15 .cse16 v_ArrVal_1270) |v_ULTIMATE.start_main_~tmpList~0#1.base_35| v_ArrVal_1272) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse6) v_ArrVal_1273) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse6) (_ bv4 32)))) (or (= (_ bv0 32) .cse4) (and (bvule .cse4 (bvadd (select (select .cse5 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse6) (_ bv4 32))) (forall ((v_ArrVal_1274 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (let ((.cse8 (store (let ((.cse10 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1268))) (store .cse10 (select (select .cse10 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse9) v_ArrVal_1270)) |v_ULTIMATE.start_main_~tmpList~0#1.base_35| v_ArrVal_1272))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse9))) (= .cse7 (select (select (store .cse8 .cse7 v_ArrVal_1274) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse9)))))) (forall ((v_ArrVal_1274 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (let ((.cse13 (let ((.cse14 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1268))) (store .cse14 (select (select .cse14 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse12) v_ArrVal_1270)))) (= (select (select (let ((.cse11 (store .cse13 |v_ULTIMATE.start_main_~tmpList~0#1.base_35| v_ArrVal_1272))) (store .cse11 (select (select .cse11 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse12) v_ArrVal_1274)) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse12) (select (select .cse13 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse12))))))))))))))) is different from false [2021-12-18 20:42:08,137 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-18 20:42:08,137 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 14 [2021-12-18 20:42:08,928 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_35| (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~tree~0#1.base| |v_ULTIMATE.start_main_~tmpList~0#1.base_35|) (and (forall ((v_ArrVal_1272 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1273 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1270 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1271 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1269 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1267 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1268 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse3 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1268))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1267) .cse1 v_ArrVal_1269) |v_ULTIMATE.start_main_~tmpList~0#1.base_35| v_ArrVal_1271) (select (select (store (store .cse2 .cse1 v_ArrVal_1270) |v_ULTIMATE.start_main_~tmpList~0#1.base_35| v_ArrVal_1272) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3) v_ArrVal_1273))) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3)))) (bvule .cse0 (bvadd .cse0 (_ bv4 32))))) (forall ((v_ArrVal_1272 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1273 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1270 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1271 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1269 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1267 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1268 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse15 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1268)) (.cse6 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (let ((.cse16 (select (select .cse15 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse6))) (let ((.cse5 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1267) .cse16 v_ArrVal_1269) |v_ULTIMATE.start_main_~tmpList~0#1.base_35| v_ArrVal_1271))) (let ((.cse4 (bvadd (select (select (store .cse5 (select (select (store (store .cse15 .cse16 v_ArrVal_1270) |v_ULTIMATE.start_main_~tmpList~0#1.base_35| v_ArrVal_1272) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse6) v_ArrVal_1273) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse6) (_ bv4 32)))) (or (= (_ bv0 32) .cse4) (and (bvule .cse4 (bvadd (select (select .cse5 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse6) (_ bv4 32))) (forall ((v_ArrVal_1274 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (let ((.cse8 (store (let ((.cse10 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1268))) (store .cse10 (select (select .cse10 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse9) v_ArrVal_1270)) |v_ULTIMATE.start_main_~tmpList~0#1.base_35| v_ArrVal_1272))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse9))) (= .cse7 (select (select (store .cse8 .cse7 v_ArrVal_1274) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse9)))))) (forall ((v_ArrVal_1274 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (let ((.cse13 (let ((.cse14 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1268))) (store .cse14 (select (select .cse14 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse12) v_ArrVal_1270)))) (= (select (select (let ((.cse11 (store .cse13 |v_ULTIMATE.start_main_~tmpList~0#1.base_35| v_ArrVal_1272))) (store .cse11 (select (select .cse11 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse12) v_ArrVal_1274)) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse12) (select (select .cse13 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse12))))))))))))))) is different from false [2021-12-18 20:44:04,719 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:44:04,719 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 791 treesize of output 752 [2021-12-18 20:44:05,277 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:44:05,277 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 752 treesize of output 512 [2021-12-18 20:44:05,308 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:44:05,308 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:44:05,369 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 22451 treesize of output 18923 [2021-12-18 20:44:06,141 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:44:06,141 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:44:06,229 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 83295 treesize of output 78231 [2021-12-18 20:44:07,197 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-18 20:44:07,197 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 14 [2021-12-18 20:44:08,674 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12614 treesize of output 10566 [2021-12-18 20:44:08,759 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10566 treesize of output 10054 [2021-12-18 20:44:08,846 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10054 treesize of output 9030 [2021-12-18 20:44:08,931 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9030 treesize of output 8230 [2021-12-18 20:44:09,017 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8230 treesize of output 7686 [2021-12-18 20:44:30,534 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 20:44:30,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2138479388] [2021-12-18 20:44:30,534 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-12-18 20:44:30,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1003061791] [2021-12-18 20:44:30,534 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-18 20:44:30,534 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-18 20:44:30,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-18 20:44:30,536 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-18 20:44:30,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (37)] Waiting until timeout for monitored process [2021-12-18 20:44:30,854 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-18 20:44:30,854 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 20:44:30,869 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 43 conjunts are in the unsatisfiable core [2021-12-18 20:44:30,873 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:44:30,945 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2021-12-18 20:44:36,323 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2021-12-18 20:44:37,061 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-18 20:44:37,061 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 27 [2021-12-18 20:44:39,386 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:44:39,662 INFO L388 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 13 treesize of output 9 [2021-12-18 20:44:44,651 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 20:44:44,651 INFO L388 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 57 [2021-12-18 20:44:44,715 INFO L388 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 22 treesize of output 24 [2021-12-18 20:44:45,974 INFO L354 Elim1Store]: treesize reduction 23, result has 47.7 percent of original size [2021-12-18 20:44:45,974 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 18 treesize of output 30 [2021-12-18 20:44:46,303 INFO L244 Elim1Store]: Index analysis took 122 ms [2021-12-18 20:44:46,886 INFO L354 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2021-12-18 20:44:46,887 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 31 [2021-12-18 20:44:53,956 INFO L388 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 51 treesize of output 47 [2021-12-18 20:44:54,339 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-18 20:44:58,597 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 20:44:58,597 INFO L388 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 56 [2021-12-18 20:44:58,663 INFO L388 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 22 treesize of output 24 [2021-12-18 20:45:01,021 INFO L354 Elim1Store]: treesize reduction 23, result has 47.7 percent of original size [2021-12-18 20:45:01,021 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 18 treesize of output 30 [2021-12-18 20:45:01,385 INFO L244 Elim1Store]: Index analysis took 145 ms [2021-12-18 20:45:02,063 INFO L354 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2021-12-18 20:45:02,063 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 31 [2021-12-18 20:45:04,917 INFO L388 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 51 treesize of output 47 [2021-12-18 20:45:04,984 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-18 20:45:09,464 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 20:45:09,465 INFO L388 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 56 [2021-12-18 20:45:09,528 INFO L388 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 22 treesize of output 24 [2021-12-18 20:45:11,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:45:11,557 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-18 20:45:11,862 INFO L354 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2021-12-18 20:45:11,863 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2021-12-18 20:45:13,510 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-18 20:45:13,573 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2021-12-18 20:45:15,561 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-18 20:45:15,561 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 20:45:42,762 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-18 20:45:42,762 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 14 [2021-12-18 20:45:43,330 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_34| (_ BitVec 32))) (or (and (forall ((v_ArrVal_1350 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1353 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1351 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1352 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1275 (_ BitVec 32))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1351)) (.cse1 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1350) .cse0 v_ArrVal_1352) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) (_ bv4 32)) (select (store |c_#length| |v_ULTIMATE.start_main_~tmpList~0#1.base_34| v_ArrVal_1275) (select (select (store .cse2 .cse0 v_ArrVal_1353) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1350 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1351 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1352 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (let ((.cse4 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1350) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1351) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse4) v_ArrVal_1352) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse4)))) (bvule .cse3 (bvadd .cse3 (_ bv4 32)))))) (= |v_ULTIMATE.start_main_~tmpList~0#1.base_34| |c_ULTIMATE.start_main_#t~mem9#1.base|))) is different from false [2021-12-18 20:45:43,947 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_34| (_ BitVec 32))) (or (and (forall ((v_ArrVal_1350 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1353 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1351 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1352 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1275 (_ BitVec 32))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1351)) (.cse1 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1350) .cse0 v_ArrVal_1352) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) (_ bv4 32)) (select (store |c_#length| |v_ULTIMATE.start_main_~tmpList~0#1.base_34| v_ArrVal_1275) (select (select (store .cse2 .cse0 v_ArrVal_1353) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1350 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1351 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1352 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (let ((.cse4 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1350) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1351) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse4) v_ArrVal_1352) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse4)))) (bvule .cse3 (bvadd .cse3 (_ bv4 32)))))) (= |v_ULTIMATE.start_main_~tmpList~0#1.base_34| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))))) is different from false [2021-12-18 20:45:47,645 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_38| (_ BitVec 32)) (|v_ULTIMATE.start_main_~tmpList~0#1.base_34| (_ BitVec 32))) (or (and (forall ((v_ArrVal_1350 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1351 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1352 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (select (select (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~tmpList~0#1.base_38| v_ArrVal_1350) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~tmpList~0#1.base_38| v_ArrVal_1351) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) v_ArrVal_1352) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1)))) (bvule .cse0 (bvadd .cse0 (_ bv4 32))))) (forall ((v_ArrVal_1350 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1349 (_ BitVec 32)) (v_ArrVal_1353 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1351 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1352 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1275 (_ BitVec 32))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~tmpList~0#1.base_38| v_ArrVal_1351)) (.cse3 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~tmpList~0#1.base_38| v_ArrVal_1350) .cse2 v_ArrVal_1352) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3) (_ bv4 32)) (select (store (store |c_#length| |v_ULTIMATE.start_main_~tmpList~0#1.base_38| v_ArrVal_1349) |v_ULTIMATE.start_main_~tmpList~0#1.base_34| v_ArrVal_1275) (select (select (store .cse4 .cse2 v_ArrVal_1353) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_38|))) (= |v_ULTIMATE.start_main_~tmpList~0#1.base_34| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))))) is different from false [2021-12-18 20:45:53,394 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_38| (_ BitVec 32)) (v_ArrVal_1347 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~tmpList~0#1.base_34| (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_~tmpList~0#1.base_34| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1347) |c_ULTIMATE.start_main_~tree~0#1.base|) (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (and (forall ((v_ArrVal_1350 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1349 (_ BitVec 32)) (v_ArrVal_1353 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1351 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1352 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1275 (_ BitVec 32)) (v_ArrVal_1348 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1347) |v_ULTIMATE.start_main_~tmpList~0#1.base_38| v_ArrVal_1351)) (.cse1 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1348) |v_ULTIMATE.start_main_~tmpList~0#1.base_38| v_ArrVal_1350) .cse0 v_ArrVal_1352) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) (_ bv4 32)) (select (store (store |c_#length| |v_ULTIMATE.start_main_~tmpList~0#1.base_38| v_ArrVal_1349) |v_ULTIMATE.start_main_~tmpList~0#1.base_34| v_ArrVal_1275) (select (select (store .cse2 .cse0 v_ArrVal_1353) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1350 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1351 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1352 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1348 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (let ((.cse4 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1348) |v_ULTIMATE.start_main_~tmpList~0#1.base_38| v_ArrVal_1350) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1347) |v_ULTIMATE.start_main_~tmpList~0#1.base_38| v_ArrVal_1351) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse4) v_ArrVal_1352) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse4)))) (bvule .cse3 (bvadd .cse3 (_ bv4 32)))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_38|))))) is different from false [2021-12-18 20:46:08,545 INFO L354 Elim1Store]: treesize reduction 18, result has 28.0 percent of original size [2021-12-18 20:46:08,546 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 23 [2021-12-18 20:46:11,393 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_38| (_ BitVec 32)) (v_ArrVal_1347 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1344 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~tmpList~0#1.base_34| (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_~tmpList~0#1.base_34| (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1344))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) v_ArrVal_1347)) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1350 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1351 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1352 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1345 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1348 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (let ((.cse5 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1344))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse5))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1345) .cse3 v_ArrVal_1348) |v_ULTIMATE.start_main_~tmpList~0#1.base_38| v_ArrVal_1350) (select (select (store (store .cse4 .cse3 v_ArrVal_1347) |v_ULTIMATE.start_main_~tmpList~0#1.base_38| v_ArrVal_1351) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse5) v_ArrVal_1352))) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse5)))) (bvule .cse2 (bvadd .cse2 (_ bv4 32))))) (forall ((v_ArrVal_1350 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1349 (_ BitVec 32)) (v_ArrVal_1353 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1351 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1352 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1345 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1275 (_ BitVec 32)) (v_ArrVal_1348 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1344)) (.cse8 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (let ((.cse6 (select (select .cse10 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse8))) (let ((.cse9 (store (store .cse10 .cse6 v_ArrVal_1347) |v_ULTIMATE.start_main_~tmpList~0#1.base_38| v_ArrVal_1351))) (let ((.cse7 (select (select .cse9 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse8))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1345) .cse6 v_ArrVal_1348) |v_ULTIMATE.start_main_~tmpList~0#1.base_38| v_ArrVal_1350) .cse7 v_ArrVal_1352) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse8) (_ bv4 32)) (select (store (store |c_#length| |v_ULTIMATE.start_main_~tmpList~0#1.base_38| v_ArrVal_1349) |v_ULTIMATE.start_main_~tmpList~0#1.base_34| v_ArrVal_1275) (select (select (store .cse9 .cse7 v_ArrVal_1353) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse8))))))))) (= |c_ULTIMATE.start_main_#t~mem9#1.base| |v_ULTIMATE.start_main_~tmpList~0#1.base_38|) (= |v_ULTIMATE.start_main_~tmpList~0#1.base_38| |c_ULTIMATE.start_main_~tree~0#1.base|))) is different from false [2021-12-18 20:46:14,782 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_38| (_ BitVec 32)) (v_ArrVal_1347 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1344 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~tmpList~0#1.base_34| (_ BitVec 32))) (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (or (= |v_ULTIMATE.start_main_~tmpList~0#1.base_34| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1344))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) v_ArrVal_1347)) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1)) (and (forall ((v_ArrVal_1350 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1351 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1352 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1345 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1348 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (let ((.cse5 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1344))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse5))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1345) .cse3 v_ArrVal_1348) |v_ULTIMATE.start_main_~tmpList~0#1.base_38| v_ArrVal_1350) (select (select (store (store .cse4 .cse3 v_ArrVal_1347) |v_ULTIMATE.start_main_~tmpList~0#1.base_38| v_ArrVal_1351) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse5) v_ArrVal_1352))) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse5)))) (bvule .cse2 (bvadd .cse2 (_ bv4 32))))) (forall ((v_ArrVal_1350 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1349 (_ BitVec 32)) (v_ArrVal_1353 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1351 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1352 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1345 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1275 (_ BitVec 32)) (v_ArrVal_1348 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1344)) (.cse8 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (let ((.cse6 (select (select .cse10 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse8))) (let ((.cse9 (store (store .cse10 .cse6 v_ArrVal_1347) |v_ULTIMATE.start_main_~tmpList~0#1.base_38| v_ArrVal_1351))) (let ((.cse7 (select (select .cse9 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse8))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1345) .cse6 v_ArrVal_1348) |v_ULTIMATE.start_main_~tmpList~0#1.base_38| v_ArrVal_1350) .cse7 v_ArrVal_1352) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse8) (_ bv4 32)) (select (store (store |c_#length| |v_ULTIMATE.start_main_~tmpList~0#1.base_38| v_ArrVal_1349) |v_ULTIMATE.start_main_~tmpList~0#1.base_34| v_ArrVal_1275) (select (select (store .cse9 .cse7 v_ArrVal_1353) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse8))))))))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) |v_ULTIMATE.start_main_~tmpList~0#1.base_38|) (= |v_ULTIMATE.start_main_~tmpList~0#1.base_38| |c_ULTIMATE.start_main_~tree~0#1.base|)))) is different from false [2021-12-18 20:46:24,393 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_39| (_ BitVec 32)) (|v_ULTIMATE.start_main_~tmpList~0#1.base_38| (_ BitVec 32)) (v_ArrVal_1347 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1344 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~tmpList~0#1.base_34| (_ BitVec 32))) (let ((.cse9 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (or (and (forall ((v_ArrVal_1350 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1349 (_ BitVec 32)) (v_ArrVal_1353 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1351 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1352 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1345 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1275 (_ BitVec 32)) (v_ArrVal_1343 (_ BitVec 32)) (v_ArrVal_1348 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~tmpList~0#1.base_39| v_ArrVal_1344)) (.cse2 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2))) (let ((.cse3 (store (store .cse4 .cse0 v_ArrVal_1347) |v_ULTIMATE.start_main_~tmpList~0#1.base_38| v_ArrVal_1351))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~tmpList~0#1.base_39| v_ArrVal_1345) .cse0 v_ArrVal_1348) |v_ULTIMATE.start_main_~tmpList~0#1.base_38| v_ArrVal_1350) .cse1 v_ArrVal_1352) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2) (_ bv4 32)) (select (store (store (store |c_#length| |v_ULTIMATE.start_main_~tmpList~0#1.base_39| v_ArrVal_1343) |v_ULTIMATE.start_main_~tmpList~0#1.base_38| v_ArrVal_1349) |v_ULTIMATE.start_main_~tmpList~0#1.base_34| v_ArrVal_1275) (select (select (store .cse3 .cse1 v_ArrVal_1353) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_1350 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1351 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1352 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1345 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1348 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (let ((.cse8 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~tmpList~0#1.base_39| v_ArrVal_1344))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse8))) (store (store (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~tmpList~0#1.base_39| v_ArrVal_1345) .cse6 v_ArrVal_1348) |v_ULTIMATE.start_main_~tmpList~0#1.base_38| v_ArrVal_1350) (select (select (store (store .cse7 .cse6 v_ArrVal_1347) |v_ULTIMATE.start_main_~tmpList~0#1.base_38| v_ArrVal_1351) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse8) v_ArrVal_1352))) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse8)))) (bvule .cse5 (bvadd .cse5 (_ bv4 32)))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_39|))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse9) |v_ULTIMATE.start_main_~tmpList~0#1.base_38|) (= |v_ULTIMATE.start_main_~tmpList~0#1.base_38| |c_ULTIMATE.start_main_~tree~0#1.base|) (= |v_ULTIMATE.start_main_~tmpList~0#1.base_34| (select (select (let ((.cse10 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~tmpList~0#1.base_39| v_ArrVal_1344))) (store .cse10 (select (select .cse10 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse9) v_ArrVal_1347)) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse9))))) is different from false [2021-12-18 20:46:45,426 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_39| (_ BitVec 32)) (|v_ULTIMATE.start_main_~tmpList~0#1.base_38| (_ BitVec 32)) (v_ArrVal_1341 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1347 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1344 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~tmpList~0#1.base_34| (_ BitVec 32))) (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1341)) (.cse10 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (or (and (forall ((v_ArrVal_1350 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1342 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1351 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1352 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1345 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1348 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse3 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse2 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1341) |v_ULTIMATE.start_main_~tmpList~0#1.base_39| v_ArrVal_1344))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3))) (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1342) |v_ULTIMATE.start_main_~tmpList~0#1.base_39| v_ArrVal_1345) .cse1 v_ArrVal_1348) |v_ULTIMATE.start_main_~tmpList~0#1.base_38| v_ArrVal_1350) (select (select (store (store .cse2 .cse1 v_ArrVal_1347) |v_ULTIMATE.start_main_~tmpList~0#1.base_38| v_ArrVal_1351) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3) v_ArrVal_1352))) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3)))) (bvule .cse0 (bvadd .cse0 (_ bv4 32))))) (forall ((v_ArrVal_1350 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1342 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1349 (_ BitVec 32)) (v_ArrVal_1353 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1351 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1352 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1345 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1275 (_ BitVec 32)) (v_ArrVal_1343 (_ BitVec 32)) (v_ArrVal_1348 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1341) |v_ULTIMATE.start_main_~tmpList~0#1.base_39| v_ArrVal_1344)) (.cse6 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (let ((.cse4 (select (select .cse8 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse6))) (let ((.cse7 (store (store .cse8 .cse4 v_ArrVal_1347) |v_ULTIMATE.start_main_~tmpList~0#1.base_38| v_ArrVal_1351))) (let ((.cse5 (select (select .cse7 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse6))) (bvule (bvadd (select (select (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1342) |v_ULTIMATE.start_main_~tmpList~0#1.base_39| v_ArrVal_1345) .cse4 v_ArrVal_1348) |v_ULTIMATE.start_main_~tmpList~0#1.base_38| v_ArrVal_1350) .cse5 v_ArrVal_1352) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse6) (_ bv4 32)) (select (store (store (store |c_#length| |v_ULTIMATE.start_main_~tmpList~0#1.base_39| v_ArrVal_1343) |v_ULTIMATE.start_main_~tmpList~0#1.base_38| v_ArrVal_1349) |v_ULTIMATE.start_main_~tmpList~0#1.base_34| v_ArrVal_1275) (select (select (store .cse7 .cse5 v_ArrVal_1353) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse6))))))))) (= (select (select .cse9 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse10) |v_ULTIMATE.start_main_~tmpList~0#1.base_38|) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_39|))) (= |v_ULTIMATE.start_main_~tmpList~0#1.base_34| (select (select (let ((.cse11 (store .cse9 |v_ULTIMATE.start_main_~tmpList~0#1.base_39| v_ArrVal_1344))) (store .cse11 (select (select .cse11 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse10) v_ArrVal_1347)) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse10)) (= |v_ULTIMATE.start_main_~tmpList~0#1.base_38| |c_ULTIMATE.start_main_~tree~0#1.base|)))) is different from false [2021-12-18 20:47:21,852 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:47:21,852 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 434 treesize of output 415 [2021-12-18 20:47:22,011 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:47:22,012 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 487 treesize of output 337 [2021-12-18 20:47:22,049 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:47:22,050 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:47:22,100 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 50746 treesize of output 41968 [2021-12-18 20:47:22,257 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:47:22,258 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:47:22,337 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 820304 treesize of output 802730 [2021-12-18 20:47:24,995 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 802730 treesize of output 758882 [2021-12-18 20:47:26,279 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 758882 treesize of output 723722 [2021-12-18 20:47:28,722 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 721267 treesize of output 676211 [2021-12-18 20:47:30,163 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 676211 treesize of output 653683 [2021-12-18 20:47:31,449 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 653683 treesize of output 608627 [2021-12-18 20:47:32,743 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 608627 treesize of output 597363 [2021-12-18 20:47:34,217 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 597363 treesize of output 596467 [2021-12-18 20:47:35,658 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 596467 treesize of output 594675 [2021-12-18 20:47:37,008 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 594675 treesize of output 594227 [2021-12-18 20:47:39,486 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-12-18 20:47:39,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [146499106] [2021-12-18 20:47:39,487 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-18 20:47:39,487 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:47:39,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 20:47:39,495 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 20:47:39,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2021-12-18 20:47:40,271 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-18 20:47:40,272 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 20:47:40,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 36 conjunts are in the unsatisfiable core [2021-12-18 20:47:40,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:47:40,414 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2021-12-18 20:47:41,045 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 20:47:41,045 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2021-12-18 20:47:44,351 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:47:44,534 INFO L388 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 13 treesize of output 9 [2021-12-18 20:47:51,749 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 20:47:51,749 INFO L388 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2021-12-18 20:47:51,838 INFO L388 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 22 treesize of output 24 [2021-12-18 20:47:58,704 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 20:47:58,705 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2021-12-18 20:48:04,438 INFO L388 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 17 treesize of output 19 [2021-12-18 20:48:04,515 INFO L388 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 16 treesize of output 18 [2021-12-18 20:48:08,147 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 20:48:08,147 INFO L388 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2021-12-18 20:48:08,225 INFO L388 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 22 treesize of output 24 [2021-12-18 20:48:09,083 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 20:48:09,083 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2021-12-18 20:48:15,136 INFO L388 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 49 treesize of output 47 [2021-12-18 20:48:15,213 INFO L388 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 35 treesize of output 35 [2021-12-18 20:48:22,889 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 20:48:22,889 INFO L388 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 64 [2021-12-18 20:48:22,971 INFO L388 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 41 treesize of output 41 [2021-12-18 20:48:24,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:48:24,033 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2021-12-18 20:48:24,446 INFO L354 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2021-12-18 20:48:24,446 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2021-12-18 20:48:30,023 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2021-12-18 20:48:30,113 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2021-12-18 20:48:31,087 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-18 20:48:31,087 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 20:49:19,020 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:49:19,020 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 184 treesize of output 188 [2021-12-18 20:49:19,353 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-18 20:49:19,353 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 14 [2021-12-18 20:49:31,983 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1424 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1425 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1426 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1425) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1424) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) v_ArrVal_1426) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1)))) (bvule .cse0 (bvadd .cse0 (_ bv4 32))))) (forall ((v_prenex_2807 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_2806 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_2805 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (let ((.cse5 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_2806) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_2805) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse5) v_prenex_2807) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse5)) (_ bv4 32)))) (or (and (bvule .cse2 (bvadd |c_ULTIMATE.start_main_#t~mem9#1.offset| (_ bv4 32))) (forall ((v_ArrVal_1427 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse4 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_2805))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse4) v_ArrVal_1427)) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse4)) |c_ULTIMATE.start_main_#t~mem9#1.base|))) (= (_ bv0 32) .cse2)))) (forall ((v_prenex_2805 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1427 (Array (_ BitVec 32) (_ BitVec 32)))) (or (and (forall ((v_ArrVal_1424 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1425 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1426 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (let ((.cse7 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1425) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1424) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse7) v_ArrVal_1426) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse7)))) (bvule .cse6 (bvadd .cse6 (_ bv4 32))))) (forall ((v_prenex_2807 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_2806 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (bvadd (let ((.cse8 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_2806) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_2805) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse8) v_prenex_2807) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse8)) (_ bv4 32))))) (= (let ((.cse10 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_2805))) (store .cse9 (select (select .cse9 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse10) v_ArrVal_1427)) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse10)) |c_ULTIMATE.start_main_#t~mem9#1.base|)))) is different from false [2021-12-18 20:49:34,064 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1424 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1425 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1426 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1425) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1424) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) v_ArrVal_1426) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1)))) (bvule .cse0 (bvadd .cse0 (_ bv4 32))))) (forall ((v_prenex_2805 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1427 (Array (_ BitVec 32) (_ BitVec 32)))) (or (let ((.cse3 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (= (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_2805))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3) v_ArrVal_1427)) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3))) (and (forall ((v_ArrVal_1424 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1425 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1426 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (let ((.cse5 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1425) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1424) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse5) v_ArrVal_1426) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse5)))) (bvule .cse4 (bvadd .cse4 (_ bv4 32))))) (forall ((v_prenex_2807 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_2806 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (bvadd (let ((.cse6 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_2806) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_2805) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse6) v_prenex_2807) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse6)) (_ bv4 32))))))) (forall ((v_prenex_2807 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_2806 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_2805 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (let ((.cse7 (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_2806) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_2805) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse10) v_prenex_2807) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse10) (_ bv4 32)))) (or (= (_ bv0 32) .cse7) (and (forall ((v_ArrVal_1427 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (= (select (select (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_2805))) (store .cse8 (select (select .cse8 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse9) v_ArrVal_1427)) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse9) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse9)))) (bvule .cse7 (bvadd (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse10) (_ bv4 32))))))))) is different from false [2021-12-18 20:50:30,124 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_41| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_41|))) (and (forall ((v_ArrVal_1423 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_2805 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1427 (Array (_ BitVec 32) (_ BitVec 32)))) (or (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1423)) (.cse1 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (= (select (select (let ((.cse0 (store .cse2 |v_ULTIMATE.start_main_~tmpList~0#1.base_41| v_prenex_2805))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) v_ArrVal_1427)) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) (select (select .cse2 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1))) (and (forall ((v_prenex_2807 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1422 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_2806 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (bvadd (let ((.cse3 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1422) |v_ULTIMATE.start_main_~tmpList~0#1.base_41| v_prenex_2806) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1423) |v_ULTIMATE.start_main_~tmpList~0#1.base_41| v_prenex_2805) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3) v_prenex_2807) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3)) (_ bv4 32)))) (forall ((v_ArrVal_1424 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1422 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1425 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1426 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (let ((.cse5 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1422) |v_ULTIMATE.start_main_~tmpList~0#1.base_41| v_ArrVal_1425) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1423) |v_ULTIMATE.start_main_~tmpList~0#1.base_41| v_ArrVal_1424) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse5) v_ArrVal_1426) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse5)))) (bvule .cse4 (bvadd .cse4 (_ bv4 32)))))))) (forall ((v_ArrVal_1423 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_2807 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1422 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_2806 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_2805 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1422)) (.cse8 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (let ((.cse6 (bvadd (select (select (store (store .cse7 |v_ULTIMATE.start_main_~tmpList~0#1.base_41| v_prenex_2806) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1423) |v_ULTIMATE.start_main_~tmpList~0#1.base_41| v_prenex_2805) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse8) v_prenex_2807) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse8) (_ bv4 32)))) (or (= (_ bv0 32) .cse6) (and (bvule .cse6 (bvadd (select (select .cse7 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse8) (_ bv4 32))) (forall ((v_ArrVal_1427 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1423)) (.cse10 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (= (select (select (let ((.cse9 (store .cse11 |v_ULTIMATE.start_main_~tmpList~0#1.base_41| v_prenex_2805))) (store .cse9 (select (select .cse9 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse10) v_ArrVal_1427)) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse10) (select (select .cse11 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse10))))))))) (forall ((v_ArrVal_1423 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1424 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1422 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1425 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1426 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (let ((.cse13 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1422) |v_ULTIMATE.start_main_~tmpList~0#1.base_41| v_ArrVal_1425) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1423) |v_ULTIMATE.start_main_~tmpList~0#1.base_41| v_ArrVal_1424) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse13) v_ArrVal_1426) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse13)))) (bvule .cse12 (bvadd .cse12 (_ bv4 32)))))))) is different from false [2021-12-18 20:52:29,560 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-18 20:52:29,561 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 14 [2021-12-18 20:52:39,828 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_41| (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_~tmpList~0#1.base_41| |c_ULTIMATE.start_main_~tree~0#1.base|) (and (forall ((v_ArrVal_1420 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1423 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1424 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1421 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1422 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1425 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1426 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse3 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1421))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1420) .cse1 v_ArrVal_1422) |v_ULTIMATE.start_main_~tmpList~0#1.base_41| v_ArrVal_1425) (select (select (store (store .cse2 .cse1 v_ArrVal_1423) |v_ULTIMATE.start_main_~tmpList~0#1.base_41| v_ArrVal_1424) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3) v_ArrVal_1426))) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3)))) (bvule .cse0 (bvadd .cse0 (_ bv4 32))))) (forall ((v_ArrVal_1420 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1423 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1421 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_2807 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1422 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_2806 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_2805 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1421)) (.cse10 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (let ((.cse12 (select (select .cse11 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse10))) (let ((.cse9 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1420) .cse12 v_ArrVal_1422))) (let ((.cse8 (bvadd (select (select (store (store .cse9 |v_ULTIMATE.start_main_~tmpList~0#1.base_41| v_prenex_2806) (select (select (store (store .cse11 .cse12 v_ArrVal_1423) |v_ULTIMATE.start_main_~tmpList~0#1.base_41| v_prenex_2805) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse10) v_prenex_2807) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse10) (_ bv4 32)))) (or (and (forall ((v_ArrVal_1427 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (let ((.cse6 (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1421))) (store .cse7 (select (select .cse7 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse5) v_ArrVal_1423)))) (= (select (select (let ((.cse4 (store .cse6 |v_ULTIMATE.start_main_~tmpList~0#1.base_41| v_prenex_2805))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse5) v_ArrVal_1427)) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse5) (select (select .cse6 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse5))))) (bvule .cse8 (bvadd (select (select .cse9 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse10) (_ bv4 32)))) (= (_ bv0 32) .cse8))))))) (forall ((v_ArrVal_1423 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1421 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_2805 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1427 (Array (_ BitVec 32) (_ BitVec 32)))) (or (and (forall ((v_ArrVal_1420 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_2807 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1422 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_2806 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (bvadd (let ((.cse15 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse14 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1421))) (let ((.cse13 (select (select .cse14 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse15))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1420) .cse13 v_ArrVal_1422) |v_ULTIMATE.start_main_~tmpList~0#1.base_41| v_prenex_2806) (select (select (store (store .cse14 .cse13 v_ArrVal_1423) |v_ULTIMATE.start_main_~tmpList~0#1.base_41| v_prenex_2805) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse15) v_prenex_2807))) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse15)) (_ bv4 32)))) (forall ((v_ArrVal_1420 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1424 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1422 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1425 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1426 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse16 (let ((.cse19 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse18 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1421))) (let ((.cse17 (select (select .cse18 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse19))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1420) .cse17 v_ArrVal_1422) |v_ULTIMATE.start_main_~tmpList~0#1.base_41| v_ArrVal_1425) (select (select (store (store .cse18 .cse17 v_ArrVal_1423) |v_ULTIMATE.start_main_~tmpList~0#1.base_41| v_ArrVal_1424) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse19) v_ArrVal_1426))) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse19)))) (bvule .cse16 (bvadd .cse16 (_ bv4 32)))))) (let ((.cse21 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (let ((.cse22 (let ((.cse23 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1421))) (store .cse23 (select (select .cse23 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse21) v_ArrVal_1423)))) (= (select (select (let ((.cse20 (store .cse22 |v_ULTIMATE.start_main_~tmpList~0#1.base_41| v_prenex_2805))) (store .cse20 (select (select .cse20 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse21) v_ArrVal_1427)) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse21) (select (select .cse22 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse21))))))))) is different from false Killed by 15