./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/forester-heap/dll-reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb692b52 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/AutomizerReach.xml -i ../sv-benchmarks/c/forester-heap/dll-reverse.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 52fc70d7844651686a4c27e057f507f0498e7d5f7c17f07a035699d1630f6ea2 --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 14:28:52,768 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 14:28:52,770 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 14:28:52,805 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 14:28:52,805 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 14:28:52,806 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 14:28:52,808 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 14:28:52,809 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 14:28:52,811 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 14:28:52,814 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 14:28:52,814 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 14:28:52,816 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 14:28:52,816 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 14:28:52,818 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 14:28:52,818 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 14:28:52,820 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 14:28:52,821 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 14:28:52,822 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 14:28:52,823 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 14:28:52,827 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 14:28:52,829 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 14:28:52,829 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 14:28:52,830 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 14:28:52,831 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 14:28:52,832 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 14:28:52,837 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 14:28:52,837 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 14:28:52,837 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 14:28:52,838 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 14:28:52,838 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 14:28:52,839 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 14:28:52,840 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 14:28:52,841 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 14:28:52,842 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 14:28:52,842 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 14:28:52,843 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 14:28:52,843 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 14:28:52,843 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 14:28:52,844 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 14:28:52,844 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 14:28:52,844 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 14:28:52,846 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 14:28:52,846 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-19 14:28:52,866 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 14:28:52,867 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 14:28:52,867 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 14:28:52,867 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 14:28:52,867 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 14:28:52,868 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 14:28:52,868 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 14:28:52,868 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 14:28:52,868 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 14:28:52,869 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 14:28:52,869 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 14:28:52,869 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 14:28:52,869 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 14:28:52,870 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 14:28:52,870 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 14:28:52,870 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 14:28:52,870 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 14:28:52,870 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 14:28:52,870 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 14:28:52,871 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 14:28:52,871 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 14:28:52,872 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 14:28:52,872 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 14:28:52,872 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 14:28:52,872 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 14:28:52,872 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 14:28:52,872 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 14:28:52,873 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 14:28:52,873 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 14:28:52,873 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 14:28:52,873 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 14:28:52,873 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 14:28:52,873 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 14:28:52,874 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 ! call(reach_error())) ) 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 -> 52fc70d7844651686a4c27e057f507f0498e7d5f7c17f07a035699d1630f6ea2 [2022-07-19 14:28:53,074 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 14:28:53,103 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 14:28:53,105 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 14:28:53,106 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 14:28:53,106 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 14:28:53,107 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-reverse.i [2022-07-19 14:28:53,182 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fdc074d7/ceb7a515040d4bdcabd3f064e6b7b8a1/FLAG95f72f1a1 [2022-07-19 14:28:53,584 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 14:28:53,585 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-reverse.i [2022-07-19 14:28:53,594 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fdc074d7/ceb7a515040d4bdcabd3f064e6b7b8a1/FLAG95f72f1a1 [2022-07-19 14:28:53,612 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fdc074d7/ceb7a515040d4bdcabd3f064e6b7b8a1 [2022-07-19 14:28:53,614 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 14:28:53,615 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 14:28:53,627 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 14:28:53,628 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 14:28:53,631 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 14:28:53,632 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 02:28:53" (1/1) ... [2022-07-19 14:28:53,633 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63c19359 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:28:53, skipping insertion in model container [2022-07-19 14:28:53,633 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 02:28:53" (1/1) ... [2022-07-19 14:28:53,639 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 14:28:53,689 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 14:28:53,977 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-reverse.i[22309,22322] [2022-07-19 14:28:53,979 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-reverse.i[22394,22407] [2022-07-19 14:28:53,983 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-reverse.i[22924,22937] [2022-07-19 14:28:53,986 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 14:28:53,995 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 14:28:54,031 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-reverse.i[22309,22322] [2022-07-19 14:28:54,041 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-reverse.i[22394,22407] [2022-07-19 14:28:54,047 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-reverse.i[22924,22937] [2022-07-19 14:28:54,049 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 14:28:54,069 INFO L208 MainTranslator]: Completed translation [2022-07-19 14:28:54,069 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:28:54 WrapperNode [2022-07-19 14:28:54,069 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 14:28:54,074 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 14:28:54,087 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 14:28:54,087 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 14:28:54,093 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:28:54" (1/1) ... [2022-07-19 14:28:54,117 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:28:54" (1/1) ... [2022-07-19 14:28:54,141 INFO L137 Inliner]: procedures = 119, calls = 41, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 144 [2022-07-19 14:28:54,141 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 14:28:54,142 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 14:28:54,142 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 14:28:54,142 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 14:28:54,148 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:28:54" (1/1) ... [2022-07-19 14:28:54,148 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:28:54" (1/1) ... [2022-07-19 14:28:54,153 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:28:54" (1/1) ... [2022-07-19 14:28:54,154 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:28:54" (1/1) ... [2022-07-19 14:28:54,173 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:28:54" (1/1) ... [2022-07-19 14:28:54,176 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:28:54" (1/1) ... [2022-07-19 14:28:54,181 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:28:54" (1/1) ... [2022-07-19 14:28:54,183 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 14:28:54,184 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 14:28:54,184 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 14:28:54,184 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 14:28:54,185 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:28:54" (1/1) ... [2022-07-19 14:28:54,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 14:28:54,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:28:54,209 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) [2022-07-19 14:28:54,212 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 [2022-07-19 14:28:54,239 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-19 14:28:54,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-19 14:28:54,240 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-19 14:28:54,240 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 14:28:54,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-19 14:28:54,240 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-19 14:28:54,240 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-19 14:28:54,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 14:28:54,241 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 14:28:54,241 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 14:28:54,339 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 14:28:54,340 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 14:28:54,546 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 14:28:54,550 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 14:28:54,551 INFO L299 CfgBuilder]: Removed 11 assume(true) statements. [2022-07-19 14:28:54,552 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 02:28:54 BoogieIcfgContainer [2022-07-19 14:28:54,552 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 14:28:54,553 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 14:28:54,553 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 14:28:54,558 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 14:28:54,558 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 02:28:53" (1/3) ... [2022-07-19 14:28:54,558 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60c10e18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 02:28:54, skipping insertion in model container [2022-07-19 14:28:54,558 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:28:54" (2/3) ... [2022-07-19 14:28:54,559 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60c10e18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 02:28:54, skipping insertion in model container [2022-07-19 14:28:54,559 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 02:28:54" (3/3) ... [2022-07-19 14:28:54,560 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-reverse.i [2022-07-19 14:28:54,576 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 14:28:54,576 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-07-19 14:28:54,609 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 14:28:54,614 INFO L357 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=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7cc50d01, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5af636e8 [2022-07-19 14:28:54,614 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-07-19 14:28:54,620 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 33 states have (on average 1.7878787878787878) internal successors, (59), 36 states have internal predecessors, (59), 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) [2022-07-19 14:28:54,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-19 14:28:54,624 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:28:54,624 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:28:54,625 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:28:54,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:28:54,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1813527409, now seen corresponding path program 1 times [2022-07-19 14:28:54,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:28:54,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554807474] [2022-07-19 14:28:54,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:28:54,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:28:54,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:28:54,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:28:54,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:28:54,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554807474] [2022-07-19 14:28:54,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554807474] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:28:54,732 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:28:54,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-19 14:28:54,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752319856] [2022-07-19 14:28:54,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:28:54,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-19 14:28:54,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:28:54,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-19 14:28:54,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-19 14:28:54,760 INFO L87 Difference]: Start difference. First operand has 37 states, 33 states have (on average 1.7878787878787878) internal successors, (59), 36 states have internal predecessors, (59), 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 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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) [2022-07-19 14:28:54,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:28:54,781 INFO L93 Difference]: Finished difference Result 70 states and 112 transitions. [2022-07-19 14:28:54,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-19 14:28:54,783 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 7 [2022-07-19 14:28:54,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:28:54,788 INFO L225 Difference]: With dead ends: 70 [2022-07-19 14:28:54,789 INFO L226 Difference]: Without dead ends: 31 [2022-07-19 14:28:54,791 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-19 14:28:54,794 INFO L413 NwaCegarLoop]: 45 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, 45 SdHoareTripleChecker+Invalid, 0 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 [2022-07-19 14:28:54,796 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 14:28:54,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-07-19 14:28:54,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-07-19 14:28:54,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 30 states have internal predecessors, (38), 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) [2022-07-19 14:28:54,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2022-07-19 14:28:54,823 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 7 [2022-07-19 14:28:54,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:28:54,823 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2022-07-19 14:28:54,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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) [2022-07-19 14:28:54,824 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2022-07-19 14:28:54,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-19 14:28:54,825 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:28:54,825 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:28:54,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 14:28:54,826 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:28:54,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:28:54,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1038813004, now seen corresponding path program 1 times [2022-07-19 14:28:54,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:28:54,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324312336] [2022-07-19 14:28:54,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:28:54,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:28:54,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:28:54,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:28:55,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:28:55,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324312336] [2022-07-19 14:28:55,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324312336] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:28:55,001 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:28:55,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 14:28:55,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172287932] [2022-07-19 14:28:55,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:28:55,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 14:28:55,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:28:55,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 14:28:55,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 14:28:55,005 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand has 5 states, 5 states have (on average 2.0) 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) [2022-07-19 14:28:55,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:28:55,142 INFO L93 Difference]: Finished difference Result 71 states and 89 transitions. [2022-07-19 14:28:55,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 14:28:55,143 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) 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 [2022-07-19 14:28:55,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:28:55,144 INFO L225 Difference]: With dead ends: 71 [2022-07-19 14:28:55,144 INFO L226 Difference]: Without dead ends: 45 [2022-07-19 14:28:55,144 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-19 14:28:55,145 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 17 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 14:28:55,145 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 92 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 14:28:55,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-07-19 14:28:55,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 37. [2022-07-19 14:28:55,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 36 states have internal predecessors, (45), 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) [2022-07-19 14:28:55,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2022-07-19 14:28:55,174 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 10 [2022-07-19 14:28:55,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:28:55,175 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2022-07-19 14:28:55,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) 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) [2022-07-19 14:28:55,175 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2022-07-19 14:28:55,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-19 14:28:55,175 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:28:55,175 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:28:55,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-19 14:28:55,175 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:28:55,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:28:55,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1038754672, now seen corresponding path program 1 times [2022-07-19 14:28:55,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:28:55,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529026297] [2022-07-19 14:28:55,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:28:55,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:28:55,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:28:55,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:28:55,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:28:55,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529026297] [2022-07-19 14:28:55,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529026297] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:28:55,226 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:28:55,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 14:28:55,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091719675] [2022-07-19 14:28:55,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:28:55,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 14:28:55,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:28:55,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 14:28:55,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 14:28:55,228 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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) [2022-07-19 14:28:55,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:28:55,284 INFO L93 Difference]: Finished difference Result 64 states and 78 transitions. [2022-07-19 14:28:55,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 14:28:55,285 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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 [2022-07-19 14:28:55,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:28:55,287 INFO L225 Difference]: With dead ends: 64 [2022-07-19 14:28:55,287 INFO L226 Difference]: Without dead ends: 50 [2022-07-19 14:28:55,287 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 14:28:55,291 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 41 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 14:28:55,292 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 54 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 14:28:55,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-07-19 14:28:55,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 44. [2022-07-19 14:28:55,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 43 states have internal predecessors, (54), 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) [2022-07-19 14:28:55,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 54 transitions. [2022-07-19 14:28:55,301 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 54 transitions. Word has length 10 [2022-07-19 14:28:55,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:28:55,302 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 54 transitions. [2022-07-19 14:28:55,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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) [2022-07-19 14:28:55,302 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 54 transitions. [2022-07-19 14:28:55,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-19 14:28:55,304 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:28:55,304 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:28:55,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-19 14:28:55,304 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:28:55,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:28:55,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1414194791, now seen corresponding path program 1 times [2022-07-19 14:28:55,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:28:55,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787141155] [2022-07-19 14:28:55,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:28:55,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:28:55,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:28:55,436 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-19 14:28:55,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:28:55,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787141155] [2022-07-19 14:28:55,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787141155] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:28:55,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [388355047] [2022-07-19 14:28:55,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:28:55,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:28:55,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:28:55,452 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) [2022-07-19 14:28:55,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-19 14:28:55,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:28:55,548 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-19 14:28:55,552 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:28:55,670 INFO L390 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 17 [2022-07-19 14:28:55,675 INFO L390 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 13 [2022-07-19 14:28:55,693 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-19 14:28:55,693 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:28:55,763 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-19 14:28:55,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [388355047] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:28:55,765 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 14:28:55,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2022-07-19 14:28:55,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643047363] [2022-07-19 14:28:55,767 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 14:28:55,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 14:28:55,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:28:55,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 14:28:55,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-19 14:28:55,769 INFO L87 Difference]: Start difference. First operand 44 states and 54 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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) [2022-07-19 14:28:55,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:28:55,890 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2022-07-19 14:28:55,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 14:28:55,891 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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 18 [2022-07-19 14:28:55,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:28:55,893 INFO L225 Difference]: With dead ends: 50 [2022-07-19 14:28:55,894 INFO L226 Difference]: Without dead ends: 46 [2022-07-19 14:28:55,895 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-07-19 14:28:55,896 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 26 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 14:28:55,897 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 51 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 14:28:55,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-07-19 14:28:55,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 34. [2022-07-19 14:28:55,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 33 states have internal predecessors, (42), 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) [2022-07-19 14:28:55,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2022-07-19 14:28:55,908 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 18 [2022-07-19 14:28:55,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:28:55,908 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2022-07-19 14:28:55,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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) [2022-07-19 14:28:55,908 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2022-07-19 14:28:55,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-19 14:28:55,909 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:28:55,909 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:28:55,931 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-19 14:28:56,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:28:56,126 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:28:56,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:28:56,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1635066921, now seen corresponding path program 1 times [2022-07-19 14:28:56,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:28:56,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544289178] [2022-07-19 14:28:56,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:28:56,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:28:56,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:28:56,215 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:28:56,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:28:56,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544289178] [2022-07-19 14:28:56,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544289178] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:28:56,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [364989442] [2022-07-19 14:28:56,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:28:56,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:28:56,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:28:56,217 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) [2022-07-19 14:28:56,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-19 14:28:56,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:28:56,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 35 conjunts are in the unsatisfiable core [2022-07-19 14:28:56,308 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:28:56,317 INFO L390 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 [2022-07-19 14:28:56,462 INFO L390 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 0 case distinctions, treesize of input 32 treesize of output 24 [2022-07-19 14:28:56,511 INFO L356 Elim1Store]: treesize reduction 56, result has 33.3 percent of original size [2022-07-19 14:28:56,512 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-19 14:28:56,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-19 14:28:56,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:28:56,730 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: v_arrayElimArr_1 input size 48 context size 48 output size 48 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:364) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:427) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:124) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:650) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:611) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:529) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:333) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:180) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:269) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) 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) [2022-07-19 14:28:56,734 INFO L158 Benchmark]: Toolchain (without parser) took 3118.89ms. Allocated memory was 81.8MB in the beginning and 119.5MB in the end (delta: 37.7MB). Free memory was 43.8MB in the beginning and 87.1MB in the end (delta: -43.3MB). Peak memory consumption was 32.7MB. Max. memory is 16.1GB. [2022-07-19 14:28:56,734 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 81.8MB. Free memory was 61.7MB in the beginning and 61.6MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 14:28:56,734 INFO L158 Benchmark]: CACSL2BoogieTranslator took 445.87ms. Allocated memory was 81.8MB in the beginning and 98.6MB in the end (delta: 16.8MB). Free memory was 43.7MB in the beginning and 66.1MB in the end (delta: -22.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-19 14:28:56,735 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.33ms. Allocated memory is still 98.6MB. Free memory was 66.1MB in the beginning and 64.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-19 14:28:56,735 INFO L158 Benchmark]: Boogie Preprocessor took 41.48ms. Allocated memory is still 98.6MB. Free memory was 64.0MB in the beginning and 62.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-19 14:28:56,735 INFO L158 Benchmark]: RCFGBuilder took 368.37ms. Allocated memory is still 98.6MB. Free memory was 61.8MB in the beginning and 44.6MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-07-19 14:28:56,735 INFO L158 Benchmark]: TraceAbstraction took 2180.21ms. Allocated memory was 98.6MB in the beginning and 119.5MB in the end (delta: 21.0MB). Free memory was 43.8MB in the beginning and 87.1MB in the end (delta: -43.3MB). Peak memory consumption was 18.1MB. Max. memory is 16.1GB. [2022-07-19 14:28:56,737 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.15ms. Allocated memory is still 81.8MB. Free memory was 61.7MB in the beginning and 61.6MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 445.87ms. Allocated memory was 81.8MB in the beginning and 98.6MB in the end (delta: 16.8MB). Free memory was 43.7MB in the beginning and 66.1MB in the end (delta: -22.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.33ms. Allocated memory is still 98.6MB. Free memory was 66.1MB in the beginning and 64.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.48ms. Allocated memory is still 98.6MB. Free memory was 64.0MB in the beginning and 62.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 368.37ms. Allocated memory is still 98.6MB. Free memory was 61.8MB in the beginning and 44.6MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2180.21ms. Allocated memory was 98.6MB in the beginning and 119.5MB in the end (delta: 21.0MB). Free memory was 43.8MB in the beginning and 87.1MB in the end (delta: -43.3MB). Peak memory consumption was 18.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: v_arrayElimArr_1 input size 48 context size 48 output size 48 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: v_arrayElimArr_1 input size 48 context size 48 output size 48: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:364) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-19 14:28:56,764 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, 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/AutomizerReach.xml -i ../sv-benchmarks/c/forester-heap/dll-reverse.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 52fc70d7844651686a4c27e057f507f0498e7d5f7c17f07a035699d1630f6ea2 --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 14:28:58,817 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 14:28:58,818 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 14:28:58,845 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 14:28:58,846 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 14:28:58,846 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 14:28:58,847 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 14:28:58,849 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 14:28:58,850 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 14:28:58,850 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 14:28:58,851 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 14:28:58,852 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 14:28:58,852 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 14:28:58,853 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 14:28:58,853 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 14:28:58,854 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 14:28:58,855 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 14:28:58,855 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 14:28:58,856 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 14:28:58,858 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 14:28:58,858 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 14:28:58,859 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 14:28:58,860 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 14:28:58,861 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 14:28:58,861 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 14:28:58,863 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 14:28:58,863 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 14:28:58,863 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 14:28:58,864 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 14:28:58,864 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 14:28:58,865 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 14:28:58,865 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 14:28:58,866 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 14:28:58,866 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 14:28:58,867 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 14:28:58,867 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 14:28:58,868 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 14:28:58,868 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 14:28:58,868 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 14:28:58,868 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 14:28:58,869 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 14:28:58,870 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 14:28:58,870 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-19 14:28:58,891 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 14:28:58,891 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 14:28:58,891 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 14:28:58,891 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 14:28:58,892 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 14:28:58,892 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 14:28:58,893 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 14:28:58,893 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 14:28:58,893 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 14:28:58,893 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 14:28:58,893 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 14:28:58,893 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 14:28:58,897 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 14:28:58,897 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 14:28:58,897 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 14:28:58,897 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 14:28:58,898 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-19 14:28:58,898 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-19 14:28:58,898 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-19 14:28:58,898 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 14:28:58,898 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 14:28:58,898 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 14:28:58,899 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 14:28:58,899 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 14:28:58,899 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 14:28:58,899 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 14:28:58,899 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 14:28:58,899 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 14:28:58,900 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 14:28:58,900 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 14:28:58,900 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-19 14:28:58,900 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-19 14:28:58,900 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 14:28:58,900 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 14:28:58,901 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 14:28:58,901 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-19 14:28:58,901 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 ! call(reach_error())) ) 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 -> 52fc70d7844651686a4c27e057f507f0498e7d5f7c17f07a035699d1630f6ea2 [2022-07-19 14:28:59,156 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 14:28:59,184 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 14:28:59,187 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 14:28:59,188 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 14:28:59,189 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 14:28:59,189 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-reverse.i [2022-07-19 14:28:59,245 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba24c615e/91cd78ca21e444b9a0502cb40ea11b9e/FLAG421fdae0a [2022-07-19 14:28:59,633 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 14:28:59,633 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-reverse.i [2022-07-19 14:28:59,645 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba24c615e/91cd78ca21e444b9a0502cb40ea11b9e/FLAG421fdae0a [2022-07-19 14:28:59,975 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba24c615e/91cd78ca21e444b9a0502cb40ea11b9e [2022-07-19 14:28:59,978 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 14:28:59,979 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 14:28:59,979 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 14:28:59,980 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 14:28:59,982 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 14:28:59,983 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 02:28:59" (1/1) ... [2022-07-19 14:28:59,984 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69d1561e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:28:59, skipping insertion in model container [2022-07-19 14:28:59,988 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 02:28:59" (1/1) ... [2022-07-19 14:28:59,994 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 14:29:00,016 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 14:29:00,214 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-reverse.i[22309,22322] [2022-07-19 14:29:00,217 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-reverse.i[22394,22407] [2022-07-19 14:29:00,220 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-reverse.i[22924,22937] [2022-07-19 14:29:00,223 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 14:29:00,231 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 14:29:00,251 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-reverse.i[22309,22322] [2022-07-19 14:29:00,252 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-reverse.i[22394,22407] [2022-07-19 14:29:00,262 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-reverse.i[22924,22937] [2022-07-19 14:29:00,264 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 14:29:00,283 INFO L208 MainTranslator]: Completed translation [2022-07-19 14:29:00,284 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:29:00 WrapperNode [2022-07-19 14:29:00,284 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 14:29:00,285 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 14:29:00,285 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 14:29:00,285 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 14:29:00,290 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:29:00" (1/1) ... [2022-07-19 14:29:00,318 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:29:00" (1/1) ... [2022-07-19 14:29:00,345 INFO L137 Inliner]: procedures = 122, calls = 41, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 138 [2022-07-19 14:29:00,345 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 14:29:00,346 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 14:29:00,346 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 14:29:00,346 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 14:29:00,352 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:29:00" (1/1) ... [2022-07-19 14:29:00,352 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:29:00" (1/1) ... [2022-07-19 14:29:00,364 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:29:00" (1/1) ... [2022-07-19 14:29:00,365 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:29:00" (1/1) ... [2022-07-19 14:29:00,377 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:29:00" (1/1) ... [2022-07-19 14:29:00,382 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:29:00" (1/1) ... [2022-07-19 14:29:00,391 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:29:00" (1/1) ... [2022-07-19 14:29:00,393 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 14:29:00,397 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 14:29:00,398 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 14:29:00,398 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 14:29:00,399 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:29:00" (1/1) ... [2022-07-19 14:29:00,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 14:29:00,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:29:00,457 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) [2022-07-19 14:29:00,494 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 [2022-07-19 14:29:00,511 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-19 14:29:00,512 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-19 14:29:00,512 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 14:29:00,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-19 14:29:00,512 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-19 14:29:00,512 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-19 14:29:00,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-19 14:29:00,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-19 14:29:00,513 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 14:29:00,513 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 14:29:00,587 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 14:29:00,589 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 14:29:01,337 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 14:29:01,342 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 14:29:01,342 INFO L299 CfgBuilder]: Removed 11 assume(true) statements. [2022-07-19 14:29:01,343 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 02:29:01 BoogieIcfgContainer [2022-07-19 14:29:01,344 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 14:29:01,345 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 14:29:01,345 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 14:29:01,347 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 14:29:01,347 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 02:28:59" (1/3) ... [2022-07-19 14:29:01,348 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@566f2a9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 02:29:01, skipping insertion in model container [2022-07-19 14:29:01,348 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:29:00" (2/3) ... [2022-07-19 14:29:01,348 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@566f2a9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 02:29:01, skipping insertion in model container [2022-07-19 14:29:01,349 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 02:29:01" (3/3) ... [2022-07-19 14:29:01,350 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-reverse.i [2022-07-19 14:29:01,360 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 14:29:01,361 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-07-19 14:29:01,396 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 14:29:01,401 INFO L357 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=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5afb1756, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3c7ea8a8 [2022-07-19 14:29:01,401 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-07-19 14:29:01,405 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 31 states have (on average 1.8064516129032258) internal successors, (56), 34 states have internal predecessors, (56), 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) [2022-07-19 14:29:01,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-19 14:29:01,409 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:29:01,409 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:29:01,410 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:29:01,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:29:01,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1808873062, now seen corresponding path program 1 times [2022-07-19 14:29:01,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:29:01,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [738271207] [2022-07-19 14:29:01,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:29:01,423 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:29:01,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:29:01,425 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) [2022-07-19 14:29:01,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-19 14:29:01,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:29:01,541 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-19 14:29:01,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:29:01,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:29:01,559 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 14:29:01,560 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:29:01,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [738271207] [2022-07-19 14:29:01,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [738271207] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:29:01,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:29:01,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-19 14:29:01,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942605019] [2022-07-19 14:29:01,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:29:01,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-19 14:29:01,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:29:01,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-19 14:29:01,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-19 14:29:01,592 INFO L87 Difference]: Start difference. First operand has 35 states, 31 states have (on average 1.8064516129032258) internal successors, (56), 34 states have internal predecessors, (56), 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 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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) [2022-07-19 14:29:01,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:29:01,609 INFO L93 Difference]: Finished difference Result 67 states and 107 transitions. [2022-07-19 14:29:01,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-19 14:29:01,612 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 7 [2022-07-19 14:29:01,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:29:01,618 INFO L225 Difference]: With dead ends: 67 [2022-07-19 14:29:01,618 INFO L226 Difference]: Without dead ends: 29 [2022-07-19 14:29:01,621 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-19 14:29:01,624 INFO L413 NwaCegarLoop]: 42 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, 42 SdHoareTripleChecker+Invalid, 0 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 [2022-07-19 14:29:01,626 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 14:29:01,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-07-19 14:29:01,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-07-19 14:29:01,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 28 states have internal predecessors, (35), 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) [2022-07-19 14:29:01,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2022-07-19 14:29:01,653 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 7 [2022-07-19 14:29:01,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:29:01,654 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2022-07-19 14:29:01,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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) [2022-07-19 14:29:01,654 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-07-19 14:29:01,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-19 14:29:01,654 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:29:01,655 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:29:01,683 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-07-19 14:29:01,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 14:29:01,864 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:29:01,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:29:01,866 INFO L85 PathProgramCache]: Analyzing trace with hash 239687661, now seen corresponding path program 1 times [2022-07-19 14:29:01,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:29:01,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [382172378] [2022-07-19 14:29:01,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:29:01,869 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:29:01,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:29:01,879 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) [2022-07-19 14:29:01,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-19 14:29:01,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:29:01,954 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 14:29:01,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:29:01,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:29:01,982 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 14:29:01,982 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:29:01,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [382172378] [2022-07-19 14:29:01,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [382172378] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:29:01,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:29:01,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 14:29:01,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958574016] [2022-07-19 14:29:01,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:29:01,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 14:29:01,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:29:01,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 14:29:01,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 14:29:01,984 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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) [2022-07-19 14:29:02,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:29:02,133 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2022-07-19 14:29:02,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 14:29:02,133 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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 8 [2022-07-19 14:29:02,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:29:02,134 INFO L225 Difference]: With dead ends: 54 [2022-07-19 14:29:02,134 INFO L226 Difference]: Without dead ends: 40 [2022-07-19 14:29:02,134 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 14:29:02,135 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 35 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 14:29:02,135 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 49 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 14:29:02,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-07-19 14:29:02,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 34. [2022-07-19 14:29:02,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 33 states have internal predecessors, (41), 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) [2022-07-19 14:29:02,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2022-07-19 14:29:02,139 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 8 [2022-07-19 14:29:02,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:29:02,139 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2022-07-19 14:29:02,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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) [2022-07-19 14:29:02,139 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2022-07-19 14:29:02,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-19 14:29:02,140 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:29:02,140 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:29:02,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-19 14:29:02,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 14:29:02,348 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:29:02,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:29:02,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1200905122, now seen corresponding path program 1 times [2022-07-19 14:29:02,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:29:02,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [185162950] [2022-07-19 14:29:02,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:29:02,349 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:29:02,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:29:02,350 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) [2022-07-19 14:29:02,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-19 14:29:02,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:29:02,407 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-19 14:29:02,409 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:29:02,501 INFO L390 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 17 [2022-07-19 14:29:02,505 INFO L390 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 13 [2022-07-19 14:29:02,524 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:29:02,524 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:29:02,583 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:29:02,583 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:29:02,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [185162950] [2022-07-19 14:29:02,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [185162950] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:29:02,584 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 14:29:02,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2022-07-19 14:29:02,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639793836] [2022-07-19 14:29:02,584 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 14:29:02,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 14:29:02,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:29:02,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 14:29:02,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-19 14:29:02,585 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 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) [2022-07-19 14:29:03,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:29:03,088 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2022-07-19 14:29:03,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 14:29:03,089 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 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 13 [2022-07-19 14:29:03,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:29:03,090 INFO L225 Difference]: With dead ends: 35 [2022-07-19 14:29:03,090 INFO L226 Difference]: Without dead ends: 31 [2022-07-19 14:29:03,090 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-07-19 14:29:03,091 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 15 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-19 14:29:03,091 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 31 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-19 14:29:03,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-07-19 14:29:03,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 26. [2022-07-19 14:29:03,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 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) [2022-07-19 14:29:03,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2022-07-19 14:29:03,094 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 13 [2022-07-19 14:29:03,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:29:03,102 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2022-07-19 14:29:03,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 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) [2022-07-19 14:29:03,102 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2022-07-19 14:29:03,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-19 14:29:03,103 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:29:03,103 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:29:03,110 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-07-19 14:29:03,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 14:29:03,311 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:29:03,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:29:03,311 INFO L85 PathProgramCache]: Analyzing trace with hash 825424614, now seen corresponding path program 1 times [2022-07-19 14:29:03,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:29:03,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2062542865] [2022-07-19 14:29:03,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:29:03,312 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:29:03,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:29:03,313 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) [2022-07-19 14:29:03,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-19 14:29:03,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:29:03,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-19 14:29:03,444 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:29:03,451 INFO L390 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 [2022-07-19 14:29:03,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:29:03,527 INFO L390 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 0 case distinctions, treesize of input 14 treesize of output 14 [2022-07-19 14:29:03,538 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-19 14:29:03,538 INFO L390 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 28 treesize of output 29 [2022-07-19 14:29:03,546 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-19 14:29:03,546 INFO L390 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 15 [2022-07-19 14:29:03,601 INFO L390 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 [2022-07-19 14:29:03,622 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:29:03,622 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:29:03,682 INFO L356 Elim1Store]: treesize reduction 25, result has 50.0 percent of original size [2022-07-19 14:29:03,682 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 84 [2022-07-19 14:29:03,760 INFO L356 Elim1Store]: treesize reduction 57, result has 41.2 percent of original size [2022-07-19 14:29:03,760 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 134 treesize of output 132 [2022-07-19 14:29:03,779 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:29:03,779 INFO L390 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 100 treesize of output 102 [2022-07-19 14:29:03,790 INFO L390 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 70 treesize of output 66 [2022-07-19 14:29:03,841 INFO L390 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 8 treesize of output 6 [2022-07-19 14:29:03,854 INFO L390 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 6 treesize of output 4 [2022-07-19 14:29:03,886 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:29:03,886 INFO L390 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 59 treesize of output 63 [2022-07-19 14:29:03,936 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-19 14:29:03,936 INFO L390 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 55 treesize of output 54 [2022-07-19 14:29:03,973 INFO L390 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 6 treesize of output 4 [2022-07-19 14:29:04,010 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:29:04,011 INFO L390 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 28 treesize of output 32 [2022-07-19 14:29:04,031 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:29:04,031 INFO L390 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 76 treesize of output 64 [2022-07-19 14:29:04,270 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:29:04,271 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:29:04,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2062542865] [2022-07-19 14:29:04,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2062542865] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:29:04,271 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 14:29:04,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2022-07-19 14:29:04,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176274477] [2022-07-19 14:29:04,271 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 14:29:04,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-19 14:29:04,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:29:04,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-19 14:29:04,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-07-19 14:29:04,272 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 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) [2022-07-19 14:29:05,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:29:05,225 INFO L93 Difference]: Finished difference Result 50 states and 61 transitions. [2022-07-19 14:29:05,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 14:29:05,228 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 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 18 [2022-07-19 14:29:05,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:29:05,229 INFO L225 Difference]: With dead ends: 50 [2022-07-19 14:29:05,229 INFO L226 Difference]: Without dead ends: 40 [2022-07-19 14:29:05,230 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2022-07-19 14:29:05,230 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 53 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 14 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-19 14:29:05,230 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 89 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 95 Invalid, 0 Unknown, 14 Unchecked, 0.9s Time] [2022-07-19 14:29:05,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-07-19 14:29:05,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 34. [2022-07-19 14:29:05,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 33 states have internal predecessors, (42), 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) [2022-07-19 14:29:05,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2022-07-19 14:29:05,235 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 18 [2022-07-19 14:29:05,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:29:05,235 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2022-07-19 14:29:05,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 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) [2022-07-19 14:29:05,235 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2022-07-19 14:29:05,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-19 14:29:05,236 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:29:05,236 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:29:05,248 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-19 14:29:05,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 14:29:05,447 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:29:05,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:29:05,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1505482984, now seen corresponding path program 1 times [2022-07-19 14:29:05,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:29:05,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [728440607] [2022-07-19 14:29:05,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:29:05,448 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:29:05,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:29:05,449 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) [2022-07-19 14:29:05,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-19 14:29:05,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:29:05,546 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-19 14:29:05,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:29:05,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:29:05,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:29:05,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:29:05,559 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-07-19 14:29:05,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:29:05,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:29:05,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:29:05,566 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-07-19 14:29:05,646 INFO L390 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 [2022-07-19 14:29:05,648 INFO L390 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 [2022-07-19 14:29:05,658 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-19 14:29:05,658 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 14:29:05,658 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:29:05,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [728440607] [2022-07-19 14:29:05,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [728440607] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:29:05,658 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:29:05,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 14:29:05,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897809484] [2022-07-19 14:29:05,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:29:05,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 14:29:05,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:29:05,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 14:29:05,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 14:29:05,660 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 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) [2022-07-19 14:29:06,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:29:06,297 INFO L93 Difference]: Finished difference Result 67 states and 82 transitions. [2022-07-19 14:29:06,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 14:29:06,298 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 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 [2022-07-19 14:29:06,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:29:06,298 INFO L225 Difference]: With dead ends: 67 [2022-07-19 14:29:06,298 INFO L226 Difference]: Without dead ends: 54 [2022-07-19 14:29:06,298 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-19 14:29:06,299 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 20 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-19 14:29:06,299 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 76 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-19 14:29:06,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-07-19 14:29:06,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 42. [2022-07-19 14:29:06,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.2682926829268293) internal successors, (52), 41 states have internal predecessors, (52), 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) [2022-07-19 14:29:06,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 52 transitions. [2022-07-19 14:29:06,304 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 52 transitions. Word has length 18 [2022-07-19 14:29:06,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:29:06,304 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 52 transitions. [2022-07-19 14:29:06,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 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) [2022-07-19 14:29:06,304 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 52 transitions. [2022-07-19 14:29:06,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-19 14:29:06,305 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:29:06,305 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:29:06,316 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-19 14:29:06,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 14:29:06,514 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:29:06,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:29:06,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1413183039, now seen corresponding path program 2 times [2022-07-19 14:29:06,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:29:06,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [877180059] [2022-07-19 14:29:06,515 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 14:29:06,515 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:29:06,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:29:06,516 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) [2022-07-19 14:29:06,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-19 14:29:06,696 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 14:29:06,696 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 14:29:06,706 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 73 conjunts are in the unsatisfiable core [2022-07-19 14:29:06,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:29:06,718 INFO L390 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 [2022-07-19 14:29:06,791 INFO L390 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 [2022-07-19 14:29:06,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:29:06,854 INFO L390 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 57 [2022-07-19 14:29:06,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:29:06,866 INFO L390 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 0 case distinctions, treesize of input 35 treesize of output 34 [2022-07-19 14:29:06,881 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-19 14:29:06,882 INFO L390 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 48 treesize of output 47 [2022-07-19 14:29:06,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:29:06,888 INFO L390 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 [2022-07-19 14:29:06,894 INFO L390 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 0 case distinctions, treesize of input 18 treesize of output 18 [2022-07-19 14:29:06,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:29:06,899 INFO L390 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 18 treesize of output 20 [2022-07-19 14:29:06,907 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-19 14:29:06,908 INFO L390 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 15 [2022-07-19 14:29:06,959 INFO L390 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 16 treesize of output 8 [2022-07-19 14:29:06,963 INFO L390 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 [2022-07-19 14:29:06,974 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2022-07-19 14:29:07,002 INFO L390 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2022-07-19 14:29:07,006 INFO L390 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 18 treesize of output 20 [2022-07-19 14:29:07,013 INFO L390 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 14 treesize of output 15 [2022-07-19 14:29:07,126 INFO L390 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 37 treesize of output 25 [2022-07-19 14:29:07,130 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:29:07,131 INFO L390 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 7 [2022-07-19 14:29:07,150 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:29:07,150 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:29:07,228 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_339 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_339) |c_ULTIMATE.start_main_~prev~0#1.base|) (bvadd |c_ULTIMATE.start_main_~prev~0#1.offset| (_ bv8 32))) (_ bv1 32))) is different from false [2022-07-19 14:29:07,261 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_338 (_ BitVec 32)) (v_ArrVal_335 (_ BitVec 32)) (v_ArrVal_339 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_335) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_338)) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_339) |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~x~0#1.offset|)) (_ bv1 32))) is different from false [2022-07-19 14:29:07,277 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_338 (_ BitVec 32)) (v_ArrVal_335 (_ BitVec 32)) (v_ArrVal_339 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_335) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)) v_ArrVal_338)) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) v_ArrVal_339) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))) (_ bv1 32))) is different from false [2022-07-19 14:29:07,408 INFO L356 Elim1Store]: treesize reduction 25, result has 50.0 percent of original size [2022-07-19 14:29:07,408 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 164 treesize of output 175 [2022-07-19 14:29:07,939 INFO L356 Elim1Store]: treesize reduction 57, result has 41.2 percent of original size [2022-07-19 14:29:07,939 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 291 treesize of output 279 [2022-07-19 14:29:08,073 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:29:08,073 INFO L390 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 162 treesize of output 164 [2022-07-19 14:29:08,080 INFO L390 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 270 treesize of output 266 [2022-07-19 14:29:08,207 INFO L390 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 8 treesize of output 6 [2022-07-19 14:29:08,257 INFO L390 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 6 treesize of output 4 [2022-07-19 14:29:08,295 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:29:08,295 INFO L390 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 143 treesize of output 147 [2022-07-19 14:29:08,436 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-19 14:29:08,437 INFO L390 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 139 treesize of output 138 [2022-07-19 14:29:22,538 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:29:22,539 INFO L390 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 181 treesize of output 185 [2022-07-19 14:29:24,783 INFO L390 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 408 treesize of output 404 [2022-07-19 14:29:31,960 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:29:31,960 INFO L390 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 983 treesize of output 899 [2022-07-19 14:29:42,364 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:29:42,396 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:29:42,396 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 31 treesize of output 38 [2022-07-19 14:29:42,403 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:29:42,411 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:29:42,412 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 31 treesize of output 38 [2022-07-19 14:29:42,465 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:29:42,482 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:29:42,482 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 38 [2022-07-19 14:29:42,489 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:29:42,497 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:29:42,498 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 38 [2022-07-19 14:29:42,517 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:29:42,526 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:29:42,526 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 31 treesize of output 38 [2022-07-19 14:29:45,138 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:29:45,149 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:29:45,149 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 38 [2022-07-19 14:29:45,816 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:29:45,823 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:29:45,823 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 38 [2022-07-19 14:29:45,829 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:29:45,838 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:29:45,840 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 38 [2022-07-19 14:29:45,870 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:29:45,877 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:29:45,877 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 38 [2022-07-19 14:29:45,885 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:29:45,892 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:29:45,893 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 38 [2022-07-19 14:29:45,907 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:29:45,917 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:29:45,918 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 38 [2022-07-19 14:29:48,863 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:29:48,871 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:29:48,871 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 31 treesize of output 38 [2022-07-19 14:29:49,503 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:29:49,512 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:29:49,513 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 31 treesize of output 38 [2022-07-19 14:29:49,521 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:29:49,530 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:29:49,531 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 31 treesize of output 38 [2022-07-19 14:29:49,573 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:29:49,582 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:29:49,582 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 38 [2022-07-19 14:29:49,588 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:29:49,596 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:29:49,597 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 38 [2022-07-19 14:29:51,381 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:29:51,389 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:29:51,389 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 38 [2022-07-19 14:29:51,394 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:29:51,402 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:29:51,402 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 38 [2022-07-19 14:29:51,432 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:29:51,439 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:29:51,439 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 38 [2022-07-19 14:29:51,445 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:29:51,452 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:29:51,452 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 38 [2022-07-19 14:29:55,287 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:29:55,297 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:29:55,297 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 31 treesize of output 38 [2022-07-19 14:29:55,867 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:29:55,874 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:29:55,875 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 31 treesize of output 38 [2022-07-19 14:29:55,892 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:29:55,901 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:29:55,902 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 38 [2022-07-19 14:29:55,911 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:29:55,918 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:29:55,919 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 31 treesize of output 38 [2022-07-19 14:29:55,926 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:29:55,934 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:29:55,934 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 38 [2022-07-19 14:29:55,967 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:29:55,975 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:29:55,975 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 31 treesize of output 38 [2022-07-19 14:29:56,005 INFO L356 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2022-07-19 14:29:56,006 INFO L390 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 38 [2022-07-19 14:29:56,012 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:29:56,019 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:29:56,020 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 31 treesize of output 38 [2022-07-19 14:29:56,039 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:29:56,046 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:29:56,046 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 31 treesize of output 38 [2022-07-19 14:29:56,053 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:29:56,061 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:29:56,061 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 38 [2022-07-19 14:29:57,916 INFO L356 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2022-07-19 14:29:57,916 INFO L390 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 38 [2022-07-19 14:29:57,922 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:29:57,929 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:29:57,929 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 31 treesize of output 38 [2022-07-19 14:29:57,947 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:29:57,954 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:29:57,954 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 31 treesize of output 38 [2022-07-19 14:29:57,962 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:29:57,969 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:29:57,969 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 38 [2022-07-19 14:29:59,898 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse14 (= |c_ULTIMATE.start_main_~head~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse42 (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|))) (let ((.cse10 (not (= (_ bv0 1) .cse42))) (.cse32 (not (= (select |c_#valid| |c_ULTIMATE.start_main_~x~0#1.base|) (_ bv0 1)))) (.cse5 (not .cse14)) (.cse7 (= |c_ULTIMATE.start_main_~head~0#1.offset| |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse1 (or (and (forall ((v_ArrVal_322 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_48 (_ BitVec 32)) (v_arrayElimCell_54 (_ BitVec 32)) (v_ArrVal_338 (_ BitVec 32)) (v_ArrVal_335 (_ BitVec 32)) (v_ArrVal_320 (_ BitVec 32)) (v_ArrVal_339 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_54))) (= (select (select (store (let ((.cse48 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_320)) v_arrayElimCell_54 v_ArrVal_322))) (store .cse48 |c_ULTIMATE.start_main_~head~0#1.base| (store (store (select .cse48 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_335) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)) v_ArrVal_338))) v_arrayElimCell_48 v_ArrVal_339) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))) (_ bv1 32)) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_54))) (or .cse32 (forall ((v_ArrVal_322 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_48 (_ BitVec 32)) (v_arrayElimCell_43 (_ BitVec 32)) (v_ArrVal_338 (_ BitVec 32)) (v_ArrVal_335 (_ BitVec 32)) (v_ArrVal_339 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse49 (let ((.cse51 (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_322))) (store .cse51 |c_ULTIMATE.start_main_~head~0#1.base| (store (store (select .cse51 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_335) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)) v_ArrVal_338)))) (.cse50 (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32)))) (or (= (select (select (store .cse49 v_arrayElimCell_43 v_ArrVal_339) |c_ULTIMATE.start_main_~head~0#1.base|) .cse50) (_ bv1 32)) (= (select (select (store .cse49 v_arrayElimCell_48 v_ArrVal_339) |c_ULTIMATE.start_main_~head~0#1.base|) .cse50) (_ bv1 32))))))) .cse5 .cse7)) (.cse2 (or .cse32 .cse5 (forall ((v_ArrVal_322 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_43 (_ BitVec 32)) (v_ArrVal_338 (_ BitVec 32)) (v_ArrVal_335 (_ BitVec 32)) (v_ArrVal_339 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (let ((.cse47 (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_322))) (store .cse47 |c_ULTIMATE.start_main_~head~0#1.base| (store (store (select .cse47 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_335) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)) v_ArrVal_338))) v_arrayElimCell_43 v_ArrVal_339) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))) (_ bv1 32))))) (.cse0 (= (_ bv4 32) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse3 (or .cse10 (forall ((v_ArrVal_322 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_43 (_ BitVec 32)) (v_ArrVal_338 (_ BitVec 32)) (v_ArrVal_335 (_ BitVec 32)) (v_ArrVal_320 (_ BitVec 32)) (v_ArrVal_339 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_320)) |c_ULTIMATE.start_main_~head~0#1.base| (store (store v_ArrVal_322 |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_335) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)) v_ArrVal_338)) v_arrayElimCell_43 v_ArrVal_339) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))) (_ bv1 32))))) (.cse6 (forall ((v_ArrVal_322 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_48 (_ BitVec 32)) (v_arrayElimCell_54 (_ BitVec 32)) (v_arrayElimCell_43 (_ BitVec 32)) (v_ArrVal_338 (_ BitVec 32)) (v_ArrVal_335 (_ BitVec 32)) (v_ArrVal_320 (_ BitVec 32)) (v_ArrVal_339 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_54))) (= (select (select (store (let ((.cse45 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_320)) v_arrayElimCell_54 v_ArrVal_322))) (store .cse45 |c_ULTIMATE.start_main_~head~0#1.base| (store (store (select .cse45 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_335) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)) v_ArrVal_338))) v_arrayElimCell_48 v_ArrVal_339) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))) (_ bv1 32)) (and (forall ((v_ArrVal_310 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (let ((.cse46 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_320)) v_arrayElimCell_54 v_ArrVal_310) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_322))) (store .cse46 |c_ULTIMATE.start_main_~head~0#1.base| (store (store (select .cse46 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_335) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)) v_ArrVal_338))) v_arrayElimCell_43 v_ArrVal_339) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))) (_ bv1 32))) (= v_arrayElimCell_54 |c_ULTIMATE.start_main_~x~0#1.base|))))) (.cse16 (or .cse32 (forall ((v_prenex_45 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_48 (_ BitVec 32)) (v_prenex_50 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_47 (_ BitVec 32))) (= (select (select (store (let ((.cse44 (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_45))) (store .cse44 |c_ULTIMATE.start_main_~head~0#1.base| (store (store (select .cse44 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| v_prenex_48) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)) v_prenex_47))) |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_50) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))) (_ bv1 32))))) (.cse9 (forall ((v_arrayElimCell_54 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_54))) (forall ((v_prenex_17 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_13 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_16 (_ BitVec 32)) (v_arrayElimCell_50 (_ BitVec 32)) (v_prenex_15 (_ BitVec 32)) (v_prenex_14 (_ BitVec 32))) (= (select (select (store (let ((.cse43 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_prenex_16)) v_arrayElimCell_54 v_prenex_13))) (store .cse43 |c_ULTIMATE.start_main_~head~0#1.base| (store (store (select .cse43 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| v_prenex_15) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)) v_prenex_14))) v_arrayElimCell_50 v_prenex_17) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))) (_ bv1 32))) (= v_arrayElimCell_54 |c_ULTIMATE.start_main_~x~0#1.base|) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_54)))) (.cse15 (= |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32))) (.cse8 (not (= (_ bv0 1) (bvneg (bvneg .cse42))))) (.cse12 (forall ((v_arrayElimCell_54 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_54))) (forall ((v_prenex_51 (_ BitVec 32)) (v_prenex_53 (_ BitVec 32)) (v_prenex_57 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_55 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_52 (_ BitVec 32)) (v_prenex_52 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_56 (_ BitVec 32))) (= (select (select (store (let ((.cse41 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_prenex_56)) v_arrayElimCell_54 v_prenex_57) |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_55))) (store .cse41 |c_ULTIMATE.start_main_~head~0#1.base| (store (store (select .cse41 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| v_prenex_51) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)) v_prenex_53))) v_arrayElimCell_52 v_prenex_52) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))) (_ bv1 32))) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_54)))) (.cse13 (forall ((v_arrayElimCell_54 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_54))) (= v_arrayElimCell_54 |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_prenex_35 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_34 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_38 (_ BitVec 32)) (v_prenex_37 (_ BitVec 32)) (v_prenex_36 (_ BitVec 32))) (= (select (select (store (let ((.cse40 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_prenex_36)) v_arrayElimCell_54 v_prenex_35))) (store .cse40 |c_ULTIMATE.start_main_~head~0#1.base| (store (store (select .cse40 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| v_prenex_37) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)) v_prenex_38))) |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_34) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))) (_ bv1 32))) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_54)))) (.cse4 (forall ((v_ArrVal_322 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_54 (_ BitVec 32)) (v_ArrVal_338 (_ BitVec 32)) (v_ArrVal_335 (_ BitVec 32)) (v_ArrVal_320 (_ BitVec 32)) (v_ArrVal_339 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_54))) (= (select (select (store (let ((.cse39 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_320)) v_arrayElimCell_54 v_ArrVal_322))) (store .cse39 |c_ULTIMATE.start_main_~head~0#1.base| (store (store (select .cse39 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_335) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)) v_ArrVal_338))) v_arrayElimCell_54 v_ArrVal_339) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))) (_ bv1 32)) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_54)))) (.cse17 (or .cse32 (forall ((v_ArrVal_322 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_338 (_ BitVec 32)) (v_ArrVal_335 (_ BitVec 32)) (v_ArrVal_339 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (let ((.cse37 (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_322))) (store .cse37 |c_ULTIMATE.start_main_~head~0#1.base| (store (store (select .cse37 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_335) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)) v_ArrVal_338))) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_339) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))) (_ bv1 32)) (and (forall ((v_arrayElimCell_43 (_ BitVec 32))) (= (select (select (store (let ((.cse38 (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_322))) (store .cse38 |c_ULTIMATE.start_main_~head~0#1.base| (store (store (select .cse38 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_335) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)) v_ArrVal_338))) v_arrayElimCell_43 v_ArrVal_339) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))) (_ bv1 32))) (= |c_ULTIMATE.start_main_~head~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|))))))) (and (or .cse0 (and .cse1 .cse2 (or (and .cse3 .cse4 (or .cse5 .cse6 .cse7) (or (and (or (and (forall ((v_arrayElimArr_30 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_31 (_ BitVec 32)) (v_prenex_33 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_25 (_ BitVec 32))) (= (_ bv1 32) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_prenex_31)) |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimArr_30) v_prenex_25 v_prenex_33) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))))) (or (forall ((v_prenex_29 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_32 (_ BitVec 32)) (v_arrayElimArr_31 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_27 (_ BitVec 32))) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_prenex_32)) |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimArr_31) v_prenex_27 v_prenex_29) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))) (_ bv1 32))) .cse7)) .cse8) .cse9 (or (forall ((v_prenex_49 (_ BitVec 32)) (v_prenex_50 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_34 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_46 (_ BitVec 32))) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_prenex_49)) |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimArr_34) v_prenex_46 v_prenex_50) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))) (_ bv1 32))) .cse10) (forall ((v_arrayElimCell_54 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_54))) (forall ((v_prenex_45 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_49 (_ BitVec 32)) (v_prenex_48 (_ BitVec 32)) (v_prenex_50 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_47 (_ BitVec 32))) (= (select (select (store (let ((.cse11 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_prenex_49)) v_arrayElimCell_54 v_prenex_45))) (store .cse11 |c_ULTIMATE.start_main_~head~0#1.base| (store (store (select .cse11 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| v_prenex_48) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)) v_prenex_47))) v_arrayElimCell_54 v_prenex_50) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))) (_ bv1 32))) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_54))) (or (and (forall ((v_prenex_54 (_ BitVec 32)) (v_prenex_42 (_ BitVec 32)) (v_prenex_40 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_32 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_prenex_42)) |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimArr_32) v_prenex_54 v_prenex_40) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))))) (or (forall ((v_prenex_8 (_ BitVec 32)) (v_prenex_12 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_11 (_ BitVec 32)) (v_arrayElimArr_33 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_prenex_11)) |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimArr_33) v_prenex_8 v_prenex_12) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))))) .cse7)) .cse8) .cse12 .cse13) .cse14)) .cse15) (or (and .cse16 (or (and (or (forall ((v_prenex_29 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_32 (_ BitVec 32)) (v_arrayElimArr_36 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_27 (_ BitVec 32))) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_prenex_32)) |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimArr_36) v_prenex_27 v_prenex_29) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))) (_ bv1 32))) .cse7) (forall ((v_prenex_31 (_ BitVec 32)) (v_prenex_33 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_25 (_ BitVec 32)) (v_arrayElimArr_35 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_prenex_31)) |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimArr_35) v_prenex_25 v_prenex_33) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))) (_ bv1 32)))) .cse8) (or (and .cse9 (or (and (or (forall ((v_prenex_8 (_ BitVec 32)) (v_prenex_12 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_38 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_11 (_ BitVec 32))) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_prenex_11)) |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimArr_38) v_prenex_8 v_prenex_12) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))) (_ bv1 32))) .cse7) (forall ((v_prenex_54 (_ BitVec 32)) (v_prenex_42 (_ BitVec 32)) (v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_40 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_prenex_42)) |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimArr_37) v_prenex_54 v_prenex_40) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))) (_ bv1 32)))) .cse8)) .cse15) .cse12 .cse13) .cse14) .cse4 .cse17)) .cse1 .cse2 (or (and .cse16 (or (and .cse9 (or (and (forall ((v_arrayElimArr_41 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_54 (_ BitVec 32)) (v_prenex_42 (_ BitVec 32)) (v_prenex_40 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_prenex_42)) |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimArr_41) v_prenex_54 v_prenex_40) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))))) (or (forall ((v_arrayElimArr_42 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_8 (_ BitVec 32)) (v_prenex_12 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_11 (_ BitVec 32))) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_prenex_11)) |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimArr_42) v_prenex_8 v_prenex_12) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))) (_ bv1 32))) .cse7)) .cse8)) .cse15) .cse12 .cse13 (or (and (or (forall ((v_arrayElimArr_40 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_29 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_32 (_ BitVec 32)) (v_prenex_27 (_ BitVec 32))) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_prenex_32)) |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimArr_40) v_prenex_27 v_prenex_29) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))) (_ bv1 32))) .cse7) (forall ((v_prenex_31 (_ BitVec 32)) (v_prenex_33 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_39 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_25 (_ BitVec 32))) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_prenex_31)) |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimArr_39) v_prenex_25 v_prenex_33) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))) (_ bv1 32)))) .cse8)) .cse14) (or (and (or .cse0 (let ((.cse18 (or .cse5 .cse6))) (and (or (and .cse18 (forall ((v_ArrVal_322 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_54 (_ BitVec 32)) (v_ArrVal_338 (_ BitVec 32)) (v_ArrVal_335 (_ BitVec 32)) (v_ArrVal_320 (_ BitVec 32)) (v_ArrVal_339 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_54))) (forall ((v_arrayElimCell_53 (_ BitVec 32))) (= (select (select (store (let ((.cse19 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_320)) v_arrayElimCell_54 v_ArrVal_322))) (store .cse19 |c_ULTIMATE.start_main_~head~0#1.base| (store (store (select .cse19 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_335) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)) v_ArrVal_338))) v_arrayElimCell_53 v_ArrVal_339) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))) (_ bv1 32))) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_54))) .cse3 (or (and .cse9 (forall ((v_arrayElimCell_54 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_54))) (forall ((v_arrayElimCell_53 (_ BitVec 32)) (v_prenex_45 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_49 (_ BitVec 32)) (v_prenex_48 (_ BitVec 32)) (v_prenex_50 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_47 (_ BitVec 32))) (= (select (select (store (let ((.cse20 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_prenex_49)) v_arrayElimCell_54 v_prenex_45))) (store .cse20 |c_ULTIMATE.start_main_~head~0#1.base| (store (store (select .cse20 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| v_prenex_48) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)) v_prenex_47))) v_arrayElimCell_53 v_prenex_50) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))) (_ bv1 32))) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_54))) (or .cse8 (and (forall ((v_arrayElimArr_18 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_8 (_ BitVec 32)) (v_prenex_12 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_11 (_ BitVec 32))) (= (_ bv1 32) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_prenex_11)) |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimArr_18) v_prenex_8 v_prenex_12) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))))) (forall ((v_prenex_54 (_ BitVec 32)) (v_prenex_42 (_ BitVec 32)) (v_prenex_40 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_prenex_42)) |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimArr_17) v_prenex_54 v_prenex_40) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))) (_ bv1 32))))) (or (and (forall ((v_prenex_29 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_32 (_ BitVec 32)) (v_prenex_27 (_ BitVec 32)) (v_arrayElimArr_16 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_prenex_32)) |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimArr_16) v_prenex_27 v_prenex_29) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))) (_ bv1 32))) (forall ((v_prenex_31 (_ BitVec 32)) (v_prenex_33 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_15 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_25 (_ BitVec 32))) (= (_ bv1 32) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_prenex_31)) |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimArr_15) v_prenex_25 v_prenex_33) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32)))))) .cse8) .cse12 (or (forall ((v_arrayElimArr_19 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_49 (_ BitVec 32)) (v_prenex_50 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_46 (_ BitVec 32))) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_prenex_49)) |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimArr_19) v_prenex_46 v_prenex_50) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))) (_ bv1 32))) .cse10) .cse13) .cse14)) .cse15) .cse18 (forall ((v_ArrVal_322 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_54 (_ BitVec 32)) (v_ArrVal_338 (_ BitVec 32)) (v_ArrVal_335 (_ BitVec 32)) (v_ArrVal_320 (_ BitVec 32)) (v_ArrVal_339 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_54))) (= (select (select (store (let ((.cse21 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_320)) v_arrayElimCell_54 v_ArrVal_322))) (store .cse21 |c_ULTIMATE.start_main_~head~0#1.base| (store (store (select .cse21 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_335) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)) v_ArrVal_338))) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_339) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))) (_ bv1 32)) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_54))) (forall ((v_ArrVal_322 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_54 (_ BitVec 32)) (v_ArrVal_338 (_ BitVec 32)) (v_ArrVal_335 (_ BitVec 32)) (v_ArrVal_320 (_ BitVec 32)) (v_ArrVal_339 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_54))) (and (or (forall ((v_arrayElimCell_48 (_ BitVec 32))) (= (select (select (store (let ((.cse22 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_320)) v_arrayElimCell_54 v_ArrVal_322))) (store .cse22 |c_ULTIMATE.start_main_~head~0#1.base| (store (store (select .cse22 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_335) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)) v_ArrVal_338))) v_arrayElimCell_48 v_ArrVal_339) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))) (_ bv1 32))) (not (= |c_ULTIMATE.start_main_~head~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|))) (forall ((v_arrayElimCell_53 (_ BitVec 32))) (= (select (select (store (let ((.cse23 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_320)) v_arrayElimCell_54 v_ArrVal_322))) (store .cse23 |c_ULTIMATE.start_main_~head~0#1.base| (store (store (select .cse23 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_335) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)) v_ArrVal_338))) v_arrayElimCell_53 v_ArrVal_339) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))) (_ bv1 32)))) (= v_arrayElimCell_54 |c_ULTIMATE.start_main_~x~0#1.base|) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_54))) .cse3 (or .cse14 (and (or .cse10 (forall ((v_prenex_49 (_ BitVec 32)) (v_prenex_50 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_46 (_ BitVec 32))) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_prenex_49)) |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimArr_13) v_prenex_46 v_prenex_50) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))) (_ bv1 32)))) (forall ((v_arrayElimCell_54 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_54))) (forall ((v_prenex_45 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_49 (_ BitVec 32)) (v_prenex_48 (_ BitVec 32)) (v_prenex_50 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_47 (_ BitVec 32))) (= (select (select (store (let ((.cse24 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_prenex_49)) v_arrayElimCell_54 v_prenex_45))) (store .cse24 |c_ULTIMATE.start_main_~head~0#1.base| (store (store (select .cse24 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| v_prenex_48) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)) v_prenex_47))) |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_50) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))) (_ bv1 32))) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_54))) (or .cse8 (and (forall ((v_arrayElimArr_9 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_31 (_ BitVec 32)) (v_prenex_33 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_25 (_ BitVec 32))) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_prenex_31)) |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimArr_9) v_prenex_25 v_prenex_33) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))) (_ bv1 32))) (forall ((v_prenex_29 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_32 (_ BitVec 32)) (v_prenex_27 (_ BitVec 32)) (v_arrayElimArr_10 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_prenex_32)) |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimArr_10) v_prenex_27 v_prenex_29) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))) (_ bv1 32))))) (or .cse15 (and .cse9 (or (and (forall ((v_prenex_54 (_ BitVec 32)) (v_prenex_42 (_ BitVec 32)) (v_prenex_40 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_prenex_42)) |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimArr_11) v_prenex_54 v_prenex_40) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))) (_ bv1 32))) (forall ((v_prenex_8 (_ BitVec 32)) (v_prenex_12 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_11 (_ BitVec 32)) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_prenex_11)) |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimArr_12) v_prenex_8 v_prenex_12) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32)))))) .cse8))) .cse12 .cse13))))) (forall ((v_ArrVal_322 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_54 (_ BitVec 32)) (v_ArrVal_338 (_ BitVec 32)) (v_ArrVal_335 (_ BitVec 32)) (v_ArrVal_320 (_ BitVec 32)) (v_ArrVal_339 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_54))) (and (or (forall ((v_arrayElimCell_48 (_ BitVec 32))) (= (select (select (store (let ((.cse25 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_320)) v_arrayElimCell_54 v_ArrVal_322))) (store .cse25 |c_ULTIMATE.start_main_~head~0#1.base| (store (store (select .cse25 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_335) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)) v_ArrVal_338))) v_arrayElimCell_48 v_ArrVal_339) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))) (_ bv1 32))) (not (= |c_ULTIMATE.start_main_~head~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|))) (= (select (select (store (let ((.cse26 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_320)) v_arrayElimCell_54 v_ArrVal_322))) (store .cse26 |c_ULTIMATE.start_main_~head~0#1.base| (store (store (select .cse26 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_335) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)) v_ArrVal_338))) v_arrayElimCell_54 v_ArrVal_339) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))) (_ bv1 32))) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_54))) (or (and (forall ((v_ArrVal_322 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_54 (_ BitVec 32)) (v_ArrVal_338 (_ BitVec 32)) (v_ArrVal_335 (_ BitVec 32)) (v_ArrVal_320 (_ BitVec 32)) (v_ArrVal_339 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_54))) (and (or (forall ((v_arrayElimCell_48 (_ BitVec 32))) (= (select (select (store (let ((.cse27 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_320)) v_arrayElimCell_54 v_ArrVal_322))) (store .cse27 |c_ULTIMATE.start_main_~head~0#1.base| (store (store (select .cse27 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_335) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)) v_ArrVal_338))) v_arrayElimCell_48 v_ArrVal_339) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))) (_ bv1 32))) (not (= |c_ULTIMATE.start_main_~head~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|))) (forall ((v_arrayElimCell_53 (_ BitVec 32))) (= (select (select (store (let ((.cse28 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_320)) v_arrayElimCell_54 v_ArrVal_322))) (store .cse28 |c_ULTIMATE.start_main_~head~0#1.base| (store (store (select .cse28 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_335) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)) v_ArrVal_338))) v_arrayElimCell_53 v_ArrVal_339) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))) (_ bv1 32)))) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_54))) (or (forall ((v_ArrVal_322 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_338 (_ BitVec 32)) (v_ArrVal_335 (_ BitVec 32)) (v_ArrVal_339 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse30 (= |c_ULTIMATE.start_main_~head~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|))) (or (and (forall ((v_arrayElimCell_53 (_ BitVec 32))) (= (_ bv1 32) (select (select (store (let ((.cse29 (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_322))) (store .cse29 |c_ULTIMATE.start_main_~head~0#1.base| (store (store (select .cse29 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_335) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)) v_ArrVal_338))) v_arrayElimCell_53 v_ArrVal_339) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))))) (not .cse30)) (and (forall ((v_arrayElimCell_43 (_ BitVec 32))) (= (select (select (store (let ((.cse31 (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_322))) (store .cse31 |c_ULTIMATE.start_main_~head~0#1.base| (store (store (select .cse31 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_335) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)) v_ArrVal_338))) v_arrayElimCell_43 v_ArrVal_339) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))) (_ bv1 32))) .cse30)))) .cse32) (or (and (or .cse8 (and (forall ((v_prenex_31 (_ BitVec 32)) (v_prenex_33 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_25 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_25 (_ BitVec 32))) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_prenex_31)) |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimArr_25) v_prenex_25 v_prenex_33) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))) (_ bv1 32))) (forall ((v_prenex_29 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_32 (_ BitVec 32)) (v_prenex_27 (_ BitVec 32)) (v_arrayElimArr_26 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_prenex_32)) |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimArr_26) v_prenex_27 v_prenex_29) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))) (_ bv1 32))))) .cse9 (or .cse8 (and (forall ((v_prenex_54 (_ BitVec 32)) (v_prenex_42 (_ BitVec 32)) (v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_40 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_prenex_42)) |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimArr_27) v_prenex_54 v_prenex_40) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))))) (forall ((v_prenex_8 (_ BitVec 32)) (v_prenex_12 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_28 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_11 (_ BitVec 32))) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_prenex_11)) |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimArr_28) v_prenex_8 v_prenex_12) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))) (_ bv1 32))))) .cse12 (or .cse32 (forall ((v_arrayElimCell_53 (_ BitVec 32)) (v_prenex_45 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_48 (_ BitVec 32)) (v_prenex_50 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_47 (_ BitVec 32))) (= (_ bv1 32) (select (select (store (let ((.cse33 (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_45))) (store .cse33 |c_ULTIMATE.start_main_~head~0#1.base| (store (store (select .cse33 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| v_prenex_48) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)) v_prenex_47))) v_arrayElimCell_53 v_prenex_50) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32)))))) .cse13) .cse14)) .cse15) (or .cse14 (and .cse16 (or (and .cse9 (or .cse8 (and (forall ((v_prenex_8 (_ BitVec 32)) (v_prenex_12 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_11 (_ BitVec 32)) (v_arrayElimArr_24 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_prenex_11)) |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimArr_24) v_prenex_8 v_prenex_12) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))) (_ bv1 32))) (forall ((v_prenex_54 (_ BitVec 32)) (v_prenex_42 (_ BitVec 32)) (v_prenex_40 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_23 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_prenex_42)) |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimArr_23) v_prenex_54 v_prenex_40) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))) (_ bv1 32)))))) .cse15) (or (and (forall ((v_prenex_31 (_ BitVec 32)) (v_prenex_33 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_21 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_25 (_ BitVec 32))) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_prenex_31)) |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimArr_21) v_prenex_25 v_prenex_33) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))) (_ bv1 32))) (forall ((v_prenex_29 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_32 (_ BitVec 32)) (v_prenex_27 (_ BitVec 32)) (v_arrayElimArr_22 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_prenex_32)) |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimArr_22) v_prenex_27 v_prenex_29) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))) (_ bv1 32)))) .cse8) .cse12 .cse13)) (or .cse32 (forall ((v_ArrVal_322 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_338 (_ BitVec 32)) (v_ArrVal_335 (_ BitVec 32)) (v_ArrVal_339 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse34 (= |c_ULTIMATE.start_main_~head~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|))) (or (and (not .cse34) (= (select (select (store (let ((.cse35 (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_322))) (store .cse35 |c_ULTIMATE.start_main_~head~0#1.base| (store (store (select .cse35 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_335) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)) v_ArrVal_338))) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_339) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))) (_ bv1 32))) (and (forall ((v_arrayElimCell_43 (_ BitVec 32))) (= (select (select (store (let ((.cse36 (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_322))) (store .cse36 |c_ULTIMATE.start_main_~head~0#1.base| (store (store (select .cse36 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_335) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)) v_ArrVal_338))) v_arrayElimCell_43 v_ArrVal_339) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))) (_ bv1 32))) .cse34)))))) .cse7) .cse4 .cse17)))) is different from false [2022-07-19 14:30:00,518 INFO L356 Elim1Store]: treesize reduction 23, result has 45.2 percent of original size [2022-07-19 14:30:00,519 INFO L390 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 2 case distinctions, treesize of input 63 treesize of output 56 [2022-07-19 14:30:00,521 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:30:00,522 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:30:00,523 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-19 14:30:00,527 INFO L390 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 11 treesize of output 7 [2022-07-19 14:30:00,535 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:30:00,536 INFO L390 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 9 treesize of output 3 [2022-07-19 14:30:00,560 INFO L356 Elim1Store]: treesize reduction 23, result has 45.2 percent of original size [2022-07-19 14:30:00,560 INFO L390 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 2 case distinctions, treesize of input 57 treesize of output 50 [2022-07-19 14:30:00,563 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:30:00,563 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:30:00,565 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-19 14:30:00,591 INFO L356 Elim1Store]: treesize reduction 23, result has 45.2 percent of original size [2022-07-19 14:30:00,592 INFO L390 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 2 case distinctions, treesize of input 28 treesize of output 34 [2022-07-19 14:30:00,594 INFO L390 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 34 treesize of output 28 [2022-07-19 14:30:00,598 INFO L390 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 12 treesize of output 8 [2022-07-19 14:30:00,600 INFO L390 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 11 treesize of output 7 [2022-07-19 14:30:00,628 INFO L356 Elim1Store]: treesize reduction 23, result has 45.2 percent of original size [2022-07-19 14:30:00,628 INFO L390 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 2 case distinctions, treesize of input 57 treesize of output 50 [2022-07-19 14:30:00,630 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:30:00,633 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-19 14:30:00,638 INFO L390 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 11 treesize of output 7 [2022-07-19 14:30:00,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:30:00,654 INFO L390 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 11 treesize of output 7 [2022-07-19 14:30:00,657 INFO L390 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 12 treesize of output 8 [2022-07-19 14:30:00,683 INFO L356 Elim1Store]: treesize reduction 23, result has 45.2 percent of original size [2022-07-19 14:30:00,683 INFO L390 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 2 case distinctions, treesize of input 57 treesize of output 50 [2022-07-19 14:30:00,686 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:30:00,700 INFO L356 Elim1Store]: treesize reduction 8, result has 46.7 percent of original size [2022-07-19 14:30:00,700 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 15 [2022-07-19 14:30:00,718 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:30:00,727 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:30:00,727 INFO L390 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 2 case distinctions, treesize of input 57 treesize of output 50 [2022-07-19 14:30:00,734 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:30:00,747 INFO L356 Elim1Store]: treesize reduction 8, result has 46.7 percent of original size [2022-07-19 14:30:00,747 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 15 [2022-07-19 14:30:00,760 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:30:00,768 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:30:00,768 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 50 [2022-07-19 14:30:00,771 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:30:00,773 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:30:00,773 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-19 14:30:00,777 INFO L390 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 11 treesize of output 7 [2022-07-19 14:30:00,793 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:30:00,801 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:30:00,801 INFO L390 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 2 case distinctions, treesize of input 57 treesize of output 50 [2022-07-19 14:30:00,804 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:30:00,816 INFO L356 Elim1Store]: treesize reduction 8, result has 46.7 percent of original size [2022-07-19 14:30:00,817 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 15 [2022-07-19 14:30:00,828 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-07-19 14:30:00,837 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:30:00,849 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:30:00,850 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 56 [2022-07-19 14:30:00,855 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:30:00,855 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:30:00,859 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-19 14:30:00,866 INFO L390 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 11 treesize of output 7 [2022-07-19 14:30:00,880 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:30:00,889 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:30:00,889 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 50 [2022-07-19 14:30:00,894 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:30:00,897 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-19 14:30:00,908 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:30:00,917 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:30:00,918 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 50 [2022-07-19 14:30:00,921 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:30:00,924 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-19 14:30:00,929 INFO L390 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 11 treesize of output 7 [2022-07-19 14:30:00,944 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:30:00,952 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:30:00,952 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 50 [2022-07-19 14:30:00,956 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:30:00,956 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:30:00,959 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-19 14:30:00,972 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-07-19 14:30:00,987 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:30:00,995 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:30:00,995 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 50 [2022-07-19 14:30:00,998 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:30:01,000 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:30:01,000 INFO L390 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 36 treesize of output 24 [2022-07-19 14:30:01,004 INFO L390 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 11 treesize of output 7 [2022-07-19 14:30:01,013 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-07-19 14:30:01,015 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-07-19 14:30:01,023 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:30:01,033 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:30:01,034 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 56 [2022-07-19 14:30:01,039 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:30:01,039 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:30:01,043 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-19 14:30:01,050 INFO L390 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 11 treesize of output 7 [2022-07-19 14:30:01,063 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:30:01,073 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:30:01,074 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 50 [2022-07-19 14:30:01,077 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:30:01,077 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:30:01,079 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-19 14:30:01,092 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:30:01,100 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:30:01,101 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 50 [2022-07-19 14:30:01,104 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:30:01,106 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-19 14:30:01,113 INFO L390 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 11 treesize of output 7 [2022-07-19 14:30:01,132 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:30:01,140 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:30:01,141 INFO L390 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 2 case distinctions, treesize of input 57 treesize of output 50 [2022-07-19 14:30:01,143 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:30:01,145 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:30:01,146 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-19 14:30:01,150 INFO L390 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 11 treesize of output 7 [2022-07-19 14:30:01,176 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:30:01,184 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:30:01,184 INFO L390 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 2 case distinctions, treesize of input 57 treesize of output 50 [2022-07-19 14:30:01,187 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:30:01,189 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:30:01,189 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-19 14:30:01,193 INFO L390 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 11 treesize of output 7 [2022-07-19 14:30:01,201 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:30:01,211 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:30:01,211 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 50 [2022-07-19 14:30:01,215 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:30:01,218 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-19 14:30:01,225 INFO L390 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 11 treesize of output 7 [2022-07-19 14:30:01,252 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:30:01,262 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:30:01,262 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 56 [2022-07-19 14:30:01,267 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:30:01,267 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:30:01,270 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-19 14:30:01,277 INFO L390 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 11 treesize of output 7 [2022-07-19 14:30:01,292 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:30:01,300 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:30:01,300 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 50 [2022-07-19 14:30:01,304 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:30:01,307 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-19 14:30:01,314 INFO L390 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 11 treesize of output 7 [2022-07-19 14:30:01,332 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:30:01,340 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:30:01,341 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 50 [2022-07-19 14:30:01,345 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:30:01,345 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:30:01,349 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-19 14:30:01,363 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:30:01,370 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:30:01,370 INFO L390 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 2 case distinctions, treesize of input 57 treesize of output 50 [2022-07-19 14:30:01,373 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:30:01,375 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:30:01,377 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:30:01,378 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 8 [2022-07-19 14:30:01,415 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:30:01,423 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:30:01,423 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 50 [2022-07-19 14:30:01,426 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:30:01,428 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:30:01,428 INFO L390 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 36 treesize of output 24 [2022-07-19 14:30:01,432 INFO L390 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 11 treesize of output 7 [2022-07-19 14:30:01,452 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:30:01,461 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:30:01,462 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 50 [2022-07-19 14:30:01,465 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:30:01,467 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:30:01,467 INFO L390 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 36 treesize of output 24 [2022-07-19 14:30:01,471 INFO L390 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 11 treesize of output 7 [2022-07-19 14:30:01,488 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:30:01,498 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:30:01,499 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 50 [2022-07-19 14:30:01,503 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:30:01,507 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-19 14:30:01,515 INFO L390 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 11 treesize of output 7 [2022-07-19 14:30:01,525 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-07-19 14:30:01,527 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-07-19 14:30:01,535 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:30:01,545 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:30:01,546 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 56 [2022-07-19 14:30:01,553 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:30:01,553 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:30:01,558 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-19 14:30:01,572 INFO L390 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 11 treesize of output 7 [2022-07-19 14:30:01,601 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:30:01,613 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:30:01,613 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 50 [2022-07-19 14:30:01,623 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:30:01,627 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-19 14:30:01,634 INFO L390 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 11 treesize of output 7 [2022-07-19 14:30:01,649 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:30:01,660 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:30:01,660 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 50 [2022-07-19 14:30:01,665 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:30:01,665 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:30:01,668 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-19 14:30:01,679 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-07-19 14:30:01,684 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-07-19 14:30:01,688 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:30:01,696 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:30:01,696 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 50 [2022-07-19 14:30:01,699 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:30:01,702 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:30:01,705 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:30:01,705 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 24 [2022-07-19 14:30:01,709 INFO L390 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 11 treesize of output 7 [2022-07-19 14:30:01,721 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:30:01,729 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:30:01,729 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 50 [2022-07-19 14:30:01,732 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:30:01,750 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:30:01,753 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:30:01,753 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 24 [2022-07-19 14:30:01,758 INFO L390 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 11 treesize of output 7 [2022-07-19 14:30:01,767 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-07-19 14:30:01,773 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:30:01,781 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:30:01,781 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 50 [2022-07-19 14:30:01,787 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:30:01,789 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:30:01,789 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-19 14:30:01,794 INFO L390 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 11 treesize of output 7 [2022-07-19 14:30:01,803 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:30:01,812 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:30:01,813 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 50 [2022-07-19 14:30:01,817 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:30:01,820 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-19 14:30:01,827 INFO L390 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 11 treesize of output 7 [2022-07-19 14:30:01,867 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:30:01,877 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:30:01,878 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 56 [2022-07-19 14:30:01,882 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:30:01,883 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:30:01,886 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-19 14:30:01,894 INFO L390 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 11 treesize of output 7 [2022-07-19 14:30:01,908 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:30:01,917 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:30:01,917 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 50 [2022-07-19 14:30:01,920 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:30:01,921 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:30:01,924 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-19 14:30:01,934 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-07-19 14:30:01,954 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:30:01,964 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:30:01,965 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 50 [2022-07-19 14:30:01,968 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:30:01,973 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-19 14:30:01,980 INFO L390 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 11 treesize of output 7 [2022-07-19 14:30:01,992 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-07-19 14:30:01,994 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-07-19 14:30:02,001 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:30:02,011 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:30:02,012 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 50 [2022-07-19 14:30:02,016 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:30:02,016 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:30:02,019 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-19 14:30:02,035 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:30:02,045 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:30:02,045 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 50 [2022-07-19 14:30:02,049 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:30:02,052 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-19 14:30:02,062 INFO L390 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 11 treesize of output 7 [2022-07-19 14:30:02,093 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:30:02,102 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:30:02,102 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 56 [2022-07-19 14:30:02,106 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:30:02,107 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:30:02,110 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-19 14:30:02,117 INFO L390 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 11 treesize of output 7 [2022-07-19 14:30:02,129 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:30:02,139 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:30:02,139 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 50 [2022-07-19 14:30:02,143 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:30:02,143 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:30:02,150 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-19 14:30:02,157 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-07-19 14:30:02,159 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-07-19 14:30:02,408 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-07-19 14:30:02,409 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:30:02,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [877180059] [2022-07-19 14:30:02,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [877180059] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:30:02,409 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 14:30:02,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2022-07-19 14:30:02,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703630497] [2022-07-19 14:30:02,409 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 14:30:02,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-19 14:30:02,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:30:02,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-19 14:30:02,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=176, Unknown=4, NotChecked=116, Total=342 [2022-07-19 14:30:02,410 INFO L87 Difference]: Start difference. First operand 42 states and 52 transitions. Second operand has 19 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 19 states have internal predecessors, (35), 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) [2022-07-19 14:30:06,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:30:06,288 INFO L93 Difference]: Finished difference Result 76 states and 92 transitions. [2022-07-19 14:30:06,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-19 14:30:06,288 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 19 states have internal predecessors, (35), 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 [2022-07-19 14:30:06,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:30:06,289 INFO L225 Difference]: With dead ends: 76 [2022-07-19 14:30:06,289 INFO L226 Difference]: Without dead ends: 74 [2022-07-19 14:30:06,289 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=81, Invalid=311, Unknown=4, NotChecked=156, Total=552 [2022-07-19 14:30:06,290 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 92 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 185 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-07-19 14:30:06,290 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 146 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 255 Invalid, 0 Unknown, 185 Unchecked, 3.5s Time] [2022-07-19 14:30:06,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-07-19 14:30:06,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 48. [2022-07-19 14:30:06,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 47 states have internal predecessors, (60), 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) [2022-07-19 14:30:06,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 60 transitions. [2022-07-19 14:30:06,294 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 60 transitions. Word has length 19 [2022-07-19 14:30:06,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:30:06,295 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 60 transitions. [2022-07-19 14:30:06,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 19 states have internal predecessors, (35), 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) [2022-07-19 14:30:06,295 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 60 transitions. [2022-07-19 14:30:06,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-19 14:30:06,295 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:30:06,295 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:30:06,316 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2022-07-19 14:30:06,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 14:30:06,507 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:30:06,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:30:06,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1413184961, now seen corresponding path program 1 times [2022-07-19 14:30:06,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:30:06,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [702281439] [2022-07-19 14:30:06,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:30:06,509 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:30:06,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:30:06,516 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) [2022-07-19 14:30:06,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-19 14:30:06,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:30:06,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-19 14:30:06,630 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:30:06,636 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-19 14:30:06,637 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 14:30:06,637 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:30:06,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [702281439] [2022-07-19 14:30:06,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [702281439] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:30:06,637 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:30:06,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 14:30:06,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747485856] [2022-07-19 14:30:06,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:30:06,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 14:30:06,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:30:06,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 14:30:06,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 14:30:06,638 INFO L87 Difference]: Start difference. First operand 48 states and 60 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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) [2022-07-19 14:30:06,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:30:06,665 INFO L93 Difference]: Finished difference Result 56 states and 69 transitions. [2022-07-19 14:30:06,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 14:30:06,665 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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 19 [2022-07-19 14:30:06,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:30:06,666 INFO L225 Difference]: With dead ends: 56 [2022-07-19 14:30:06,666 INFO L226 Difference]: Without dead ends: 54 [2022-07-19 14:30:06,666 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 14:30:06,667 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 6 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 62 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 [2022-07-19 14:30:06,667 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 62 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 14:30:06,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-07-19 14:30:06,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 48. [2022-07-19 14:30:06,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 47 states have internal predecessors, (60), 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) [2022-07-19 14:30:06,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 60 transitions. [2022-07-19 14:30:06,673 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 60 transitions. Word has length 19 [2022-07-19 14:30:06,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:30:06,673 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 60 transitions. [2022-07-19 14:30:06,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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) [2022-07-19 14:30:06,673 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 60 transitions. [2022-07-19 14:30:06,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-19 14:30:06,674 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:30:06,674 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:30:06,683 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2022-07-19 14:30:06,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 14:30:06,879 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:30:06,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:30:06,879 INFO L85 PathProgramCache]: Analyzing trace with hash -758128691, now seen corresponding path program 1 times [2022-07-19 14:30:06,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:30:06,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1671875369] [2022-07-19 14:30:06,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:30:06,880 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:30:06,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:30:06,881 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) [2022-07-19 14:30:06,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-19 14:30:07,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:30:07,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-19 14:30:07,031 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:30:07,052 INFO L390 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 [2022-07-19 14:30:07,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:30:07,070 INFO L390 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 0 case distinctions, treesize of input 14 treesize of output 14 [2022-07-19 14:30:07,082 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-19 14:30:07,082 INFO L390 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 28 treesize of output 29 [2022-07-19 14:30:07,092 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-19 14:30:07,092 INFO L390 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 15 [2022-07-19 14:30:07,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:30:07,164 INFO L390 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 25 [2022-07-19 14:30:07,184 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-19 14:30:07,185 INFO L390 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 27 treesize of output 28 [2022-07-19 14:30:07,206 INFO L390 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 [2022-07-19 14:30:07,213 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:30:07,213 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:30:07,238 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_547 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_547) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)))) is different from false [2022-07-19 14:30:07,245 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_546 (_ BitVec 32)) (v_ArrVal_547 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_546)) (select .cse0 |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_547)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)))) is different from false [2022-07-19 14:30:07,271 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_546 (_ BitVec 32)) (v_ArrVal_547 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| (store .cse0 (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32)) v_ArrVal_546)) (select .cse0 |c_ULTIMATE.start_main_~head~0#1.offset|) v_ArrVal_547)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)))) is different from false [2022-07-19 14:30:07,315 INFO L356 Elim1Store]: treesize reduction 25, result has 50.0 percent of original size [2022-07-19 14:30:07,315 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 182 treesize of output 130 [2022-07-19 14:30:07,393 INFO L356 Elim1Store]: treesize reduction 56, result has 48.1 percent of original size [2022-07-19 14:30:07,394 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 192 treesize of output 202 [2022-07-19 14:30:07,423 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:30:07,424 INFO L390 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 235 treesize of output 215 [2022-07-19 14:30:07,430 INFO L390 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 150 treesize of output 142 [2022-07-19 14:30:07,434 INFO L390 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 142 treesize of output 130 [2022-07-19 14:30:07,480 INFO L390 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 6 treesize of output 4 [2022-07-19 14:30:07,500 INFO L390 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 8 treesize of output 6 [2022-07-19 14:30:07,520 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-19 14:30:07,521 INFO L390 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 11 [2022-07-19 14:30:07,607 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:30:07,607 INFO L390 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 119 treesize of output 129 [2022-07-19 14:30:07,766 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:30:07,766 INFO L390 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 36 treesize of output 34 [2022-07-19 14:30:07,813 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-07-19 14:30:07,813 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:30:07,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1671875369] [2022-07-19 14:30:07,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1671875369] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:30:07,813 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 14:30:07,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 13 [2022-07-19 14:30:07,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190658200] [2022-07-19 14:30:07,814 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 14:30:07,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-19 14:30:07,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:30:07,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-19 14:30:07,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=69, Unknown=3, NotChecked=54, Total=156 [2022-07-19 14:30:07,815 INFO L87 Difference]: Start difference. First operand 48 states and 60 transitions. Second operand has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 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) [2022-07-19 14:30:09,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:30:09,756 INFO L93 Difference]: Finished difference Result 97 states and 118 transitions. [2022-07-19 14:30:09,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 14:30:09,756 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 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 [2022-07-19 14:30:09,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:30:09,758 INFO L225 Difference]: With dead ends: 97 [2022-07-19 14:30:09,759 INFO L226 Difference]: Without dead ends: 86 [2022-07-19 14:30:09,759 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=101, Unknown=3, NotChecked=66, Total=210 [2022-07-19 14:30:09,759 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 87 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 171 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-07-19 14:30:09,760 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 128 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 124 Invalid, 0 Unknown, 171 Unchecked, 1.9s Time] [2022-07-19 14:30:09,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-07-19 14:30:09,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 58. [2022-07-19 14:30:09,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 57 states have (on average 1.280701754385965) internal successors, (73), 57 states have internal predecessors, (73), 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) [2022-07-19 14:30:09,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 73 transitions. [2022-07-19 14:30:09,774 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 73 transitions. Word has length 19 [2022-07-19 14:30:09,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:30:09,774 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 73 transitions. [2022-07-19 14:30:09,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 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) [2022-07-19 14:30:09,775 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 73 transitions. [2022-07-19 14:30:09,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-19 14:30:09,775 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:30:09,775 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:30:09,785 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-19 14:30:09,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 14:30:09,977 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:30:09,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:30:09,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1841142266, now seen corresponding path program 3 times [2022-07-19 14:30:09,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:30:09,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [577340265] [2022-07-19 14:30:09,978 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-19 14:30:09,978 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:30:09,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:30:09,979 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) [2022-07-19 14:30:09,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-19 14:30:10,229 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-19 14:30:10,229 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 14:30:10,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 54 conjunts are in the unsatisfiable core [2022-07-19 14:30:10,247 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:30:10,253 INFO L390 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 [2022-07-19 14:30:10,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:30:10,334 INFO L390 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 0 case distinctions, treesize of input 157 treesize of output 156 [2022-07-19 14:30:10,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:30:10,338 INFO L390 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 0 case distinctions, treesize of input 41 treesize of output 40 [2022-07-19 14:30:10,352 INFO L356 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2022-07-19 14:30:10,352 INFO L390 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 43 [2022-07-19 14:30:10,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:30:10,357 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2022-07-19 14:30:10,361 INFO L390 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 15 treesize of output 23 [2022-07-19 14:30:10,365 INFO L390 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 15 treesize of output 23 [2022-07-19 14:30:10,373 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-19 14:30:10,373 INFO L390 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 15 [2022-07-19 14:30:10,424 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-19 14:30:10,425 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 41 [2022-07-19 14:30:10,429 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2022-07-19 14:30:10,432 INFO L390 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 24 treesize of output 18 [2022-07-19 14:30:10,434 INFO L390 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 11 treesize of output 7 [2022-07-19 14:30:10,459 INFO L390 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 [2022-07-19 14:30:10,461 INFO L390 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 [2022-07-19 14:30:10,473 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:30:10,473 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:30:10,498 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_692 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_692) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (_ bv0 32))) (forall ((v_ArrVal_691 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_691) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (_ bv0 32)))) is different from false [2022-07-19 14:30:10,505 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_692 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_692) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv0 32))) (forall ((v_ArrVal_691 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_691) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2022-07-19 14:30:11,641 INFO L356 Elim1Store]: treesize reduction 25, result has 50.0 percent of original size [2022-07-19 14:30:11,642 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 869 treesize of output 795 [2022-07-19 14:30:24,816 WARN L233 SmtUtils]: Spent 13.16s on a formula simplification. DAG size of input: 29 DAG size of output: 26 (called from [L 353] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-07-19 14:30:24,816 INFO L356 Elim1Store]: treesize reduction 15, result has 70.0 percent of original size [2022-07-19 14:30:24,817 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 810 treesize of output 655 [2022-07-19 14:30:24,840 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:30:27,835 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:30:27,835 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 602 treesize of output 572 [2022-07-19 14:30:27,850 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:30:32,846 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:30:32,847 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 550 treesize of output 562 [2022-07-19 14:30:32,977 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:30:33,665 INFO L244 Elim1Store]: Index analysis took 688 ms [2022-07-19 14:30:37,044 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:30:37,045 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 433 treesize of output 408 [2022-07-19 14:30:37,256 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:30:37,957 INFO L244 Elim1Store]: Index analysis took 701 ms [2022-07-19 14:30:41,770 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:30:41,771 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 345 treesize of output 368 [2022-07-19 14:32:04,454 WARN L233 SmtUtils]: Spent 1.38m on a formula simplification. DAG size of input: 1108 DAG size of output: 530 (called from [L 353] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-07-19 14:32:04,456 INFO L356 Elim1Store]: treesize reduction 5318, result has 31.6 percent of original size [2022-07-19 14:32:04,459 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 26 select indices, 26 select index equivalence classes, 0 disjoint index pairs (out of 325 index pairs), introduced 27 new quantified variables, introduced 325 case distinctions, treesize of input 2823493 treesize of output 2668855 [2022-07-19 14:32:22,950 WARN L233 SmtUtils]: Spent 18.49s on a formula simplification. DAG size of input: 3332 DAG size of output: 3331 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-19 14:32:32,221 WARN L233 SmtUtils]: Spent 9.25s on a formula simplification that was a NOOP. DAG size: 3321 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-19 14:32:40,861 WARN L233 SmtUtils]: Spent 8.35s on a formula simplification that was a NOOP. DAG size: 2884 (called from [L 167] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.eliminate) [2022-07-19 14:32:48,892 WARN L233 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 2874 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-19 14:32:56,890 WARN L233 SmtUtils]: Spent 7.99s on a formula simplification that was a NOOP. DAG size: 2874 (called from [L 172] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.eliminate) [2022-07-19 14:33:06,119 WARN L233 SmtUtils]: Spent 9.11s on a formula simplification that was a NOOP. DAG size: 3324 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-19 14:33:15,239 WARN L233 SmtUtils]: Spent 9.11s on a formula simplification that was a NOOP. DAG size: 3318 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-19 14:33:15,972 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:33:18,309 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:33:18,617 INFO L244 Elim1Store]: Index analysis took 1969 ms