./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-ext-properties/test-0513_1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-ext-properties/test-0513_1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2cd9310cc22b48510db29915dc2047c5968d5424a204e513aea9283dac5ac7bf --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 18:47:17,186 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 18:47:17,188 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 18:47:17,220 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 18:47:17,221 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 18:47:17,222 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 18:47:17,223 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 18:47:17,225 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 18:47:17,226 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 18:47:17,229 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 18:47:17,230 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 18:47:17,231 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 18:47:17,231 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 18:47:17,233 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 18:47:17,233 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 18:47:17,236 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 18:47:17,236 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 18:47:17,237 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 18:47:17,238 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 18:47:17,242 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 18:47:17,243 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 18:47:17,244 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 18:47:17,245 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 18:47:17,245 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 18:47:17,246 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 18:47:17,251 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 18:47:17,251 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 18:47:17,251 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 18:47:17,252 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 18:47:17,253 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 18:47:17,253 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 18:47:17,253 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 18:47:17,255 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 18:47:17,255 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 18:47:17,255 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 18:47:17,256 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 18:47:17,257 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 18:47:17,257 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 18:47:17,257 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 18:47:17,258 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 18:47:17,258 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 18:47:17,259 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 18:47:17,260 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-12 18:47:17,281 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 18:47:17,282 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 18:47:17,282 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 18:47:17,282 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 18:47:17,283 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 18:47:17,283 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 18:47:17,283 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 18:47:17,283 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 18:47:17,284 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 18:47:17,284 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 18:47:17,284 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 18:47:17,284 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-12 18:47:17,285 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 18:47:17,285 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 18:47:17,285 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 18:47:17,285 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-12 18:47:17,285 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-12 18:47:17,285 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-12 18:47:17,285 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 18:47:17,286 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-12 18:47:17,286 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 18:47:17,286 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 18:47:17,287 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 18:47:17,287 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 18:47:17,288 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 18:47:17,288 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 18:47:17,288 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 18:47:17,288 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 18:47:17,288 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 18:47:17,289 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 18:47:17,289 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2cd9310cc22b48510db29915dc2047c5968d5424a204e513aea9283dac5ac7bf [2022-07-12 18:47:17,461 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 18:47:17,476 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 18:47:17,478 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 18:47:17,479 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 18:47:17,479 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 18:47:17,480 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext-properties/test-0513_1.i [2022-07-12 18:47:17,537 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2077640f6/77c08e710a7b4df5be239f35856d8ff1/FLAG746ceffd5 [2022-07-12 18:47:17,939 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 18:47:17,942 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/test-0513_1.i [2022-07-12 18:47:17,951 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2077640f6/77c08e710a7b4df5be239f35856d8ff1/FLAG746ceffd5 [2022-07-12 18:47:17,962 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2077640f6/77c08e710a7b4df5be239f35856d8ff1 [2022-07-12 18:47:17,964 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 18:47:17,965 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 18:47:17,966 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 18:47:17,966 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 18:47:17,968 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 18:47:17,969 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 06:47:17" (1/1) ... [2022-07-12 18:47:17,969 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@673c0bee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:47:17, skipping insertion in model container [2022-07-12 18:47:17,969 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 06:47:17" (1/1) ... [2022-07-12 18:47:17,974 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 18:47:18,010 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 18:47:18,250 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 18:47:18,257 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 18:47:18,295 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 18:47:18,314 INFO L208 MainTranslator]: Completed translation [2022-07-12 18:47:18,315 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:47:18 WrapperNode [2022-07-12 18:47:18,315 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 18:47:18,316 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 18:47:18,316 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 18:47:18,317 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 18:47:18,322 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:47:18" (1/1) ... [2022-07-12 18:47:18,339 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:47:18" (1/1) ... [2022-07-12 18:47:18,361 INFO L137 Inliner]: procedures = 123, calls = 41, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 148 [2022-07-12 18:47:18,362 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 18:47:18,362 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 18:47:18,363 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 18:47:18,363 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 18:47:18,368 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:47:18" (1/1) ... [2022-07-12 18:47:18,368 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:47:18" (1/1) ... [2022-07-12 18:47:18,371 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:47:18" (1/1) ... [2022-07-12 18:47:18,371 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:47:18" (1/1) ... [2022-07-12 18:47:18,379 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:47:18" (1/1) ... [2022-07-12 18:47:18,388 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:47:18" (1/1) ... [2022-07-12 18:47:18,390 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:47:18" (1/1) ... [2022-07-12 18:47:18,401 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 18:47:18,403 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 18:47:18,403 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 18:47:18,404 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 18:47:18,405 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:47:18" (1/1) ... [2022-07-12 18:47:18,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 18:47:18,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:47:18,428 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-12 18:47:18,430 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-12 18:47:18,451 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 18:47:18,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 18:47:18,451 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 18:47:18,451 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 18:47:18,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 18:47:18,451 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 18:47:18,451 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 18:47:18,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 18:47:18,451 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 18:47:18,452 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 18:47:18,526 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 18:47:18,527 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 18:47:18,879 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 18:47:18,886 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 18:47:18,887 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-12 18:47:18,889 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 06:47:18 BoogieIcfgContainer [2022-07-12 18:47:18,889 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 18:47:18,891 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 18:47:18,891 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 18:47:18,893 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 18:47:18,893 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 06:47:17" (1/3) ... [2022-07-12 18:47:18,894 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77b9f679 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 06:47:18, skipping insertion in model container [2022-07-12 18:47:18,894 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:47:18" (2/3) ... [2022-07-12 18:47:18,894 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77b9f679 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 06:47:18, skipping insertion in model container [2022-07-12 18:47:18,894 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 06:47:18" (3/3) ... [2022-07-12 18:47:18,895 INFO L111 eAbstractionObserver]: Analyzing ICFG test-0513_1.i [2022-07-12 18:47:18,906 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 18:47:18,906 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 70 error locations. [2022-07-12 18:47:18,948 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 18:47:18,952 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=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@445d9e87, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@26419e66 [2022-07-12 18:47:18,952 INFO L358 AbstractCegarLoop]: Starting to check reachability of 70 error locations. [2022-07-12 18:47:18,955 INFO L276 IsEmpty]: Start isEmpty. Operand has 151 states, 80 states have (on average 2.125) internal successors, (170), 150 states have internal predecessors, (170), 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-12 18:47:18,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-12 18:47:18,959 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:47:18,960 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-12 18:47:18,960 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 18:47:18,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:47:18,964 INFO L85 PathProgramCache]: Analyzing trace with hash 28769460, now seen corresponding path program 1 times [2022-07-12 18:47:18,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:47:18,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246571590] [2022-07-12 18:47:18,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:47:18,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:47:19,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:47:19,061 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-12 18:47:19,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:47:19,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246571590] [2022-07-12 18:47:19,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246571590] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:47:19,063 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:47:19,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 18:47:19,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722646238] [2022-07-12 18:47:19,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:47:19,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-12 18:47:19,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:47:19,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-12 18:47:19,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 18:47:19,090 INFO L87 Difference]: Start difference. First operand has 151 states, 80 states have (on average 2.125) internal successors, (170), 150 states have internal predecessors, (170), 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 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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-12 18:47:19,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:47:19,112 INFO L93 Difference]: Finished difference Result 151 states and 165 transitions. [2022-07-12 18:47:19,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-12 18:47:19,115 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 5 [2022-07-12 18:47:19,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:47:19,122 INFO L225 Difference]: With dead ends: 151 [2022-07-12 18:47:19,123 INFO L226 Difference]: Without dead ends: 149 [2022-07-12 18:47:19,124 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-12 18:47:19,127 INFO L413 NwaCegarLoop]: 165 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, 165 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-12 18:47:19,129 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:47:19,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-07-12 18:47:19,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2022-07-12 18:47:19,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 79 states have (on average 2.0632911392405062) internal successors, (163), 148 states have internal predecessors, (163), 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-12 18:47:19,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 163 transitions. [2022-07-12 18:47:19,160 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 163 transitions. Word has length 5 [2022-07-12 18:47:19,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:47:19,160 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 163 transitions. [2022-07-12 18:47:19,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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-12 18:47:19,160 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 163 transitions. [2022-07-12 18:47:19,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-12 18:47:19,160 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:47:19,160 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:47:19,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 18:47:19,161 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 18:47:19,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:47:19,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1806849456, now seen corresponding path program 1 times [2022-07-12 18:47:19,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:47:19,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161635954] [2022-07-12 18:47:19,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:47:19,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:47:19,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:47:19,203 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-12 18:47:19,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:47:19,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161635954] [2022-07-12 18:47:19,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161635954] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:47:19,204 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:47:19,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 18:47:19,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075920107] [2022-07-12 18:47:19,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:47:19,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:47:19,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:47:19,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:47:19,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:47:19,206 INFO L87 Difference]: Start difference. First operand 149 states and 163 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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-12 18:47:19,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:47:19,339 INFO L93 Difference]: Finished difference Result 196 states and 213 transitions. [2022-07-12 18:47:19,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:47:19,340 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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-12 18:47:19,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:47:19,344 INFO L225 Difference]: With dead ends: 196 [2022-07-12 18:47:19,344 INFO L226 Difference]: Without dead ends: 195 [2022-07-12 18:47:19,347 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:47:19,348 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 43 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:47:19,348 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 234 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:47:19,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2022-07-12 18:47:19,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 153. [2022-07-12 18:47:19,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 83 states have (on average 2.036144578313253) internal successors, (169), 152 states have internal predecessors, (169), 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-12 18:47:19,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 169 transitions. [2022-07-12 18:47:19,357 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 169 transitions. Word has length 7 [2022-07-12 18:47:19,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:47:19,359 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 169 transitions. [2022-07-12 18:47:19,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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-12 18:47:19,359 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 169 transitions. [2022-07-12 18:47:19,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-12 18:47:19,360 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:47:19,362 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:47:19,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 18:47:19,363 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 18:47:19,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:47:19,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1806849360, now seen corresponding path program 1 times [2022-07-12 18:47:19,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:47:19,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008532782] [2022-07-12 18:47:19,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:47:19,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:47:19,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:47:19,394 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-12 18:47:19,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:47:19,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008532782] [2022-07-12 18:47:19,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008532782] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:47:19,394 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:47:19,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 18:47:19,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556153454] [2022-07-12 18:47:19,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:47:19,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:47:19,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:47:19,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:47:19,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:47:19,395 INFO L87 Difference]: Start difference. First operand 153 states and 169 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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-12 18:47:19,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:47:19,440 INFO L93 Difference]: Finished difference Result 173 states and 190 transitions. [2022-07-12 18:47:19,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:47:19,440 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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-12 18:47:19,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:47:19,441 INFO L225 Difference]: With dead ends: 173 [2022-07-12 18:47:19,441 INFO L226 Difference]: Without dead ends: 172 [2022-07-12 18:47:19,441 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:47:19,442 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 27 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:47:19,442 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 279 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:47:19,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-07-12 18:47:19,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 162. [2022-07-12 18:47:19,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 92 states have (on average 2.0434782608695654) internal successors, (188), 161 states have internal predecessors, (188), 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-12 18:47:19,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 188 transitions. [2022-07-12 18:47:19,448 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 188 transitions. Word has length 7 [2022-07-12 18:47:19,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:47:19,449 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 188 transitions. [2022-07-12 18:47:19,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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-12 18:47:19,449 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 188 transitions. [2022-07-12 18:47:19,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-12 18:47:19,450 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:47:19,450 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:47:19,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 18:47:19,450 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 18:47:19,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:47:19,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1806849231, now seen corresponding path program 1 times [2022-07-12 18:47:19,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:47:19,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818995298] [2022-07-12 18:47:19,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:47:19,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:47:19,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:47:19,475 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-12 18:47:19,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:47:19,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818995298] [2022-07-12 18:47:19,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818995298] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:47:19,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:47:19,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 18:47:19,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530000716] [2022-07-12 18:47:19,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:47:19,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:47:19,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:47:19,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:47:19,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:47:19,478 INFO L87 Difference]: Start difference. First operand 162 states and 188 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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-12 18:47:19,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:47:19,562 INFO L93 Difference]: Finished difference Result 191 states and 217 transitions. [2022-07-12 18:47:19,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:47:19,563 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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-12 18:47:19,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:47:19,564 INFO L225 Difference]: With dead ends: 191 [2022-07-12 18:47:19,564 INFO L226 Difference]: Without dead ends: 191 [2022-07-12 18:47:19,564 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:47:19,565 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 84 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:47:19,565 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 196 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:47:19,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-07-12 18:47:19,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 161. [2022-07-12 18:47:19,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 96 states have (on average 1.9479166666666667) internal successors, (187), 160 states have internal predecessors, (187), 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-12 18:47:19,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 187 transitions. [2022-07-12 18:47:19,571 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 187 transitions. Word has length 7 [2022-07-12 18:47:19,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:47:19,572 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 187 transitions. [2022-07-12 18:47:19,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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-12 18:47:19,572 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 187 transitions. [2022-07-12 18:47:19,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-12 18:47:19,572 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:47:19,573 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:47:19,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 18:47:19,573 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 18:47:19,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:47:19,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1806849232, now seen corresponding path program 1 times [2022-07-12 18:47:19,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:47:19,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190488089] [2022-07-12 18:47:19,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:47:19,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:47:19,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:47:19,627 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-12 18:47:19,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:47:19,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190488089] [2022-07-12 18:47:19,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190488089] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:47:19,627 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:47:19,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 18:47:19,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790233208] [2022-07-12 18:47:19,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:47:19,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:47:19,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:47:19,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:47:19,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:47:19,628 INFO L87 Difference]: Start difference. First operand 161 states and 187 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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-12 18:47:19,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:47:19,706 INFO L93 Difference]: Finished difference Result 157 states and 179 transitions. [2022-07-12 18:47:19,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:47:19,707 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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-12 18:47:19,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:47:19,708 INFO L225 Difference]: With dead ends: 157 [2022-07-12 18:47:19,708 INFO L226 Difference]: Without dead ends: 157 [2022-07-12 18:47:19,708 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:47:19,711 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 29 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:47:19,711 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 202 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:47:19,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-07-12 18:47:19,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2022-07-12 18:47:19,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 96 states have (on average 1.8645833333333333) internal successors, (179), 156 states have internal predecessors, (179), 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-12 18:47:19,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 179 transitions. [2022-07-12 18:47:19,727 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 179 transitions. Word has length 7 [2022-07-12 18:47:19,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:47:19,727 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 179 transitions. [2022-07-12 18:47:19,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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-12 18:47:19,727 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 179 transitions. [2022-07-12 18:47:19,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-12 18:47:19,727 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:47:19,727 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:47:19,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 18:47:19,728 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 18:47:19,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:47:19,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1188718309, now seen corresponding path program 1 times [2022-07-12 18:47:19,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:47:19,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891819658] [2022-07-12 18:47:19,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:47:19,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:47:19,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:47:19,783 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-12 18:47:19,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:47:19,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891819658] [2022-07-12 18:47:19,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891819658] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:47:19,783 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:47:19,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 18:47:19,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12362676] [2022-07-12 18:47:19,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:47:19,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 18:47:19,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:47:19,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 18:47:19,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:47:19,786 INFO L87 Difference]: Start difference. First operand 157 states and 179 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-12 18:47:19,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:47:19,813 INFO L93 Difference]: Finished difference Result 295 states and 329 transitions. [2022-07-12 18:47:19,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 18:47:19,814 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-12 18:47:19,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:47:19,815 INFO L225 Difference]: With dead ends: 295 [2022-07-12 18:47:19,815 INFO L226 Difference]: Without dead ends: 295 [2022-07-12 18:47:19,815 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:47:19,816 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 149 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:47:19,820 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 454 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:47:19,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2022-07-12 18:47:19,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 160. [2022-07-12 18:47:19,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 99 states have (on average 1.8080808080808082) internal successors, (179), 159 states have internal predecessors, (179), 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-12 18:47:19,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 179 transitions. [2022-07-12 18:47:19,825 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 179 transitions. Word has length 13 [2022-07-12 18:47:19,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:47:19,825 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 179 transitions. [2022-07-12 18:47:19,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-12 18:47:19,826 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 179 transitions. [2022-07-12 18:47:19,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-12 18:47:19,826 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:47:19,826 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:47:19,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 18:47:19,826 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 18:47:19,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:47:19,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1826682520, now seen corresponding path program 1 times [2022-07-12 18:47:19,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:47:19,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654229247] [2022-07-12 18:47:19,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:47:19,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:47:19,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:47:19,903 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-12 18:47:19,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:47:19,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654229247] [2022-07-12 18:47:19,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654229247] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:47:19,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:47:19,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 18:47:19,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982850293] [2022-07-12 18:47:19,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:47:19,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:47:19,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:47:19,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:47:19,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:47:19,905 INFO L87 Difference]: Start difference. First operand 160 states and 179 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:47:19,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:47:19,966 INFO L93 Difference]: Finished difference Result 156 states and 175 transitions. [2022-07-12 18:47:19,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:47:19,967 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-12 18:47:19,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:47:19,967 INFO L225 Difference]: With dead ends: 156 [2022-07-12 18:47:19,967 INFO L226 Difference]: Without dead ends: 156 [2022-07-12 18:47:19,968 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:47:19,968 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 23 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:47:19,969 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 204 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:47:19,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-07-12 18:47:19,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2022-07-12 18:47:19,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 99 states have (on average 1.7676767676767677) internal successors, (175), 155 states have internal predecessors, (175), 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-12 18:47:19,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 175 transitions. [2022-07-12 18:47:19,972 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 175 transitions. Word has length 16 [2022-07-12 18:47:19,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:47:19,972 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 175 transitions. [2022-07-12 18:47:19,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:47:19,973 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 175 transitions. [2022-07-12 18:47:19,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-12 18:47:19,973 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:47:19,973 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:47:19,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 18:47:19,973 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 18:47:19,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:47:19,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1826682519, now seen corresponding path program 1 times [2022-07-12 18:47:19,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:47:19,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826247264] [2022-07-12 18:47:19,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:47:19,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:47:19,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:47:20,023 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-12 18:47:20,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:47:20,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826247264] [2022-07-12 18:47:20,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826247264] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:47:20,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:47:20,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 18:47:20,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883683530] [2022-07-12 18:47:20,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:47:20,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:47:20,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:47:20,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:47:20,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:47:20,026 INFO L87 Difference]: Start difference. First operand 156 states and 175 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:47:20,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:47:20,076 INFO L93 Difference]: Finished difference Result 153 states and 172 transitions. [2022-07-12 18:47:20,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:47:20,076 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-12 18:47:20,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:47:20,078 INFO L225 Difference]: With dead ends: 153 [2022-07-12 18:47:20,078 INFO L226 Difference]: Without dead ends: 153 [2022-07-12 18:47:20,078 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:47:20,078 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 12 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:47:20,079 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 215 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:47:20,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-07-12 18:47:20,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2022-07-12 18:47:20,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 99 states have (on average 1.7373737373737375) internal successors, (172), 152 states have internal predecessors, (172), 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-12 18:47:20,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 172 transitions. [2022-07-12 18:47:20,084 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 172 transitions. Word has length 16 [2022-07-12 18:47:20,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:47:20,084 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 172 transitions. [2022-07-12 18:47:20,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:47:20,085 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 172 transitions. [2022-07-12 18:47:20,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-12 18:47:20,086 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:47:20,086 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:47:20,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 18:47:20,087 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 18:47:20,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:47:20,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1446351565, now seen corresponding path program 1 times [2022-07-12 18:47:20,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:47:20,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739287792] [2022-07-12 18:47:20,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:47:20,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:47:20,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:47:20,169 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:47:20,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:47:20,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739287792] [2022-07-12 18:47:20,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739287792] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:47:20,170 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:47:20,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 18:47:20,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175967416] [2022-07-12 18:47:20,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:47:20,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 18:47:20,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:47:20,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 18:47:20,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:47:20,171 INFO L87 Difference]: Start difference. First operand 153 states and 172 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:47:20,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:47:20,241 INFO L93 Difference]: Finished difference Result 261 states and 290 transitions. [2022-07-12 18:47:20,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 18:47:20,241 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-07-12 18:47:20,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:47:20,242 INFO L225 Difference]: With dead ends: 261 [2022-07-12 18:47:20,242 INFO L226 Difference]: Without dead ends: 261 [2022-07-12 18:47:20,242 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-12 18:47:20,243 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 146 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:47:20,243 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 323 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:47:20,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2022-07-12 18:47:20,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 153. [2022-07-12 18:47:20,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 99 states have (on average 1.7171717171717171) internal successors, (170), 152 states have internal predecessors, (170), 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-12 18:47:20,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 170 transitions. [2022-07-12 18:47:20,245 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 170 transitions. Word has length 24 [2022-07-12 18:47:20,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:47:20,246 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 170 transitions. [2022-07-12 18:47:20,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:47:20,246 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 170 transitions. [2022-07-12 18:47:20,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-12 18:47:20,246 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:47:20,246 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:47:20,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-12 18:47:20,246 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 18:47:20,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:47:20,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1446351469, now seen corresponding path program 1 times [2022-07-12 18:47:20,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:47:20,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764727922] [2022-07-12 18:47:20,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:47:20,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:47:20,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:47:20,289 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:47:20,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:47:20,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764727922] [2022-07-12 18:47:20,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764727922] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:47:20,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:47:20,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 18:47:20,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695342094] [2022-07-12 18:47:20,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:47:20,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 18:47:20,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:47:20,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 18:47:20,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:47:20,290 INFO L87 Difference]: Start difference. First operand 153 states and 170 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:47:20,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:47:20,392 INFO L93 Difference]: Finished difference Result 147 states and 164 transitions. [2022-07-12 18:47:20,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 18:47:20,392 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-07-12 18:47:20,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:47:20,393 INFO L225 Difference]: With dead ends: 147 [2022-07-12 18:47:20,393 INFO L226 Difference]: Without dead ends: 147 [2022-07-12 18:47:20,393 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:47:20,394 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 69 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:47:20,394 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 224 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:47:20,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-07-12 18:47:20,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 146. [2022-07-12 18:47:20,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 100 states have (on average 1.64) internal successors, (164), 145 states have internal predecessors, (164), 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-12 18:47:20,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 164 transitions. [2022-07-12 18:47:20,396 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 164 transitions. Word has length 24 [2022-07-12 18:47:20,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:47:20,396 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 164 transitions. [2022-07-12 18:47:20,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:47:20,396 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 164 transitions. [2022-07-12 18:47:20,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-12 18:47:20,397 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:47:20,397 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:47:20,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-12 18:47:20,397 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 18:47:20,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:47:20,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1446351470, now seen corresponding path program 1 times [2022-07-12 18:47:20,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:47:20,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359928175] [2022-07-12 18:47:20,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:47:20,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:47:20,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:47:20,444 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:47:20,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:47:20,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359928175] [2022-07-12 18:47:20,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359928175] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:47:20,444 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:47:20,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 18:47:20,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642778884] [2022-07-12 18:47:20,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:47:20,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 18:47:20,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:47:20,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 18:47:20,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:47:20,445 INFO L87 Difference]: Start difference. First operand 146 states and 164 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:47:20,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:47:20,598 INFO L93 Difference]: Finished difference Result 239 states and 267 transitions. [2022-07-12 18:47:20,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 18:47:20,598 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-07-12 18:47:20,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:47:20,599 INFO L225 Difference]: With dead ends: 239 [2022-07-12 18:47:20,599 INFO L226 Difference]: Without dead ends: 239 [2022-07-12 18:47:20,599 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-12 18:47:20,599 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 325 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:47:20,600 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 226 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:47:20,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2022-07-12 18:47:20,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 185. [2022-07-12 18:47:20,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 141 states have (on average 1.6666666666666667) internal successors, (235), 184 states have internal predecessors, (235), 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-12 18:47:20,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 235 transitions. [2022-07-12 18:47:20,602 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 235 transitions. Word has length 24 [2022-07-12 18:47:20,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:47:20,603 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 235 transitions. [2022-07-12 18:47:20,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:47:20,603 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 235 transitions. [2022-07-12 18:47:20,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-12 18:47:20,603 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:47:20,603 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:47:20,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-12 18:47:20,603 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 18:47:20,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:47:20,604 INFO L85 PathProgramCache]: Analyzing trace with hash 611618329, now seen corresponding path program 1 times [2022-07-12 18:47:20,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:47:20,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695160561] [2022-07-12 18:47:20,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:47:20,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:47:20,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:47:20,650 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:47:20,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:47:20,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695160561] [2022-07-12 18:47:20,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695160561] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:47:20,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:47:20,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 18:47:20,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604494228] [2022-07-12 18:47:20,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:47:20,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 18:47:20,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:47:20,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 18:47:20,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:47:20,652 INFO L87 Difference]: Start difference. First operand 185 states and 235 transitions. Second operand has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 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-12 18:47:20,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:47:20,731 INFO L93 Difference]: Finished difference Result 238 states and 266 transitions. [2022-07-12 18:47:20,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 18:47:20,731 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-07-12 18:47:20,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:47:20,732 INFO L225 Difference]: With dead ends: 238 [2022-07-12 18:47:20,732 INFO L226 Difference]: Without dead ends: 238 [2022-07-12 18:47:20,733 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-07-12 18:47:20,733 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 258 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:47:20,734 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 360 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:47:20,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2022-07-12 18:47:20,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 186. [2022-07-12 18:47:20,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 142 states have (on average 1.6619718309859155) internal successors, (236), 185 states have internal predecessors, (236), 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-12 18:47:20,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 236 transitions. [2022-07-12 18:47:20,738 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 236 transitions. Word has length 29 [2022-07-12 18:47:20,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:47:20,738 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 236 transitions. [2022-07-12 18:47:20,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 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-12 18:47:20,738 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 236 transitions. [2022-07-12 18:47:20,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-12 18:47:20,742 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:47:20,742 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:47:20,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-12 18:47:20,743 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 18:47:20,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:47:20,744 INFO L85 PathProgramCache]: Analyzing trace with hash 610479294, now seen corresponding path program 1 times [2022-07-12 18:47:20,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:47:20,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676572307] [2022-07-12 18:47:20,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:47:20,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:47:20,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:47:20,820 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:47:20,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:47:20,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676572307] [2022-07-12 18:47:20,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676572307] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:47:20,821 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:47:20,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 18:47:20,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3641851] [2022-07-12 18:47:20,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:47:20,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 18:47:20,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:47:20,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 18:47:20,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-12 18:47:20,822 INFO L87 Difference]: Start difference. First operand 186 states and 236 transitions. Second operand has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 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-12 18:47:20,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:47:20,968 INFO L93 Difference]: Finished difference Result 213 states and 266 transitions. [2022-07-12 18:47:20,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 18:47:20,969 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-07-12 18:47:20,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:47:20,970 INFO L225 Difference]: With dead ends: 213 [2022-07-12 18:47:20,970 INFO L226 Difference]: Without dead ends: 213 [2022-07-12 18:47:20,970 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-12 18:47:20,970 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 19 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:47:20,971 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 396 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:47:20,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2022-07-12 18:47:20,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 198. [2022-07-12 18:47:20,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 154 states have (on average 1.6363636363636365) internal successors, (252), 197 states have internal predecessors, (252), 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-12 18:47:20,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 252 transitions. [2022-07-12 18:47:20,975 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 252 transitions. Word has length 29 [2022-07-12 18:47:20,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:47:20,976 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 252 transitions. [2022-07-12 18:47:20,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 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-12 18:47:20,976 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 252 transitions. [2022-07-12 18:47:20,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-12 18:47:20,976 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:47:20,976 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:47:20,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-12 18:47:20,976 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 18:47:20,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:47:20,977 INFO L85 PathProgramCache]: Analyzing trace with hash 610479295, now seen corresponding path program 1 times [2022-07-12 18:47:20,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:47:20,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081544515] [2022-07-12 18:47:20,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:47:20,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:47:21,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:47:21,052 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:47:21,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:47:21,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081544515] [2022-07-12 18:47:21,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081544515] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:47:21,053 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:47:21,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 18:47:21,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111655524] [2022-07-12 18:47:21,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:47:21,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 18:47:21,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:47:21,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 18:47:21,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-12 18:47:21,053 INFO L87 Difference]: Start difference. First operand 198 states and 252 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 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-12 18:47:21,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:47:21,152 INFO L93 Difference]: Finished difference Result 225 states and 279 transitions. [2022-07-12 18:47:21,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 18:47:21,153 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-07-12 18:47:21,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:47:21,154 INFO L225 Difference]: With dead ends: 225 [2022-07-12 18:47:21,154 INFO L226 Difference]: Without dead ends: 225 [2022-07-12 18:47:21,154 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-12 18:47:21,154 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 36 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:47:21,154 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 455 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:47:21,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2022-07-12 18:47:21,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 194. [2022-07-12 18:47:21,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 150 states have (on average 1.64) internal successors, (246), 193 states have internal predecessors, (246), 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-12 18:47:21,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 246 transitions. [2022-07-12 18:47:21,157 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 246 transitions. Word has length 29 [2022-07-12 18:47:21,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:47:21,158 INFO L495 AbstractCegarLoop]: Abstraction has 194 states and 246 transitions. [2022-07-12 18:47:21,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 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-12 18:47:21,158 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 246 transitions. [2022-07-12 18:47:21,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-12 18:47:21,158 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:47:21,158 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:47:21,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-12 18:47:21,159 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 18:47:21,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:47:21,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1470604246, now seen corresponding path program 1 times [2022-07-12 18:47:21,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:47:21,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102693154] [2022-07-12 18:47:21,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:47:21,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:47:21,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:47:21,318 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:47:21,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:47:21,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102693154] [2022-07-12 18:47:21,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102693154] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:47:21,319 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:47:21,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 18:47:21,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007128856] [2022-07-12 18:47:21,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:47:21,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 18:47:21,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:47:21,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 18:47:21,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-07-12 18:47:21,321 INFO L87 Difference]: Start difference. First operand 194 states and 246 transitions. Second operand has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 10 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-12 18:47:21,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:47:21,648 INFO L93 Difference]: Finished difference Result 307 states and 374 transitions. [2022-07-12 18:47:21,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-12 18:47:21,648 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 10 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) Word has length 32 [2022-07-12 18:47:21,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:47:21,649 INFO L225 Difference]: With dead ends: 307 [2022-07-12 18:47:21,649 INFO L226 Difference]: Without dead ends: 307 [2022-07-12 18:47:21,649 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2022-07-12 18:47:21,650 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 169 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:47:21,650 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 447 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:47:21,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2022-07-12 18:47:21,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 220. [2022-07-12 18:47:21,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 176 states have (on average 1.5909090909090908) internal successors, (280), 219 states have internal predecessors, (280), 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-12 18:47:21,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 280 transitions. [2022-07-12 18:47:21,653 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 280 transitions. Word has length 32 [2022-07-12 18:47:21,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:47:21,653 INFO L495 AbstractCegarLoop]: Abstraction has 220 states and 280 transitions. [2022-07-12 18:47:21,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 10 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-12 18:47:21,653 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 280 transitions. [2022-07-12 18:47:21,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-12 18:47:21,654 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:47:21,654 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:47:21,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-12 18:47:21,654 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 18:47:21,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:47:21,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1470604247, now seen corresponding path program 1 times [2022-07-12 18:47:21,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:47:21,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761510582] [2022-07-12 18:47:21,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:47:21,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:47:21,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:47:21,796 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:47:21,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:47:21,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761510582] [2022-07-12 18:47:21,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761510582] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:47:21,796 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:47:21,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 18:47:21,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602313020] [2022-07-12 18:47:21,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:47:21,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 18:47:21,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:47:21,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 18:47:21,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-12 18:47:21,797 INFO L87 Difference]: Start difference. First operand 220 states and 280 transitions. Second operand has 9 states, 8 states have (on average 4.0) internal successors, (32), 9 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-12 18:47:22,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:47:22,194 INFO L93 Difference]: Finished difference Result 309 states and 374 transitions. [2022-07-12 18:47:22,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 18:47:22,195 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.0) internal successors, (32), 9 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) Word has length 32 [2022-07-12 18:47:22,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:47:22,196 INFO L225 Difference]: With dead ends: 309 [2022-07-12 18:47:22,196 INFO L226 Difference]: Without dead ends: 309 [2022-07-12 18:47:22,196 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2022-07-12 18:47:22,196 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 170 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 619 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 18:47:22,196 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 479 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 619 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 18:47:22,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2022-07-12 18:47:22,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 220. [2022-07-12 18:47:22,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 176 states have (on average 1.5852272727272727) internal successors, (279), 219 states have internal predecessors, (279), 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-12 18:47:22,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 279 transitions. [2022-07-12 18:47:22,199 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 279 transitions. Word has length 32 [2022-07-12 18:47:22,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:47:22,200 INFO L495 AbstractCegarLoop]: Abstraction has 220 states and 279 transitions. [2022-07-12 18:47:22,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.0) internal successors, (32), 9 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-12 18:47:22,200 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 279 transitions. [2022-07-12 18:47:22,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-12 18:47:22,200 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:47:22,200 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:47:22,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-12 18:47:22,200 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 18:47:22,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:47:22,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1655909309, now seen corresponding path program 1 times [2022-07-12 18:47:22,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:47:22,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865847222] [2022-07-12 18:47:22,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:47:22,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:47:22,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:47:22,297 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:47:22,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:47:22,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865847222] [2022-07-12 18:47:22,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865847222] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:47:22,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:47:22,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 18:47:22,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133151712] [2022-07-12 18:47:22,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:47:22,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 18:47:22,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:47:22,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 18:47:22,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-12 18:47:22,299 INFO L87 Difference]: Start difference. First operand 220 states and 279 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 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-12 18:47:22,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:47:22,449 INFO L93 Difference]: Finished difference Result 254 states and 315 transitions. [2022-07-12 18:47:22,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 18:47:22,449 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 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 33 [2022-07-12 18:47:22,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:47:22,450 INFO L225 Difference]: With dead ends: 254 [2022-07-12 18:47:22,450 INFO L226 Difference]: Without dead ends: 254 [2022-07-12 18:47:22,450 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-07-12 18:47:22,451 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 60 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 657 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:47:22,451 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 657 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:47:22,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2022-07-12 18:47:22,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 226. [2022-07-12 18:47:22,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 182 states have (on average 1.565934065934066) internal successors, (285), 225 states have internal predecessors, (285), 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-12 18:47:22,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 285 transitions. [2022-07-12 18:47:22,454 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 285 transitions. Word has length 33 [2022-07-12 18:47:22,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:47:22,454 INFO L495 AbstractCegarLoop]: Abstraction has 226 states and 285 transitions. [2022-07-12 18:47:22,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 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-12 18:47:22,454 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 285 transitions. [2022-07-12 18:47:22,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-12 18:47:22,454 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:47:22,454 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:47:22,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-12 18:47:22,454 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 18:47:22,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:47:22,454 INFO L85 PathProgramCache]: Analyzing trace with hash 206446071, now seen corresponding path program 1 times [2022-07-12 18:47:22,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:47:22,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118313004] [2022-07-12 18:47:22,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:47:22,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:47:22,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:47:22,481 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-12 18:47:22,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:47:22,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118313004] [2022-07-12 18:47:22,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118313004] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:47:22,481 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:47:22,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 18:47:22,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930290495] [2022-07-12 18:47:22,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:47:22,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 18:47:22,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:47:22,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 18:47:22,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:47:22,482 INFO L87 Difference]: Start difference. First operand 226 states and 285 transitions. Second operand has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 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-12 18:47:22,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:47:22,594 INFO L93 Difference]: Finished difference Result 299 states and 378 transitions. [2022-07-12 18:47:22,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 18:47:22,594 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 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) Word has length 34 [2022-07-12 18:47:22,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:47:22,595 INFO L225 Difference]: With dead ends: 299 [2022-07-12 18:47:22,595 INFO L226 Difference]: Without dead ends: 299 [2022-07-12 18:47:22,595 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:47:22,596 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 92 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:47:22,596 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 265 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:47:22,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2022-07-12 18:47:22,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 228. [2022-07-12 18:47:22,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 188 states have (on average 1.5638297872340425) internal successors, (294), 227 states have internal predecessors, (294), 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-12 18:47:22,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 294 transitions. [2022-07-12 18:47:22,599 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 294 transitions. Word has length 34 [2022-07-12 18:47:22,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:47:22,599 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 294 transitions. [2022-07-12 18:47:22,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 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-12 18:47:22,599 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 294 transitions. [2022-07-12 18:47:22,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-12 18:47:22,599 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:47:22,599 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:47:22,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-12 18:47:22,600 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 18:47:22,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:47:22,600 INFO L85 PathProgramCache]: Analyzing trace with hash 206446072, now seen corresponding path program 1 times [2022-07-12 18:47:22,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:47:22,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650282532] [2022-07-12 18:47:22,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:47:22,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:47:22,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:47:22,773 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:47:22,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:47:22,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650282532] [2022-07-12 18:47:22,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650282532] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:47:22,774 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:47:22,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 18:47:22,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614441376] [2022-07-12 18:47:22,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:47:22,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 18:47:22,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:47:22,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 18:47:22,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-07-12 18:47:22,775 INFO L87 Difference]: Start difference. First operand 228 states and 294 transitions. Second operand has 11 states, 10 states have (on average 3.4) internal successors, (34), 11 states have internal predecessors, (34), 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-12 18:47:23,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:47:23,195 INFO L93 Difference]: Finished difference Result 328 states and 402 transitions. [2022-07-12 18:47:23,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-12 18:47:23,195 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.4) internal successors, (34), 11 states have internal predecessors, (34), 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 34 [2022-07-12 18:47:23,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:47:23,196 INFO L225 Difference]: With dead ends: 328 [2022-07-12 18:47:23,196 INFO L226 Difference]: Without dead ends: 328 [2022-07-12 18:47:23,197 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=132, Invalid=420, Unknown=0, NotChecked=0, Total=552 [2022-07-12 18:47:23,197 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 208 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 18:47:23,197 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 396 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 18:47:23,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2022-07-12 18:47:23,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 236. [2022-07-12 18:47:23,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 196 states have (on average 1.5510204081632653) internal successors, (304), 235 states have internal predecessors, (304), 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-12 18:47:23,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 304 transitions. [2022-07-12 18:47:23,200 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 304 transitions. Word has length 34 [2022-07-12 18:47:23,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:47:23,200 INFO L495 AbstractCegarLoop]: Abstraction has 236 states and 304 transitions. [2022-07-12 18:47:23,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.4) internal successors, (34), 11 states have internal predecessors, (34), 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-12 18:47:23,201 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 304 transitions. [2022-07-12 18:47:23,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-12 18:47:23,201 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:47:23,201 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:47:23,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-12 18:47:23,201 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 18:47:23,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:47:23,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1585985001, now seen corresponding path program 1 times [2022-07-12 18:47:23,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:47:23,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560793534] [2022-07-12 18:47:23,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:47:23,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:47:23,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:47:23,395 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:47:23,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:47:23,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560793534] [2022-07-12 18:47:23,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560793534] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:47:23,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [775116528] [2022-07-12 18:47:23,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:47:23,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:47:23,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:47:23,397 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-12 18:47:23,435 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-12 18:47:23,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:47:23,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 60 conjunts are in the unsatisfiable core [2022-07-12 18:47:23,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:47:23,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 18:47:23,631 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 11 treesize of output 7 [2022-07-12 18:47:23,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:47:23,664 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 21 treesize of output 20 [2022-07-12 18:47:23,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:47:23,669 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 21 treesize of output 20 [2022-07-12 18:47:23,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:47:23,683 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 21 treesize of output 20 [2022-07-12 18:47:23,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:47:23,688 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 21 treesize of output 20 [2022-07-12 18:47:23,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:47:23,705 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 21 treesize of output 20 [2022-07-12 18:47:23,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:47:23,710 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 21 treesize of output 20 [2022-07-12 18:47:23,752 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 18:47:23,752 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-12 18:47:23,762 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 5 treesize of output 3 [2022-07-12 18:47:23,772 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 18:47:23,773 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-12 18:47:23,779 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 5 treesize of output 3 [2022-07-12 18:47:23,853 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 23 treesize of output 22 [2022-07-12 18:47:23,862 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 31 treesize of output 30 [2022-07-12 18:47:24,127 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-12 18:47:24,341 INFO L356 Elim1Store]: treesize reduction 128, result has 22.4 percent of original size [2022-07-12 18:47:24,342 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 112 treesize of output 119 [2022-07-12 18:47:24,385 INFO L356 Elim1Store]: treesize reduction 128, result has 22.4 percent of original size [2022-07-12 18:47:24,385 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 126 treesize of output 134 [2022-07-12 18:47:24,403 INFO L356 Elim1Store]: treesize reduction 4, result has 84.0 percent of original size [2022-07-12 18:47:24,403 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 139 treesize of output 153 [2022-07-12 18:47:24,483 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:47:24,483 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:47:24,532 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 10 treesize of output 8 [2022-07-12 18:47:26,457 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~data~0#1.offset| Int)) (let ((.cse3 (+ 4 |c_ULTIMATE.start_main_~lItem~0#1.offset|)) (.cse2 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~lItem~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~lItem~0#1.base|) .cse3 |c_ULTIMATE.start_main_~item~0#1.base|)) |c_ULTIMATE.start_main_~data~0#1.base|) .cse2))) (or (= (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~lItem~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~lItem~0#1.base|) .cse3 |c_ULTIMATE.start_main_~item~0#1.offset|)))) (select (select .cse0 .cse1) (select (select .cse0 |c_ULTIMATE.start_main_~data~0#1.base|) .cse2))) 0) (= .cse1 |c_ULTIMATE.start_main_~data~0#1.base|) (not (<= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)))))) (forall ((|ULTIMATE.start_main_~data~0#1.offset| Int)) (let ((.cse6 (+ 4 |c_ULTIMATE.start_main_~lItem~0#1.offset|))) (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~lItem~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~lItem~0#1.base|) .cse6 |c_ULTIMATE.start_main_~item~0#1.base|))) (.cse7 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~data~0#1.base|) .cse7))) (or (= .cse4 |c_ULTIMATE.start_main_~data~0#1.base|) (not (<= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (= (select (select .cse5 .cse4) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~lItem~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~lItem~0#1.base|) .cse6 |c_ULTIMATE.start_main_~item~0#1.offset|)) |c_ULTIMATE.start_main_~data~0#1.base|) .cse7)) 0) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)))))))) is different from false [2022-07-12 18:48:04,374 INFO L356 Elim1Store]: treesize reduction 20, result has 52.4 percent of original size [2022-07-12 18:48:04,375 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 70 treesize of output 77 [2022-07-12 18:48:04,383 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 129 treesize of output 117 [2022-07-12 18:48:04,633 INFO L356 Elim1Store]: treesize reduction 20, result has 52.4 percent of original size [2022-07-12 18:48:04,634 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 97 treesize of output 100 [2022-07-12 18:48:04,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 102 treesize of output 94 [2022-07-12 18:48:04,932 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (not (<= 0 |c_ULTIMATE.start_main_~lItem~0#1.offset|))) (.cse2 (not (<= |c_ULTIMATE.start_main_~lItem~0#1.offset| 0)))) (and (forall ((|ULTIMATE.start_main_~data~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)) (= |c_ULTIMATE.start_main_~lItem~0#1.offset| |ULTIMATE.start_main_~data~0#1.offset|) (forall ((v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_arrayElimCell_32 Int)) (let ((.cse0 (select v_arrayElimArr_2 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)))) (or (not (= (select v_arrayElimArr_2 (+ 4 |c_ULTIMATE.start_main_~lItem~0#1.offset|)) |c_ULTIMATE.start_main_~item~0#1.base|)) (= .cse0 |ULTIMATE.start_main_~lItem~0#1.base|) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) .cse0) v_arrayElimCell_32) 0)))))) (or .cse1 .cse2 (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| (select v_arrayElimArr_1 (+ 4 |c_ULTIMATE.start_main_~lItem~0#1.offset|))))))) (forall ((|ULTIMATE.start_main_~data~0#1.offset| Int)) (or (forall ((v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_arrayElimCell_32 Int)) (let ((.cse5 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_main_~item~0#1.base|)) (.cse4 (select v_arrayElimArr_2 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)))) (or (= (select .cse3 v_arrayElimCell_32) 0) (not (= (select v_arrayElimArr_2 (+ 4 |c_ULTIMATE.start_main_~lItem~0#1.offset|)) |c_ULTIMATE.start_main_~item~0#1.base|)) (= .cse4 |ULTIMATE.start_main_~lItem~0#1.base|) (= (select .cse3 |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= (select (select .cse5 .cse4) v_arrayElimCell_32) 0))))) (not (<= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)) (= |c_ULTIMATE.start_main_~lItem~0#1.offset| |ULTIMATE.start_main_~data~0#1.offset|))) (forall ((|ULTIMATE.start_main_~data~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (forall ((v_arrayElimCell_30 Int) (v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (let ((.cse6 (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) v_arrayElimCell_30))) (or (= (select .cse6 |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_30) (= (select .cse6 (select v_arrayElimArr_1 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 0) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| (select v_arrayElimArr_1 (+ 4 |c_ULTIMATE.start_main_~lItem~0#1.offset|))))))) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)) (= |c_ULTIMATE.start_main_~lItem~0#1.offset| |ULTIMATE.start_main_~data~0#1.offset|))) (forall ((|ULTIMATE.start_main_~data~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)) (forall ((v_arrayElimArr_1 (Array Int Int))) (or (forall ((v_arrayElimCell_30 Int) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (let ((.cse7 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1))) (let ((.cse8 (select .cse7 v_arrayElimCell_30))) (or (= (select (select .cse7 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (= (select .cse8 |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_30) (= (select .cse8 (select v_arrayElimArr_1 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 0))))) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| (select v_arrayElimArr_1 (+ 4 |c_ULTIMATE.start_main_~lItem~0#1.offset|)))))))) (forall ((|ULTIMATE.start_main_~data~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (forall ((v_arrayElimArr_2 (Array Int Int))) (or (not (= (select v_arrayElimArr_2 (+ 4 |c_ULTIMATE.start_main_~lItem~0#1.offset|)) |c_ULTIMATE.start_main_~item~0#1.base|)) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_arrayElimCell_32 Int)) (let ((.cse11 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2))) (let ((.cse9 (select .cse11 |c_ULTIMATE.start_main_~item~0#1.base|)) (.cse10 (select v_arrayElimArr_2 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)))) (or (= (select .cse9 v_arrayElimCell_32) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (= .cse10 |ULTIMATE.start_main_~lItem~0#1.base|) (= (select .cse9 |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= (select (select .cse11 .cse10) v_arrayElimCell_32) 0))))))) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)))) (or .cse1 .cse2 (forall ((v_arrayElimCell_30 Int) (v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (let ((.cse12 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1))) (or (= (select (select .cse12 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (= (select (select .cse12 v_arrayElimCell_30) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| (select v_arrayElimArr_1 (+ 4 |c_ULTIMATE.start_main_~lItem~0#1.offset|)))))))) (forall ((|ULTIMATE.start_main_~data~0#1.offset| Int)) (or (forall ((v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_arrayElimCell_32 Int)) (let ((.cse13 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2)) (.cse14 (select v_arrayElimArr_2 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)))) (or (= (select (select .cse13 |c_ULTIMATE.start_main_~item~0#1.base|) v_arrayElimCell_32) 0) (not (= (select v_arrayElimArr_2 (+ 4 |c_ULTIMATE.start_main_~lItem~0#1.offset|)) |c_ULTIMATE.start_main_~item~0#1.base|)) (= .cse14 |ULTIMATE.start_main_~lItem~0#1.base|) (= (select (select .cse13 .cse14) v_arrayElimCell_32) 0)))) (not (<= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)) (= |c_ULTIMATE.start_main_~lItem~0#1.offset| |ULTIMATE.start_main_~data~0#1.offset|))) (or .cse1 (forall ((v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_arrayElimCell_32 Int) (v_arrayElimCell_31 Int)) (let ((.cse16 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2))) (let ((.cse15 (select .cse16 |c_ULTIMATE.start_main_~item~0#1.base|))) (or (= (select .cse15 v_arrayElimCell_32) 0) (not (= (select v_arrayElimArr_2 (+ 4 |c_ULTIMATE.start_main_~lItem~0#1.offset|)) |c_ULTIMATE.start_main_~item~0#1.base|)) (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_31) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (= (select (select .cse16 v_arrayElimCell_31) v_arrayElimCell_32) 0) (= (select .cse15 |c_ULTIMATE.start_main_~item~0#1.offset|) 0))))) .cse2) (forall ((|ULTIMATE.start_main_~data~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)) (= |c_ULTIMATE.start_main_~lItem~0#1.offset| |ULTIMATE.start_main_~data~0#1.offset|) (forall ((v_arrayElimCell_30 Int) (v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_30) (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) v_arrayElimCell_30) (select v_arrayElimArr_1 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 0) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| (select v_arrayElimArr_1 (+ 4 |c_ULTIMATE.start_main_~lItem~0#1.offset|)))))))) (or .cse1 .cse2 (forall ((v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (not (= (select v_arrayElimArr_2 (+ 4 |c_ULTIMATE.start_main_~lItem~0#1.offset|)) |c_ULTIMATE.start_main_~item~0#1.base|)) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0)))) (forall ((|ULTIMATE.start_main_~data~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)) (= |c_ULTIMATE.start_main_~lItem~0#1.offset| |ULTIMATE.start_main_~data~0#1.offset|) (forall ((v_arrayElimCell_30 Int) (v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (let ((.cse17 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1))) (let ((.cse18 (select .cse17 v_arrayElimCell_30))) (or (= (select (select .cse17 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= (select .cse18 |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_30) (= (select .cse18 (select v_arrayElimArr_1 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 0) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| (select v_arrayElimArr_1 (+ 4 |c_ULTIMATE.start_main_~lItem~0#1.offset|)))))))))) (or .cse1 (and (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (forall ((v_arrayElimArr_2 (Array Int Int)) (v_arrayElimCell_32 Int)) (let ((.cse19 (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_main_~item~0#1.base|))) (or (= (select .cse19 v_arrayElimCell_32) 0) (not (= (select v_arrayElimArr_2 (+ 4 |c_ULTIMATE.start_main_~lItem~0#1.offset|)) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select .cse19 |c_ULTIMATE.start_main_~item~0#1.offset|) 0)))))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (forall ((v_arrayElimArr_2 (Array Int Int))) (or (not (= (select v_arrayElimArr_2 (+ 4 |c_ULTIMATE.start_main_~lItem~0#1.offset|)) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0))) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (forall ((v_arrayElimArr_2 (Array Int Int)) (v_arrayElimCell_32 Int) (v_arrayElimCell_31 Int)) (let ((.cse21 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2))) (let ((.cse20 (select .cse21 |c_ULTIMATE.start_main_~item~0#1.base|))) (or (= (select .cse20 v_arrayElimCell_32) 0) (not (= (select v_arrayElimArr_2 (+ 4 |c_ULTIMATE.start_main_~lItem~0#1.offset|)) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select .cse21 v_arrayElimCell_31) v_arrayElimCell_32) 0) (= (select .cse20 |c_ULTIMATE.start_main_~item~0#1.offset|) 0))))) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|)))) .cse2) (or .cse1 (forall ((v_arrayElimCell_30 Int) (v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (let ((.cse22 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1)) (.cse23 (select v_arrayElimArr_1 (+ 4 |c_ULTIMATE.start_main_~lItem~0#1.offset|)))) (or (= (select (select .cse22 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse23)) (= (select (select .cse22 v_arrayElimCell_30) .cse23) 0)))) .cse2))) is different from false [2022-07-12 18:48:05,357 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_arrayElimCell_30 Int) (v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1)) (.cse1 (select v_arrayElimArr_1 4))) (or (= (select (select .cse0 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse1)) (= 0 (select (select .cse0 v_arrayElimCell_30) .cse1))))) (forall ((|ULTIMATE.start_main_~data~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)) (forall ((v_arrayElimArr_1 (Array Int Int))) (or (forall ((v_arrayElimCell_30 Int) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1))) (or (= (select (select .cse2 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (= (select (select .cse2 v_arrayElimCell_30) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_30)))) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| (select v_arrayElimArr_1 4))))))) (forall ((v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_arrayElimCell_32 Int) (v_arrayElimCell_31 Int)) (let ((.cse4 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~item~0#1.base|))) (or (= (select .cse3 v_arrayElimCell_32) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_31) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (not (= (select v_arrayElimArr_2 4) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select .cse4 v_arrayElimCell_31) v_arrayElimCell_32) 0) (= (select .cse3 |c_ULTIMATE.start_main_~item~0#1.offset|) 0))))) (forall ((v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (not (= (select v_arrayElimArr_2 4) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0))) (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| (select v_arrayElimArr_1 4))))) (forall ((|ULTIMATE.start_main_~data~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (forall ((v_arrayElimArr_2 (Array Int Int))) (or (not (= (select v_arrayElimArr_2 4) |c_ULTIMATE.start_main_~item~0#1.base|)) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_arrayElimCell_32 Int)) (let ((.cse5 (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_main_~item~0#1.base|))) (or (= (select .cse5 v_arrayElimCell_32) 0) (= (select v_arrayElimArr_2 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) |ULTIMATE.start_main_~lItem~0#1.base|) (= (select .cse5 |c_ULTIMATE.start_main_~item~0#1.offset|) 0)))))) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (forall ((v_arrayElimArr_2 (Array Int Int)) (v_arrayElimCell_32 Int)) (let ((.cse6 (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_main_~item~0#1.base|))) (or (= (select .cse6 v_arrayElimCell_32) 0) (not (= (select v_arrayElimArr_2 4) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select .cse6 |c_ULTIMATE.start_main_~item~0#1.offset|) 0)))))) (forall ((v_arrayElimCell_30 Int) (v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (let ((.cse7 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1))) (or (= (select (select .cse7 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (= (select (select .cse7 v_arrayElimCell_30) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| (select v_arrayElimArr_1 4)))))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (forall ((v_arrayElimArr_2 (Array Int Int)) (v_arrayElimCell_32 Int) (v_arrayElimCell_31 Int)) (let ((.cse9 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2))) (let ((.cse8 (select .cse9 |c_ULTIMATE.start_main_~item~0#1.base|))) (or (= (select .cse8 v_arrayElimCell_32) 0) (not (= (select v_arrayElimArr_2 4) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select .cse9 v_arrayElimCell_31) v_arrayElimCell_32) 0) (= (select .cse8 |c_ULTIMATE.start_main_~item~0#1.offset|) 0))))))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (forall ((v_arrayElimArr_2 (Array Int Int))) (or (not (= (select v_arrayElimArr_2 4) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0))) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|)))) is different from false [2022-07-12 18:48:05,466 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_arrayElimCell_30 Int) (v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_613 Int)) (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4) v_ArrVal_613)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1))) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (= (select (select .cse0 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| (select v_arrayElimArr_1 4))) (= (select (select .cse0 v_arrayElimCell_30) |c_ULTIMATE.start_main_~item~0#1.offset|) 0)))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_611 Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (forall ((v_arrayElimArr_2 (Array Int Int)) (v_arrayElimCell_32 Int) (v_arrayElimCell_31 Int)) (let ((.cse2 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4) v_ArrVal_611)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_main_~item~0#1.base|))) (or (= (select .cse1 |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (not (= (select v_arrayElimArr_2 4) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select .cse2 v_arrayElimCell_31) v_arrayElimCell_32) 0) (= (select .cse1 v_arrayElimCell_32) 0))))))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_611 Int)) (or (forall ((v_arrayElimArr_2 (Array Int Int))) (or (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4) v_ArrVal_611)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (not (= (select v_arrayElimArr_2 4) |c_ULTIMATE.start_main_~item~0#1.base|)))) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|))) (forall ((v_arrayElimCell_30 Int) (v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_613 Int)) (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4) v_ArrVal_613)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1)) (.cse4 (select v_arrayElimArr_1 4))) (or (= (select (select .cse3 v_arrayElimCell_30) .cse4) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (= (select (select .cse3 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse4))))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_611 Int)) (or (forall ((v_arrayElimArr_2 (Array Int Int)) (v_arrayElimCell_32 Int)) (let ((.cse5 (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4) v_ArrVal_611)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_main_~item~0#1.base|))) (or (= (select .cse5 |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (not (= (select v_arrayElimArr_2 4) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select .cse5 v_arrayElimCell_32) 0)))) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|))) (forall ((|ULTIMATE.start_main_~data~0#1.offset| Int) (v_ArrVal_611 Int)) (or (not (<= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (forall ((v_arrayElimArr_2 (Array Int Int))) (or (not (= (select v_arrayElimArr_2 4) |c_ULTIMATE.start_main_~item~0#1.base|)) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_arrayElimCell_32 Int)) (let ((.cse6 (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4) v_ArrVal_611)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_main_~item~0#1.base|))) (or (= (select .cse6 |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= (select v_arrayElimArr_2 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) |ULTIMATE.start_main_~lItem~0#1.base|) (= (select .cse6 v_arrayElimCell_32) 0)))))) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)))) (forall ((v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_611 Int)) (or (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4) v_ArrVal_611)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (not (= (select v_arrayElimArr_2 4) |c_ULTIMATE.start_main_~item~0#1.base|)))) (forall ((v_arrayElimCell_30 Int) (v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_613 Int)) (let ((.cse7 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4) v_ArrVal_613)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1))) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_30) (= (select (select .cse7 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| (select v_arrayElimArr_1 4))) (= (select (select .cse7 v_arrayElimCell_30) |c_ULTIMATE.start_main_~item~0#1.offset|) 0)))) (forall ((v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_arrayElimCell_32 Int) (v_arrayElimCell_31 Int) (v_ArrVal_611 Int)) (let ((.cse9 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4) v_ArrVal_611)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2))) (let ((.cse8 (select .cse9 |c_ULTIMATE.start_main_~item~0#1.base|))) (or (= (select .cse8 |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_31) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (not (= (select v_arrayElimArr_2 4) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select .cse9 v_arrayElimCell_31) v_arrayElimCell_32) 0) (= (select .cse8 v_arrayElimCell_32) 0))))) (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_613 Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4) v_ArrVal_613)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| (select v_arrayElimArr_1 4)))))) is different from false [2022-07-12 18:48:05,960 INFO L356 Elim1Store]: treesize reduction 45, result has 2.2 percent of original size [2022-07-12 18:48:05,961 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 29 treesize of output 1 [2022-07-12 18:48:05,966 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:48:05,968 INFO L356 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-07-12 18:48:05,968 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 47 treesize of output 1 [2022-07-12 18:48:05,973 INFO L356 Elim1Store]: treesize reduction 45, result has 2.2 percent of original size [2022-07-12 18:48:05,973 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 86 treesize of output 1 [2022-07-12 18:48:05,978 INFO L356 Elim1Store]: treesize reduction 45, result has 2.2 percent of original size [2022-07-12 18:48:05,978 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 59 treesize of output 1 [2022-07-12 18:48:05,981 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:48:05,984 INFO L356 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-07-12 18:48:05,984 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 47 treesize of output 1 [2022-07-12 18:48:05,990 INFO L356 Elim1Store]: treesize reduction 45, result has 2.2 percent of original size [2022-07-12 18:48:05,990 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 86 treesize of output 1 [2022-07-12 18:48:05,993 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:48:05,995 INFO L356 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-07-12 18:48:05,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 1 [2022-07-12 18:48:05,998 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:48:06,000 INFO L356 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-07-12 18:48:06,000 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 23 treesize of output 1 [2022-07-12 18:48:06,004 INFO L356 Elim1Store]: treesize reduction 45, result has 2.2 percent of original size [2022-07-12 18:48:06,005 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 59 treesize of output 1 [2022-07-12 18:48:06,006 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:48:06,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [775116528] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:48:06,006 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:48:06,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 39 [2022-07-12 18:48:06,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067716646] [2022-07-12 18:48:06,007 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:48:06,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-07-12 18:48:06,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:48:06,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-07-12 18:48:06,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1043, Unknown=33, NotChecked=276, Total=1482 [2022-07-12 18:48:06,008 INFO L87 Difference]: Start difference. First operand 236 states and 304 transitions. Second operand has 39 states, 39 states have (on average 2.6666666666666665) internal successors, (104), 39 states have internal predecessors, (104), 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-12 18:48:06,054 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_arrayElimCell_30 Int) (v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_613 Int)) (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4) v_ArrVal_613)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1))) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (= (select (select .cse0 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| (select v_arrayElimArr_1 4))) (= (select (select .cse0 v_arrayElimCell_30) |c_ULTIMATE.start_main_~item~0#1.offset|) 0)))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_611 Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (forall ((v_arrayElimArr_2 (Array Int Int)) (v_arrayElimCell_32 Int) (v_arrayElimCell_31 Int)) (let ((.cse2 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4) v_ArrVal_611)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_main_~item~0#1.base|))) (or (= (select .cse1 |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (not (= (select v_arrayElimArr_2 4) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select .cse2 v_arrayElimCell_31) v_arrayElimCell_32) 0) (= (select .cse1 v_arrayElimCell_32) 0))))))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_611 Int)) (or (forall ((v_arrayElimArr_2 (Array Int Int))) (or (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4) v_ArrVal_611)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (not (= (select v_arrayElimArr_2 4) |c_ULTIMATE.start_main_~item~0#1.base|)))) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|))) (forall ((v_arrayElimCell_30 Int) (v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_613 Int)) (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4) v_ArrVal_613)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1)) (.cse4 (select v_arrayElimArr_1 4))) (or (= (select (select .cse3 v_arrayElimCell_30) .cse4) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (= (select (select .cse3 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse4))))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_611 Int)) (or (forall ((v_arrayElimArr_2 (Array Int Int)) (v_arrayElimCell_32 Int)) (let ((.cse5 (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4) v_ArrVal_611)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_main_~item~0#1.base|))) (or (= (select .cse5 |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (not (= (select v_arrayElimArr_2 4) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select .cse5 v_arrayElimCell_32) 0)))) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~item~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_main_~item~0#1.base|) 1) (forall ((|ULTIMATE.start_main_~data~0#1.offset| Int) (v_ArrVal_611 Int)) (or (not (<= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (forall ((v_arrayElimArr_2 (Array Int Int))) (or (not (= (select v_arrayElimArr_2 4) |c_ULTIMATE.start_main_~item~0#1.base|)) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_arrayElimCell_32 Int)) (let ((.cse6 (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4) v_ArrVal_611)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_main_~item~0#1.base|))) (or (= (select .cse6 |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= (select v_arrayElimArr_2 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) |ULTIMATE.start_main_~lItem~0#1.base|) (= (select .cse6 v_arrayElimCell_32) 0)))))) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)))) (forall ((v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_611 Int)) (or (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4) v_ArrVal_611)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (not (= (select v_arrayElimArr_2 4) |c_ULTIMATE.start_main_~item~0#1.base|)))) (forall ((v_arrayElimCell_30 Int) (v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_613 Int)) (let ((.cse7 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4) v_ArrVal_613)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1))) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_30) (= (select (select .cse7 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| (select v_arrayElimArr_1 4))) (= (select (select .cse7 v_arrayElimCell_30) |c_ULTIMATE.start_main_~item~0#1.offset|) 0)))) (<= 1 |c_ULTIMATE.start_main_~c1~0#1|) (forall ((v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_arrayElimCell_32 Int) (v_arrayElimCell_31 Int) (v_ArrVal_611 Int)) (let ((.cse9 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4) v_ArrVal_611)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2))) (let ((.cse8 (select .cse9 |c_ULTIMATE.start_main_~item~0#1.base|))) (or (= (select .cse8 |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_31) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (not (= (select v_arrayElimArr_2 4) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select .cse9 v_arrayElimCell_31) v_arrayElimCell_32) 0) (= (select .cse8 v_arrayElimCell_32) 0))))) (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_613 Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4) v_ArrVal_613)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| (select v_arrayElimArr_1 4)))))) is different from false [2022-07-12 18:48:06,066 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_arrayElimCell_30 Int) (v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1)) (.cse1 (select v_arrayElimArr_1 4))) (or (= (select (select .cse0 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse1)) (= 0 (select (select .cse0 v_arrayElimCell_30) .cse1))))) (forall ((|ULTIMATE.start_main_~data~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)) (forall ((v_arrayElimArr_1 (Array Int Int))) (or (forall ((v_arrayElimCell_30 Int) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1))) (or (= (select (select .cse2 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (= (select (select .cse2 v_arrayElimCell_30) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_30)))) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| (select v_arrayElimArr_1 4))))))) (forall ((v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_arrayElimCell_32 Int) (v_arrayElimCell_31 Int)) (let ((.cse4 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~item~0#1.base|))) (or (= (select .cse3 v_arrayElimCell_32) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_31) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (not (= (select v_arrayElimArr_2 4) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select .cse4 v_arrayElimCell_31) v_arrayElimCell_32) 0) (= (select .cse3 |c_ULTIMATE.start_main_~item~0#1.offset|) 0))))) (forall ((v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (not (= (select v_arrayElimArr_2 4) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0))) (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| (select v_arrayElimArr_1 4))))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (forall ((|ULTIMATE.start_main_~data~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (forall ((v_arrayElimArr_2 (Array Int Int))) (or (not (= (select v_arrayElimArr_2 4) |c_ULTIMATE.start_main_~item~0#1.base|)) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_arrayElimCell_32 Int)) (let ((.cse5 (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_main_~item~0#1.base|))) (or (= (select .cse5 v_arrayElimCell_32) 0) (= (select v_arrayElimArr_2 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) |ULTIMATE.start_main_~lItem~0#1.base|) (= (select .cse5 |c_ULTIMATE.start_main_~item~0#1.offset|) 0)))))) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)))) (<= 6 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~item~0#1.base|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (forall ((v_arrayElimArr_2 (Array Int Int)) (v_arrayElimCell_32 Int)) (let ((.cse6 (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_main_~item~0#1.base|))) (or (= (select .cse6 v_arrayElimCell_32) 0) (not (= (select v_arrayElimArr_2 4) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select .cse6 |c_ULTIMATE.start_main_~item~0#1.offset|) 0)))))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~item~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_main_~item~0#1.base|) 1) (forall ((v_arrayElimCell_30 Int) (v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (let ((.cse7 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1))) (or (= (select (select .cse7 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (= (select (select .cse7 v_arrayElimCell_30) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| (select v_arrayElimArr_1 4)))))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (forall ((v_arrayElimArr_2 (Array Int Int)) (v_arrayElimCell_32 Int) (v_arrayElimCell_31 Int)) (let ((.cse9 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2))) (let ((.cse8 (select .cse9 |c_ULTIMATE.start_main_~item~0#1.base|))) (or (= (select .cse8 v_arrayElimCell_32) 0) (not (= (select v_arrayElimArr_2 4) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select .cse9 v_arrayElimCell_31) v_arrayElimCell_32) 0) (= (select .cse8 |c_ULTIMATE.start_main_~item~0#1.offset|) 0))))))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (forall ((v_arrayElimArr_2 (Array Int Int))) (or (not (= (select v_arrayElimArr_2 4) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0))) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|)))) is different from false [2022-07-12 18:48:06,079 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (not (<= 0 |c_ULTIMATE.start_main_~lItem~0#1.offset|))) (.cse2 (not (<= |c_ULTIMATE.start_main_~lItem~0#1.offset| 0)))) (and (forall ((|ULTIMATE.start_main_~data~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)) (= |c_ULTIMATE.start_main_~lItem~0#1.offset| |ULTIMATE.start_main_~data~0#1.offset|) (forall ((v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_arrayElimCell_32 Int)) (let ((.cse0 (select v_arrayElimArr_2 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)))) (or (not (= (select v_arrayElimArr_2 (+ 4 |c_ULTIMATE.start_main_~lItem~0#1.offset|)) |c_ULTIMATE.start_main_~item~0#1.base|)) (= .cse0 |ULTIMATE.start_main_~lItem~0#1.base|) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) .cse0) v_arrayElimCell_32) 0)))))) (= |c_ULTIMATE.start_main_~lItem~0#1.offset| 0) (or .cse1 .cse2 (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| (select v_arrayElimArr_1 (+ 4 |c_ULTIMATE.start_main_~lItem~0#1.offset|))))))) (forall ((|ULTIMATE.start_main_~data~0#1.offset| Int)) (or (forall ((v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_arrayElimCell_32 Int)) (let ((.cse5 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_main_~item~0#1.base|)) (.cse4 (select v_arrayElimArr_2 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)))) (or (= (select .cse3 v_arrayElimCell_32) 0) (not (= (select v_arrayElimArr_2 (+ 4 |c_ULTIMATE.start_main_~lItem~0#1.offset|)) |c_ULTIMATE.start_main_~item~0#1.base|)) (= .cse4 |ULTIMATE.start_main_~lItem~0#1.base|) (= (select .cse3 |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= (select (select .cse5 .cse4) v_arrayElimCell_32) 0))))) (not (<= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)) (= |c_ULTIMATE.start_main_~lItem~0#1.offset| |ULTIMATE.start_main_~data~0#1.offset|))) (forall ((|ULTIMATE.start_main_~data~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (forall ((v_arrayElimCell_30 Int) (v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (let ((.cse6 (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) v_arrayElimCell_30))) (or (= (select .cse6 |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_30) (= (select .cse6 (select v_arrayElimArr_1 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 0) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| (select v_arrayElimArr_1 (+ 4 |c_ULTIMATE.start_main_~lItem~0#1.offset|))))))) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)) (= |c_ULTIMATE.start_main_~lItem~0#1.offset| |ULTIMATE.start_main_~data~0#1.offset|))) (not (= |c_ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|)) (forall ((|ULTIMATE.start_main_~data~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)) (forall ((v_arrayElimArr_1 (Array Int Int))) (or (forall ((v_arrayElimCell_30 Int) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (let ((.cse7 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1))) (let ((.cse8 (select .cse7 v_arrayElimCell_30))) (or (= (select (select .cse7 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (= (select .cse8 |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_30) (= (select .cse8 (select v_arrayElimArr_1 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 0))))) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| (select v_arrayElimArr_1 (+ 4 |c_ULTIMATE.start_main_~lItem~0#1.offset|)))))))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (<= 6 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~item~0#1.base|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4))) (forall ((|ULTIMATE.start_main_~data~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (forall ((v_arrayElimArr_2 (Array Int Int))) (or (not (= (select v_arrayElimArr_2 (+ 4 |c_ULTIMATE.start_main_~lItem~0#1.offset|)) |c_ULTIMATE.start_main_~item~0#1.base|)) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_arrayElimCell_32 Int)) (let ((.cse11 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2))) (let ((.cse9 (select .cse11 |c_ULTIMATE.start_main_~item~0#1.base|)) (.cse10 (select v_arrayElimArr_2 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)))) (or (= (select .cse9 v_arrayElimCell_32) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (= .cse10 |ULTIMATE.start_main_~lItem~0#1.base|) (= (select .cse9 |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= (select (select .cse11 .cse10) v_arrayElimCell_32) 0))))))) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)))) (or .cse1 .cse2 (forall ((v_arrayElimCell_30 Int) (v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (let ((.cse12 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1))) (or (= (select (select .cse12 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (= (select (select .cse12 v_arrayElimCell_30) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| (select v_arrayElimArr_1 (+ 4 |c_ULTIMATE.start_main_~lItem~0#1.offset|)))))))) (forall ((|ULTIMATE.start_main_~data~0#1.offset| Int)) (or (forall ((v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_arrayElimCell_32 Int)) (let ((.cse13 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2)) (.cse14 (select v_arrayElimArr_2 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)))) (or (= (select (select .cse13 |c_ULTIMATE.start_main_~item~0#1.base|) v_arrayElimCell_32) 0) (not (= (select v_arrayElimArr_2 (+ 4 |c_ULTIMATE.start_main_~lItem~0#1.offset|)) |c_ULTIMATE.start_main_~item~0#1.base|)) (= .cse14 |ULTIMATE.start_main_~lItem~0#1.base|) (= (select (select .cse13 .cse14) v_arrayElimCell_32) 0)))) (not (<= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)) (= |c_ULTIMATE.start_main_~lItem~0#1.offset| |ULTIMATE.start_main_~data~0#1.offset|))) (or .cse1 (forall ((v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_arrayElimCell_32 Int) (v_arrayElimCell_31 Int)) (let ((.cse16 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2))) (let ((.cse15 (select .cse16 |c_ULTIMATE.start_main_~item~0#1.base|))) (or (= (select .cse15 v_arrayElimCell_32) 0) (not (= (select v_arrayElimArr_2 (+ 4 |c_ULTIMATE.start_main_~lItem~0#1.offset|)) |c_ULTIMATE.start_main_~item~0#1.base|)) (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_31) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (= (select (select .cse16 v_arrayElimCell_31) v_arrayElimCell_32) 0) (= (select .cse15 |c_ULTIMATE.start_main_~item~0#1.offset|) 0))))) .cse2) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~item~0#1.offset| 0) (forall ((|ULTIMATE.start_main_~data~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)) (= |c_ULTIMATE.start_main_~lItem~0#1.offset| |ULTIMATE.start_main_~data~0#1.offset|) (forall ((v_arrayElimCell_30 Int) (v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_30) (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) v_arrayElimCell_30) (select v_arrayElimArr_1 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 0) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| (select v_arrayElimArr_1 (+ 4 |c_ULTIMATE.start_main_~lItem~0#1.offset|)))))))) (or .cse1 .cse2 (forall ((v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (not (= (select v_arrayElimArr_2 (+ 4 |c_ULTIMATE.start_main_~lItem~0#1.offset|)) |c_ULTIMATE.start_main_~item~0#1.base|)) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0)))) (forall ((|ULTIMATE.start_main_~data~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)) (= |c_ULTIMATE.start_main_~lItem~0#1.offset| |ULTIMATE.start_main_~data~0#1.offset|) (forall ((v_arrayElimCell_30 Int) (v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (let ((.cse17 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1))) (let ((.cse18 (select .cse17 v_arrayElimCell_30))) (or (= (select (select .cse17 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= (select .cse18 |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_30) (= (select .cse18 (select v_arrayElimArr_1 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 0) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| (select v_arrayElimArr_1 (+ 4 |c_ULTIMATE.start_main_~lItem~0#1.offset|)))))))))) (or .cse1 (and (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (forall ((v_arrayElimArr_2 (Array Int Int)) (v_arrayElimCell_32 Int)) (let ((.cse19 (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_main_~item~0#1.base|))) (or (= (select .cse19 v_arrayElimCell_32) 0) (not (= (select v_arrayElimArr_2 (+ 4 |c_ULTIMATE.start_main_~lItem~0#1.offset|)) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select .cse19 |c_ULTIMATE.start_main_~item~0#1.offset|) 0)))))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (forall ((v_arrayElimArr_2 (Array Int Int))) (or (not (= (select v_arrayElimArr_2 (+ 4 |c_ULTIMATE.start_main_~lItem~0#1.offset|)) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0))) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (forall ((v_arrayElimArr_2 (Array Int Int)) (v_arrayElimCell_32 Int) (v_arrayElimCell_31 Int)) (let ((.cse21 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2))) (let ((.cse20 (select .cse21 |c_ULTIMATE.start_main_~item~0#1.base|))) (or (= (select .cse20 v_arrayElimCell_32) 0) (not (= (select v_arrayElimArr_2 (+ 4 |c_ULTIMATE.start_main_~lItem~0#1.offset|)) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select .cse21 v_arrayElimCell_31) v_arrayElimCell_32) 0) (= (select .cse20 |c_ULTIMATE.start_main_~item~0#1.offset|) 0))))) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|)))) .cse2) (or .cse1 (forall ((v_arrayElimCell_30 Int) (v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (let ((.cse22 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1)) (.cse23 (select v_arrayElimArr_1 (+ 4 |c_ULTIMATE.start_main_~lItem~0#1.offset|)))) (or (= (select (select .cse22 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse23)) (= (select (select .cse22 v_arrayElimCell_30) .cse23) 0)))) .cse2))) is different from false [2022-07-12 18:48:08,511 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0)) (.cse1 (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0)) (.cse0 (= |c_ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|))) (and (= |c_ULTIMATE.start_main_~lItem~0#1.offset| 0) (not .cse0) .cse1 (<= 6 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~item~0#1.base|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4))) (= |c_ULTIMATE.start_main_~data~0#1.offset| 0) (= |c_ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~data~0#1.base|) (or .cse2 .cse0) .cse2 (forall ((|ULTIMATE.start_main_~data~0#1.offset| Int)) (let ((.cse6 (+ 4 |c_ULTIMATE.start_main_~lItem~0#1.offset|)) (.cse5 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) (let ((.cse4 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~lItem~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~lItem~0#1.base|) .cse6 |c_ULTIMATE.start_main_~item~0#1.base|)) |c_ULTIMATE.start_main_~data~0#1.base|) .cse5))) (or (= (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~lItem~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~lItem~0#1.base|) .cse6 |c_ULTIMATE.start_main_~item~0#1.offset|)))) (select (select .cse3 .cse4) (select (select .cse3 |c_ULTIMATE.start_main_~data~0#1.base|) .cse5))) 0) (= .cse4 |c_ULTIMATE.start_main_~data~0#1.base|) (not (<= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)))))) (= |c_ULTIMATE.start_main_~item~0#1.offset| 0) (forall ((|ULTIMATE.start_main_~data~0#1.offset| Int)) (let ((.cse9 (+ 4 |c_ULTIMATE.start_main_~lItem~0#1.offset|))) (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~lItem~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~lItem~0#1.base|) .cse9 |c_ULTIMATE.start_main_~item~0#1.base|))) (.cse10 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~data~0#1.base|) .cse10))) (or (= .cse7 |c_ULTIMATE.start_main_~data~0#1.base|) (not (<= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (= (select (select .cse8 .cse7) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~lItem~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~lItem~0#1.base|) .cse9 |c_ULTIMATE.start_main_~item~0#1.offset|)) |c_ULTIMATE.start_main_~data~0#1.base|) .cse10)) 0) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0))))))) (or .cse1 .cse0))) is different from false [2022-07-12 18:48:11,987 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse12 (+ |c_ULTIMATE.start_main_~data~0#1.offset| 4))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~data~0#1.base|) .cse12)) (.cse7 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~data~0#1.base|) .cse12))) (and (forall ((v_arrayElimCell_30 Int) (v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_613 Int)) (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4) v_ArrVal_613)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1))) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (= (select (select .cse0 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| (select v_arrayElimArr_1 4))) (= (select (select .cse0 v_arrayElimCell_30) |c_ULTIMATE.start_main_~item~0#1.offset|) 0)))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_611 Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (forall ((v_arrayElimArr_2 (Array Int Int)) (v_arrayElimCell_32 Int) (v_arrayElimCell_31 Int)) (let ((.cse2 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4) v_ArrVal_611)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_main_~item~0#1.base|))) (or (= (select .cse1 |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (not (= (select v_arrayElimArr_2 4) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select .cse2 v_arrayElimCell_31) v_arrayElimCell_32) 0) (= (select .cse1 v_arrayElimCell_32) 0))))))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_611 Int)) (or (forall ((v_arrayElimArr_2 (Array Int Int))) (or (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4) v_ArrVal_611)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (not (= (select v_arrayElimArr_2 4) |c_ULTIMATE.start_main_~item~0#1.base|)))) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|))) (forall ((v_arrayElimCell_30 Int) (v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_613 Int)) (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4) v_ArrVal_613)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1)) (.cse4 (select v_arrayElimArr_1 4))) (or (= (select (select .cse3 v_arrayElimCell_30) .cse4) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (= (select (select .cse3 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse4))))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_611 Int)) (or (forall ((v_arrayElimArr_2 (Array Int Int)) (v_arrayElimCell_32 Int)) (let ((.cse5 (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4) v_ArrVal_611)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_main_~item~0#1.base|))) (or (= (select .cse5 |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (not (= (select v_arrayElimArr_2 4) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select .cse5 v_arrayElimCell_32) 0)))) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|))) (= |c_ULTIMATE.start_main_~data~0#1.offset| 0) (or (= .cse6 |c_ULTIMATE.start_main_~data~0#1.base|) (not (<= |c_ULTIMATE.start_main_~data~0#1.offset| 0)) (and (= (select (select |c_#memory_$Pointer$.offset| .cse6) .cse7) 0) (= (select (select |c_#memory_$Pointer$.base| .cse6) .cse7) 0))) (<= 6 (select (select |c_#memory_int| .cse6) 4)) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~item~0#1.offset| 0) (forall ((|ULTIMATE.start_main_~data~0#1.offset| Int) (v_ArrVal_611 Int)) (or (not (<= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (forall ((v_arrayElimArr_2 (Array Int Int))) (or (not (= (select v_arrayElimArr_2 4) |c_ULTIMATE.start_main_~item~0#1.base|)) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_arrayElimCell_32 Int)) (let ((.cse8 (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4) v_ArrVal_611)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_main_~item~0#1.base|))) (or (= (select .cse8 |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= (select v_arrayElimArr_2 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) |ULTIMATE.start_main_~lItem~0#1.base|) (= (select .cse8 v_arrayElimCell_32) 0)))))) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)))) (= .cse7 0) (forall ((v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_611 Int)) (or (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4) v_ArrVal_611)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (not (= (select v_arrayElimArr_2 4) |c_ULTIMATE.start_main_~item~0#1.base|)))) (forall ((v_arrayElimCell_30 Int) (v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_613 Int)) (let ((.cse9 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4) v_ArrVal_613)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1))) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_30) (= (select (select .cse9 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| (select v_arrayElimArr_1 4))) (= (select (select .cse9 v_arrayElimCell_30) |c_ULTIMATE.start_main_~item~0#1.offset|) 0)))) (forall ((v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_arrayElimCell_32 Int) (v_arrayElimCell_31 Int) (v_ArrVal_611 Int)) (let ((.cse11 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4) v_ArrVal_611)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2))) (let ((.cse10 (select .cse11 |c_ULTIMATE.start_main_~item~0#1.base|))) (or (= (select .cse10 |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_31) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (not (= (select v_arrayElimArr_2 4) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select .cse11 v_arrayElimCell_31) v_arrayElimCell_32) 0) (= (select .cse10 v_arrayElimCell_32) 0))))) (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_613 Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4) v_ArrVal_613)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| (select v_arrayElimArr_1 4)))))))) is different from false [2022-07-12 18:48:12,007 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_arrayElimCell_30 Int) (v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_613 Int)) (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4) v_ArrVal_613)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1))) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (= (select (select .cse0 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| (select v_arrayElimArr_1 4))) (= (select (select .cse0 v_arrayElimCell_30) |c_ULTIMATE.start_main_~item~0#1.offset|) 0)))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_611 Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (forall ((v_arrayElimArr_2 (Array Int Int)) (v_arrayElimCell_32 Int) (v_arrayElimCell_31 Int)) (let ((.cse2 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4) v_ArrVal_611)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_main_~item~0#1.base|))) (or (= (select .cse1 |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (not (= (select v_arrayElimArr_2 4) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select .cse2 v_arrayElimCell_31) v_arrayElimCell_32) 0) (= (select .cse1 v_arrayElimCell_32) 0))))))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_611 Int)) (or (forall ((v_arrayElimArr_2 (Array Int Int))) (or (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4) v_ArrVal_611)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (not (= (select v_arrayElimArr_2 4) |c_ULTIMATE.start_main_~item~0#1.base|)))) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|))) (forall ((v_arrayElimCell_30 Int) (v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_613 Int)) (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4) v_ArrVal_613)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1)) (.cse4 (select v_arrayElimArr_1 4))) (or (= (select (select .cse3 v_arrayElimCell_30) .cse4) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (= (select (select .cse3 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse4))))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_611 Int)) (or (forall ((v_arrayElimArr_2 (Array Int Int)) (v_arrayElimCell_32 Int)) (let ((.cse5 (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4) v_ArrVal_611)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_main_~item~0#1.base|))) (or (= (select .cse5 |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (not (= (select v_arrayElimArr_2 4) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select .cse5 v_arrayElimCell_32) 0)))) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~item~0#1.offset| 0) (forall ((|ULTIMATE.start_main_~data~0#1.offset| Int) (v_ArrVal_611 Int)) (or (not (<= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (forall ((v_arrayElimArr_2 (Array Int Int))) (or (not (= (select v_arrayElimArr_2 4) |c_ULTIMATE.start_main_~item~0#1.base|)) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_arrayElimCell_32 Int)) (let ((.cse6 (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4) v_ArrVal_611)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_main_~item~0#1.base|))) (or (= (select .cse6 |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= (select v_arrayElimArr_2 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) |ULTIMATE.start_main_~lItem~0#1.base|) (= (select .cse6 v_arrayElimCell_32) 0)))))) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)))) (forall ((v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_611 Int)) (or (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4) v_ArrVal_611)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (not (= (select v_arrayElimArr_2 4) |c_ULTIMATE.start_main_~item~0#1.base|)))) (forall ((v_arrayElimCell_30 Int) (v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_613 Int)) (let ((.cse7 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4) v_ArrVal_613)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1))) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_30) (= (select (select .cse7 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| (select v_arrayElimArr_1 4))) (= (select (select .cse7 v_arrayElimCell_30) |c_ULTIMATE.start_main_~item~0#1.offset|) 0)))) (forall ((v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_arrayElimCell_32 Int) (v_arrayElimCell_31 Int) (v_ArrVal_611 Int)) (let ((.cse9 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4) v_ArrVal_611)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2))) (let ((.cse8 (select .cse9 |c_ULTIMATE.start_main_~item~0#1.base|))) (or (= (select .cse8 |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_31) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (not (= (select v_arrayElimArr_2 4) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select .cse9 v_arrayElimCell_31) v_arrayElimCell_32) 0) (= (select .cse8 v_arrayElimCell_32) 0))))) (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_613 Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4) v_ArrVal_613)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| (select v_arrayElimArr_1 4)))))) is different from false [2022-07-12 18:48:13,364 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_arrayElimCell_30 Int) (v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1)) (.cse1 (select v_arrayElimArr_1 4))) (or (= (select (select .cse0 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse1)) (= 0 (select (select .cse0 v_arrayElimCell_30) .cse1))))) (forall ((|ULTIMATE.start_main_~data~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)) (forall ((v_arrayElimArr_1 (Array Int Int))) (or (forall ((v_arrayElimCell_30 Int) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1))) (or (= (select (select .cse2 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (= (select (select .cse2 v_arrayElimCell_30) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_30)))) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| (select v_arrayElimArr_1 4))))))) (forall ((v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_arrayElimCell_32 Int) (v_arrayElimCell_31 Int)) (let ((.cse4 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~item~0#1.base|))) (or (= (select .cse3 v_arrayElimCell_32) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_31) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (not (= (select v_arrayElimArr_2 4) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select .cse4 v_arrayElimCell_31) v_arrayElimCell_32) 0) (= (select .cse3 |c_ULTIMATE.start_main_~item~0#1.offset|) 0))))) (forall ((v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (not (= (select v_arrayElimArr_2 4) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0))) (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| (select v_arrayElimArr_1 4))))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (forall ((|ULTIMATE.start_main_~data~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (forall ((v_arrayElimArr_2 (Array Int Int))) (or (not (= (select v_arrayElimArr_2 4) |c_ULTIMATE.start_main_~item~0#1.base|)) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_arrayElimCell_32 Int)) (let ((.cse5 (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_main_~item~0#1.base|))) (or (= (select .cse5 v_arrayElimCell_32) 0) (= (select v_arrayElimArr_2 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) |ULTIMATE.start_main_~lItem~0#1.base|) (= (select .cse5 |c_ULTIMATE.start_main_~item~0#1.offset|) 0)))))) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (forall ((v_arrayElimArr_2 (Array Int Int)) (v_arrayElimCell_32 Int)) (let ((.cse6 (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_main_~item~0#1.base|))) (or (= (select .cse6 v_arrayElimCell_32) 0) (not (= (select v_arrayElimArr_2 4) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select .cse6 |c_ULTIMATE.start_main_~item~0#1.offset|) 0)))))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~item~0#1.offset| 0) (forall ((v_arrayElimCell_30 Int) (v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (let ((.cse7 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1))) (or (= (select (select .cse7 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (= (select (select .cse7 v_arrayElimCell_30) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| (select v_arrayElimArr_1 4)))))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (forall ((v_arrayElimArr_2 (Array Int Int)) (v_arrayElimCell_32 Int) (v_arrayElimCell_31 Int)) (let ((.cse9 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2))) (let ((.cse8 (select .cse9 |c_ULTIMATE.start_main_~item~0#1.base|))) (or (= (select .cse8 v_arrayElimCell_32) 0) (not (= (select v_arrayElimArr_2 4) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select .cse9 v_arrayElimCell_31) v_arrayElimCell_32) 0) (= (select .cse8 |c_ULTIMATE.start_main_~item~0#1.offset|) 0))))))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (forall ((v_arrayElimArr_2 (Array Int Int))) (or (not (= (select v_arrayElimArr_2 4) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0))) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|)))) is different from false [2022-07-12 18:48:13,431 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (not (<= 0 |c_ULTIMATE.start_main_~lItem~0#1.offset|))) (.cse2 (not (<= |c_ULTIMATE.start_main_~lItem~0#1.offset| 0)))) (and (forall ((|ULTIMATE.start_main_~data~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)) (= |c_ULTIMATE.start_main_~lItem~0#1.offset| |ULTIMATE.start_main_~data~0#1.offset|) (forall ((v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_arrayElimCell_32 Int)) (let ((.cse0 (select v_arrayElimArr_2 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)))) (or (not (= (select v_arrayElimArr_2 (+ 4 |c_ULTIMATE.start_main_~lItem~0#1.offset|)) |c_ULTIMATE.start_main_~item~0#1.base|)) (= .cse0 |ULTIMATE.start_main_~lItem~0#1.base|) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) .cse0) v_arrayElimCell_32) 0)))))) (= |c_ULTIMATE.start_main_~lItem~0#1.offset| 0) (or .cse1 .cse2 (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| (select v_arrayElimArr_1 (+ 4 |c_ULTIMATE.start_main_~lItem~0#1.offset|))))))) (forall ((|ULTIMATE.start_main_~data~0#1.offset| Int)) (or (forall ((v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_arrayElimCell_32 Int)) (let ((.cse5 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_main_~item~0#1.base|)) (.cse4 (select v_arrayElimArr_2 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)))) (or (= (select .cse3 v_arrayElimCell_32) 0) (not (= (select v_arrayElimArr_2 (+ 4 |c_ULTIMATE.start_main_~lItem~0#1.offset|)) |c_ULTIMATE.start_main_~item~0#1.base|)) (= .cse4 |ULTIMATE.start_main_~lItem~0#1.base|) (= (select .cse3 |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= (select (select .cse5 .cse4) v_arrayElimCell_32) 0))))) (not (<= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)) (= |c_ULTIMATE.start_main_~lItem~0#1.offset| |ULTIMATE.start_main_~data~0#1.offset|))) (forall ((|ULTIMATE.start_main_~data~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (forall ((v_arrayElimCell_30 Int) (v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (let ((.cse6 (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) v_arrayElimCell_30))) (or (= (select .cse6 |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_30) (= (select .cse6 (select v_arrayElimArr_1 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 0) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| (select v_arrayElimArr_1 (+ 4 |c_ULTIMATE.start_main_~lItem~0#1.offset|))))))) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)) (= |c_ULTIMATE.start_main_~lItem~0#1.offset| |ULTIMATE.start_main_~data~0#1.offset|))) (forall ((|ULTIMATE.start_main_~data~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)) (forall ((v_arrayElimArr_1 (Array Int Int))) (or (forall ((v_arrayElimCell_30 Int) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (let ((.cse7 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1))) (let ((.cse8 (select .cse7 v_arrayElimCell_30))) (or (= (select (select .cse7 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (= (select .cse8 |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_30) (= (select .cse8 (select v_arrayElimArr_1 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 0))))) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| (select v_arrayElimArr_1 (+ 4 |c_ULTIMATE.start_main_~lItem~0#1.offset|)))))))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (forall ((|ULTIMATE.start_main_~data~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (forall ((v_arrayElimArr_2 (Array Int Int))) (or (not (= (select v_arrayElimArr_2 (+ 4 |c_ULTIMATE.start_main_~lItem~0#1.offset|)) |c_ULTIMATE.start_main_~item~0#1.base|)) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_arrayElimCell_32 Int)) (let ((.cse11 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2))) (let ((.cse9 (select .cse11 |c_ULTIMATE.start_main_~item~0#1.base|)) (.cse10 (select v_arrayElimArr_2 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)))) (or (= (select .cse9 v_arrayElimCell_32) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (= .cse10 |ULTIMATE.start_main_~lItem~0#1.base|) (= (select .cse9 |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= (select (select .cse11 .cse10) v_arrayElimCell_32) 0))))))) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)))) (or .cse1 .cse2 (forall ((v_arrayElimCell_30 Int) (v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (let ((.cse12 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1))) (or (= (select (select .cse12 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (= (select (select .cse12 v_arrayElimCell_30) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| (select v_arrayElimArr_1 (+ 4 |c_ULTIMATE.start_main_~lItem~0#1.offset|)))))))) (forall ((|ULTIMATE.start_main_~data~0#1.offset| Int)) (or (forall ((v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_arrayElimCell_32 Int)) (let ((.cse13 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2)) (.cse14 (select v_arrayElimArr_2 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)))) (or (= (select (select .cse13 |c_ULTIMATE.start_main_~item~0#1.base|) v_arrayElimCell_32) 0) (not (= (select v_arrayElimArr_2 (+ 4 |c_ULTIMATE.start_main_~lItem~0#1.offset|)) |c_ULTIMATE.start_main_~item~0#1.base|)) (= .cse14 |ULTIMATE.start_main_~lItem~0#1.base|) (= (select (select .cse13 .cse14) v_arrayElimCell_32) 0)))) (not (<= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)) (= |c_ULTIMATE.start_main_~lItem~0#1.offset| |ULTIMATE.start_main_~data~0#1.offset|))) (or .cse1 (forall ((v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_arrayElimCell_32 Int) (v_arrayElimCell_31 Int)) (let ((.cse16 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2))) (let ((.cse15 (select .cse16 |c_ULTIMATE.start_main_~item~0#1.base|))) (or (= (select .cse15 v_arrayElimCell_32) 0) (not (= (select v_arrayElimArr_2 (+ 4 |c_ULTIMATE.start_main_~lItem~0#1.offset|)) |c_ULTIMATE.start_main_~item~0#1.base|)) (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_31) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (= (select (select .cse16 v_arrayElimCell_31) v_arrayElimCell_32) 0) (= (select .cse15 |c_ULTIMATE.start_main_~item~0#1.offset|) 0))))) .cse2) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~item~0#1.offset| 0) (forall ((|ULTIMATE.start_main_~data~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)) (= |c_ULTIMATE.start_main_~lItem~0#1.offset| |ULTIMATE.start_main_~data~0#1.offset|) (forall ((v_arrayElimCell_30 Int) (v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_30) (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) v_arrayElimCell_30) (select v_arrayElimArr_1 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 0) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| (select v_arrayElimArr_1 (+ 4 |c_ULTIMATE.start_main_~lItem~0#1.offset|)))))))) (or .cse1 .cse2 (forall ((v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (not (= (select v_arrayElimArr_2 (+ 4 |c_ULTIMATE.start_main_~lItem~0#1.offset|)) |c_ULTIMATE.start_main_~item~0#1.base|)) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0)))) (forall ((|ULTIMATE.start_main_~data~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)) (= |c_ULTIMATE.start_main_~lItem~0#1.offset| |ULTIMATE.start_main_~data~0#1.offset|) (forall ((v_arrayElimCell_30 Int) (v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (let ((.cse17 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1))) (let ((.cse18 (select .cse17 v_arrayElimCell_30))) (or (= (select (select .cse17 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= (select .cse18 |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_30) (= (select .cse18 (select v_arrayElimArr_1 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 0) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| (select v_arrayElimArr_1 (+ 4 |c_ULTIMATE.start_main_~lItem~0#1.offset|)))))))))) (or .cse1 (and (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (forall ((v_arrayElimArr_2 (Array Int Int)) (v_arrayElimCell_32 Int)) (let ((.cse19 (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_main_~item~0#1.base|))) (or (= (select .cse19 v_arrayElimCell_32) 0) (not (= (select v_arrayElimArr_2 (+ 4 |c_ULTIMATE.start_main_~lItem~0#1.offset|)) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select .cse19 |c_ULTIMATE.start_main_~item~0#1.offset|) 0)))))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (forall ((v_arrayElimArr_2 (Array Int Int))) (or (not (= (select v_arrayElimArr_2 (+ 4 |c_ULTIMATE.start_main_~lItem~0#1.offset|)) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0))) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (forall ((v_arrayElimArr_2 (Array Int Int)) (v_arrayElimCell_32 Int) (v_arrayElimCell_31 Int)) (let ((.cse21 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2))) (let ((.cse20 (select .cse21 |c_ULTIMATE.start_main_~item~0#1.base|))) (or (= (select .cse20 v_arrayElimCell_32) 0) (not (= (select v_arrayElimArr_2 (+ 4 |c_ULTIMATE.start_main_~lItem~0#1.offset|)) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select .cse21 v_arrayElimCell_31) v_arrayElimCell_32) 0) (= (select .cse20 |c_ULTIMATE.start_main_~item~0#1.offset|) 0))))) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|)))) .cse2) (or .cse1 (forall ((v_arrayElimCell_30 Int) (v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (let ((.cse22 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1)) (.cse23 (select v_arrayElimArr_1 (+ 4 |c_ULTIMATE.start_main_~lItem~0#1.offset|)))) (or (= (select (select .cse22 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse23)) (= (select (select .cse22 v_arrayElimCell_30) .cse23) 0)))) .cse2))) is different from false [2022-07-12 18:48:13,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:48:13,764 INFO L93 Difference]: Finished difference Result 258 states and 327 transitions. [2022-07-12 18:48:13,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-07-12 18:48:13,765 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.6666666666666665) internal successors, (104), 39 states have internal predecessors, (104), 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 39 [2022-07-12 18:48:13,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:48:13,766 INFO L225 Difference]: With dead ends: 258 [2022-07-12 18:48:13,766 INFO L226 Difference]: Without dead ends: 258 [2022-07-12 18:48:13,767 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 47.4s TimeCoverageRelationStatistics Valid=266, Invalid=1898, Unknown=46, NotChecked=1212, Total=3422 [2022-07-12 18:48:13,767 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 133 mSDsluCounter, 1637 mSDsCounter, 0 mSdLazyCounter, 883 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 1737 SdHoareTripleChecker+Invalid, 1474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 565 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 18:48:13,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 1737 Invalid, 1474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 883 Invalid, 0 Unknown, 565 Unchecked, 0.4s Time] [2022-07-12 18:48:13,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2022-07-12 18:48:13,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 248. [2022-07-12 18:48:13,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 208 states have (on average 1.5288461538461537) internal successors, (318), 247 states have internal predecessors, (318), 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-12 18:48:13,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 318 transitions. [2022-07-12 18:48:13,770 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 318 transitions. Word has length 39 [2022-07-12 18:48:13,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:48:13,770 INFO L495 AbstractCegarLoop]: Abstraction has 248 states and 318 transitions. [2022-07-12 18:48:13,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 2.6666666666666665) internal successors, (104), 39 states have internal predecessors, (104), 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-12 18:48:13,771 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 318 transitions. [2022-07-12 18:48:13,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-12 18:48:13,771 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:48:13,771 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:48:13,793 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-12 18:48:13,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:48:13,972 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 18:48:13,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:48:13,972 INFO L85 PathProgramCache]: Analyzing trace with hash 394802097, now seen corresponding path program 1 times [2022-07-12 18:48:13,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:48:13,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961417210] [2022-07-12 18:48:13,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:48:13,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:48:13,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:48:14,073 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:48:14,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:48:14,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961417210] [2022-07-12 18:48:14,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961417210] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:48:14,074 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:48:14,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 18:48:14,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760760091] [2022-07-12 18:48:14,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:48:14,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 18:48:14,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:48:14,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 18:48:14,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-07-12 18:48:14,077 INFO L87 Difference]: Start difference. First operand 248 states and 318 transitions. Second operand has 10 states, 9 states have (on average 4.555555555555555) internal successors, (41), 10 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-12 18:48:14,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:48:14,407 INFO L93 Difference]: Finished difference Result 342 states and 417 transitions. [2022-07-12 18:48:14,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-12 18:48:14,408 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.555555555555555) internal successors, (41), 10 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) Word has length 41 [2022-07-12 18:48:14,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:48:14,409 INFO L225 Difference]: With dead ends: 342 [2022-07-12 18:48:14,409 INFO L226 Difference]: Without dead ends: 342 [2022-07-12 18:48:14,409 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2022-07-12 18:48:14,409 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 198 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:48:14,410 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 627 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:48:14,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2022-07-12 18:48:14,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 249. [2022-07-12 18:48:14,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 209 states have (on average 1.5215311004784688) internal successors, (318), 248 states have internal predecessors, (318), 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-12 18:48:14,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 318 transitions. [2022-07-12 18:48:14,413 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 318 transitions. Word has length 41 [2022-07-12 18:48:14,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:48:14,413 INFO L495 AbstractCegarLoop]: Abstraction has 249 states and 318 transitions. [2022-07-12 18:48:14,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.555555555555555) internal successors, (41), 10 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-12 18:48:14,413 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 318 transitions. [2022-07-12 18:48:14,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-12 18:48:14,413 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:48:14,413 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:48:14,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-12 18:48:14,414 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 18:48:14,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:48:14,414 INFO L85 PathProgramCache]: Analyzing trace with hash -645822017, now seen corresponding path program 1 times [2022-07-12 18:48:14,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:48:14,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940321053] [2022-07-12 18:48:14,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:48:14,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:48:14,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:48:14,708 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:48:14,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:48:14,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940321053] [2022-07-12 18:48:14,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940321053] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:48:14,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:48:14,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-07-12 18:48:14,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146923998] [2022-07-12 18:48:14,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:48:14,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-12 18:48:14,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:48:14,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-12 18:48:14,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2022-07-12 18:48:14,709 INFO L87 Difference]: Start difference. First operand 249 states and 318 transitions. Second operand has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 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-12 18:48:15,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:48:15,337 INFO L93 Difference]: Finished difference Result 285 states and 355 transitions. [2022-07-12 18:48:15,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-12 18:48:15,338 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 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) Word has length 42 [2022-07-12 18:48:15,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:48:15,339 INFO L225 Difference]: With dead ends: 285 [2022-07-12 18:48:15,339 INFO L226 Difference]: Without dead ends: 285 [2022-07-12 18:48:15,339 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=246, Invalid=1086, Unknown=0, NotChecked=0, Total=1332 [2022-07-12 18:48:15,340 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 195 mSDsluCounter, 719 mSDsCounter, 0 mSdLazyCounter, 705 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 824 SdHoareTripleChecker+Invalid, 782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 18:48:15,340 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 824 Invalid, 782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 705 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 18:48:15,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2022-07-12 18:48:15,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 249. [2022-07-12 18:48:15,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 209 states have (on average 1.5167464114832536) internal successors, (317), 248 states have internal predecessors, (317), 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-12 18:48:15,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 317 transitions. [2022-07-12 18:48:15,343 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 317 transitions. Word has length 42 [2022-07-12 18:48:15,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:48:15,343 INFO L495 AbstractCegarLoop]: Abstraction has 249 states and 317 transitions. [2022-07-12 18:48:15,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 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-12 18:48:15,343 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 317 transitions. [2022-07-12 18:48:15,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-12 18:48:15,343 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:48:15,343 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:48:15,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-12 18:48:15,343 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 18:48:15,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:48:15,344 INFO L85 PathProgramCache]: Analyzing trace with hash -327922889, now seen corresponding path program 1 times [2022-07-12 18:48:15,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:48:15,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054507842] [2022-07-12 18:48:15,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:48:15,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:48:15,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:48:15,524 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:48:15,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:48:15,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054507842] [2022-07-12 18:48:15,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054507842] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:48:15,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1698057733] [2022-07-12 18:48:15,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:48:15,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:48:15,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:48:15,526 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-12 18:48:15,527 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-12 18:48:15,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:48:15,621 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-12 18:48:15,624 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:48:15,657 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 18:48:15,658 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 32 [2022-07-12 18:48:15,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 18:48:15,795 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:48:15,795 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 40 treesize of output 32 [2022-07-12 18:48:16,066 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:48:16,066 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:48:16,253 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 64 treesize of output 56 [2022-07-12 18:48:16,272 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 36 treesize of output 32 [2022-07-12 18:48:58,118 WARN L233 SmtUtils]: Spent 36.11s on a formula simplification. DAG size of input: 49 DAG size of output: 42 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 18:49:48,332 WARN L233 SmtUtils]: Spent 8.05s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 18:50:05,534 WARN L233 SmtUtils]: Spent 17.10s on a formula simplification. DAG size of input: 40 DAG size of output: 36 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 18:50:09,842 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:50:09,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1698057733] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:50:09,843 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:50:09,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 29 [2022-07-12 18:50:09,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764847339] [2022-07-12 18:50:09,843 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:50:09,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-07-12 18:50:09,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:50:09,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-07-12 18:50:09,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=742, Unknown=23, NotChecked=0, Total=870 [2022-07-12 18:50:09,844 INFO L87 Difference]: Start difference. First operand 249 states and 317 transitions. Second operand has 30 states, 29 states have (on average 3.7586206896551726) internal successors, (109), 30 states have internal predecessors, (109), 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-12 18:50:12,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:50:12,430 INFO L93 Difference]: Finished difference Result 251 states and 318 transitions. [2022-07-12 18:50:12,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 18:50:12,430 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 3.7586206896551726) internal successors, (109), 30 states have internal predecessors, (109), 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 45 [2022-07-12 18:50:12,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:50:12,431 INFO L225 Difference]: With dead ends: 251 [2022-07-12 18:50:12,431 INFO L226 Difference]: Without dead ends: 228 [2022-07-12 18:50:12,431 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 70 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 115.8s TimeCoverageRelationStatistics Valid=158, Invalid=940, Unknown=24, NotChecked=0, Total=1122 [2022-07-12 18:50:12,432 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 32 mSDsluCounter, 1171 mSDsCounter, 0 mSdLazyCounter, 921 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 1282 SdHoareTripleChecker+Invalid, 1266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 921 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 337 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 18:50:12,432 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 1282 Invalid, 1266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 921 Invalid, 0 Unknown, 337 Unchecked, 0.5s Time] [2022-07-12 18:50:12,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2022-07-12 18:50:12,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2022-07-12 18:50:12,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 188 states have (on average 1.5691489361702127) internal successors, (295), 227 states have internal predecessors, (295), 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-12 18:50:12,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 295 transitions. [2022-07-12 18:50:12,434 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 295 transitions. Word has length 45 [2022-07-12 18:50:12,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:50:12,435 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 295 transitions. [2022-07-12 18:50:12,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 3.7586206896551726) internal successors, (109), 30 states have internal predecessors, (109), 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-12 18:50:12,435 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 295 transitions. [2022-07-12 18:50:12,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-12 18:50:12,435 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:50:12,435 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:50:12,457 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-12 18:50:12,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-07-12 18:50:12,636 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 18:50:12,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:50:12,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1291794435, now seen corresponding path program 1 times [2022-07-12 18:50:12,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:50:12,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651183922] [2022-07-12 18:50:12,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:50:12,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:50:12,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:50:12,664 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 17 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:50:12,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:50:12,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651183922] [2022-07-12 18:50:12,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651183922] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:50:12,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [839068211] [2022-07-12 18:50:12,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:50:12,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:50:12,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:50:12,666 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:50:12,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-12 18:50:12,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:50:12,772 INFO L263 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 18:50:12,776 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:50:12,794 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-12 18:50:12,794 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:50:12,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [839068211] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:50:12,794 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 18:50:12,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-07-12 18:50:12,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094979500] [2022-07-12 18:50:12,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:50:12,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 18:50:12,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:50:12,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 18:50:12,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-12 18:50:12,796 INFO L87 Difference]: Start difference. First operand 228 states and 295 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:50:12,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:50:12,817 INFO L93 Difference]: Finished difference Result 391 states and 505 transitions. [2022-07-12 18:50:12,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 18:50:12,818 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-07-12 18:50:12,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:50:12,819 INFO L225 Difference]: With dead ends: 391 [2022-07-12 18:50:12,819 INFO L226 Difference]: Without dead ends: 389 [2022-07-12 18:50:12,819 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-12 18:50:12,820 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 105 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:50:12,820 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 384 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:50:12,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2022-07-12 18:50:12,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 239. [2022-07-12 18:50:12,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 199 states have (on average 1.5175879396984924) internal successors, (302), 238 states have internal predecessors, (302), 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-12 18:50:12,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 302 transitions. [2022-07-12 18:50:12,823 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 302 transitions. Word has length 45 [2022-07-12 18:50:12,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:50:12,824 INFO L495 AbstractCegarLoop]: Abstraction has 239 states and 302 transitions. [2022-07-12 18:50:12,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:50:12,824 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 302 transitions. [2022-07-12 18:50:12,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-12 18:50:12,824 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:50:12,824 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:50:12,841 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-12 18:50:13,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:50:13,042 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 18:50:13,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:50:13,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1971852805, now seen corresponding path program 1 times [2022-07-12 18:50:13,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:50:13,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139045920] [2022-07-12 18:50:13,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:50:13,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:50:13,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:50:13,086 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 17 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:50:13,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:50:13,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139045920] [2022-07-12 18:50:13,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139045920] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:50:13,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [785773374] [2022-07-12 18:50:13,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:50:13,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:50:13,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:50:13,088 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:50:13,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-12 18:50:13,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:50:13,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 18:50:13,192 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:50:13,221 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:50:13,221 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:50:13,257 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:50:13,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [785773374] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:50:13,258 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:50:13,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 8 [2022-07-12 18:50:13,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019456072] [2022-07-12 18:50:13,259 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:50:13,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 18:50:13,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:50:13,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 18:50:13,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2022-07-12 18:50:13,260 INFO L87 Difference]: Start difference. First operand 239 states and 302 transitions. Second operand has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 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-12 18:50:13,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:50:13,322 INFO L93 Difference]: Finished difference Result 1027 states and 1353 transitions. [2022-07-12 18:50:13,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 18:50:13,322 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 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 45 [2022-07-12 18:50:13,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:50:13,325 INFO L225 Difference]: With dead ends: 1027 [2022-07-12 18:50:13,325 INFO L226 Difference]: Without dead ends: 1027 [2022-07-12 18:50:13,325 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2022-07-12 18:50:13,326 INFO L413 NwaCegarLoop]: 233 mSDtfsCounter, 962 mSDsluCounter, 702 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 962 SdHoareTripleChecker+Valid, 935 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:50:13,326 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [962 Valid, 935 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:50:13,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1027 states. [2022-07-12 18:50:13,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1027 to 273. [2022-07-12 18:50:13,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 233 states have (on average 1.4721030042918455) internal successors, (343), 272 states have internal predecessors, (343), 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-12 18:50:13,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 343 transitions. [2022-07-12 18:50:13,331 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 343 transitions. Word has length 45 [2022-07-12 18:50:13,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:50:13,332 INFO L495 AbstractCegarLoop]: Abstraction has 273 states and 343 transitions. [2022-07-12 18:50:13,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 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-12 18:50:13,332 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 343 transitions. [2022-07-12 18:50:13,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-12 18:50:13,332 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:50:13,332 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:50:13,367 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-12 18:50:13,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:50:13,540 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 18:50:13,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:50:13,540 INFO L85 PathProgramCache]: Analyzing trace with hash 69553884, now seen corresponding path program 1 times [2022-07-12 18:50:13,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:50:13,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530181670] [2022-07-12 18:50:13,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:50:13,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:50:13,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:50:13,620 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:50:13,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:50:13,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530181670] [2022-07-12 18:50:13,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530181670] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:50:13,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2021890414] [2022-07-12 18:50:13,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:50:13,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:50:13,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:50:13,622 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:50:13,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-12 18:50:13,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:50:13,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 28 conjunts are in the unsatisfiable core [2022-07-12 18:50:13,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:50:13,773 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-12 18:50:13,828 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 11 treesize of output 7 [2022-07-12 18:50:13,833 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 11 treesize of output 7 [2022-07-12 18:50:13,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:50:13,859 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 60 treesize of output 46 [2022-07-12 18:50:13,869 INFO L356 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-07-12 18:50:13,869 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 33 treesize of output 27 [2022-07-12 18:50:13,914 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-12 18:50:13,966 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 13 [2022-07-12 18:50:13,969 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:50:13,969 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:50:13,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2021890414] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:50:13,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 18:50:13,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [9] total 17 [2022-07-12 18:50:13,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35893838] [2022-07-12 18:50:13,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:50:13,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 18:50:13,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:50:13,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 18:50:13,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2022-07-12 18:50:13,972 INFO L87 Difference]: Start difference. First operand 273 states and 343 transitions. Second operand has 11 states, 10 states have (on average 4.7) internal successors, (47), 11 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:50:14,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:50:14,269 INFO L93 Difference]: Finished difference Result 299 states and 346 transitions. [2022-07-12 18:50:14,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 18:50:14,269 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.7) internal successors, (47), 11 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2022-07-12 18:50:14,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:50:14,270 INFO L225 Difference]: With dead ends: 299 [2022-07-12 18:50:14,270 INFO L226 Difference]: Without dead ends: 299 [2022-07-12 18:50:14,271 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=482, Unknown=0, NotChecked=0, Total=600 [2022-07-12 18:50:14,271 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 293 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:50:14,278 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 549 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:50:14,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2022-07-12 18:50:14,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 273. [2022-07-12 18:50:14,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 233 states have (on average 1.4678111587982832) internal successors, (342), 272 states have internal predecessors, (342), 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-12 18:50:14,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 342 transitions. [2022-07-12 18:50:14,284 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 342 transitions. Word has length 47 [2022-07-12 18:50:14,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:50:14,284 INFO L495 AbstractCegarLoop]: Abstraction has 273 states and 342 transitions. [2022-07-12 18:50:14,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.7) internal successors, (47), 11 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:50:14,285 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 342 transitions. [2022-07-12 18:50:14,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-12 18:50:14,285 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:50:14,285 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:50:14,304 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-12 18:50:14,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-07-12 18:50:14,502 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 18:50:14,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:50:14,503 INFO L85 PathProgramCache]: Analyzing trace with hash 69553885, now seen corresponding path program 1 times [2022-07-12 18:50:14,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:50:14,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280362674] [2022-07-12 18:50:14,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:50:14,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:50:14,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:50:14,677 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:50:14,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:50:14,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280362674] [2022-07-12 18:50:14,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280362674] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:50:14,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1896704372] [2022-07-12 18:50:14,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:50:14,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:50:14,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:50:14,679 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:50:14,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-12 18:50:14,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:50:14,803 INFO L263 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-12 18:50:14,811 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:50:14,841 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-12 18:50:14,896 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 11 treesize of output 7 [2022-07-12 18:50:14,899 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 11 treesize of output 7 [2022-07-12 18:50:14,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:50:14,927 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 60 treesize of output 46 [2022-07-12 18:50:14,937 INFO L356 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-07-12 18:50:14,937 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 33 treesize of output 27 [2022-07-12 18:50:15,081 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 13 [2022-07-12 18:50:15,085 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-12 18:50:15,102 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:50:15,103 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:50:15,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1896704372] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:50:15,103 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 18:50:15,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 19 [2022-07-12 18:50:15,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659662681] [2022-07-12 18:50:15,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:50:15,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 18:50:15,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:50:15,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 18:50:15,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2022-07-12 18:50:15,104 INFO L87 Difference]: Start difference. First operand 273 states and 342 transitions. Second operand has 11 states, 10 states have (on average 4.7) internal successors, (47), 11 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:50:15,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:50:15,411 INFO L93 Difference]: Finished difference Result 319 states and 368 transitions. [2022-07-12 18:50:15,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 18:50:15,411 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.7) internal successors, (47), 11 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2022-07-12 18:50:15,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:50:15,412 INFO L225 Difference]: With dead ends: 319 [2022-07-12 18:50:15,412 INFO L226 Difference]: Without dead ends: 319 [2022-07-12 18:50:15,412 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=483, Unknown=0, NotChecked=0, Total=600 [2022-07-12 18:50:15,413 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 369 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:50:15,413 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 541 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:50:15,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2022-07-12 18:50:15,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 273. [2022-07-12 18:50:15,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 233 states have (on average 1.463519313304721) internal successors, (341), 272 states have internal predecessors, (341), 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-12 18:50:15,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 341 transitions. [2022-07-12 18:50:15,416 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 341 transitions. Word has length 47 [2022-07-12 18:50:15,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:50:15,416 INFO L495 AbstractCegarLoop]: Abstraction has 273 states and 341 transitions. [2022-07-12 18:50:15,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.7) internal successors, (47), 11 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:50:15,416 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 341 transitions. [2022-07-12 18:50:15,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-12 18:50:15,416 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:50:15,416 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:50:15,433 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-12 18:50:15,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-07-12 18:50:15,631 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 18:50:15,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:50:15,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1479009528, now seen corresponding path program 1 times [2022-07-12 18:50:15,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:50:15,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460221093] [2022-07-12 18:50:15,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:50:15,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:50:15,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:50:15,700 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:50:15,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:50:15,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460221093] [2022-07-12 18:50:15,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460221093] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:50:15,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [842951261] [2022-07-12 18:50:15,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:50:15,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:50:15,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:50:15,702 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:50:15,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-12 18:50:15,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:50:15,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-12 18:50:15,823 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:50:15,825 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-12 18:50:15,851 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-12 18:50:15,851 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-12 18:50:15,864 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 18:50:15,864 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 11 treesize of output 11 [2022-07-12 18:50:15,872 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 11 treesize of output 7 [2022-07-12 18:50:15,880 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 18:50:15,880 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 19 treesize of output 22 [2022-07-12 18:50:15,888 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-12 18:50:15,889 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:50:15,890 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:50:15,900 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1569 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1569) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset|) |c_ULTIMATE.start_main_~data~0#1.base|))) is different from false [2022-07-12 18:50:15,904 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:50:15,904 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 1 case distinctions, treesize of input 19 treesize of output 20 [2022-07-12 18:50:15,905 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 33 treesize of output 25 [2022-07-12 18:50:15,909 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-12 18:50:15,950 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-07-12 18:50:15,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [842951261] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:50:15,950 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:50:15,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 12 [2022-07-12 18:50:15,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168093117] [2022-07-12 18:50:15,950 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:50:15,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 18:50:15,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:50:15,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 18:50:15,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=84, Unknown=1, NotChecked=18, Total=132 [2022-07-12 18:50:15,951 INFO L87 Difference]: Start difference. First operand 273 states and 341 transitions. Second operand has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 12 states have internal predecessors, (71), 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-12 18:50:16,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:50:16,196 INFO L93 Difference]: Finished difference Result 273 states and 338 transitions. [2022-07-12 18:50:16,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 18:50:16,196 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 12 states have internal predecessors, (71), 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 50 [2022-07-12 18:50:16,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:50:16,197 INFO L225 Difference]: With dead ends: 273 [2022-07-12 18:50:16,197 INFO L226 Difference]: Without dead ends: 273 [2022-07-12 18:50:16,197 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 99 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=251, Unknown=1, NotChecked=34, Total=380 [2022-07-12 18:50:16,197 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 137 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 101 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:50:16,197 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 728 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 434 Invalid, 0 Unknown, 101 Unchecked, 0.2s Time] [2022-07-12 18:50:16,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2022-07-12 18:50:16,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 269. [2022-07-12 18:50:16,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 229 states have (on average 1.4672489082969433) internal successors, (336), 268 states have internal predecessors, (336), 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-12 18:50:16,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 336 transitions. [2022-07-12 18:50:16,200 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 336 transitions. Word has length 50 [2022-07-12 18:50:16,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:50:16,200 INFO L495 AbstractCegarLoop]: Abstraction has 269 states and 336 transitions. [2022-07-12 18:50:16,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 12 states have internal predecessors, (71), 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-12 18:50:16,200 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 336 transitions. [2022-07-12 18:50:16,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-12 18:50:16,200 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:50:16,201 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:50:16,218 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-12 18:50:16,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:50:16,415 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 18:50:16,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:50:16,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1055909602, now seen corresponding path program 1 times [2022-07-12 18:50:16,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:50:16,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123108306] [2022-07-12 18:50:16,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:50:16,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:50:16,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:50:16,486 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-12 18:50:16,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:50:16,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123108306] [2022-07-12 18:50:16,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123108306] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:50:16,487 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:50:16,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 18:50:16,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887481997] [2022-07-12 18:50:16,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:50:16,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 18:50:16,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:50:16,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 18:50:16,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 18:50:16,488 INFO L87 Difference]: Start difference. First operand 269 states and 336 transitions. Second operand has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 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-12 18:50:16,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:50:16,621 INFO L93 Difference]: Finished difference Result 268 states and 334 transitions. [2022-07-12 18:50:16,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 18:50:16,621 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 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 51 [2022-07-12 18:50:16,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:50:16,622 INFO L225 Difference]: With dead ends: 268 [2022-07-12 18:50:16,622 INFO L226 Difference]: Without dead ends: 268 [2022-07-12 18:50:16,622 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-12 18:50:16,622 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 25 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:50:16,622 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 386 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:50:16,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2022-07-12 18:50:16,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2022-07-12 18:50:16,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 229 states have (on average 1.4585152838427948) internal successors, (334), 267 states have internal predecessors, (334), 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-12 18:50:16,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 334 transitions. [2022-07-12 18:50:16,625 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 334 transitions. Word has length 51 [2022-07-12 18:50:16,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:50:16,625 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 334 transitions. [2022-07-12 18:50:16,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 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-12 18:50:16,625 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 334 transitions. [2022-07-12 18:50:16,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-12 18:50:16,625 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:50:16,626 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:50:16,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-07-12 18:50:16,626 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 18:50:16,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:50:16,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1055909601, now seen corresponding path program 1 times [2022-07-12 18:50:16,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:50:16,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994753486] [2022-07-12 18:50:16,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:50:16,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:50:16,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:50:16,773 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:50:16,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:50:16,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994753486] [2022-07-12 18:50:16,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994753486] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:50:16,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1523527768] [2022-07-12 18:50:16,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:50:16,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:50:16,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:50:16,775 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:50:16,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-12 18:50:16,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:50:16,916 INFO L263 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-12 18:50:16,917 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:50:16,985 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 11 treesize of output 7 [2022-07-12 18:50:17,012 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-12 18:50:17,012 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 25 treesize of output 23 [2022-07-12 18:50:17,139 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 23 treesize of output 15 [2022-07-12 18:50:17,141 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 26 treesize of output 14 [2022-07-12 18:50:17,172 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:50:17,173 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:50:17,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1523527768] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:50:17,173 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 18:50:17,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [11] total 21 [2022-07-12 18:50:17,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705991991] [2022-07-12 18:50:17,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:50:17,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 18:50:17,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:50:17,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 18:50:17,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=377, Unknown=0, NotChecked=0, Total=462 [2022-07-12 18:50:17,174 INFO L87 Difference]: Start difference. First operand 268 states and 334 transitions. Second operand has 12 states, 11 states have (on average 4.636363636363637) internal successors, (51), 12 states have internal predecessors, (51), 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-12 18:50:17,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:50:17,480 INFO L93 Difference]: Finished difference Result 338 states and 388 transitions. [2022-07-12 18:50:17,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-12 18:50:17,481 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.636363636363637) internal successors, (51), 12 states have internal predecessors, (51), 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 51 [2022-07-12 18:50:17,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:50:17,482 INFO L225 Difference]: With dead ends: 338 [2022-07-12 18:50:17,482 INFO L226 Difference]: Without dead ends: 338 [2022-07-12 18:50:17,482 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=208, Invalid=662, Unknown=0, NotChecked=0, Total=870 [2022-07-12 18:50:17,482 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 691 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 691 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:50:17,483 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [691 Valid, 427 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:50:17,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2022-07-12 18:50:17,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 268. [2022-07-12 18:50:17,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 229 states have (on average 1.4497816593886463) internal successors, (332), 267 states have internal predecessors, (332), 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-12 18:50:17,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 332 transitions. [2022-07-12 18:50:17,486 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 332 transitions. Word has length 51 [2022-07-12 18:50:17,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:50:17,486 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 332 transitions. [2022-07-12 18:50:17,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.636363636363637) internal successors, (51), 12 states have internal predecessors, (51), 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-12 18:50:17,486 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 332 transitions. [2022-07-12 18:50:17,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-12 18:50:17,486 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:50:17,486 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:50:17,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-12 18:50:17,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:50:17,691 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 18:50:17,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:50:17,692 INFO L85 PathProgramCache]: Analyzing trace with hash 455851009, now seen corresponding path program 1 times [2022-07-12 18:50:17,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:50:17,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743457756] [2022-07-12 18:50:17,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:50:17,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:50:17,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:50:17,821 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:50:17,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:50:17,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743457756] [2022-07-12 18:50:17,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743457756] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:50:17,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [273339027] [2022-07-12 18:50:17,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:50:17,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:50:17,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:50:17,823 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:50:17,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-12 18:50:17,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:50:17,983 INFO L263 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-12 18:50:17,988 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:50:18,052 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 11 treesize of output 7 [2022-07-12 18:50:18,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:50:18,074 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 21 treesize of output 20 [2022-07-12 18:50:18,115 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-12 18:50:18,127 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:50:18,127 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:50:18,242 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:50:18,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [273339027] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:50:18,242 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:50:18,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2022-07-12 18:50:18,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28964286] [2022-07-12 18:50:18,242 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:50:18,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-12 18:50:18,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:50:18,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-12 18:50:18,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2022-07-12 18:50:18,243 INFO L87 Difference]: Start difference. First operand 268 states and 332 transitions. Second operand has 18 states, 17 states have (on average 6.705882352941177) internal successors, (114), 18 states have internal predecessors, (114), 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-12 18:50:18,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:50:18,506 INFO L93 Difference]: Finished difference Result 270 states and 333 transitions. [2022-07-12 18:50:18,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 18:50:18,507 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 6.705882352941177) internal successors, (114), 18 states have internal predecessors, (114), 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 55 [2022-07-12 18:50:18,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:50:18,508 INFO L225 Difference]: With dead ends: 270 [2022-07-12 18:50:18,508 INFO L226 Difference]: Without dead ends: 270 [2022-07-12 18:50:18,508 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 100 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=139, Invalid=413, Unknown=0, NotChecked=0, Total=552 [2022-07-12 18:50:18,508 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 494 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 494 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:50:18,508 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [494 Valid, 694 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 344 Invalid, 0 Unknown, 2 Unchecked, 0.2s Time] [2022-07-12 18:50:18,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2022-07-12 18:50:18,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 268. [2022-07-12 18:50:18,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 229 states have (on average 1.445414847161572) internal successors, (331), 267 states have internal predecessors, (331), 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-12 18:50:18,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 331 transitions. [2022-07-12 18:50:18,511 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 331 transitions. Word has length 55 [2022-07-12 18:50:18,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:50:18,511 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 331 transitions. [2022-07-12 18:50:18,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 6.705882352941177) internal successors, (114), 18 states have internal predecessors, (114), 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-12 18:50:18,511 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 331 transitions. [2022-07-12 18:50:18,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-12 18:50:18,511 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:50:18,512 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:50:18,528 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-07-12 18:50:18,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:50:18,724 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 18:50:18,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:50:18,724 INFO L85 PathProgramCache]: Analyzing trace with hash -429024641, now seen corresponding path program 1 times [2022-07-12 18:50:18,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:50:18,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850607997] [2022-07-12 18:50:18,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:50:18,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:50:18,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:50:19,126 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:50:19,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:50:19,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850607997] [2022-07-12 18:50:19,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850607997] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:50:19,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1638223329] [2022-07-12 18:50:19,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:50:19,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:50:19,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:50:19,127 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:50:19,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-12 18:50:19,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:50:19,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 60 conjunts are in the unsatisfiable core [2022-07-12 18:50:19,290 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:50:19,292 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-12 18:50:19,315 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 18:50:19,316 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-07-12 18:50:19,375 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 11 treesize of output 7 [2022-07-12 18:50:19,428 INFO L356 Elim1Store]: treesize reduction 60, result has 31.0 percent of original size [2022-07-12 18:50:19,429 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 41 [2022-07-12 18:50:19,467 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 24 [2022-07-12 18:50:19,498 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 24 [2022-07-12 18:50:19,516 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 24 [2022-07-12 18:50:19,592 INFO L356 Elim1Store]: treesize reduction 78, result has 31.6 percent of original size [2022-07-12 18:50:19,592 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 31 treesize of output 53 [2022-07-12 18:50:19,706 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-07-12 18:50:19,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:50:19,764 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 37 treesize of output 28 [2022-07-12 18:50:19,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:50:19,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:50:19,834 INFO L356 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-07-12 18:50:19,834 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 48 [2022-07-12 18:50:20,205 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:50:20,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:50:20,207 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 28 [2022-07-12 18:50:20,211 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-12 18:50:20,409 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-12 18:50:20,410 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 30 [2022-07-12 18:50:20,459 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:50:20,459 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:50:20,795 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 32 treesize of output 20 [2022-07-12 18:50:21,217 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_2176 Int) (v_ArrVal_2178 Int) (v_ArrVal_2173 (Array Int Int))) (= (let ((.cse5 (select (let ((.cse6 (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_2173))) (store .cse7 |c_ULTIMATE.start_main_~data~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset| |c_ULTIMATE.start_main_~lItem~0#1.base|))))) (store .cse6 |c_ULTIMATE.start_main_~lItem~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~lItem~0#1.base|) (+ 4 |c_ULTIMATE.start_main_~lItem~0#1.offset|) v_ArrVal_2176))) |c_ULTIMATE.start_main_~data~0#1.base|))) (select (store |c_#valid| (select .cse5 |c_ULTIMATE.start_main_~data~0#1.offset|) v_ArrVal_2178) (select .cse5 (+ |c_ULTIMATE.start_main_~data~0#1.offset| 4)))) 1)))) (and (or (<= |c_ULTIMATE.start_main_~data~0#1.offset| 0) .cse0) (or (<= 0 |c_ULTIMATE.start_main_~data~0#1.offset|) .cse0) (forall ((v_ArrVal_2176 Int) (v_ArrVal_2178 Int) (v_ArrVal_2173 (Array Int Int))) (let ((.cse2 (select (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_2173))) (store .cse4 |c_ULTIMATE.start_main_~data~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset| |c_ULTIMATE.start_main_~lItem~0#1.base|))))) (store .cse3 |c_ULTIMATE.start_main_~lItem~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~lItem~0#1.base|) (+ 4 |c_ULTIMATE.start_main_~lItem~0#1.offset|) v_ArrVal_2176))) |c_ULTIMATE.start_main_~data~0#1.base|))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_main_~data~0#1.offset|))) (or (= (select (store |c_#valid| .cse1 v_ArrVal_2178) (select .cse2 (+ |c_ULTIMATE.start_main_~data~0#1.offset| 4))) 1) (= |c_ULTIMATE.start_main_~data~0#1.base| .cse1))))))) is different from false [2022-07-12 18:50:22,293 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:50:22,293 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 1 case distinctions, treesize of input 302 treesize of output 192 [2022-07-12 18:50:22,297 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:50:22,313 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:50:22,314 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 1305 treesize of output 1291 [2022-07-12 18:50:22,323 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:50:22,329 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:50:22,330 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 0 case distinctions, treesize of input 2131 treesize of output 1971 [2022-07-12 18:50:22,352 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:50:22,364 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 1063 treesize of output 1031 [2022-07-12 18:50:23,294 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 4 [2022-07-12 18:50:23,315 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:50:23,325 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:50:23,325 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 565 treesize of output 561