./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/dll2n_append_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e8d55036 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-simple/dll2n_append_unequal.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 8e4e2611155a39995b0fc64ec45d64e4c98f789d2737326ee819380629347be0 --- Real Ultimate output --- This is Ultimate 0.2.2-?-e8d5503-m [2023-02-15 22:25:56,978 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 22:25:56,979 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 22:25:57,012 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 22:25:57,013 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 22:25:57,014 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 22:25:57,017 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 22:25:57,020 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 22:25:57,021 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 22:25:57,025 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 22:25:57,026 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 22:25:57,028 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 22:25:57,029 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 22:25:57,032 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 22:25:57,033 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 22:25:57,034 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 22:25:57,035 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 22:25:57,036 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 22:25:57,038 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 22:25:57,042 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 22:25:57,043 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 22:25:57,044 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 22:25:57,045 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 22:25:57,046 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 22:25:57,053 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 22:25:57,054 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 22:25:57,054 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 22:25:57,055 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 22:25:57,055 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 22:25:57,056 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 22:25:57,056 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 22:25:57,057 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 22:25:57,058 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 22:25:57,060 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 22:25:57,061 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 22:25:57,061 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 22:25:57,062 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 22:25:57,062 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 22:25:57,062 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 22:25:57,063 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 22:25:57,064 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 22:25:57,065 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-15 22:25:57,093 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 22:25:57,094 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 22:25:57,094 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 22:25:57,094 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 22:25:57,095 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 22:25:57,095 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 22:25:57,096 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 22:25:57,096 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 22:25:57,096 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 22:25:57,096 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 22:25:57,097 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 22:25:57,097 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 22:25:57,098 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 22:25:57,098 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 22:25:57,098 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 22:25:57,098 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-15 22:25:57,098 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-15 22:25:57,098 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-15 22:25:57,099 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 22:25:57,099 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 22:25:57,099 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 22:25:57,099 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 22:25:57,099 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 22:25:57,099 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 22:25:57,100 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 22:25:57,100 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 22:25:57,100 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 22:25:57,100 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 22:25:57,100 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 22:25:57,100 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 22:25:57,101 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 22:25:57,101 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 22:25:57,101 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 22:25:57,101 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 22:25:57,101 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> 8e4e2611155a39995b0fc64ec45d64e4c98f789d2737326ee819380629347be0 [2023-02-15 22:25:57,317 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 22:25:57,341 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 22:25:57,343 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 22:25:57,344 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 22:25:57,344 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 22:25:57,345 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2n_append_unequal.i [2023-02-15 22:25:58,389 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 22:25:58,672 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 22:25:58,673 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_append_unequal.i [2023-02-15 22:25:58,687 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a28855497/7ac3970bca904d28a67d522752d6deb3/FLAG35120bd3e [2023-02-15 22:25:58,702 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a28855497/7ac3970bca904d28a67d522752d6deb3 [2023-02-15 22:25:58,704 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 22:25:58,705 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 22:25:58,707 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 22:25:58,707 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 22:25:58,710 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 22:25:58,711 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:25:58" (1/1) ... [2023-02-15 22:25:58,712 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65296306 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:25:58, skipping insertion in model container [2023-02-15 22:25:58,712 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:25:58" (1/1) ... [2023-02-15 22:25:58,717 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 22:25:58,757 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 22:25:59,046 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_append_unequal.i[24457,24470] [2023-02-15 22:25:59,052 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 22:25:59,061 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 22:25:59,114 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_append_unequal.i[24457,24470] [2023-02-15 22:25:59,118 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 22:25:59,144 INFO L208 MainTranslator]: Completed translation [2023-02-15 22:25:59,144 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:25:59 WrapperNode [2023-02-15 22:25:59,144 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 22:25:59,145 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 22:25:59,146 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 22:25:59,146 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 22:25:59,151 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:25:59" (1/1) ... [2023-02-15 22:25:59,177 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:25:59" (1/1) ... [2023-02-15 22:25:59,205 INFO L138 Inliner]: procedures = 127, calls = 40, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 141 [2023-02-15 22:25:59,205 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 22:25:59,206 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 22:25:59,206 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 22:25:59,206 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 22:25:59,214 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:25:59" (1/1) ... [2023-02-15 22:25:59,214 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:25:59" (1/1) ... [2023-02-15 22:25:59,228 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:25:59" (1/1) ... [2023-02-15 22:25:59,229 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:25:59" (1/1) ... [2023-02-15 22:25:59,236 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:25:59" (1/1) ... [2023-02-15 22:25:59,244 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:25:59" (1/1) ... [2023-02-15 22:25:59,246 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:25:59" (1/1) ... [2023-02-15 22:25:59,251 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:25:59" (1/1) ... [2023-02-15 22:25:59,253 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 22:25:59,254 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 22:25:59,255 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 22:25:59,256 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 22:25:59,256 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:25:59" (1/1) ... [2023-02-15 22:25:59,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 22:25:59,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:25:59,285 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) [2023-02-15 22:25:59,300 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 [2023-02-15 22:25:59,317 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-15 22:25:59,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-15 22:25:59,317 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-02-15 22:25:59,317 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-02-15 22:25:59,318 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 22:25:59,318 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 22:25:59,321 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-15 22:25:59,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-15 22:25:59,322 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-15 22:25:59,322 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 22:25:59,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-15 22:25:59,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 22:25:59,323 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 22:25:59,323 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 22:25:59,416 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 22:25:59,418 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 22:25:59,784 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 22:25:59,800 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 22:25:59,800 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2023-02-15 22:25:59,802 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:25:59 BoogieIcfgContainer [2023-02-15 22:25:59,802 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 22:25:59,804 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 22:25:59,804 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 22:25:59,806 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 22:25:59,807 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 10:25:58" (1/3) ... [2023-02-15 22:25:59,807 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ec447df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:25:59, skipping insertion in model container [2023-02-15 22:25:59,807 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:25:59" (2/3) ... [2023-02-15 22:25:59,808 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ec447df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:25:59, skipping insertion in model container [2023-02-15 22:25:59,808 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:25:59" (3/3) ... [2023-02-15 22:25:59,809 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_append_unequal.i [2023-02-15 22:25:59,822 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 22:25:59,825 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 47 error locations. [2023-02-15 22:25:59,870 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 22:25:59,875 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=PETRI_NET, 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@578e457f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 22:25:59,875 INFO L358 AbstractCegarLoop]: Starting to check reachability of 47 error locations. [2023-02-15 22:25:59,879 INFO L276 IsEmpty]: Start isEmpty. Operand has 108 states, 57 states have (on average 2.087719298245614) internal successors, (119), 104 states have internal predecessors, (119), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 22:25:59,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-02-15 22:25:59,884 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:25:59,884 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:25:59,885 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2023-02-15 22:25:59,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:25:59,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1815964311, now seen corresponding path program 1 times [2023-02-15 22:25:59,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:25:59,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612045596] [2023-02-15 22:25:59,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:25:59,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:25:59,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:26:00,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:26:00,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:26:00,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612045596] [2023-02-15 22:26:00,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612045596] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:26:00,119 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:26:00,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 22:26:00,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921449104] [2023-02-15 22:26:00,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:26:00,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 22:26:00,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:26:00,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 22:26:00,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 22:26:00,186 INFO L87 Difference]: Start difference. First operand has 108 states, 57 states have (on average 2.087719298245614) internal successors, (119), 104 states have internal predecessors, (119), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:26:00,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:26:00,318 INFO L93 Difference]: Finished difference Result 105 states and 115 transitions. [2023-02-15 22:26:00,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 22:26:00,320 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-02-15 22:26:00,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:26:00,327 INFO L225 Difference]: With dead ends: 105 [2023-02-15 22:26:00,327 INFO L226 Difference]: Without dead ends: 102 [2023-02-15 22:26:00,331 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 [2023-02-15 22:26:00,336 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 10 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:26:00,337 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 164 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:26:00,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-02-15 22:26:00,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2023-02-15 22:26:00,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 55 states have (on average 1.9454545454545455) internal successors, (107), 98 states have internal predecessors, (107), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 22:26:00,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 111 transitions. [2023-02-15 22:26:00,375 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 111 transitions. Word has length 7 [2023-02-15 22:26:00,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:26:00,376 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 111 transitions. [2023-02-15 22:26:00,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:26:00,376 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 111 transitions. [2023-02-15 22:26:00,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-02-15 22:26:00,377 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:26:00,377 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:26:00,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 22:26:00,378 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2023-02-15 22:26:00,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:26:00,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1815964312, now seen corresponding path program 1 times [2023-02-15 22:26:00,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:26:00,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651357048] [2023-02-15 22:26:00,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:26:00,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:26:00,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:26:00,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:26:00,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:26:00,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651357048] [2023-02-15 22:26:00,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651357048] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:26:00,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:26:00,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 22:26:00,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084778364] [2023-02-15 22:26:00,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:26:00,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 22:26:00,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:26:00,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 22:26:00,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 22:26:00,567 INFO L87 Difference]: Start difference. First operand 102 states and 111 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:26:00,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:26:00,661 INFO L93 Difference]: Finished difference Result 99 states and 108 transitions. [2023-02-15 22:26:00,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 22:26:00,661 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-02-15 22:26:00,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:26:00,665 INFO L225 Difference]: With dead ends: 99 [2023-02-15 22:26:00,665 INFO L226 Difference]: Without dead ends: 99 [2023-02-15 22:26:00,668 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 [2023-02-15 22:26:00,671 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 5 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:26:00,672 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 164 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:26:00,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-02-15 22:26:00,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2023-02-15 22:26:00,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 55 states have (on average 1.8909090909090909) internal successors, (104), 95 states have internal predecessors, (104), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 22:26:00,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 108 transitions. [2023-02-15 22:26:00,683 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 108 transitions. Word has length 7 [2023-02-15 22:26:00,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:26:00,683 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 108 transitions. [2023-02-15 22:26:00,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:26:00,684 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 108 transitions. [2023-02-15 22:26:00,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-15 22:26:00,686 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:26:00,686 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:26:00,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 22:26:00,687 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2023-02-15 22:26:00,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:26:00,692 INFO L85 PathProgramCache]: Analyzing trace with hash -418267899, now seen corresponding path program 1 times [2023-02-15 22:26:00,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:26:00,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257860402] [2023-02-15 22:26:00,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:26:00,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:26:00,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:26:00,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 22:26:00,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:26:01,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:26:01,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:26:01,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257860402] [2023-02-15 22:26:01,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257860402] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:26:01,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:26:01,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 22:26:01,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845194245] [2023-02-15 22:26:01,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:26:01,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 22:26:01,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:26:01,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 22:26:01,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-02-15 22:26:01,086 INFO L87 Difference]: Start difference. First operand 99 states and 108 transitions. Second operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:26:01,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:26:01,332 INFO L93 Difference]: Finished difference Result 102 states and 114 transitions. [2023-02-15 22:26:01,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 22:26:01,333 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2023-02-15 22:26:01,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:26:01,338 INFO L225 Difference]: With dead ends: 102 [2023-02-15 22:26:01,338 INFO L226 Difference]: Without dead ends: 102 [2023-02-15 22:26:01,341 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-02-15 22:26:01,345 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 18 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:26:01,347 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 476 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 22:26:01,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-02-15 22:26:01,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 97. [2023-02-15 22:26:01,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 55 states have (on average 1.8545454545454545) internal successors, (102), 93 states have internal predecessors, (102), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 22:26:01,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 106 transitions. [2023-02-15 22:26:01,367 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 106 transitions. Word has length 14 [2023-02-15 22:26:01,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:26:01,368 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 106 transitions. [2023-02-15 22:26:01,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:26:01,369 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 106 transitions. [2023-02-15 22:26:01,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-15 22:26:01,369 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:26:01,370 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:26:01,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-15 22:26:01,370 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2023-02-15 22:26:01,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:26:01,371 INFO L85 PathProgramCache]: Analyzing trace with hash -418267900, now seen corresponding path program 1 times [2023-02-15 22:26:01,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:26:01,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444257565] [2023-02-15 22:26:01,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:26:01,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:26:01,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:26:01,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 22:26:01,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:26:01,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:26:01,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:26:01,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444257565] [2023-02-15 22:26:01,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444257565] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:26:01,511 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:26:01,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 22:26:01,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828936543] [2023-02-15 22:26:01,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:26:01,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 22:26:01,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:26:01,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 22:26:01,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-15 22:26:01,514 INFO L87 Difference]: Start difference. First operand 97 states and 106 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:26:01,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:26:01,704 INFO L93 Difference]: Finished difference Result 100 states and 112 transitions. [2023-02-15 22:26:01,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 22:26:01,704 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2023-02-15 22:26:01,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:26:01,705 INFO L225 Difference]: With dead ends: 100 [2023-02-15 22:26:01,705 INFO L226 Difference]: Without dead ends: 100 [2023-02-15 22:26:01,706 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-15 22:26:01,706 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 15 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:26:01,707 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 361 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 22:26:01,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-02-15 22:26:01,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 95. [2023-02-15 22:26:01,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 55 states have (on average 1.8181818181818181) internal successors, (100), 91 states have internal predecessors, (100), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 22:26:01,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 104 transitions. [2023-02-15 22:26:01,712 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 104 transitions. Word has length 14 [2023-02-15 22:26:01,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:26:01,712 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 104 transitions. [2023-02-15 22:26:01,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:26:01,713 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 104 transitions. [2023-02-15 22:26:01,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-15 22:26:01,713 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:26:01,714 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:26:01,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-15 22:26:01,714 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2023-02-15 22:26:01,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:26:01,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1186059880, now seen corresponding path program 1 times [2023-02-15 22:26:01,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:26:01,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375531091] [2023-02-15 22:26:01,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:26:01,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:26:01,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:26:01,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-15 22:26:01,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:26:01,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:26:01,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:26:01,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375531091] [2023-02-15 22:26:01,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375531091] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:26:01,775 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:26:01,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 22:26:01,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063320412] [2023-02-15 22:26:01,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:26:01,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 22:26:01,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:26:01,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 22:26:01,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 22:26:01,778 INFO L87 Difference]: Start difference. First operand 95 states and 104 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:26:01,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:26:01,856 INFO L93 Difference]: Finished difference Result 105 states and 116 transitions. [2023-02-15 22:26:01,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 22:26:01,857 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2023-02-15 22:26:01,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:26:01,858 INFO L225 Difference]: With dead ends: 105 [2023-02-15 22:26:01,858 INFO L226 Difference]: Without dead ends: 105 [2023-02-15 22:26:01,858 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 22:26:01,859 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 9 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:26:01,860 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 241 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:26:01,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-02-15 22:26:01,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 96. [2023-02-15 22:26:01,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 56 states have (on average 1.8035714285714286) internal successors, (101), 92 states have internal predecessors, (101), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 22:26:01,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 105 transitions. [2023-02-15 22:26:01,872 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 105 transitions. Word has length 16 [2023-02-15 22:26:01,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:26:01,872 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 105 transitions. [2023-02-15 22:26:01,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:26:01,873 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 105 transitions. [2023-02-15 22:26:01,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-15 22:26:01,874 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:26:01,874 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:26:01,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-15 22:26:01,875 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2023-02-15 22:26:01,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:26:01,875 INFO L85 PathProgramCache]: Analyzing trace with hash -918895952, now seen corresponding path program 1 times [2023-02-15 22:26:01,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:26:01,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059252606] [2023-02-15 22:26:01,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:26:01,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:26:01,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:26:01,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 22:26:01,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:26:01,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:26:01,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:26:01,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059252606] [2023-02-15 22:26:01,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059252606] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:26:01,962 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:26:01,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 22:26:01,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827379269] [2023-02-15 22:26:01,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:26:01,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 22:26:01,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:26:01,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 22:26:01,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 22:26:01,964 INFO L87 Difference]: Start difference. First operand 96 states and 105 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:26:02,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:26:02,045 INFO L93 Difference]: Finished difference Result 102 states and 112 transitions. [2023-02-15 22:26:02,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 22:26:02,046 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2023-02-15 22:26:02,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:26:02,047 INFO L225 Difference]: With dead ends: 102 [2023-02-15 22:26:02,047 INFO L226 Difference]: Without dead ends: 102 [2023-02-15 22:26:02,047 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 22:26:02,048 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 1 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:26:02,054 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 237 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:26:02,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-02-15 22:26:02,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2023-02-15 22:26:02,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 60 states have (on average 1.75) internal successors, (105), 96 states have internal predecessors, (105), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 22:26:02,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 111 transitions. [2023-02-15 22:26:02,072 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 111 transitions. Word has length 17 [2023-02-15 22:26:02,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:26:02,072 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 111 transitions. [2023-02-15 22:26:02,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:26:02,073 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 111 transitions. [2023-02-15 22:26:02,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-15 22:26:02,074 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:26:02,074 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:26:02,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-15 22:26:02,074 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2023-02-15 22:26:02,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:26:02,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1802773707, now seen corresponding path program 1 times [2023-02-15 22:26:02,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:26:02,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927050586] [2023-02-15 22:26:02,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:26:02,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:26:02,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:26:02,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 22:26:02,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:26:02,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-15 22:26:02,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:26:02,182 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-15 22:26:02,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:26:02,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927050586] [2023-02-15 22:26:02,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927050586] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:26:02,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1403651016] [2023-02-15 22:26:02,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:26:02,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:26:02,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:26:02,188 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) [2023-02-15 22:26:02,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-15 22:26:02,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:26:02,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-15 22:26:02,369 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:26:02,420 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:26:02,420 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:26:02,467 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-15 22:26:02,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1403651016] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:26:02,468 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 22:26:02,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2023-02-15 22:26:02,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129095213] [2023-02-15 22:26:02,468 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 22:26:02,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 22:26:02,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:26:02,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 22:26:02,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-02-15 22:26:02,470 INFO L87 Difference]: Start difference. First operand 101 states and 111 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-15 22:26:02,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:26:02,553 INFO L93 Difference]: Finished difference Result 103 states and 113 transitions. [2023-02-15 22:26:02,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 22:26:02,554 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 31 [2023-02-15 22:26:02,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:26:02,554 INFO L225 Difference]: With dead ends: 103 [2023-02-15 22:26:02,555 INFO L226 Difference]: Without dead ends: 103 [2023-02-15 22:26:02,555 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-02-15 22:26:02,556 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 9 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:26:02,556 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 428 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:26:02,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-02-15 22:26:02,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2023-02-15 22:26:02,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 62 states have (on average 1.7258064516129032) internal successors, (107), 98 states have internal predecessors, (107), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 22:26:02,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 113 transitions. [2023-02-15 22:26:02,566 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 113 transitions. Word has length 31 [2023-02-15 22:26:02,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:26:02,567 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 113 transitions. [2023-02-15 22:26:02,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-15 22:26:02,567 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 113 transitions. [2023-02-15 22:26:02,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-02-15 22:26:02,568 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:26:02,570 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-02-15 22:26:02,581 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-15 22:26:02,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:26:02,776 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2023-02-15 22:26:02,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:26:02,777 INFO L85 PathProgramCache]: Analyzing trace with hash 916543363, now seen corresponding path program 1 times [2023-02-15 22:26:02,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:26:02,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848057322] [2023-02-15 22:26:02,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:26:02,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:26:02,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:26:02,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 22:26:02,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:26:03,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 22:26:03,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:26:03,107 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 22:26:03,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:26:03,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848057322] [2023-02-15 22:26:03,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848057322] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:26:03,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [507573823] [2023-02-15 22:26:03,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:26:03,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:26:03,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:26:03,110 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) [2023-02-15 22:26:03,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-15 22:26:03,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:26:03,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-15 22:26:03,245 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:26:03,297 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_509 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_509))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-02-15 22:26:03,444 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 22:26:03,445 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:26:03,454 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:26:03,454 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:26:03,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [507573823] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:26:03,504 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:26:03,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 11 [2023-02-15 22:26:03,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346137450] [2023-02-15 22:26:03,504 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:26:03,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-15 22:26:03,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:26:03,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-15 22:26:03,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=107, Unknown=1, NotChecked=20, Total=156 [2023-02-15 22:26:03,506 INFO L87 Difference]: Start difference. First operand 103 states and 113 transitions. Second operand has 12 states, 11 states have (on average 3.909090909090909) internal successors, (43), 9 states have internal predecessors, (43), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-15 22:26:03,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:26:03,783 INFO L93 Difference]: Finished difference Result 114 states and 125 transitions. [2023-02-15 22:26:03,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 22:26:03,794 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.909090909090909) internal successors, (43), 9 states have internal predecessors, (43), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 32 [2023-02-15 22:26:03,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:26:03,794 INFO L225 Difference]: With dead ends: 114 [2023-02-15 22:26:03,794 INFO L226 Difference]: Without dead ends: 114 [2023-02-15 22:26:03,795 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=191, Unknown=1, NotChecked=28, Total=272 [2023-02-15 22:26:03,795 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 169 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 104 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:26:03,795 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 329 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 376 Invalid, 0 Unknown, 104 Unchecked, 0.2s Time] [2023-02-15 22:26:03,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2023-02-15 22:26:03,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 102. [2023-02-15 22:26:03,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 62 states have (on average 1.7096774193548387) internal successors, (106), 97 states have internal predecessors, (106), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 22:26:03,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 112 transitions. [2023-02-15 22:26:03,798 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 112 transitions. Word has length 32 [2023-02-15 22:26:03,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:26:03,798 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 112 transitions. [2023-02-15 22:26:03,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.909090909090909) internal successors, (43), 9 states have internal predecessors, (43), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-15 22:26:03,799 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 112 transitions. [2023-02-15 22:26:03,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-02-15 22:26:03,799 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:26:03,799 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-02-15 22:26:03,807 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-15 22:26:03,999 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,SelfDestructingSolverStorable7 [2023-02-15 22:26:04,000 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2023-02-15 22:26:04,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:26:04,001 INFO L85 PathProgramCache]: Analyzing trace with hash 916543364, now seen corresponding path program 1 times [2023-02-15 22:26:04,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:26:04,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911791770] [2023-02-15 22:26:04,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:26:04,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:26:04,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:26:04,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 22:26:04,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:26:04,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 22:26:04,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:26:04,454 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 22:26:04,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:26:04,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911791770] [2023-02-15 22:26:04,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911791770] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:26:04,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2127112028] [2023-02-15 22:26:04,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:26:04,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:26:04,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:26:04,457 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) [2023-02-15 22:26:04,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-15 22:26:04,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:26:04,597 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 37 conjunts are in the unsatisfiable core [2023-02-15 22:26:04,599 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:26:04,605 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:26:04,801 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 22:26:04,802 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:26:04,806 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-02-15 22:26:04,836 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:26:04,837 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:26:06,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2127112028] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:26:06,987 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:26:06,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 19 [2023-02-15 22:26:06,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877200496] [2023-02-15 22:26:06,988 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:26:06,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-02-15 22:26:06,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:26:06,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-15 22:26:06,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2023-02-15 22:26:06,989 INFO L87 Difference]: Start difference. First operand 102 states and 112 transitions. Second operand has 20 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 15 states have internal predecessors, (41), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-15 22:26:07,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:26:07,456 INFO L93 Difference]: Finished difference Result 102 states and 112 transitions. [2023-02-15 22:26:07,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-15 22:26:07,456 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 15 states have internal predecessors, (41), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 32 [2023-02-15 22:26:07,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:26:07,457 INFO L225 Difference]: With dead ends: 102 [2023-02-15 22:26:07,457 INFO L226 Difference]: Without dead ends: 102 [2023-02-15 22:26:07,458 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=111, Invalid=645, Unknown=0, NotChecked=0, Total=756 [2023-02-15 22:26:07,458 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 191 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 592 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 22:26:07,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 466 Invalid, 599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 592 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 22:26:07,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-02-15 22:26:07,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2023-02-15 22:26:07,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 62 states have (on average 1.6935483870967742) internal successors, (105), 96 states have internal predecessors, (105), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 22:26:07,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 111 transitions. [2023-02-15 22:26:07,461 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 111 transitions. Word has length 32 [2023-02-15 22:26:07,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:26:07,461 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 111 transitions. [2023-02-15 22:26:07,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 15 states have internal predecessors, (41), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-15 22:26:07,462 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 111 transitions. [2023-02-15 22:26:07,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-15 22:26:07,463 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:26:07,463 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:26:07,473 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-15 22:26:07,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:26:07,671 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2023-02-15 22:26:07,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:26:07,671 INFO L85 PathProgramCache]: Analyzing trace with hash -2135424312, now seen corresponding path program 2 times [2023-02-15 22:26:07,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:26:07,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374948490] [2023-02-15 22:26:07,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:26:07,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:26:07,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:26:07,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 22:26:07,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:26:07,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 22:26:07,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:26:07,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-02-15 22:26:07,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:26:07,850 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-02-15 22:26:07,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:26:07,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374948490] [2023-02-15 22:26:07,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374948490] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:26:07,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2021627513] [2023-02-15 22:26:07,850 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 22:26:07,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:26:07,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:26:07,853 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) [2023-02-15 22:26:07,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-15 22:26:08,025 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 22:26:08,026 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 22:26:08,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-15 22:26:08,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:26:08,083 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 22:26:08,083 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:26:08,157 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-02-15 22:26:08,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2021627513] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:26:08,157 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 22:26:08,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 8 [2023-02-15 22:26:08,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359066636] [2023-02-15 22:26:08,158 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 22:26:08,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 22:26:08,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:26:08,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 22:26:08,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-02-15 22:26:08,159 INFO L87 Difference]: Start difference. First operand 101 states and 111 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-15 22:26:08,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:26:08,300 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2023-02-15 22:26:08,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 22:26:08,300 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 46 [2023-02-15 22:26:08,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:26:08,301 INFO L225 Difference]: With dead ends: 101 [2023-02-15 22:26:08,301 INFO L226 Difference]: Without dead ends: 101 [2023-02-15 22:26:08,302 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 91 SyntacticMatches, 6 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-02-15 22:26:08,302 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 170 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:26:08,303 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 411 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:26:08,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2023-02-15 22:26:08,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2023-02-15 22:26:08,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 62 states have (on average 1.6774193548387097) internal successors, (104), 96 states have internal predecessors, (104), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 22:26:08,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 110 transitions. [2023-02-15 22:26:08,307 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 110 transitions. Word has length 46 [2023-02-15 22:26:08,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:26:08,307 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 110 transitions. [2023-02-15 22:26:08,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-15 22:26:08,308 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 110 transitions. [2023-02-15 22:26:08,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-02-15 22:26:08,310 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:26:08,311 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:26:08,319 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-15 22:26:08,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:26:08,519 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2023-02-15 22:26:08,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:26:08,520 INFO L85 PathProgramCache]: Analyzing trace with hash 568631680, now seen corresponding path program 1 times [2023-02-15 22:26:08,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:26:08,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594428374] [2023-02-15 22:26:08,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:26:08,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:26:08,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:26:08,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 22:26:08,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:26:08,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 22:26:08,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:26:08,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-15 22:26:08,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:26:09,029 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-15 22:26:09,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:26:09,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594428374] [2023-02-15 22:26:09,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594428374] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:26:09,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [120903931] [2023-02-15 22:26:09,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:26:09,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:26:09,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:26:09,033 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) [2023-02-15 22:26:09,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-15 22:26:09,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:26:09,205 INFO L263 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 29 conjunts are in the unsatisfiable core [2023-02-15 22:26:09,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:26:09,212 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:26:09,228 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1167 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| v_ArrVal_1167))) is different from true [2023-02-15 22:26:09,238 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1167 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| v_ArrVal_1167))) is different from true [2023-02-15 22:26:09,253 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 22:26:09,253 INFO L350 Elim1Store]: Elim1 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 18 [2023-02-15 22:26:09,310 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2023-02-15 22:26:09,336 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:26:09,336 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:26:09,390 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:26:09,391 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:26:09,400 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 14 not checked. [2023-02-15 22:26:09,400 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:26:09,786 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-02-15 22:26:09,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [120903931] provided 1 perfect and 1 imperfect interpolant sequences [2023-02-15 22:26:09,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:26:09,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9, 9] total 20 [2023-02-15 22:26:09,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577726654] [2023-02-15 22:26:09,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:26:09,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 22:26:09,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:26:09,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 22:26:09,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=243, Unknown=3, NotChecked=102, Total=420 [2023-02-15 22:26:09,789 INFO L87 Difference]: Start difference. First operand 101 states and 110 transitions. Second operand has 9 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 22:26:09,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:26:09,946 INFO L93 Difference]: Finished difference Result 108 states and 118 transitions. [2023-02-15 22:26:09,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 22:26:09,946 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 47 [2023-02-15 22:26:09,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:26:09,947 INFO L225 Difference]: With dead ends: 108 [2023-02-15 22:26:09,947 INFO L226 Difference]: Without dead ends: 108 [2023-02-15 22:26:09,947 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 77 SyntacticMatches, 11 SemanticMatches, 20 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=271, Unknown=3, NotChecked=108, Total=462 [2023-02-15 22:26:09,948 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 211 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:26:09,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 186 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:26:09,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-02-15 22:26:09,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 96. [2023-02-15 22:26:09,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 62 states have (on average 1.596774193548387) internal successors, (99), 91 states have internal predecessors, (99), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 22:26:09,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 105 transitions. [2023-02-15 22:26:09,951 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 105 transitions. Word has length 47 [2023-02-15 22:26:09,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:26:09,951 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 105 transitions. [2023-02-15 22:26:09,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 22:26:09,951 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 105 transitions. [2023-02-15 22:26:09,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-02-15 22:26:09,952 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:26:09,952 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:26:09,961 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-15 22:26:10,159 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,SelfDestructingSolverStorable10 [2023-02-15 22:26:10,159 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2023-02-15 22:26:10,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:26:10,160 INFO L85 PathProgramCache]: Analyzing trace with hash 568631681, now seen corresponding path program 1 times [2023-02-15 22:26:10,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:26:10,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336004070] [2023-02-15 22:26:10,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:26:10,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:26:10,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:26:10,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 22:26:10,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:26:10,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 22:26:10,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:26:10,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-15 22:26:10,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:26:10,660 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-02-15 22:26:10,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:26:10,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336004070] [2023-02-15 22:26:10,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336004070] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:26:10,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1213549018] [2023-02-15 22:26:10,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:26:10,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:26:10,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:26:10,665 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) [2023-02-15 22:26:10,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-15 22:26:10,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:26:10,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 26 conjunts are in the unsatisfiable core [2023-02-15 22:26:10,857 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:26:10,865 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:26:10,902 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:26:10,917 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_1420 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1420))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2023-02-15 22:26:10,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:26:10,956 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 22:26:10,990 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:26:10,997 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_1421 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1421))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2023-02-15 22:26:11,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:26:11,031 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 22:26:11,102 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:26:11,108 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_1422 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1422))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2023-02-15 22:26:11,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:26:11,142 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 22:26:11,159 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 21 not checked. [2023-02-15 22:26:11,159 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:26:11,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1213549018] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:26:11,241 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:26:11,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2023-02-15 22:26:11,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680165276] [2023-02-15 22:26:11,241 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:26:11,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-15 22:26:11,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:26:11,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-15 22:26:11,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=167, Unknown=3, NotChecked=84, Total=306 [2023-02-15 22:26:11,242 INFO L87 Difference]: Start difference. First operand 96 states and 105 transitions. Second operand has 16 states, 13 states have (on average 4.461538461538462) internal successors, (58), 14 states have internal predecessors, (58), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-15 22:26:11,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:26:11,546 INFO L93 Difference]: Finished difference Result 103 states and 113 transitions. [2023-02-15 22:26:11,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 22:26:11,546 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 4.461538461538462) internal successors, (58), 14 states have internal predecessors, (58), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 47 [2023-02-15 22:26:11,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:26:11,547 INFO L225 Difference]: With dead ends: 103 [2023-02-15 22:26:11,547 INFO L226 Difference]: Without dead ends: 103 [2023-02-15 22:26:11,547 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=207, Unknown=3, NotChecked=96, Total=380 [2023-02-15 22:26:11,548 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 242 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 303 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:26:11,548 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 207 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 308 Invalid, 0 Unknown, 303 Unchecked, 0.2s Time] [2023-02-15 22:26:11,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-02-15 22:26:11,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 91. [2023-02-15 22:26:11,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 62 states have (on average 1.5161290322580645) internal successors, (94), 86 states have internal predecessors, (94), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 22:26:11,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 100 transitions. [2023-02-15 22:26:11,551 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 100 transitions. Word has length 47 [2023-02-15 22:26:11,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:26:11,551 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 100 transitions. [2023-02-15 22:26:11,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 4.461538461538462) internal successors, (58), 14 states have internal predecessors, (58), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-15 22:26:11,551 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 100 transitions. [2023-02-15 22:26:11,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-15 22:26:11,552 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:26:11,552 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:26:11,562 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-15 22:26:11,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:26:11,760 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2023-02-15 22:26:11,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:26:11,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1941985862, now seen corresponding path program 1 times [2023-02-15 22:26:11,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:26:11,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067511524] [2023-02-15 22:26:11,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:26:11,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:26:11,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:26:12,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 22:26:12,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:26:12,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 22:26:12,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:26:12,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-15 22:26:12,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:26:12,435 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-15 22:26:12,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:26:12,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067511524] [2023-02-15 22:26:12,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067511524] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:26:12,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [309896485] [2023-02-15 22:26:12,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:26:12,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:26:12,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:26:12,437 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) [2023-02-15 22:26:12,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-15 22:26:12,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:26:12,633 INFO L263 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 44 conjunts are in the unsatisfiable core [2023-02-15 22:26:12,638 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:26:12,680 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:26:12,844 INFO L350 Elim1Store]: Elim1 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 9 treesize of output 5 [2023-02-15 22:26:12,968 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1)) (exists ((v_ArrVal_1674 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1674))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2023-02-15 22:26:12,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:26:12,993 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-15 22:26:13,003 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2023-02-15 22:26:13,003 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 18 [2023-02-15 22:26:13,068 INFO L350 Elim1Store]: Elim1 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 17 treesize of output 9 [2023-02-15 22:26:13,081 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 3 not checked. [2023-02-15 22:26:13,081 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:26:13,134 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1680 (Array Int Int)) (|v_node_create_~temp~0#1.base_53| Int)) (or (= (select (store |c_#valid| |v_node_create_~temp~0#1.base_53| 1) (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_53| v_ArrVal_1680) |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) 1) (not (< |v_node_create_~temp~0#1.base_53| |c_#StackHeapBarrier|)))) is different from false [2023-02-15 22:26:13,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [309896485] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:26:13,136 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:26:13,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 27 [2023-02-15 22:26:13,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66331556] [2023-02-15 22:26:13,136 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:26:13,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-02-15 22:26:13,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:26:13,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-02-15 22:26:13,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=623, Unknown=3, NotChecked=102, Total=812 [2023-02-15 22:26:13,138 INFO L87 Difference]: Start difference. First operand 91 states and 100 transitions. Second operand has 28 states, 25 states have (on average 2.92) internal successors, (73), 24 states have internal predecessors, (73), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 22:26:14,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:26:14,055 INFO L93 Difference]: Finished difference Result 143 states and 158 transitions. [2023-02-15 22:26:14,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-15 22:26:14,056 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 25 states have (on average 2.92) internal successors, (73), 24 states have internal predecessors, (73), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 51 [2023-02-15 22:26:14,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:26:14,057 INFO L225 Difference]: With dead ends: 143 [2023-02-15 22:26:14,057 INFO L226 Difference]: Without dead ends: 143 [2023-02-15 22:26:14,057 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 49 SyntacticMatches, 4 SemanticMatches, 38 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=219, Invalid=1190, Unknown=5, NotChecked=146, Total=1560 [2023-02-15 22:26:14,058 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 483 mSDsluCounter, 703 mSDsCounter, 0 mSdLazyCounter, 982 mSolverCounterSat, 13 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 483 SdHoareTripleChecker+Valid, 773 SdHoareTripleChecker+Invalid, 1139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 982 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 141 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-15 22:26:14,058 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [483 Valid, 773 Invalid, 1139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 982 Invalid, 3 Unknown, 141 Unchecked, 0.6s Time] [2023-02-15 22:26:14,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2023-02-15 22:26:14,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 90. [2023-02-15 22:26:14,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 63 states have (on average 1.492063492063492) internal successors, (94), 85 states have internal predecessors, (94), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 22:26:14,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 100 transitions. [2023-02-15 22:26:14,061 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 100 transitions. Word has length 51 [2023-02-15 22:26:14,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:26:14,061 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 100 transitions. [2023-02-15 22:26:14,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 25 states have (on average 2.92) internal successors, (73), 24 states have internal predecessors, (73), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 22:26:14,061 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 100 transitions. [2023-02-15 22:26:14,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-15 22:26:14,062 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:26:14,062 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:26:14,070 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-02-15 22:26:14,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:26:14,263 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2023-02-15 22:26:14,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:26:14,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1941985863, now seen corresponding path program 1 times [2023-02-15 22:26:14,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:26:14,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913474886] [2023-02-15 22:26:14,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:26:14,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:26:14,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:26:14,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 22:26:14,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:26:14,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 22:26:14,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:26:14,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-15 22:26:14,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:26:15,468 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 22:26:15,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:26:15,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913474886] [2023-02-15 22:26:15,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913474886] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:26:15,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [862248193] [2023-02-15 22:26:15,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:26:15,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:26:15,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:26:15,477 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) [2023-02-15 22:26:15,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-15 22:26:15,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:26:15,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 68 conjunts are in the unsatisfiable core [2023-02-15 22:26:15,683 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:26:15,766 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:26:15,771 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:26:16,167 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-02-15 22:26:16,170 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:26:16,338 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1933 (Array Int Int)) (v_ArrVal_1932 (Array Int Int)) (|node_create_~temp~0#1.base| Int)) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1932)) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_1933)) (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (select |c_old(#valid)| |node_create_~temp~0#1.base|) 0) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|))) is different from true [2023-02-15 22:26:16,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:26:16,378 INFO L350 Elim1Store]: Elim1 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 25 treesize of output 25 [2023-02-15 22:26:16,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:26:16,384 INFO L350 Elim1Store]: Elim1 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 21 [2023-02-15 22:26:16,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:26:16,389 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-02-15 22:26:16,395 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-15 22:26:16,396 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-02-15 22:26:16,459 INFO L350 Elim1Store]: Elim1 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 22 treesize of output 10 [2023-02-15 22:26:16,462 INFO L350 Elim1Store]: Elim1 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 17 treesize of output 9 [2023-02-15 22:26:16,477 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 23 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 3 not checked. [2023-02-15 22:26:16,477 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:26:16,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [862248193] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:26:16,729 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:26:16,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 29 [2023-02-15 22:26:16,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59557395] [2023-02-15 22:26:16,729 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:26:16,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-02-15 22:26:16,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:26:16,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-02-15 22:26:16,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=953, Unknown=1, NotChecked=62, Total=1122 [2023-02-15 22:26:16,731 INFO L87 Difference]: Start difference. First operand 90 states and 100 transitions. Second operand has 30 states, 27 states have (on average 2.814814814814815) internal successors, (76), 26 states have internal predecessors, (76), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 22:26:17,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:26:17,958 INFO L93 Difference]: Finished difference Result 139 states and 153 transitions. [2023-02-15 22:26:17,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-15 22:26:17,959 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 27 states have (on average 2.814814814814815) internal successors, (76), 26 states have internal predecessors, (76), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 51 [2023-02-15 22:26:17,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:26:17,959 INFO L225 Difference]: With dead ends: 139 [2023-02-15 22:26:17,960 INFO L226 Difference]: Without dead ends: 139 [2023-02-15 22:26:17,960 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 43 SyntacticMatches, 5 SemanticMatches, 43 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 473 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=214, Invalid=1681, Unknown=1, NotChecked=84, Total=1980 [2023-02-15 22:26:17,960 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 276 mSDsluCounter, 1030 mSDsCounter, 0 mSdLazyCounter, 1500 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 1119 SdHoareTripleChecker+Invalid, 1654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 145 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-02-15 22:26:17,961 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 1119 Invalid, 1654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1500 Invalid, 0 Unknown, 145 Unchecked, 0.9s Time] [2023-02-15 22:26:17,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2023-02-15 22:26:17,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 93. [2023-02-15 22:26:17,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 66 states have (on average 1.4696969696969697) internal successors, (97), 88 states have internal predecessors, (97), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 22:26:17,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 103 transitions. [2023-02-15 22:26:17,963 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 103 transitions. Word has length 51 [2023-02-15 22:26:17,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:26:17,963 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 103 transitions. [2023-02-15 22:26:17,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 27 states have (on average 2.814814814814815) internal successors, (76), 26 states have internal predecessors, (76), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 22:26:17,964 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 103 transitions. [2023-02-15 22:26:17,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-02-15 22:26:17,964 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:26:17,964 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2023-02-15 22:26:17,976 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-02-15 22:26:18,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-02-15 22:26:18,174 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2023-02-15 22:26:18,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:26:18,175 INFO L85 PathProgramCache]: Analyzing trace with hash 2085671715, now seen corresponding path program 1 times [2023-02-15 22:26:18,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:26:18,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72276077] [2023-02-15 22:26:18,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:26:18,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:26:18,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:26:18,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 22:26:18,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:26:18,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 22:26:18,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:26:18,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-15 22:26:18,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:26:18,462 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-02-15 22:26:18,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:26:18,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72276077] [2023-02-15 22:26:18,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72276077] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:26:18,463 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:26:18,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-15 22:26:18,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718779424] [2023-02-15 22:26:18,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:26:18,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-15 22:26:18,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:26:18,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 22:26:18,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2023-02-15 22:26:18,465 INFO L87 Difference]: Start difference. First operand 93 states and 103 transitions. Second operand has 11 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 22:26:18,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:26:18,740 INFO L93 Difference]: Finished difference Result 141 states and 157 transitions. [2023-02-15 22:26:18,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-15 22:26:18,741 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 53 [2023-02-15 22:26:18,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:26:18,741 INFO L225 Difference]: With dead ends: 141 [2023-02-15 22:26:18,741 INFO L226 Difference]: Without dead ends: 141 [2023-02-15 22:26:18,742 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2023-02-15 22:26:18,742 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 222 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:26:18,742 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 356 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 22:26:18,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2023-02-15 22:26:18,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 94. [2023-02-15 22:26:18,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 71 states have (on average 1.408450704225352) internal successors, (100), 89 states have internal predecessors, (100), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 22:26:18,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 106 transitions. [2023-02-15 22:26:18,745 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 106 transitions. Word has length 53 [2023-02-15 22:26:18,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:26:18,745 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 106 transitions. [2023-02-15 22:26:18,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 22:26:18,746 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 106 transitions. [2023-02-15 22:26:18,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-02-15 22:26:18,746 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:26:18,746 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2023-02-15 22:26:18,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-02-15 22:26:18,747 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2023-02-15 22:26:18,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:26:18,747 INFO L85 PathProgramCache]: Analyzing trace with hash 2085671716, now seen corresponding path program 1 times [2023-02-15 22:26:18,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:26:18,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467996068] [2023-02-15 22:26:18,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:26:18,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:26:18,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:26:19,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 22:26:19,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:26:19,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 22:26:19,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:26:19,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-15 22:26:19,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:26:19,234 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-02-15 22:26:19,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:26:19,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467996068] [2023-02-15 22:26:19,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467996068] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:26:19,235 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:26:19,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-02-15 22:26:19,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259213539] [2023-02-15 22:26:19,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:26:19,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-15 22:26:19,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:26:19,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-15 22:26:19,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2023-02-15 22:26:19,237 INFO L87 Difference]: Start difference. First operand 94 states and 106 transitions. Second operand has 12 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 22:26:19,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:26:19,543 INFO L93 Difference]: Finished difference Result 151 states and 170 transitions. [2023-02-15 22:26:19,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-15 22:26:19,544 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 53 [2023-02-15 22:26:19,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:26:19,545 INFO L225 Difference]: With dead ends: 151 [2023-02-15 22:26:19,545 INFO L226 Difference]: Without dead ends: 151 [2023-02-15 22:26:19,545 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2023-02-15 22:26:19,546 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 193 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:26:19,546 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 438 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 22:26:19,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2023-02-15 22:26:19,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 100. [2023-02-15 22:26:19,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 78 states have (on average 1.3846153846153846) internal successors, (108), 95 states have internal predecessors, (108), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 22:26:19,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 114 transitions. [2023-02-15 22:26:19,549 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 114 transitions. Word has length 53 [2023-02-15 22:26:19,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:26:19,549 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 114 transitions. [2023-02-15 22:26:19,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 22:26:19,550 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 114 transitions. [2023-02-15 22:26:19,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-02-15 22:26:19,552 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:26:19,552 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2023-02-15 22:26:19,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-02-15 22:26:19,553 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2023-02-15 22:26:19,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:26:19,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1947352068, now seen corresponding path program 1 times [2023-02-15 22:26:19,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:26:19,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440611205] [2023-02-15 22:26:19,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:26:19,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:26:19,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:26:20,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 22:26:20,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:26:20,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 22:26:20,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:26:20,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-15 22:26:20,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:26:21,232 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 18 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 22:26:21,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:26:21,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440611205] [2023-02-15 22:26:21,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440611205] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:26:21,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [899290504] [2023-02-15 22:26:21,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:26:21,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:26:21,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:26:21,235 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) [2023-02-15 22:26:21,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-15 22:26:21,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:26:21,468 INFO L263 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 88 conjunts are in the unsatisfiable core [2023-02-15 22:26:21,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:26:21,757 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 22:26:21,758 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:26:21,877 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 22:26:21,953 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:26:21,953 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2023-02-15 22:26:22,185 INFO L321 Elim1Store]: treesize reduction 3, result has 83.3 percent of original size [2023-02-15 22:26:22,185 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 33 [2023-02-15 22:26:22,191 INFO L350 Elim1Store]: Elim1 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 11 [2023-02-15 22:26:22,197 INFO L350 Elim1Store]: Elim1 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 11 treesize of output 7 [2023-02-15 22:26:22,388 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2517 (Array Int Int)) (v_ArrVal_2516 (Array Int Int)) (|node_create_~temp~0#1.base| Int)) (and (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_2517)) (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (select |c_old(#valid)| |node_create_~temp~0#1.base|) 0) (= (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|)) |c_#valid|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_2516)))) is different from true [2023-02-15 22:26:22,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:26:22,441 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 22:26:22,442 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 55 [2023-02-15 22:26:22,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:26:22,449 INFO L350 Elim1Store]: Elim1 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 48 treesize of output 48 [2023-02-15 22:26:22,480 INFO L321 Elim1Store]: treesize reduction 94, result has 36.9 percent of original size [2023-02-15 22:26:22,480 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 64 [2023-02-15 22:26:22,559 INFO L350 Elim1Store]: Elim1 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 49 treesize of output 37 [2023-02-15 22:26:22,708 INFO L321 Elim1Store]: treesize reduction 3, result has 78.6 percent of original size [2023-02-15 22:26:22,708 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 32 [2023-02-15 22:26:22,796 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-02-15 22:26:22,796 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:26:23,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [899290504] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:26:23,050 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:26:23,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 23] total 46 [2023-02-15 22:26:23,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371433438] [2023-02-15 22:26:23,050 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:26:23,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2023-02-15 22:26:23,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:26:23,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2023-02-15 22:26:23,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=2272, Unknown=1, NotChecked=96, Total=2550 [2023-02-15 22:26:23,052 INFO L87 Difference]: Start difference. First operand 100 states and 114 transitions. Second operand has 47 states, 44 states have (on average 2.1136363636363638) internal successors, (93), 41 states have internal predecessors, (93), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 22:26:25,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:26:25,998 INFO L93 Difference]: Finished difference Result 152 states and 172 transitions. [2023-02-15 22:26:25,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-02-15 22:26:25,999 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 44 states have (on average 2.1136363636363638) internal successors, (93), 41 states have internal predecessors, (93), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 55 [2023-02-15 22:26:25,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:26:26,001 INFO L225 Difference]: With dead ends: 152 [2023-02-15 22:26:26,001 INFO L226 Difference]: Without dead ends: 152 [2023-02-15 22:26:26,002 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 43 SyntacticMatches, 5 SemanticMatches, 68 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1189 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=503, Invalid=4192, Unknown=1, NotChecked=134, Total=4830 [2023-02-15 22:26:26,003 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 863 mSDsluCounter, 1712 mSDsCounter, 0 mSdLazyCounter, 2164 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 863 SdHoareTripleChecker+Valid, 1781 SdHoareTripleChecker+Invalid, 2361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 2164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 159 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-02-15 22:26:26,004 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [863 Valid, 1781 Invalid, 2361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 2164 Invalid, 0 Unknown, 159 Unchecked, 1.5s Time] [2023-02-15 22:26:26,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2023-02-15 22:26:26,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 102. [2023-02-15 22:26:26,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 80 states have (on average 1.3875) internal successors, (111), 97 states have internal predecessors, (111), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 22:26:26,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 117 transitions. [2023-02-15 22:26:26,009 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 117 transitions. Word has length 55 [2023-02-15 22:26:26,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:26:26,009 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 117 transitions. [2023-02-15 22:26:26,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 44 states have (on average 2.1136363636363638) internal successors, (93), 41 states have internal predecessors, (93), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 22:26:26,010 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 117 transitions. [2023-02-15 22:26:26,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-02-15 22:26:26,010 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:26:26,010 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2023-02-15 22:26:26,021 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-02-15 22:26:26,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-02-15 22:26:26,219 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2023-02-15 22:26:26,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:26:26,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1947352067, now seen corresponding path program 1 times [2023-02-15 22:26:26,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:26:26,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496297363] [2023-02-15 22:26:26,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:26:26,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:26:26,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:26:27,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 22:26:27,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:26:27,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 22:26:27,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:26:27,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-15 22:26:27,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:26:28,608 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 28 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 22:26:28,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:26:28,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496297363] [2023-02-15 22:26:28,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496297363] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:26:28,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1148679432] [2023-02-15 22:26:28,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:26:28,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:26:28,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:26:28,617 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) [2023-02-15 22:26:28,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-02-15 22:26:28,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:26:28,842 INFO L263 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 112 conjunts are in the unsatisfiable core [2023-02-15 22:26:28,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:26:29,242 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 22:26:29,242 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:26:29,354 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 22:26:29,365 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 22:26:29,460 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:26:29,460 INFO L350 Elim1Store]: Elim1 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 65 treesize of output 62 [2023-02-15 22:26:29,465 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 41 [2023-02-15 22:26:29,750 INFO L321 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2023-02-15 22:26:29,751 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 103 treesize of output 48 [2023-02-15 22:26:29,768 INFO L321 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2023-02-15 22:26:29,768 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 25 [2023-02-15 22:26:29,773 INFO L350 Elim1Store]: Elim1 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 11 treesize of output 7 [2023-02-15 22:26:29,777 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2023-02-15 22:26:29,972 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_2788 (Array Int Int)) (v_ArrVal_2787 (Array Int Int))) (and (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_2788)) (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (select |c_old(#valid)| |node_create_~temp~0#1.base|) 0) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_2787)))) is different from true [2023-02-15 22:26:30,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:26:30,034 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 22:26:30,035 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 109 treesize of output 97 [2023-02-15 22:26:30,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:26:30,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:26:30,044 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-15 22:26:30,045 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 91 [2023-02-15 22:26:30,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:26:30,053 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 39 [2023-02-15 22:26:30,072 INFO L321 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2023-02-15 22:26:30,072 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 36 [2023-02-15 22:26:30,391 INFO L321 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2023-02-15 22:26:30,391 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 54 [2023-02-15 22:26:30,405 INFO L321 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2023-02-15 22:26:30,405 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 28 [2023-02-15 22:26:30,414 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 11 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2023-02-15 22:26:30,414 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:26:30,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1148679432] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:26:30,899 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:26:30,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27] total 50 [2023-02-15 22:26:30,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232978651] [2023-02-15 22:26:30,899 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:26:30,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2023-02-15 22:26:30,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:26:30,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2023-02-15 22:26:30,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=2904, Unknown=1, NotChecked=108, Total=3192 [2023-02-15 22:26:30,901 INFO L87 Difference]: Start difference. First operand 102 states and 117 transitions. Second operand has 51 states, 48 states have (on average 1.9166666666666667) internal successors, (92), 44 states have internal predecessors, (92), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 22:26:35,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:26:35,693 INFO L93 Difference]: Finished difference Result 208 states and 235 transitions. [2023-02-15 22:26:35,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-02-15 22:26:35,694 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 48 states have (on average 1.9166666666666667) internal successors, (92), 44 states have internal predecessors, (92), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 55 [2023-02-15 22:26:35,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:26:35,695 INFO L225 Difference]: With dead ends: 208 [2023-02-15 22:26:35,695 INFO L226 Difference]: Without dead ends: 208 [2023-02-15 22:26:35,696 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 38 SyntacticMatches, 5 SemanticMatches, 77 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1275 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=577, Invalid=5432, Unknown=1, NotChecked=152, Total=6162 [2023-02-15 22:26:35,697 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 1100 mSDsluCounter, 1845 mSDsCounter, 0 mSdLazyCounter, 3295 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1100 SdHoareTripleChecker+Valid, 1905 SdHoareTripleChecker+Invalid, 3508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 3295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 165 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:26:35,697 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1100 Valid, 1905 Invalid, 3508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 3295 Invalid, 0 Unknown, 165 Unchecked, 2.1s Time] [2023-02-15 22:26:35,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2023-02-15 22:26:35,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 104. [2023-02-15 22:26:35,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 82 states have (on average 1.3780487804878048) internal successors, (113), 99 states have internal predecessors, (113), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 22:26:35,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 119 transitions. [2023-02-15 22:26:35,701 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 119 transitions. Word has length 55 [2023-02-15 22:26:35,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:26:35,702 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 119 transitions. [2023-02-15 22:26:35,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 48 states have (on average 1.9166666666666667) internal successors, (92), 44 states have internal predecessors, (92), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 22:26:35,702 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 119 transitions. [2023-02-15 22:26:35,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-02-15 22:26:35,703 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:26:35,703 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2023-02-15 22:26:35,713 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-02-15 22:26:35,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-02-15 22:26:35,910 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2023-02-15 22:26:35,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:26:35,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1045714181, now seen corresponding path program 1 times [2023-02-15 22:26:35,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:26:35,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501801349] [2023-02-15 22:26:35,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:26:35,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:26:35,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:26:36,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 22:26:36,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:26:36,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 22:26:36,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:26:36,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-15 22:26:36,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:26:36,413 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 22:26:36,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:26:36,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501801349] [2023-02-15 22:26:36,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501801349] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:26:36,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1956946030] [2023-02-15 22:26:36,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:26:36,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:26:36,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:26:36,416 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:26:36,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-02-15 22:26:36,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:26:36,692 INFO L263 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 34 conjunts are in the unsatisfiable core [2023-02-15 22:26:36,716 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:26:36,975 INFO L350 Elim1Store]: Elim1 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 17 treesize of output 9 [2023-02-15 22:26:37,039 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_3060 (Array Int Int))) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_3060)))) is different from true [2023-02-15 22:26:37,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:26:37,060 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:26:37,093 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:26:37,113 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 23 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 3 not checked. [2023-02-15 22:26:37,114 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:26:37,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1956946030] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:26:37,232 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:26:37,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 26 [2023-02-15 22:26:37,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164425364] [2023-02-15 22:26:37,232 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:26:37,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-02-15 22:26:37,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:26:37,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-02-15 22:26:37,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=617, Unknown=2, NotChecked=50, Total=756 [2023-02-15 22:26:37,234 INFO L87 Difference]: Start difference. First operand 104 states and 119 transitions. Second operand has 26 states, 24 states have (on average 3.0833333333333335) internal successors, (74), 22 states have internal predecessors, (74), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 22:26:37,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:26:37,772 INFO L93 Difference]: Finished difference Result 92 states and 103 transitions. [2023-02-15 22:26:37,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-15 22:26:37,773 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 3.0833333333333335) internal successors, (74), 22 states have internal predecessors, (74), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 56 [2023-02-15 22:26:37,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:26:37,774 INFO L225 Difference]: With dead ends: 92 [2023-02-15 22:26:37,774 INFO L226 Difference]: Without dead ends: 92 [2023-02-15 22:26:37,774 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 56 SyntacticMatches, 7 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=176, Invalid=1016, Unknown=2, NotChecked=66, Total=1260 [2023-02-15 22:26:37,774 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 412 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 87 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 22:26:37,775 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 565 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 435 Invalid, 0 Unknown, 87 Unchecked, 0.3s Time] [2023-02-15 22:26:37,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2023-02-15 22:26:37,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2023-02-15 22:26:37,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 70 states have (on average 1.3857142857142857) internal successors, (97), 87 states have internal predecessors, (97), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 22:26:37,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 103 transitions. [2023-02-15 22:26:37,778 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 103 transitions. Word has length 56 [2023-02-15 22:26:37,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:26:37,778 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 103 transitions. [2023-02-15 22:26:37,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 3.0833333333333335) internal successors, (74), 22 states have internal predecessors, (74), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 22:26:37,778 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 103 transitions. [2023-02-15 22:26:37,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-02-15 22:26:37,779 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:26:37,779 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2023-02-15 22:26:37,786 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-02-15 22:26:37,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:26:37,989 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2023-02-15 22:26:37,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:26:37,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1285343071, now seen corresponding path program 1 times [2023-02-15 22:26:37,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:26:37,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117694552] [2023-02-15 22:26:37,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:26:37,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:26:38,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:26:38,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 22:26:38,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:26:38,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 22:26:38,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:26:38,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-15 22:26:38,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:26:38,751 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 22:26:38,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:26:38,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117694552] [2023-02-15 22:26:38,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117694552] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:26:38,751 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:26:38,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2023-02-15 22:26:38,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406879280] [2023-02-15 22:26:38,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:26:38,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-02-15 22:26:38,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:26:38,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-02-15 22:26:38,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=450, Unknown=0, NotChecked=0, Total=506 [2023-02-15 22:26:38,753 INFO L87 Difference]: Start difference. First operand 92 states and 103 transitions. Second operand has 23 states, 21 states have (on average 2.4285714285714284) internal successors, (51), 20 states have internal predecessors, (51), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 22:26:39,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:26:39,706 INFO L93 Difference]: Finished difference Result 157 states and 174 transitions. [2023-02-15 22:26:39,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-02-15 22:26:39,706 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 2.4285714285714284) internal successors, (51), 20 states have internal predecessors, (51), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 58 [2023-02-15 22:26:39,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:26:39,707 INFO L225 Difference]: With dead ends: 157 [2023-02-15 22:26:39,707 INFO L226 Difference]: Without dead ends: 157 [2023-02-15 22:26:39,708 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=229, Invalid=1177, Unknown=0, NotChecked=0, Total=1406 [2023-02-15 22:26:39,708 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 799 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 869 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 800 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 869 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-15 22:26:39,708 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [800 Valid, 517 Invalid, 889 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 869 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-15 22:26:39,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2023-02-15 22:26:39,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 98. [2023-02-15 22:26:39,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 76 states have (on average 1.368421052631579) internal successors, (104), 93 states have internal predecessors, (104), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 22:26:39,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 110 transitions. [2023-02-15 22:26:39,711 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 110 transitions. Word has length 58 [2023-02-15 22:26:39,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:26:39,712 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 110 transitions. [2023-02-15 22:26:39,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 2.4285714285714284) internal successors, (51), 20 states have internal predecessors, (51), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 22:26:39,712 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 110 transitions. [2023-02-15 22:26:39,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-02-15 22:26:39,713 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:26:39,713 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2023-02-15 22:26:39,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-02-15 22:26:39,713 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2023-02-15 22:26:39,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:26:39,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1285343072, now seen corresponding path program 1 times [2023-02-15 22:26:39,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:26:39,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677182482] [2023-02-15 22:26:39,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:26:39,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:26:39,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:26:40,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 22:26:40,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:26:40,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 22:26:40,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:26:40,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-15 22:26:40,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:26:40,917 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 22:26:40,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:26:40,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677182482] [2023-02-15 22:26:40,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677182482] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:26:40,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1072307368] [2023-02-15 22:26:40,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:26:40,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:26:40,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:26:40,921 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:26:40,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-02-15 22:26:41,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:26:41,219 INFO L263 TraceCheckSpWp]: Trace formula consists of 517 conjuncts, 70 conjunts are in the unsatisfiable core [2023-02-15 22:26:41,222 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:26:41,555 INFO L350 Elim1Store]: Elim1 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 9 treesize of output 5 [2023-02-15 22:26:41,558 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2023-02-15 22:26:41,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:26:41,824 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-02-15 22:26:41,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:26:41,831 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-02-15 22:26:42,127 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:26:42,127 INFO L350 Elim1Store]: Elim1 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 45 treesize of output 44 [2023-02-15 22:26:42,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:26:42,133 INFO L350 Elim1Store]: Elim1 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 33 treesize of output 33 [2023-02-15 22:26:42,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:26:42,191 INFO L350 Elim1Store]: Elim1 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 31 [2023-02-15 22:26:42,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:26:42,195 INFO L350 Elim1Store]: Elim1 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 29 treesize of output 29 [2023-02-15 22:26:42,248 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:26:42,251 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:26:42,259 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 22:26:42,259 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:26:42,371 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3507 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_3507) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (forall ((v_ArrVal_3506 (Array Int Int)) (v_ArrVal_3507 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_3507) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_3506) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2023-02-15 22:26:42,507 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:26:42,507 INFO L350 Elim1Store]: Elim1 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 52 treesize of output 56 [2023-02-15 22:26:42,546 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3504 (Array Int Int)) (v_ArrVal_3507 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_3504) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_3507) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 1))) (forall ((v_ArrVal_3505 (Array Int Int)) (v_ArrVal_3506 (Array Int Int))) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_3505) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_3506) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (forall ((v_prenex_8 (Array Int Int)) (v_prenex_7 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_prenex_7) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_prenex_8) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) is different from false [2023-02-15 22:26:42,690 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (and (forall ((v_prenex_8 (Array Int Int)) (v_prenex_7 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_prenex_7) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_prenex_8) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (forall ((v_ArrVal_3504 (Array Int Int)) (v_ArrVal_3507 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_3504) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_3507) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 1))) (forall ((v_ArrVal_3505 (Array Int Int)) (v_ArrVal_3506 (Array Int Int))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3505) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_3506) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2023-02-15 22:26:42,723 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (and (forall ((|v_ULTIMATE.start_dll_append_~new_last~0#1.base_20| Int)) (or (not (<= |v_ULTIMATE.start_dll_append_~new_last~0#1.base_20| |c_ULTIMATE.start_dll_append_#t~ret7#1.base|)) (forall ((v_ArrVal_3505 (Array Int Int)) (v_ArrVal_3506 (Array Int Int))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3505) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_20| v_ArrVal_3506) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (forall ((|v_ULTIMATE.start_dll_append_~new_last~0#1.base_20| Int)) (or (not (<= |v_ULTIMATE.start_dll_append_~new_last~0#1.base_20| |c_ULTIMATE.start_dll_append_#t~ret7#1.base|)) (forall ((v_ArrVal_3504 (Array Int Int)) (v_ArrVal_3507 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_3504) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_20| v_ArrVal_3507) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 1))))) (forall ((|v_ULTIMATE.start_dll_append_~new_last~0#1.base_20| Int)) (or (not (<= |v_ULTIMATE.start_dll_append_~new_last~0#1.base_20| |c_ULTIMATE.start_dll_append_#t~ret7#1.base|)) (forall ((v_prenex_8 (Array Int Int)) (v_prenex_7 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_prenex_7) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_20| v_prenex_8) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))))) is different from false [2023-02-15 22:26:43,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1072307368] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:26:43,673 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:26:43,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 37 [2023-02-15 22:26:43,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930102811] [2023-02-15 22:26:43,674 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:26:43,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-02-15 22:26:43,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:26:43,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-02-15 22:26:43,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1722, Unknown=42, NotChecked=348, Total=2256 [2023-02-15 22:26:43,675 INFO L87 Difference]: Start difference. First operand 98 states and 110 transitions. Second operand has 38 states, 35 states have (on average 2.3714285714285714) internal successors, (83), 32 states have internal predecessors, (83), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 22:26:45,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:26:45,520 INFO L93 Difference]: Finished difference Result 156 states and 175 transitions. [2023-02-15 22:26:45,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-02-15 22:26:45,520 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 35 states have (on average 2.3714285714285714) internal successors, (83), 32 states have internal predecessors, (83), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 58 [2023-02-15 22:26:45,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:26:45,521 INFO L225 Difference]: With dead ends: 156 [2023-02-15 22:26:45,521 INFO L226 Difference]: Without dead ends: 156 [2023-02-15 22:26:45,522 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 47 SyntacticMatches, 5 SemanticMatches, 64 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 764 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=456, Invalid=3299, Unknown=43, NotChecked=492, Total=4290 [2023-02-15 22:26:45,523 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 1098 mSDsluCounter, 962 mSDsCounter, 0 mSdLazyCounter, 1349 mSolverCounterSat, 29 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1098 SdHoareTripleChecker+Valid, 1006 SdHoareTripleChecker+Invalid, 1383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1349 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-02-15 22:26:45,523 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1098 Valid, 1006 Invalid, 1383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1349 Invalid, 5 Unknown, 0 Unchecked, 0.9s Time] [2023-02-15 22:26:45,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2023-02-15 22:26:45,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 105. [2023-02-15 22:26:45,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 83 states have (on average 1.3614457831325302) internal successors, (113), 100 states have internal predecessors, (113), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 22:26:45,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 119 transitions. [2023-02-15 22:26:45,527 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 119 transitions. Word has length 58 [2023-02-15 22:26:45,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:26:45,528 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 119 transitions. [2023-02-15 22:26:45,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 35 states have (on average 2.3714285714285714) internal successors, (83), 32 states have internal predecessors, (83), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 22:26:45,528 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 119 transitions. [2023-02-15 22:26:45,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-02-15 22:26:45,529 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:26:45,529 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 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] [2023-02-15 22:26:45,539 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-02-15 22:26:45,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2023-02-15 22:26:45,739 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2023-02-15 22:26:45,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:26:45,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1757191502, now seen corresponding path program 2 times [2023-02-15 22:26:45,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:26:45,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379229079] [2023-02-15 22:26:45,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:26:45,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:26:45,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:26:47,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 22:26:47,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:26:47,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 22:26:47,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:26:48,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-15 22:26:48,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:26:48,760 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 7 proven. 29 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 22:26:48,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:26:48,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379229079] [2023-02-15 22:26:48,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379229079] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:26:48,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1809117080] [2023-02-15 22:26:48,760 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 22:26:48,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:26:48,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:26:48,761 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:26:48,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-02-15 22:26:49,027 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 22:26:49,028 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 22:26:49,032 INFO L263 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 147 conjunts are in the unsatisfiable core [2023-02-15 22:26:49,036 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:26:49,320 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 22:26:49,329 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 22:26:49,786 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 22:26:49,786 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:26:49,795 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 16 [2023-02-15 22:26:49,801 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 16 [2023-02-15 22:26:49,927 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 16 [2023-02-15 22:26:49,937 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 16 [2023-02-15 22:26:50,003 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:26:50,010 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:26:50,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:26:50,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:26:50,119 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:26:50,122 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 22:26:50,122 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 110 treesize of output 73 [2023-02-15 22:26:50,137 INFO L321 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2023-02-15 22:26:50,137 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 47 [2023-02-15 22:26:50,474 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 22:26:50,474 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 38 [2023-02-15 22:26:50,482 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:26:50,482 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 10 [2023-02-15 22:26:50,651 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_3786 (Array Int Int)) (v_ArrVal_3787 (Array Int Int))) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_3787)) (= (select |c_old(#valid)| |node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_3786)))) is different from true [2023-02-15 22:26:50,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:26:50,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:26:50,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:26:50,693 INFO L321 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2023-02-15 22:26:50,693 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 48 [2023-02-15 22:26:50,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:26:50,722 INFO L321 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2023-02-15 22:26:50,723 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 86 treesize of output 76 [2023-02-15 22:26:50,740 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-02-15 22:26:50,740 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2023-02-15 22:26:51,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:26:51,324 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:26:51,336 INFO L321 Elim1Store]: treesize reduction 67, result has 9.5 percent of original size [2023-02-15 22:26:51,337 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 132 treesize of output 74 [2023-02-15 22:26:51,349 INFO L321 Elim1Store]: treesize reduction 34, result has 17.1 percent of original size [2023-02-15 22:26:51,349 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 29 [2023-02-15 22:26:51,394 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 13 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2023-02-15 22:26:51,394 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:26:51,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1809117080] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:26:51,871 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:26:51,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31] total 57 [2023-02-15 22:26:51,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765849587] [2023-02-15 22:26:51,871 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:26:51,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2023-02-15 22:26:51,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:26:51,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2023-02-15 22:26:51,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=3599, Unknown=3, NotChecked=120, Total=3906 [2023-02-15 22:26:51,874 INFO L87 Difference]: Start difference. First operand 105 states and 119 transitions. Second operand has 57 states, 55 states have (on average 1.7636363636363637) internal successors, (97), 51 states have internal predecessors, (97), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 22:26:54,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:26:54,482 INFO L93 Difference]: Finished difference Result 130 states and 149 transitions. [2023-02-15 22:26:54,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-02-15 22:26:54,483 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 55 states have (on average 1.7636363636363637) internal successors, (97), 51 states have internal predecessors, (97), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 59 [2023-02-15 22:26:54,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:26:54,484 INFO L225 Difference]: With dead ends: 130 [2023-02-15 22:26:54,484 INFO L226 Difference]: Without dead ends: 130 [2023-02-15 22:26:54,485 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 46 SyntacticMatches, 9 SemanticMatches, 82 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1693 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=375, Invalid=6432, Unknown=3, NotChecked=162, Total=6972 [2023-02-15 22:26:54,486 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 41 mSDsluCounter, 1614 mSDsCounter, 0 mSdLazyCounter, 1961 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 1677 SdHoareTripleChecker+Invalid, 2093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1961 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 116 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-02-15 22:26:54,486 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 1677 Invalid, 2093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1961 Invalid, 0 Unknown, 116 Unchecked, 1.3s Time] [2023-02-15 22:26:54,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2023-02-15 22:26:54,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 127. [2023-02-15 22:26:54,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 103 states have (on average 1.3106796116504855) internal successors, (135), 120 states have internal predecessors, (135), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-15 22:26:54,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 145 transitions. [2023-02-15 22:26:54,490 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 145 transitions. Word has length 59 [2023-02-15 22:26:54,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:26:54,491 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 145 transitions. [2023-02-15 22:26:54,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 55 states have (on average 1.7636363636363637) internal successors, (97), 51 states have internal predecessors, (97), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 22:26:54,491 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 145 transitions. [2023-02-15 22:26:54,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-02-15 22:26:54,492 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:26:54,492 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2023-02-15 22:26:54,502 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-02-15 22:26:54,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-02-15 22:26:54,699 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2023-02-15 22:26:54,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:26:54,699 INFO L85 PathProgramCache]: Analyzing trace with hash 2022079807, now seen corresponding path program 1 times [2023-02-15 22:26:54,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:26:54,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656683379] [2023-02-15 22:26:54,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:26:54,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:26:54,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:26:55,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 22:26:55,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:26:55,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 22:26:55,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:26:55,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-15 22:26:55,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:26:56,310 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 16 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 22:26:56,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:26:56,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656683379] [2023-02-15 22:26:56,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656683379] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:26:56,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1745438950] [2023-02-15 22:26:56,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:26:56,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:26:56,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:26:56,312 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:26:56,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-02-15 22:26:56,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:26:56,576 INFO L263 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 73 conjunts are in the unsatisfiable core [2023-02-15 22:26:56,578 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:26:56,623 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:26:56,896 INFO L350 Elim1Store]: Elim1 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 17 treesize of output 9 [2023-02-15 22:26:56,898 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:26:57,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:26:57,146 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2023-02-15 22:26:57,154 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-15 22:26:57,155 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-02-15 22:26:57,441 INFO L321 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2023-02-15 22:26:57,442 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 53 treesize of output 39 [2023-02-15 22:26:57,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:26:57,447 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2023-02-15 22:26:57,533 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-02-15 22:26:57,534 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 109 treesize of output 92 [2023-02-15 22:26:57,543 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:26:57,543 INFO L350 Elim1Store]: Elim1 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 80 treesize of output 79 [2023-02-15 22:26:57,637 INFO L350 Elim1Store]: Elim1 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 67 treesize of output 51 [2023-02-15 22:26:57,775 INFO L321 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2023-02-15 22:26:57,775 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 25 [2023-02-15 22:26:57,814 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 22:26:57,814 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:26:57,986 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4073 (Array Int Int)) (v_ArrVal_4074 (Array Int Int))) (not (= 0 (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_4074))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_4073) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) is different from false [2023-02-15 22:26:58,239 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:26:58,239 INFO L350 Elim1Store]: Elim1 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 304 treesize of output 280 [2023-02-15 22:26:58,250 INFO L350 Elim1Store]: Elim1 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 268 treesize of output 264 [2023-02-15 22:26:58,254 INFO L350 Elim1Store]: Elim1 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 264 treesize of output 262 [2023-02-15 22:26:58,343 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (let ((.cse4 (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (.cse8 (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse2))) (let ((.cse5 (not .cse8)) (.cse13 (not .cse4)) (.cse3 (select |c_#memory_$Pointer$.base| .cse2))) (let ((.cse0 (or .cse13 (forall ((v_arrayElimCell_135 Int) (v_arrayElimCell_134 Int) (v_ArrVal_4074 (Array Int Int))) (not (= 0 (select (let ((.cse15 (store (store |c_#memory_$Pointer$.base| .cse2 (store .cse3 (+ v_arrayElimCell_134 4) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_4074))) (select .cse15 (select (select .cse15 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ v_arrayElimCell_135 4))))))) (.cse9 (let ((.cse10 (or .cse13 (forall ((v_arrayElimCell_133 Int) (v_arrayElimCell_135 Int) (v_ArrVal_4074 (Array Int Int))) (not (= 0 (select (let ((.cse14 (store (store |c_#memory_$Pointer$.base| .cse2 (store .cse3 (+ v_arrayElimCell_133 4) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_4074))) (select .cse14 (select (select .cse14 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ v_arrayElimCell_135 4)))))))) (and (or (and .cse10 (or .cse4 (forall ((v_arrayElimCell_133 Int) (v_arrayElimCell_134 Int) (v_ArrVal_4074 (Array Int Int))) (not (= 0 (select (let ((.cse11 (store (store |c_#memory_$Pointer$.base| .cse2 (store .cse3 (+ v_arrayElimCell_133 4) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_4074))) (select .cse11 (select (select .cse11 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ v_arrayElimCell_134 4))))))) .cse8) (or (and .cse10 (or (forall ((v_arrayElimCell_133 Int) (v_arrayElimCell_136 Int) (v_ArrVal_4074 (Array Int Int))) (not (= 0 (select (let ((.cse12 (store (store |c_#memory_$Pointer$.base| .cse2 (store .cse3 (+ v_arrayElimCell_133 4) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_4074))) (select .cse12 (select (select .cse12 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ v_arrayElimCell_136 4))))) .cse4)) .cse5))))) (and (or (and .cse0 (or (forall ((v_arrayElimCell_134 Int) (v_arrayElimCell_136 Int) (v_ArrVal_4074 (Array Int Int))) (not (= 0 (select (let ((.cse1 (store (store |c_#memory_$Pointer$.base| .cse2 (store .cse3 (+ v_arrayElimCell_134 4) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_4074))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ v_arrayElimCell_136 4))))) .cse4)) .cse5) (or (and .cse0 (or (forall ((v_arrayElimCell_134 Int) (v_ArrVal_4074 (Array Int Int))) (not (= 0 (let ((.cse7 (+ v_arrayElimCell_134 4))) (select (let ((.cse6 (store (store |c_#memory_$Pointer$.base| .cse2 (store .cse3 .cse7 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_4074))) (select .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse7))))) .cse4)) .cse8) (or (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) .cse9) (or (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) .cse9)))))) is different from false [2023-02-15 22:26:58,603 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (let ((.cse2 (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_dll_append_#t~ret7#1.base|)) (.cse7 (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse4))) (let ((.cse8 (not .cse7)) (.cse5 (select |c_#memory_$Pointer$.base| .cse4)) (.cse14 (not .cse2))) (let ((.cse1 (or (forall ((v_arrayElimCell_135 Int) (v_arrayElimCell_134 Int) (v_ArrVal_4074 (Array Int Int))) (not (= 0 (select (let ((.cse15 (store (store |c_#memory_$Pointer$.base| .cse4 (store .cse5 (+ v_arrayElimCell_134 4) |c_ULTIMATE.start_dll_append_#t~ret7#1.base|)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_4074))) (select .cse15 (select (select .cse15 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ v_arrayElimCell_135 4))))) .cse14)) (.cse0 (let ((.cse10 (or (forall ((v_arrayElimCell_133 Int) (v_arrayElimCell_135 Int) (v_ArrVal_4074 (Array Int Int))) (not (= 0 (select (let ((.cse13 (store (store |c_#memory_$Pointer$.base| .cse4 (store .cse5 (+ v_arrayElimCell_133 4) |c_ULTIMATE.start_dll_append_#t~ret7#1.base|)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_4074))) (select .cse13 (select (select .cse13 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ v_arrayElimCell_135 4))))) .cse14))) (and (or (and .cse10 (or .cse2 (forall ((v_arrayElimCell_133 Int) (v_arrayElimCell_134 Int) (v_ArrVal_4074 (Array Int Int))) (not (= 0 (select (let ((.cse11 (store (store |c_#memory_$Pointer$.base| .cse4 (store .cse5 (+ v_arrayElimCell_133 4) |c_ULTIMATE.start_dll_append_#t~ret7#1.base|)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_4074))) (select .cse11 (select (select .cse11 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ v_arrayElimCell_134 4))))))) .cse7) (or (and (or .cse2 (forall ((v_arrayElimCell_133 Int) (v_arrayElimCell_136 Int) (v_ArrVal_4074 (Array Int Int))) (not (= 0 (select (let ((.cse12 (store (store |c_#memory_$Pointer$.base| .cse4 (store .cse5 (+ v_arrayElimCell_133 4) |c_ULTIMATE.start_dll_append_#t~ret7#1.base|)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_4074))) (select .cse12 (select (select .cse12 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ v_arrayElimCell_136 4)))))) .cse10) .cse8))))) (and (or .cse0 (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (or (and .cse1 (or .cse2 (forall ((v_arrayElimCell_134 Int) (v_ArrVal_4074 (Array Int Int))) (not (= 0 (let ((.cse6 (+ v_arrayElimCell_134 4))) (select (let ((.cse3 (store (store |c_#memory_$Pointer$.base| .cse4 (store .cse5 .cse6 |c_ULTIMATE.start_dll_append_#t~ret7#1.base|)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_4074))) (select .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse6))))))) .cse7) (or .cse8 (and .cse1 (or (forall ((v_arrayElimCell_134 Int) (v_arrayElimCell_136 Int) (v_ArrVal_4074 (Array Int Int))) (not (= 0 (select (let ((.cse9 (store (store |c_#memory_$Pointer$.base| .cse4 (store .cse5 (+ v_arrayElimCell_134 4) |c_ULTIMATE.start_dll_append_#t~ret7#1.base|)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_4074))) (select .cse9 (select (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ v_arrayElimCell_136 4))))) .cse2))) (or .cse0 (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) is different from false [2023-02-15 22:27:00,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1745438950] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:27:00,598 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:27:00,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 23] total 49 [2023-02-15 22:27:00,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585870638] [2023-02-15 22:27:00,599 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:27:00,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2023-02-15 22:27:00,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:27:00,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2023-02-15 22:27:00,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=2811, Unknown=7, NotChecked=324, Total=3306 [2023-02-15 22:27:00,601 INFO L87 Difference]: Start difference. First operand 127 states and 145 transitions. Second operand has 49 states, 47 states have (on average 2.25531914893617) internal successors, (106), 43 states have internal predecessors, (106), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-15 22:27:03,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:27:03,205 INFO L93 Difference]: Finished difference Result 114 states and 127 transitions. [2023-02-15 22:27:03,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-02-15 22:27:03,205 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 47 states have (on average 2.25531914893617) internal successors, (106), 43 states have internal predecessors, (106), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 61 [2023-02-15 22:27:03,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:27:03,206 INFO L225 Difference]: With dead ends: 114 [2023-02-15 22:27:03,206 INFO L226 Difference]: Without dead ends: 114 [2023-02-15 22:27:03,207 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 77 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1311 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=401, Invalid=5302, Unknown=9, NotChecked=450, Total=6162 [2023-02-15 22:27:03,207 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 136 mSDsluCounter, 1521 mSDsCounter, 0 mSdLazyCounter, 1701 mSolverCounterSat, 9 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 1578 SdHoareTripleChecker+Invalid, 1712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1701 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:27:03,207 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 1578 Invalid, 1712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1701 Invalid, 2 Unknown, 0 Unchecked, 1.0s Time] [2023-02-15 22:27:03,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2023-02-15 22:27:03,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2023-02-15 22:27:03,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 90 states have (on average 1.3) internal successors, (117), 107 states have internal predecessors, (117), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-15 22:27:03,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 127 transitions. [2023-02-15 22:27:03,216 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 127 transitions. Word has length 61 [2023-02-15 22:27:03,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:27:03,217 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 127 transitions. [2023-02-15 22:27:03,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 47 states have (on average 2.25531914893617) internal successors, (106), 43 states have internal predecessors, (106), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-15 22:27:03,217 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 127 transitions. [2023-02-15 22:27:03,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-02-15 22:27:03,218 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:27:03,218 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2023-02-15 22:27:03,228 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2023-02-15 22:27:03,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:27:03,429 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2023-02-15 22:27:03,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:27:03,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1296901353, now seen corresponding path program 1 times [2023-02-15 22:27:03,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:27:03,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813823019] [2023-02-15 22:27:03,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:27:03,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:27:03,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:27:04,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 22:27:04,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:27:04,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 22:27:04,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:27:04,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-15 22:27:04,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:27:04,513 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 21 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 22:27:04,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:27:04,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813823019] [2023-02-15 22:27:04,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813823019] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:27:04,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [367535504] [2023-02-15 22:27:04,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:27:04,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:27:04,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:27:04,516 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:27:04,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-02-15 22:27:04,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:27:04,795 INFO L263 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 64 conjunts are in the unsatisfiable core [2023-02-15 22:27:04,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:27:04,846 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 22:27:05,145 INFO L350 Elim1Store]: Elim1 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 18 treesize of output 10 [2023-02-15 22:27:05,227 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4350 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_4350))) (exists ((v_ArrVal_4349 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| v_ArrVal_4349))) (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|)) is different from true [2023-02-15 22:27:05,243 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4349 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| v_ArrVal_4349))) (exists ((v_ArrVal_4351 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_4351))) (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|)) is different from true [2023-02-15 22:27:05,250 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4352 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_4352))) (exists ((v_ArrVal_4349 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| v_ArrVal_4349))) (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|)) is different from true [2023-02-15 22:27:05,258 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4349 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| v_ArrVal_4349))) (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_4352 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_4352)))) is different from true [2023-02-15 22:27:05,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:27:05,273 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:27:05,284 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-02-15 22:27:05,285 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 26 [2023-02-15 22:27:05,691 INFO L321 Elim1Store]: treesize reduction 31, result has 38.0 percent of original size [2023-02-15 22:27:05,691 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 40 [2023-02-15 22:27:05,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:27:05,705 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:27:05,772 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:27:05,867 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 24 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 5 not checked. [2023-02-15 22:27:05,867 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:27:08,514 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_37| Int) (v_ArrVal_4363 (Array Int Int)) (v_ArrVal_4355 (Array Int Int)) (|ULTIMATE.start_dll_append_~last~0#1.offset| Int) (|ULTIMATE.start_dll_append_~last~0#1.base| Int) (v_ArrVal_4354 Int)) (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_37| v_ArrVal_4363))) (let ((.cse2 (select .cse1 |ULTIMATE.start_dll_append_~last~0#1.base|)) (.cse3 (+ |ULTIMATE.start_dll_append_~last~0#1.offset| 4)) (.cse0 (store |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_37| 1))) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_37| |c_#StackHeapBarrier|)) (= (select .cse0 (select (select (store (store .cse1 |ULTIMATE.start_dll_append_~last~0#1.base| (store .cse2 .cse3 v_ArrVal_4354)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_37| v_ArrVal_4355) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) 1) (not (= 0 (select .cse2 .cse3))) (not (= 1 (select .cse0 (select (select .cse1 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)))))))) is different from false [2023-02-15 22:27:08,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [367535504] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:27:08,515 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:27:08,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 25] total 52 [2023-02-15 22:27:08,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649843473] [2023-02-15 22:27:08,516 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:27:08,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2023-02-15 22:27:08,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:27:08,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2023-02-15 22:27:08,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=2974, Unknown=6, NotChecked=570, Total=3782 [2023-02-15 22:27:08,517 INFO L87 Difference]: Start difference. First operand 114 states and 127 transitions. Second operand has 53 states, 50 states have (on average 2.06) internal successors, (103), 47 states have internal predecessors, (103), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 22:27:11,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:27:11,565 INFO L93 Difference]: Finished difference Result 153 states and 170 transitions. [2023-02-15 22:27:11,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-02-15 22:27:11,565 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 50 states have (on average 2.06) internal successors, (103), 47 states have internal predecessors, (103), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 62 [2023-02-15 22:27:11,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:27:11,566 INFO L225 Difference]: With dead ends: 153 [2023-02-15 22:27:11,566 INFO L226 Difference]: Without dead ends: 153 [2023-02-15 22:27:11,567 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 83 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1235 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=771, Invalid=5562, Unknown=7, NotChecked=800, Total=7140 [2023-02-15 22:27:11,567 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 1674 mSDsluCounter, 714 mSDsCounter, 0 mSdLazyCounter, 1648 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1674 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 2111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 423 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-02-15 22:27:11,567 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1674 Valid, 747 Invalid, 2111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1648 Invalid, 0 Unknown, 423 Unchecked, 0.9s Time] [2023-02-15 22:27:11,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2023-02-15 22:27:11,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 113. [2023-02-15 22:27:11,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 90 states have (on average 1.288888888888889) internal successors, (116), 106 states have internal predecessors, (116), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-15 22:27:11,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 126 transitions. [2023-02-15 22:27:11,570 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 126 transitions. Word has length 62 [2023-02-15 22:27:11,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:27:11,570 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 126 transitions. [2023-02-15 22:27:11,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 50 states have (on average 2.06) internal successors, (103), 47 states have internal predecessors, (103), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 22:27:11,571 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 126 transitions. [2023-02-15 22:27:11,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-02-15 22:27:11,571 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:27:11,571 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2023-02-15 22:27:11,581 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-02-15 22:27:11,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:27:11,778 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2023-02-15 22:27:11,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:27:11,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1296901354, now seen corresponding path program 1 times [2023-02-15 22:27:11,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:27:11,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949015903] [2023-02-15 22:27:11,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:27:11,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:27:11,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:27:12,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 22:27:12,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:27:12,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 22:27:12,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:27:12,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-15 22:27:12,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:27:13,114 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 21 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 22:27:13,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:27:13,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949015903] [2023-02-15 22:27:13,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949015903] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:27:13,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1574820229] [2023-02-15 22:27:13,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:27:13,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:27:13,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:27:13,116 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:27:13,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-02-15 22:27:13,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:27:13,406 INFO L263 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 122 conjunts are in the unsatisfiable core [2023-02-15 22:27:13,410 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:27:13,422 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:27:13,462 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:27:13,551 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 22:27:13,551 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:27:13,846 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 22:27:13,846 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-15 22:27:13,973 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 22:27:14,064 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:27:14,065 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-02-15 22:27:14,367 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:27:14,368 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 22 [2023-02-15 22:27:14,373 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2023-02-15 22:27:14,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:27:14,716 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 22:27:14,716 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 49 [2023-02-15 22:27:14,734 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-02-15 22:27:14,734 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2023-02-15 22:27:14,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:27:14,741 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 16 [2023-02-15 22:27:15,393 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-02-15 22:27:15,394 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 104 treesize of output 85 [2023-02-15 22:27:15,408 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:27:15,408 INFO L350 Elim1Store]: Elim1 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 43 treesize of output 44 [2023-02-15 22:27:15,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:27:15,497 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 22:27:15,497 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 70 treesize of output 60 [2023-02-15 22:27:15,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:27:15,513 INFO L350 Elim1Store]: Elim1 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 29 treesize of output 29 [2023-02-15 22:27:15,592 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:27:15,593 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 26 [2023-02-15 22:27:15,596 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:27:15,619 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 16 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 22:27:15,619 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:27:15,763 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4645 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_4645) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (forall ((v_ArrVal_4645 (Array Int Int)) (v_ArrVal_4646 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_4645) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_4646) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2023-02-15 22:27:16,390 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:27:16,390 INFO L350 Elim1Store]: Elim1 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 70 treesize of output 74 [2023-02-15 22:27:16,603 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) (+ |c_ULTIMATE.start_dll_append_#t~mem9#1.offset| 4)))) (and (forall ((v_prenex_111 (Array Int Int)) (v_prenex_112 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_prenex_111) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_prenex_112) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (forall ((v_ArrVal_4643 (Array Int Int)) (v_ArrVal_4645 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_4643) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_4645) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (+ |c_ULTIMATE.start_dll_append_#t~mem9#1.offset| 1))) (forall ((v_ArrVal_4644 (Array Int Int)) (v_ArrVal_4646 (Array Int Int))) (= |c_ULTIMATE.start_dll_append_#t~mem9#1.base| (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_4644) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_4646) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2023-02-15 22:27:16,614 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse2) (+ .cse1 4)))) (and (forall ((v_ArrVal_4643 (Array Int Int)) (v_ArrVal_4645 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_4643) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_4645) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (+ .cse1 1))) (forall ((v_prenex_111 (Array Int Int)) (v_prenex_112 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_prenex_111) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_prenex_112) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (forall ((v_ArrVal_4644 (Array Int Int)) (v_ArrVal_4646 (Array Int Int))) (= .cse2 (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_4644) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_4646) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2023-02-15 22:27:16,641 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) (+ .cse2 4)))) (and (forall ((v_ArrVal_4644 (Array Int Int)) (v_ArrVal_4646 (Array Int Int))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_4644) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_4646) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (forall ((v_prenex_111 (Array Int Int)) (v_prenex_112 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_prenex_111) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_prenex_112) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (forall ((v_ArrVal_4643 (Array Int Int)) (v_ArrVal_4645 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_4643) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_4645) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (+ .cse2 1)))))) is different from false [2023-02-15 22:27:16,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1574820229] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:27:16,995 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:27:16,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 33] total 58 [2023-02-15 22:27:16,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015751090] [2023-02-15 22:27:16,995 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:27:16,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2023-02-15 22:27:16,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:27:16,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2023-02-15 22:27:16,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=4146, Unknown=50, NotChecked=532, Total=4970 [2023-02-15 22:27:16,996 INFO L87 Difference]: Start difference. First operand 113 states and 126 transitions. Second operand has 59 states, 56 states have (on average 1.9285714285714286) internal successors, (108), 51 states have internal predecessors, (108), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-15 22:27:23,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:27:23,528 INFO L93 Difference]: Finished difference Result 248 states and 276 transitions. [2023-02-15 22:27:23,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-02-15 22:27:23,529 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 56 states have (on average 1.9285714285714286) internal successors, (108), 51 states have internal predecessors, (108), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 62 [2023-02-15 22:27:23,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:27:23,530 INFO L225 Difference]: With dead ends: 248 [2023-02-15 22:27:23,530 INFO L226 Difference]: Without dead ends: 248 [2023-02-15 22:27:23,531 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 109 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 2655 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=1214, Invalid=10092, Unknown=52, NotChecked=852, Total=12210 [2023-02-15 22:27:23,532 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 2784 mSDsluCounter, 934 mSDsCounter, 0 mSdLazyCounter, 2304 mSolverCounterSat, 64 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2784 SdHoareTripleChecker+Valid, 969 SdHoareTripleChecker+Invalid, 2370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 2304 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-02-15 22:27:23,532 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2784 Valid, 969 Invalid, 2370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 2304 Invalid, 2 Unknown, 0 Unchecked, 1.4s Time] [2023-02-15 22:27:23,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2023-02-15 22:27:23,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 117. [2023-02-15 22:27:23,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 95 states have (on average 1.2736842105263158) internal successors, (121), 110 states have internal predecessors, (121), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-15 22:27:23,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 131 transitions. [2023-02-15 22:27:23,536 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 131 transitions. Word has length 62 [2023-02-15 22:27:23,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:27:23,536 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 131 transitions. [2023-02-15 22:27:23,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 56 states have (on average 1.9285714285714286) internal successors, (108), 51 states have internal predecessors, (108), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-15 22:27:23,537 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 131 transitions. [2023-02-15 22:27:23,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-02-15 22:27:23,537 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:27:23,537 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2023-02-15 22:27:23,544 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2023-02-15 22:27:23,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-02-15 22:27:23,744 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2023-02-15 22:27:23,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:27:23,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1537492107, now seen corresponding path program 1 times [2023-02-15 22:27:23,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:27:23,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077254170] [2023-02-15 22:27:23,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:27:23,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:27:23,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:27:25,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 22:27:25,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:27:25,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 22:27:25,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:27:26,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-15 22:27:26,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:27:26,671 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 22:27:26,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:27:26,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077254170] [2023-02-15 22:27:26,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077254170] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:27:26,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1753402665] [2023-02-15 22:27:26,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:27:26,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:27:26,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:27:26,673 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:27:26,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-02-15 22:27:26,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:27:26,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 127 conjunts are in the unsatisfiable core [2023-02-15 22:27:26,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:27:26,986 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:27:27,039 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:27:27,081 WARN L859 $PredicateComparison]: unable to prove that (and (not (= 0 |c_node_create_~temp~0#1.base|)) (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_4926 Int)) (= |c_#length| (store |c_old(#length)| |c_node_create_~temp~0#1.base| v_ArrVal_4926)))) is different from true [2023-02-15 22:27:27,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:27:27,168 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 22:27:27,472 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2023-02-15 22:27:27,477 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:27:27,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:27:27,741 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 22:27:27,765 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 22:27:27,765 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 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 [2023-02-15 22:27:28,014 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 22:27:28,144 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:27:28,145 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 53 treesize of output 50 [2023-02-15 22:27:28,596 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:27:28,596 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 32 [2023-02-15 22:27:28,599 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 22:27:28,603 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2023-02-15 22:27:28,605 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:27:29,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:27:29,015 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-02-15 22:27:29,015 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 89 treesize of output 64 [2023-02-15 22:27:29,033 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-02-15 22:27:29,033 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2023-02-15 22:27:29,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:27:29,046 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2023-02-15 22:27:29,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:27:29,055 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 11 [2023-02-15 22:27:29,628 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:27:29,628 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2023-02-15 22:27:29,903 INFO L321 Elim1Store]: treesize reduction 27, result has 38.6 percent of original size [2023-02-15 22:27:29,903 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 101 treesize of output 69 [2023-02-15 22:27:29,912 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 16 [2023-02-15 22:27:30,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:27:30,035 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 22:27:30,035 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 67 [2023-02-15 22:27:30,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:27:30,044 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 16 [2023-02-15 22:27:30,147 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:27:30,346 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:27:30,346 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 29 [2023-02-15 22:27:30,349 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 14 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 10 not checked. [2023-02-15 22:27:30,349 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:27:30,540 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4942 (Array Int Int)) (v_ArrVal_4943 (Array Int Int))) (not (= 0 (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_4942))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_4943) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) is different from false [2023-02-15 22:27:30,549 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4941 Int) (v_ArrVal_4940 (Array Int Int)) (v_ArrVal_4942 (Array Int Int)) (v_ArrVal_4943 (Array Int Int))) (not (= 0 (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4) v_ArrVal_4941)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_4942))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_4940) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_4943) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) is different from false [2023-02-15 22:27:31,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1753402665] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:27:31,332 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:27:31,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 35] total 69 [2023-02-15 22:27:31,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948162448] [2023-02-15 22:27:31,332 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:27:31,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2023-02-15 22:27:31,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:27:31,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2023-02-15 22:27:31,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=311, Invalid=5396, Unknown=5, NotChecked=450, Total=6162 [2023-02-15 22:27:31,334 INFO L87 Difference]: Start difference. First operand 117 states and 131 transitions. Second operand has 69 states, 67 states have (on average 1.6417910447761195) internal successors, (110), 59 states have internal predecessors, (110), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 22:27:41,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:27:41,244 INFO L93 Difference]: Finished difference Result 248 states and 274 transitions. [2023-02-15 22:27:41,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2023-02-15 22:27:41,244 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 67 states have (on average 1.6417910447761195) internal successors, (110), 59 states have internal predecessors, (110), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 65 [2023-02-15 22:27:41,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:27:41,245 INFO L225 Difference]: With dead ends: 248 [2023-02-15 22:27:41,245 INFO L226 Difference]: Without dead ends: 248 [2023-02-15 22:27:41,246 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 45 SyntacticMatches, 6 SemanticMatches, 118 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 3049 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=1409, Invalid=12170, Unknown=5, NotChecked=696, Total=14280 [2023-02-15 22:27:41,247 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 1896 mSDsluCounter, 908 mSDsCounter, 0 mSdLazyCounter, 2613 mSolverCounterSat, 62 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1896 SdHoareTripleChecker+Valid, 939 SdHoareTripleChecker+Invalid, 2830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 2613 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 143 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:27:41,247 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1896 Valid, 939 Invalid, 2830 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 2613 Invalid, 12 Unknown, 143 Unchecked, 2.0s Time] [2023-02-15 22:27:41,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2023-02-15 22:27:41,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 117. [2023-02-15 22:27:41,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 95 states have (on average 1.263157894736842) internal successors, (120), 110 states have internal predecessors, (120), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-15 22:27:41,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 130 transitions. [2023-02-15 22:27:41,251 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 130 transitions. Word has length 65 [2023-02-15 22:27:41,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:27:41,251 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 130 transitions. [2023-02-15 22:27:41,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 67 states have (on average 1.6417910447761195) internal successors, (110), 59 states have internal predecessors, (110), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 22:27:41,251 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 130 transitions. [2023-02-15 22:27:41,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-02-15 22:27:41,252 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:27:41,252 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2023-02-15 22:27:41,259 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-02-15 22:27:41,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-02-15 22:27:41,457 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2023-02-15 22:27:41,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:27:41,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1304596198, now seen corresponding path program 1 times [2023-02-15 22:27:41,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:27:41,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467349957] [2023-02-15 22:27:41,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:27:41,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:27:41,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:27:41,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 22:27:41,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:27:41,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 22:27:41,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:27:41,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-15 22:27:41,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:27:41,571 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-02-15 22:27:41,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:27:41,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467349957] [2023-02-15 22:27:41,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467349957] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:27:41,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:27:41,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 22:27:41,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131514840] [2023-02-15 22:27:41,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:27:41,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 22:27:41,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:27:41,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 22:27:41,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 22:27:41,573 INFO L87 Difference]: Start difference. First operand 117 states and 130 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 22:27:41,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:27:41,675 INFO L93 Difference]: Finished difference Result 119 states and 130 transitions. [2023-02-15 22:27:41,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 22:27:41,675 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 68 [2023-02-15 22:27:41,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:27:41,676 INFO L225 Difference]: With dead ends: 119 [2023-02-15 22:27:41,676 INFO L226 Difference]: Without dead ends: 119 [2023-02-15 22:27:41,676 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-02-15 22:27:41,677 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 7 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:27:41,677 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 280 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:27:41,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2023-02-15 22:27:41,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 116. [2023-02-15 22:27:41,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 94 states have (on average 1.2553191489361701) internal successors, (118), 109 states have internal predecessors, (118), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-15 22:27:41,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 128 transitions. [2023-02-15 22:27:41,680 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 128 transitions. Word has length 68 [2023-02-15 22:27:41,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:27:41,681 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 128 transitions. [2023-02-15 22:27:41,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 22:27:41,681 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 128 transitions. [2023-02-15 22:27:41,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-02-15 22:27:41,694 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:27:41,694 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2023-02-15 22:27:41,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-02-15 22:27:41,694 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2023-02-15 22:27:41,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:27:41,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1304640900, now seen corresponding path program 1 times [2023-02-15 22:27:41,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:27:41,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90817202] [2023-02-15 22:27:41,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:27:41,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:27:41,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:27:43,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 22:27:43,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:27:43,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 22:27:43,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:27:43,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-15 22:27:43,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:27:44,922 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 30 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 22:27:44,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:27:44,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90817202] [2023-02-15 22:27:44,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90817202] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:27:44,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2002157328] [2023-02-15 22:27:44,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:27:44,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:27:44,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:27:44,924 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:27:44,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-02-15 22:27:45,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:27:45,256 INFO L263 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 141 conjunts are in the unsatisfiable core [2023-02-15 22:27:45,260 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:27:45,275 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:27:45,353 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:27:45,507 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 22:27:45,508 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:27:45,940 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 22:27:45,940 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-15 22:27:46,115 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:27:46,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:27:46,199 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-15 22:27:46,208 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 22:27:46,319 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:27:46,320 INFO L350 Elim1Store]: Elim1 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 56 treesize of output 53 [2023-02-15 22:27:46,326 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2023-02-15 22:27:46,720 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:27:46,720 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 29 [2023-02-15 22:27:46,738 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 22:27:46,742 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2023-02-15 22:27:47,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:27:47,226 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-02-15 22:27:47,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:27:47,246 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-02-15 22:27:47,246 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 70 treesize of output 53 [2023-02-15 22:27:47,263 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-02-15 22:27:47,264 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2023-02-15 22:27:47,272 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-02-15 22:27:48,123 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-02-15 22:27:48,124 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 120 treesize of output 95 [2023-02-15 22:27:48,151 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:27:48,151 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 49 [2023-02-15 22:27:48,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:27:48,161 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2023-02-15 22:27:48,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:27:48,297 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 22:27:48,298 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 56 [2023-02-15 22:27:48,307 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-02-15 22:27:48,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:27:48,324 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 16 [2023-02-15 22:27:48,417 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:27:48,417 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 22 [2023-02-15 22:27:48,425 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:27:48,569 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:27:48,627 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 16 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 22:27:48,627 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:27:48,665 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5411 (Array Int Int)) (v_ArrVal_5413 (Array Int Int)) (v_ArrVal_5412 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5411) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5412) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5413) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2023-02-15 22:27:48,673 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5411 (Array Int Int)) (v_ArrVal_5410 (Array Int Int)) (v_ArrVal_5413 (Array Int Int)) (v_ArrVal_5412 (Array Int Int)) (v_ArrVal_5408 (Array Int Int)) (v_ArrVal_5409 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_5409) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5411) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_5410) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5412) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_5408) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5413) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2023-02-15 22:27:48,692 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5411 (Array Int Int)) (v_ArrVal_5410 (Array Int Int)) (v_ArrVal_5413 (Array Int Int)) (v_ArrVal_5412 (Array Int Int)) (v_ArrVal_5408 (Array Int Int)) (v_ArrVal_5409 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_append_#t~mem10#1.base| v_ArrVal_5409) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5411) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_#t~mem10#1.base| v_ArrVal_5410) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5412) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_#t~mem10#1.base| v_ArrVal_5408) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5413) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2023-02-15 22:27:48,938 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5411 (Array Int Int)) (v_ArrVal_5410 (Array Int Int)) (v_ArrVal_5413 (Array Int Int)) (v_ArrVal_5412 (Array Int Int)) (v_ArrVal_5408 (Array Int Int)) (v_ArrVal_5409 (Array Int Int))) (= (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) (+ |c_ULTIMATE.start_dll_append_#t~mem9#1.offset| 4)))) (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_5409) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5411) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_5410) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5412) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5408) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5413) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2023-02-15 22:27:48,947 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5411 (Array Int Int)) (v_ArrVal_5410 (Array Int Int)) (v_ArrVal_5413 (Array Int Int)) (v_ArrVal_5412 (Array Int Int)) (v_ArrVal_5408 (Array Int Int)) (v_ArrVal_5409 (Array Int Int))) (= (let ((.cse0 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4)))) (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_5409) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5411) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_5410) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5412) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5408) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5413) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2023-02-15 22:27:48,968 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5411 (Array Int Int)) (v_ArrVal_5410 (Array Int Int)) (v_ArrVal_5413 (Array Int Int)) (v_ArrVal_5412 (Array Int Int)) (v_ArrVal_5408 (Array Int Int)) (v_ArrVal_5409 (Array Int Int))) (= (let ((.cse0 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4)))) (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_5409) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_5411) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_5410) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_5412) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5408) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_5413) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2023-02-15 22:27:49,059 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5411 (Array Int Int)) (v_ArrVal_5410 (Array Int Int)) (|v_ULTIMATE.start_dll_append_#t~ret7#1.base_46| Int) (v_ArrVal_5413 (Array Int Int)) (v_ArrVal_5412 (Array Int Int)) (v_ArrVal_5426 (Array Int Int)) (v_ArrVal_5428 (Array Int Int)) (v_ArrVal_5427 (Array Int Int)) (v_ArrVal_5408 (Array Int Int)) (v_ArrVal_5409 (Array Int Int))) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_46|))) (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_46| |c_#StackHeapBarrier|)) (= (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_46| v_ArrVal_5427)) (.cse2 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_46| v_ArrVal_5428))) (let ((.cse0 (select (select .cse1 (select (select .cse1 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (+ (select (select .cse2 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4)))) (select (select (store (store (store |c_#memory_int| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_46| v_ArrVal_5426) .cse0 v_ArrVal_5409) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_46| v_ArrVal_5411) (select (select (store (store .cse1 .cse0 v_ArrVal_5410) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_46| v_ArrVal_5412) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store .cse2 .cse0 v_ArrVal_5408) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_46| v_ArrVal_5413) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) |c_ULTIMATE.start_main_~data~0#1|))) is different from false [2023-02-15 22:27:49,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2002157328] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:27:49,061 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:27:49,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 66 [2023-02-15 22:27:49,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700459753] [2023-02-15 22:27:49,061 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:27:49,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2023-02-15 22:27:49,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:27:49,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2023-02-15 22:27:49,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=4149, Unknown=61, NotChecked=952, Total=5402 [2023-02-15 22:27:49,064 INFO L87 Difference]: Start difference. First operand 116 states and 128 transitions. Second operand has 66 states, 64 states have (on average 1.84375) internal successors, (118), 57 states have internal predecessors, (118), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 22:27:53,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:27:53,944 INFO L93 Difference]: Finished difference Result 183 states and 201 transitions. [2023-02-15 22:27:53,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-02-15 22:27:53,949 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 64 states have (on average 1.84375) internal successors, (118), 57 states have internal predecessors, (118), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 68 [2023-02-15 22:27:53,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:27:53,950 INFO L225 Difference]: With dead ends: 183 [2023-02-15 22:27:53,950 INFO L226 Difference]: Without dead ends: 183 [2023-02-15 22:27:53,951 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 52 SyntacticMatches, 6 SemanticMatches, 101 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 1999 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=833, Invalid=8250, Unknown=65, NotChecked=1358, Total=10506 [2023-02-15 22:27:53,951 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 967 mSDsluCounter, 1384 mSDsCounter, 0 mSdLazyCounter, 2583 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 967 SdHoareTripleChecker+Valid, 1426 SdHoareTripleChecker+Invalid, 2628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 2583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-02-15 22:27:53,952 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [967 Valid, 1426 Invalid, 2628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 2583 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-02-15 22:27:53,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2023-02-15 22:27:53,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 126. [2023-02-15 22:27:53,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 104 states have (on average 1.2307692307692308) internal successors, (128), 119 states have internal predecessors, (128), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-15 22:27:53,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 138 transitions. [2023-02-15 22:27:53,955 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 138 transitions. Word has length 68 [2023-02-15 22:27:53,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:27:53,956 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 138 transitions. [2023-02-15 22:27:53,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 64 states have (on average 1.84375) internal successors, (118), 57 states have internal predecessors, (118), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 22:27:53,956 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 138 transitions. [2023-02-15 22:27:53,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-02-15 22:27:53,957 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:27:53,957 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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, 1] [2023-02-15 22:27:53,971 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2023-02-15 22:27:54,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-02-15 22:27:54,165 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2023-02-15 22:27:54,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:27:54,166 INFO L85 PathProgramCache]: Analyzing trace with hash -370531362, now seen corresponding path program 1 times [2023-02-15 22:27:54,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:27:54,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043432541] [2023-02-15 22:27:54,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:27:54,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:27:54,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:27:56,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 22:27:56,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:27:56,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 22:27:56,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:27:56,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-15 22:27:56,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:27:57,642 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 17 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 22:27:57,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:27:57,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043432541] [2023-02-15 22:27:57,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043432541] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:27:57,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [34534839] [2023-02-15 22:27:57,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:27:57,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:27:57,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:27:57,644 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:27:57,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-02-15 22:27:58,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:27:58,023 INFO L263 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 171 conjunts are in the unsatisfiable core [2023-02-15 22:27:58,028 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:27:58,036 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:27:58,105 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:27:58,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:27:58,428 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 22:27:58,678 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:27:58,945 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 22:27:58,946 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-15 22:27:58,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:27:58,963 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2023-02-15 22:27:59,211 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 22:27:59,219 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 22:27:59,348 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:27:59,349 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 65 treesize of output 62 [2023-02-15 22:27:59,353 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 41 [2023-02-15 22:27:59,767 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:27:59,767 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 43 [2023-02-15 22:27:59,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:27:59,772 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2023-02-15 22:27:59,777 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 22:27:59,784 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 22:27:59,784 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:28:00,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:28:00,267 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 22:28:00,267 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 96 treesize of output 80 [2023-02-15 22:28:00,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:28:00,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:28:00,285 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-02-15 22:28:00,285 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 55 [2023-02-15 22:28:00,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:28:00,311 INFO L321 Elim1Store]: treesize reduction 43, result has 36.8 percent of original size [2023-02-15 22:28:00,311 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 46 [2023-02-15 22:28:00,320 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 9 [2023-02-15 22:28:00,355 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-02-15 22:28:00,355 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2023-02-15 22:28:01,546 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:28:01,576 INFO L321 Elim1Store]: treesize reduction 131, result has 19.6 percent of original size [2023-02-15 22:28:01,576 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 219 treesize of output 121 [2023-02-15 22:28:01,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:28:01,606 INFO L321 Elim1Store]: treesize reduction 112, result has 16.4 percent of original size [2023-02-15 22:28:01,606 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 119 treesize of output 91 [2023-02-15 22:28:01,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:28:01,724 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 22:28:01,725 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 84 treesize of output 70 [2023-02-15 22:28:01,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:28:01,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:28:01,732 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2023-02-15 22:28:02,383 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:28:02,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:28:02,386 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:28:02,386 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 92 treesize of output 48 [2023-02-15 22:28:02,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:28:02,395 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-15 22:28:02,395 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 18 [2023-02-15 22:28:02,555 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 19 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:28:02,555 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:28:02,789 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5719 (Array Int Int)) (v_ArrVal_5718 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5719)) (.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5718))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (<= (+ (select (select .cse0 .cse1) .cse2) 8) (select |c_#length| (select (select .cse3 .cse1) .cse2)))))) (forall ((v_ArrVal_5719 (Array Int Int)) (v_ArrVal_5718 (Array Int Int))) (<= 0 (+ (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5719))) (select (select .cse4 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5718) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) 4)))) is different from false [2023-02-15 22:28:02,800 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|)) (.cse6 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|)) (.cse5 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (and (forall ((v_ArrVal_5719 (Array Int Int)) (v_ArrVal_5716 Int) (v_ArrVal_5715 Int) (v_ArrVal_5718 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store .cse6 .cse5 v_ArrVal_5716)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5719)) (.cse3 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store .cse4 .cse5 v_ArrVal_5715)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5718))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (<= (+ (select (select .cse0 .cse1) .cse2) 8) (select |c_#length| (select (select .cse3 .cse1) .cse2)))))) (forall ((v_ArrVal_5719 (Array Int Int)) (v_ArrVal_5716 Int) (v_ArrVal_5715 Int) (v_ArrVal_5718 (Array Int Int))) (<= 0 (+ (let ((.cse7 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store .cse6 .cse5 v_ArrVal_5716)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5719))) (select (select .cse7 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store .cse4 .cse5 v_ArrVal_5715)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5718) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) 4))))) is different from false [2023-02-15 22:28:05,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [34534839] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:28:05,055 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:28:05,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 37] total 75 [2023-02-15 22:28:05,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775580793] [2023-02-15 22:28:05,055 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:28:05,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2023-02-15 22:28:05,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:28:05,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2023-02-15 22:28:05,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=348, Invalid=7134, Unknown=8, NotChecked=342, Total=7832 [2023-02-15 22:28:05,056 INFO L87 Difference]: Start difference. First operand 126 states and 138 transitions. Second operand has 76 states, 73 states have (on average 1.7397260273972603) internal successors, (127), 66 states have internal predecessors, (127), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 22:28:16,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:28:16,434 INFO L93 Difference]: Finished difference Result 221 states and 243 transitions. [2023-02-15 22:28:16,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-02-15 22:28:16,434 INFO L78 Accepts]: Start accepts. Automaton has has 76 states, 73 states have (on average 1.7397260273972603) internal successors, (127), 66 states have internal predecessors, (127), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 70 [2023-02-15 22:28:16,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:28:16,435 INFO L225 Difference]: With dead ends: 221 [2023-02-15 22:28:16,435 INFO L226 Difference]: Without dead ends: 221 [2023-02-15 22:28:16,436 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 46 SyntacticMatches, 6 SemanticMatches, 126 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 4273 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=1330, Invalid=14420, Unknown=8, NotChecked=498, Total=16256 [2023-02-15 22:28:16,436 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 1901 mSDsluCounter, 1250 mSDsCounter, 0 mSdLazyCounter, 3191 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1901 SdHoareTripleChecker+Valid, 1284 SdHoareTripleChecker+Invalid, 3256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 3191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2023-02-15 22:28:16,436 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1901 Valid, 1284 Invalid, 3256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 3191 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2023-02-15 22:28:16,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2023-02-15 22:28:16,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 128. [2023-02-15 22:28:16,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 107 states have (on average 1.2242990654205608) internal successors, (131), 121 states have internal predecessors, (131), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-15 22:28:16,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 141 transitions. [2023-02-15 22:28:16,440 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 141 transitions. Word has length 70 [2023-02-15 22:28:16,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:28:16,441 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 141 transitions. [2023-02-15 22:28:16,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 76 states, 73 states have (on average 1.7397260273972603) internal successors, (127), 66 states have internal predecessors, (127), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 22:28:16,441 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 141 transitions. [2023-02-15 22:28:16,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-02-15 22:28:16,441 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:28:16,442 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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, 1] [2023-02-15 22:28:16,452 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2023-02-15 22:28:16,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-02-15 22:28:16,649 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2023-02-15 22:28:16,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:28:16,649 INFO L85 PathProgramCache]: Analyzing trace with hash -370531363, now seen corresponding path program 1 times [2023-02-15 22:28:16,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:28:16,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810858625] [2023-02-15 22:28:16,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:28:16,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:28:16,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:19,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 22:28:19,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:19,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 22:28:19,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:19,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-15 22:28:19,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:20,939 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 11 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 22:28:20,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:28:20,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810858625] [2023-02-15 22:28:20,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810858625] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:28:20,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1404346762] [2023-02-15 22:28:20,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:28:20,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:28:20,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:28:20,941 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:28:20,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-02-15 22:28:21,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:21,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 126 conjunts are in the unsatisfiable core [2023-02-15 22:28:21,308 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:28:21,312 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:28:21,372 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:28:21,519 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 22:28:21,519 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:28:21,928 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 22:28:21,929 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-15 22:28:22,175 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 22:28:22,272 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:28:22,272 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-02-15 22:28:22,619 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:28:22,619 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 22 [2023-02-15 22:28:22,624 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2023-02-15 22:28:23,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:28:23,111 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 22:28:23,111 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 49 [2023-02-15 22:28:23,127 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-02-15 22:28:23,127 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2023-02-15 22:28:23,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:28:23,140 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 16 [2023-02-15 22:28:23,927 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-02-15 22:28:23,927 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 108 treesize of output 85 [2023-02-15 22:28:23,939 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:28:23,940 INFO L350 Elim1Store]: Elim1 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 47 treesize of output 48 [2023-02-15 22:28:24,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:28:24,051 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 22:28:24,051 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 60 [2023-02-15 22:28:24,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:28:24,057 INFO L350 Elim1Store]: Elim1 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 33 treesize of output 33 [2023-02-15 22:28:24,161 INFO L350 Elim1Store]: Elim1 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 34 treesize of output 22 [2023-02-15 22:28:24,490 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:28:24,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:28:24,492 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:28:24,493 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 23 [2023-02-15 22:28:24,525 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 16 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 22:28:24,525 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:28:24,928 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_26| Int) (v_ArrVal_6014 (Array Int Int)) (v_ArrVal_6015 (Array Int Int))) (or (= (select |c_#valid| (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6015))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_26| 4))) 1) (< (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6014) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |v_ULTIMATE.start_main_~ptr~0#1.offset_26|) (<= (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_26| 1) 0))) is different from false [2023-02-15 22:28:25,136 INFO L321 Elim1Store]: treesize reduction 5, result has 83.3 percent of original size [2023-02-15 22:28:25,137 INFO L350 Elim1Store]: Elim1 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 34 treesize of output 33 [2023-02-15 22:28:25,366 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6012 (Array Int Int)) (v_ArrVal_6014 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_26| Int) (v_ArrVal_6013 (Array Int Int)) (v_ArrVal_6015 (Array Int Int))) (or (= |c_ULTIMATE.start_dll_append_#t~mem10#1.base| (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_#t~mem10#1.base| v_ArrVal_6013) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6015))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_26| 4))) (< (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_#t~mem10#1.base| v_ArrVal_6012) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6014) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |v_ULTIMATE.start_main_~ptr~0#1.offset_26|) (<= (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_26| 1) 0))) is different from false [2023-02-15 22:28:26,620 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6012 (Array Int Int)) (v_ArrVal_6025 (Array Int Int)) (v_ArrVal_6014 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_26| Int) (v_ArrVal_6024 (Array Int Int)) (v_ArrVal_6013 (Array Int Int)) (v_ArrVal_6015 (Array Int Int)) (|v_ULTIMATE.start_dll_append_#t~ret7#1.base_52| Int)) (let ((.cse2 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_52| v_ArrVal_6025)) (.cse3 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_52| v_ArrVal_6024))) (let ((.cse0 (select (select .cse2 (select (select .cse2 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (+ (select (select .cse3 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4)))) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_52| |c_#StackHeapBarrier|)) (= .cse0 (select (let ((.cse1 (store (store .cse2 .cse0 v_ArrVal_6013) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_52| v_ArrVal_6015))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_26| 4))) (<= (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_26| 1) 0) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_52|))) (< (select (select (store (store .cse3 .cse0 v_ArrVal_6012) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_52| v_ArrVal_6014) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |v_ULTIMATE.start_main_~ptr~0#1.offset_26|))))) is different from false [2023-02-15 22:28:26,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1404346762] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:28:26,622 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:28:26,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 36] total 72 [2023-02-15 22:28:26,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625697237] [2023-02-15 22:28:26,622 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:28:26,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2023-02-15 22:28:26,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:28:26,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2023-02-15 22:28:26,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=6267, Unknown=147, NotChecked=486, Total=7140 [2023-02-15 22:28:26,624 INFO L87 Difference]: Start difference. First operand 128 states and 141 transitions. Second operand has 73 states, 70 states have (on average 1.7857142857142858) internal successors, (125), 64 states have internal predecessors, (125), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 22:28:35,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:28:35,046 INFO L93 Difference]: Finished difference Result 183 states and 201 transitions. [2023-02-15 22:28:35,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-02-15 22:28:35,046 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 70 states have (on average 1.7857142857142858) internal successors, (125), 64 states have internal predecessors, (125), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 70 [2023-02-15 22:28:35,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:28:35,047 INFO L225 Difference]: With dead ends: 183 [2023-02-15 22:28:35,047 INFO L226 Difference]: Without dead ends: 183 [2023-02-15 22:28:35,048 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 50 SyntacticMatches, 6 SemanticMatches, 115 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 2416 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=980, Invalid=11767, Unknown=147, NotChecked=678, Total=13572 [2023-02-15 22:28:35,049 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 1514 mSDsluCounter, 1232 mSDsCounter, 0 mSdLazyCounter, 3035 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1514 SdHoareTripleChecker+Valid, 1266 SdHoareTripleChecker+Invalid, 3108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 3035 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-02-15 22:28:35,049 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1514 Valid, 1266 Invalid, 3108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 3035 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-02-15 22:28:35,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2023-02-15 22:28:35,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 128. [2023-02-15 22:28:35,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 107 states have (on average 1.2149532710280373) internal successors, (130), 121 states have internal predecessors, (130), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-15 22:28:35,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 140 transitions. [2023-02-15 22:28:35,052 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 140 transitions. Word has length 70 [2023-02-15 22:28:35,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:28:35,053 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 140 transitions. [2023-02-15 22:28:35,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 70 states have (on average 1.7857142857142858) internal successors, (125), 64 states have internal predecessors, (125), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 22:28:35,053 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 140 transitions. [2023-02-15 22:28:35,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-02-15 22:28:35,053 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:28:35,054 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1] [2023-02-15 22:28:35,065 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2023-02-15 22:28:35,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:28:35,262 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2023-02-15 22:28:35,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:28:35,262 INFO L85 PathProgramCache]: Analyzing trace with hash -563372747, now seen corresponding path program 1 times [2023-02-15 22:28:35,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:28:35,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158161243] [2023-02-15 22:28:35,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:28:35,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:28:35,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:37,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 22:28:37,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:37,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 22:28:37,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:37,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-15 22:28:37,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:38,822 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 22:28:38,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:28:38,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158161243] [2023-02-15 22:28:38,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158161243] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:28:38,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2046110128] [2023-02-15 22:28:38,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:28:38,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:28:38,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:28:38,824 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:28:38,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2023-02-15 22:28:39,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:39,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 597 conjuncts, 163 conjunts are in the unsatisfiable core [2023-02-15 22:28:39,198 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:28:39,204 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:28:39,264 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:28:39,409 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 22:28:39,410 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:28:39,832 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 22:28:39,833 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-15 22:28:40,011 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 22:28:40,025 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 22:28:40,136 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:28:40,136 INFO L350 Elim1Store]: Elim1 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 56 treesize of output 53 [2023-02-15 22:28:40,144 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2023-02-15 22:28:40,534 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:28:40,535 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 29 [2023-02-15 22:28:40,543 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:28:40,544 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 22:28:40,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:28:40,953 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-02-15 22:28:40,954 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 70 treesize of output 53 [2023-02-15 22:28:40,970 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-02-15 22:28:40,970 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2023-02-15 22:28:40,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:28:40,980 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-15 22:28:40,980 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 25 [2023-02-15 22:28:41,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:28:41,768 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:28:41,789 INFO L321 Elim1Store]: treesize reduction 97, result has 19.8 percent of original size [2023-02-15 22:28:41,789 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 135 treesize of output 81 [2023-02-15 22:28:41,806 INFO L321 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2023-02-15 22:28:41,807 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 134 treesize of output 124 [2023-02-15 22:28:41,944 INFO L321 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2023-02-15 22:28:41,944 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 281 treesize of output 190 [2023-02-15 22:28:41,961 INFO L321 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2023-02-15 22:28:41,961 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 248 treesize of output 202 [2023-02-15 22:28:42,761 INFO L321 Elim1Store]: treesize reduction 22, result has 12.0 percent of original size [2023-02-15 22:28:42,762 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 242 treesize of output 140 [2023-02-15 22:28:42,974 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:28:42,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:28:42,983 INFO L321 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2023-02-15 22:28:42,983 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 107 treesize of output 38 [2023-02-15 22:28:43,044 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 9 proven. 27 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 22:28:43,044 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:28:43,520 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6311 (Array Int Int)) (v_ArrVal_6312 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6312))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6311))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (+ .cse4 4))) (let ((.cse0 (select (select .cse5 .cse2) .cse3))) (or (<= (+ .cse0 1) 0) (not (= 0 (select (select .cse1 (select (select .cse1 .cse2) .cse3)) (+ .cse0 4)))) (not (<= 0 .cse4)))))))) is different from false [2023-02-15 22:28:43,884 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6311 (Array Int Int)) (v_ArrVal_6312 (Array Int Int)) (v_ArrVal_6309 (Array Int Int))) (let ((.cse7 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse7))) (let ((.cse5 (store (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_6309) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6312))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (store (store |c_#memory_$Pointer$.base| .cse6 (store (select |c_#memory_$Pointer$.base| .cse6) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse7) 4) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6311))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ .cse4 4))) (let ((.cse3 (select (select .cse5 .cse1) .cse2))) (or (not (= 0 (select (select .cse0 (select (select .cse0 .cse1) .cse2)) (+ .cse3 4)))) (<= (+ .cse3 1) 0) (not (<= 0 .cse4)))))))))) is different from false [2023-02-15 22:28:43,916 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6311 (Array Int Int)) (v_ArrVal_6312 (Array Int Int)) (v_ArrVal_6309 (Array Int Int))) (let ((.cse7 (+ |c_ULTIMATE.start_dll_append_#t~mem9#1.offset| 4))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) .cse7))) (let ((.cse5 (store (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_6309) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6312))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (store (store |c_#memory_$Pointer$.base| .cse6 (store (select |c_#memory_$Pointer$.base| .cse6) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) .cse7) 4) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6311))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ .cse4 4))) (let ((.cse3 (select (select .cse5 .cse1) .cse2))) (or (not (= 0 (select (select .cse0 (select (select .cse0 .cse1) .cse2)) (+ .cse3 4)))) (<= (+ .cse3 1) 0) (not (<= 0 .cse4)))))))))) is different from false [2023-02-15 22:28:43,931 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6311 (Array Int Int)) (v_ArrVal_6312 (Array Int Int)) (v_ArrVal_6309 (Array Int Int))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse8 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| .cse7) .cse8))) (let ((.cse5 (store (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_6309) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6312))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (store (store |c_#memory_$Pointer$.base| .cse6 (store (select |c_#memory_$Pointer$.base| .cse6) (+ (select (select |c_#memory_$Pointer$.offset| .cse7) .cse8) 4) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6311))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ .cse4 4))) (let ((.cse3 (select (select .cse5 .cse1) .cse2))) (or (not (= 0 (select (select .cse0 (select (select .cse0 .cse1) .cse2)) (+ .cse3 4)))) (<= (+ .cse3 1) 0) (not (<= 0 .cse4)))))))))) is different from false [2023-02-15 22:28:43,973 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6311 (Array Int Int)) (v_ArrVal_6312 (Array Int Int)) (v_ArrVal_6309 (Array Int Int))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse8 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| .cse7) .cse8))) (let ((.cse5 (store (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_6309) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_6312))) (let ((.cse0 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (store (store |c_#memory_$Pointer$.base| .cse6 (store (select |c_#memory_$Pointer$.base| .cse6) (+ (select (select |c_#memory_$Pointer$.offset| .cse7) .cse8) 4) |c_ULTIMATE.start_dll_append_#t~ret7#1.base|)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_6311))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (+ .cse0 4))) (let ((.cse1 (select (select .cse5 .cse3) .cse4))) (or (not (<= 0 .cse0)) (<= (+ .cse1 1) 0) (not (= 0 (select (select .cse2 (select (select .cse2 .cse3) .cse4)) (+ .cse1 4)))))))))))) is different from false [2023-02-15 22:28:44,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2046110128] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:28:44,327 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:28:44,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 36] total 70 [2023-02-15 22:28:44,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943829075] [2023-02-15 22:28:44,328 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:28:44,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2023-02-15 22:28:44,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:28:44,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2023-02-15 22:28:44,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=5784, Unknown=8, NotChecked=780, Total=6806 [2023-02-15 22:28:44,329 INFO L87 Difference]: Start difference. First operand 128 states and 140 transitions. Second operand has 70 states, 68 states have (on average 1.8823529411764706) internal successors, (128), 61 states have internal predecessors, (128), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 22:28:50,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:28:50,256 INFO L93 Difference]: Finished difference Result 187 states and 204 transitions. [2023-02-15 22:28:50,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-02-15 22:28:50,257 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 68 states have (on average 1.8823529411764706) internal successors, (128), 61 states have internal predecessors, (128), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 74 [2023-02-15 22:28:50,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:28:50,259 INFO L225 Difference]: With dead ends: 187 [2023-02-15 22:28:50,259 INFO L226 Difference]: Without dead ends: 187 [2023-02-15 22:28:50,260 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 56 SyntacticMatches, 10 SemanticMatches, 110 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 2382 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=842, Invalid=10512, Unknown=8, NotChecked=1070, Total=12432 [2023-02-15 22:28:50,260 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 1434 mSDsluCounter, 1634 mSDsCounter, 0 mSdLazyCounter, 2954 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1434 SdHoareTripleChecker+Valid, 1677 SdHoareTripleChecker+Invalid, 3003 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 2954 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:28:50,260 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1434 Valid, 1677 Invalid, 3003 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 2954 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-02-15 22:28:50,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2023-02-15 22:28:50,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 125. [2023-02-15 22:28:50,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 104 states have (on average 1.2115384615384615) internal successors, (126), 118 states have internal predecessors, (126), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-15 22:28:50,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 136 transitions. [2023-02-15 22:28:50,263 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 136 transitions. Word has length 74 [2023-02-15 22:28:50,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:28:50,263 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 136 transitions. [2023-02-15 22:28:50,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 68 states have (on average 1.8823529411764706) internal successors, (128), 61 states have internal predecessors, (128), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 22:28:50,264 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 136 transitions. [2023-02-15 22:28:50,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-02-15 22:28:50,264 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:28:50,265 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 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] [2023-02-15 22:28:50,276 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2023-02-15 22:28:50,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:28:50,476 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2023-02-15 22:28:50,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:28:50,476 INFO L85 PathProgramCache]: Analyzing trace with hash -563328045, now seen corresponding path program 1 times [2023-02-15 22:28:50,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:28:50,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888162076] [2023-02-15 22:28:50,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:28:50,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:28:50,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:52,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 22:28:52,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:53,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 22:28:53,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:53,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-15 22:28:53,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:54,372 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 4 proven. 32 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 22:28:54,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:28:54,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888162076] [2023-02-15 22:28:54,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888162076] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:28:54,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [757341526] [2023-02-15 22:28:54,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:28:54,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:28:54,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:28:54,374 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:28:54,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2023-02-15 22:28:54,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:54,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 594 conjuncts, 186 conjunts are in the unsatisfiable core [2023-02-15 22:28:54,758 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:28:54,762 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:28:55,045 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 22:28:55,045 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:28:55,186 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:28:55,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:28:55,268 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-15 22:28:55,869 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 22:28:55,869 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-02-15 22:28:55,873 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:28:55,900 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-02-15 22:28:55,900 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2023-02-15 22:28:56,101 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 16 [2023-02-15 22:28:56,188 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 22:28:56,198 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 22:28:56,209 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 16 [2023-02-15 22:28:56,346 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:28:56,347 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 100 treesize of output 91 [2023-02-15 22:28:56,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:28:56,356 INFO L350 Elim1Store]: Elim1 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 45 treesize of output 38 [2023-02-15 22:28:56,358 INFO L350 Elim1Store]: Elim1 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 22 treesize of output 24 [2023-02-15 22:28:57,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:28:57,369 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 22:28:57,369 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 91 treesize of output 73 [2023-02-15 22:28:57,383 INFO L321 Elim1Store]: treesize reduction 27, result has 48.1 percent of original size [2023-02-15 22:28:57,383 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 36 [2023-02-15 22:28:57,388 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:28:57,415 INFO L321 Elim1Store]: treesize reduction 28, result has 49.1 percent of original size [2023-02-15 22:28:57,416 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 42 [2023-02-15 22:28:57,422 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:28:57,450 INFO L321 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2023-02-15 22:28:57,450 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 37 [2023-02-15 22:28:58,404 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-02-15 22:28:58,404 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 178 treesize of output 137 [2023-02-15 22:28:58,427 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2023-02-15 22:28:58,427 INFO L350 Elim1Store]: Elim1 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 2 case distinctions, treesize of input 94 treesize of output 88 [2023-02-15 22:28:58,435 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:28:58,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:28:58,437 INFO L350 Elim1Store]: Elim1 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 71 treesize of output 56 [2023-02-15 22:28:58,581 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 22:28:58,581 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 89 treesize of output 71 [2023-02-15 22:28:58,589 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2023-02-15 22:28:58,594 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2023-02-15 22:28:59,382 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:28:59,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:28:59,385 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:28:59,386 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 97 treesize of output 49 [2023-02-15 22:28:59,394 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-15 22:28:59,394 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 18 [2023-02-15 22:28:59,554 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:28:59,628 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 10 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:28:59,628 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:29:01,120 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6620 (Array Int Int)) (v_ArrVal_6622 (Array Int Int)) (v_ArrVal_6625 (Array Int Int)) (v_ArrVal_6624 (Array Int Int)) (v_ArrVal_6621 Int) (v_ArrVal_6626 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_#t~mem10#1.base| v_ArrVal_6622) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6626))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_#t~mem10#1.base| v_ArrVal_6620) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6625))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ .cse4 4))) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_append_#t~mem10#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_append_#t~mem10#1.base|) (+ |c_ULTIMATE.start_dll_append_#t~mem10#1.offset| 4) v_ArrVal_6621)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6624) (select (select .cse0 .cse1) .cse2)) (select (select .cse3 .cse1) .cse2)))) |c_ULTIMATE.start_main_~data~0#1|) (not (<= 0 .cse4)))))) is different from false [2023-02-15 22:29:03,151 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6620 (Array Int Int)) (v_ArrVal_6622 (Array Int Int)) (v_ArrVal_6625 (Array Int Int)) (v_ArrVal_6624 (Array Int Int)) (v_ArrVal_6621 Int) (v_ArrVal_6626 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_dll_append_#t~mem9#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) .cse2))) (let ((.cse6 (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_6622) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6626))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse0)) (= (let ((.cse3 (store (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_6620) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6625))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (+ .cse0 4))) (select (select (store (store |c_#memory_int| .cse1 (store (select |c_#memory_int| .cse1) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) .cse2) 4) v_ArrVal_6621)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6624) (select (select .cse3 .cse4) .cse5)) (select (select .cse6 .cse4) .cse5)))) |c_ULTIMATE.start_main_~data~0#1|))))))) is different from false [2023-02-15 22:29:03,164 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6620 (Array Int Int)) (v_ArrVal_6622 (Array Int Int)) (v_ArrVal_6625 (Array Int Int)) (v_ArrVal_6624 (Array Int Int)) (v_ArrVal_6621 Int) (v_ArrVal_6626 (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse3 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse2) .cse3))) (let ((.cse7 (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_6622) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6626))) (let ((.cse0 (select (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse0)) (= (let ((.cse4 (store (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_6620) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6625))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (+ .cse0 4))) (select (select (store (store |c_#memory_int| .cse1 (store (select |c_#memory_int| .cse1) (+ (select (select |c_#memory_$Pointer$.offset| .cse2) .cse3) 4) v_ArrVal_6621)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6624) (select (select .cse4 .cse5) .cse6)) (select (select .cse7 .cse5) .cse6)))) |c_ULTIMATE.start_main_~data~0#1|))))))) is different from false [2023-02-15 22:29:03,192 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6620 (Array Int Int)) (v_ArrVal_6622 (Array Int Int)) (v_ArrVal_6625 (Array Int Int)) (v_ArrVal_6624 (Array Int Int)) (v_ArrVal_6621 Int) (v_ArrVal_6626 (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse3 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse2) .cse3))) (let ((.cse7 (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_6622) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_6626))) (let ((.cse0 (select (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse0)) (= (let ((.cse4 (store (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_6620) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_6625))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (+ .cse0 4))) (select (select (store (store |c_#memory_int| .cse1 (store (select |c_#memory_int| .cse1) (+ (select (select |c_#memory_$Pointer$.offset| .cse2) .cse3) 4) v_ArrVal_6621)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_6624) (select (select .cse4 .cse5) .cse6)) (select (select .cse7 .cse5) .cse6)))) |c_ULTIMATE.start_main_~data~0#1|))))))) is different from false [2023-02-15 22:29:03,285 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6641 (Array Int Int)) (v_ArrVal_6640 (Array Int Int)) (v_ArrVal_6620 (Array Int Int)) (|v_ULTIMATE.start_dll_append_#t~ret7#1.base_58| Int) (v_ArrVal_6622 (Array Int Int)) (v_ArrVal_6625 (Array Int Int)) (v_ArrVal_6624 (Array Int Int)) (v_ArrVal_6621 Int) (v_ArrVal_6626 (Array Int Int)) (v_ArrVal_6639 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_58| v_ArrVal_6640)) (.cse10 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_58| v_ArrVal_6639))) (let ((.cse3 (select (select .cse10 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse4 (+ (select (select .cse2 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse1 (select (select .cse10 .cse3) .cse4))) (let ((.cse8 (store (store .cse2 .cse1 v_ArrVal_6622) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_58| v_ArrVal_6626))) (let ((.cse9 (select (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (let ((.cse5 (store (store .cse10 .cse1 v_ArrVal_6620) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_58| v_ArrVal_6625))) (let ((.cse6 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (+ .cse9 4))) (select (select (store (let ((.cse0 (store |c_#memory_int| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_58| v_ArrVal_6641))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ (select (select .cse2 .cse3) .cse4) 4) v_ArrVal_6621))) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_58| v_ArrVal_6624) (select (select .cse5 .cse6) .cse7)) (select (select .cse8 .cse6) .cse7)))) |c_ULTIMATE.start_main_~data~0#1|) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_58|))) (not (<= 0 .cse9))))))))) is different from false [2023-02-15 22:29:03,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [757341526] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:29:03,287 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:29:03,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 38] total 78 [2023-02-15 22:29:03,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817212456] [2023-02-15 22:29:03,288 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:29:03,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 78 states [2023-02-15 22:29:03,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:29:03,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2023-02-15 22:29:03,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=6757, Unknown=97, NotChecked=850, Total=8010 [2023-02-15 22:29:03,289 INFO L87 Difference]: Start difference. First operand 125 states and 136 transitions. Second operand has 78 states, 76 states have (on average 1.763157894736842) internal successors, (134), 68 states have internal predecessors, (134), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 22:29:15,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:29:15,100 INFO L93 Difference]: Finished difference Result 185 states and 202 transitions. [2023-02-15 22:29:15,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-02-15 22:29:15,101 INFO L78 Accepts]: Start accepts. Automaton has has 78 states, 76 states have (on average 1.763157894736842) internal successors, (134), 68 states have internal predecessors, (134), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 74 [2023-02-15 22:29:15,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:29:15,102 INFO L225 Difference]: With dead ends: 185 [2023-02-15 22:29:15,102 INFO L226 Difference]: Without dead ends: 185 [2023-02-15 22:29:15,103 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 57 SyntacticMatches, 9 SemanticMatches, 124 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 2568 ImplicationChecksByTransitivity, 17.6s TimeCoverageRelationStatistics Valid=1189, Invalid=13252, Unknown=99, NotChecked=1210, Total=15750 [2023-02-15 22:29:15,103 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 1520 mSDsluCounter, 1759 mSDsCounter, 0 mSdLazyCounter, 3867 mSolverCounterSat, 79 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1520 SdHoareTripleChecker+Valid, 1797 SdHoareTripleChecker+Invalid, 3948 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 3867 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2023-02-15 22:29:15,103 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1520 Valid, 1797 Invalid, 3948 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 3867 Invalid, 2 Unknown, 0 Unchecked, 2.9s Time] [2023-02-15 22:29:15,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2023-02-15 22:29:15,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 129. [2023-02-15 22:29:15,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 108 states have (on average 1.2037037037037037) internal successors, (130), 122 states have internal predecessors, (130), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-15 22:29:15,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 140 transitions. [2023-02-15 22:29:15,108 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 140 transitions. Word has length 74 [2023-02-15 22:29:15,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:29:15,108 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 140 transitions. [2023-02-15 22:29:15,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 78 states, 76 states have (on average 1.763157894736842) internal successors, (134), 68 states have internal predecessors, (134), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 22:29:15,109 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 140 transitions. [2023-02-15 22:29:15,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-02-15 22:29:15,109 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:29:15,110 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:29:15,119 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2023-02-15 22:29:15,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:29:15,319 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2023-02-15 22:29:15,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:29:15,320 INFO L85 PathProgramCache]: Analyzing trace with hash 364845693, now seen corresponding path program 3 times [2023-02-15 22:29:15,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:29:15,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597970566] [2023-02-15 22:29:15,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:29:15,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:29:15,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:15,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 22:29:15,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:15,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 22:29:15,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:15,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-15 22:29:15,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:15,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-02-15 22:29:15,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:15,430 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 17 proven. 8 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2023-02-15 22:29:15,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:29:15,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597970566] [2023-02-15 22:29:15,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597970566] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:29:15,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [716123855] [2023-02-15 22:29:15,431 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-15 22:29:15,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:29:15,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:29:15,432 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:29:15,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2023-02-15 22:29:15,909 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-02-15 22:29:15,909 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 22:29:15,912 INFO L263 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 146 conjunts are in the unsatisfiable core [2023-02-15 22:29:15,917 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:29:16,017 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 22:29:16,055 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-02-15 22:29:16,055 INFO L350 Elim1Store]: Elim1 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 37 treesize of output 27 [2023-02-15 22:29:16,322 INFO L321 Elim1Store]: treesize reduction 60, result has 31.0 percent of original size [2023-02-15 22:29:16,323 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:29:16,332 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 22:29:16,333 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 41 [2023-02-15 22:29:16,433 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 22:29:16,434 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 41 [2023-02-15 22:29:16,507 INFO L321 Elim1Store]: treesize reduction 45, result has 16.7 percent of original size [2023-02-15 22:29:16,507 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 41 [2023-02-15 22:29:16,517 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 22:29:16,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:29:16,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:29:16,627 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:29:16,643 INFO L321 Elim1Store]: treesize reduction 61, result has 27.4 percent of original size [2023-02-15 22:29:16,643 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 109 treesize of output 84 [2023-02-15 22:29:16,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:29:16,651 INFO L350 Elim1Store]: Elim1 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 77 treesize of output 77 [2023-02-15 22:29:16,922 INFO L321 Elim1Store]: treesize reduction 35, result has 31.4 percent of original size [2023-02-15 22:29:16,922 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 100 treesize of output 54 [2023-02-15 22:29:16,928 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:29:16,928 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 22:29:16,934 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 22:29:16,934 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 10 [2023-02-15 22:29:17,098 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1)) (exists ((v_ArrVal_7003 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_7003))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_7004 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_7004))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-02-15 22:29:17,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:29:17,150 INFO L321 Elim1Store]: treesize reduction 90, result has 15.1 percent of original size [2023-02-15 22:29:17,150 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 106 treesize of output 88 [2023-02-15 22:29:17,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:29:17,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:29:17,158 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-15 22:29:17,159 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 30 [2023-02-15 22:29:17,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:29:17,199 INFO L321 Elim1Store]: treesize reduction 154, result has 33.0 percent of original size [2023-02-15 22:29:17,199 INFO L350 Elim1Store]: Elim1 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 51 treesize of output 93 [2023-02-15 22:29:17,736 INFO L321 Elim1Store]: treesize reduction 22, result has 12.0 percent of original size [2023-02-15 22:29:17,736 INFO L350 Elim1Store]: Elim1 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 31 [2023-02-15 22:29:17,968 INFO L321 Elim1Store]: treesize reduction 35, result has 31.4 percent of original size [2023-02-15 22:29:17,969 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 140 treesize of output 62 [2023-02-15 22:29:18,085 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 54 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 6 not checked. [2023-02-15 22:29:18,085 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:29:18,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [716123855] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:29:18,554 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:29:18,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 33] total 38 [2023-02-15 22:29:18,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903623499] [2023-02-15 22:29:18,554 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:29:18,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-02-15 22:29:18,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:29:18,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-02-15 22:29:18,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1920, Unknown=3, NotChecked=88, Total=2162 [2023-02-15 22:29:18,556 INFO L87 Difference]: Start difference. First operand 129 states and 140 transitions. Second operand has 38 states, 37 states have (on average 2.72972972972973) internal successors, (101), 33 states have internal predecessors, (101), 6 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) [2023-02-15 22:29:19,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:29:19,999 INFO L93 Difference]: Finished difference Result 100 states and 106 transitions. [2023-02-15 22:29:20,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-02-15 22:29:20,000 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.72972972972973) internal successors, (101), 33 states have internal predecessors, (101), 6 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) Word has length 75 [2023-02-15 22:29:20,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:29:20,000 INFO L225 Difference]: With dead ends: 100 [2023-02-15 22:29:20,001 INFO L226 Difference]: Without dead ends: 100 [2023-02-15 22:29:20,001 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 52 SyntacticMatches, 6 SemanticMatches, 61 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 951 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=274, Invalid=3506, Unknown=6, NotChecked=120, Total=3906 [2023-02-15 22:29:20,001 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 275 mSDsluCounter, 674 mSDsCounter, 0 mSdLazyCounter, 1115 mSolverCounterSat, 10 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 1222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1115 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 92 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-02-15 22:29:20,002 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 710 Invalid, 1222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1115 Invalid, 5 Unknown, 92 Unchecked, 0.8s Time] [2023-02-15 22:29:20,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-02-15 22:29:20,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 88. [2023-02-15 22:29:20,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 73 states have (on average 1.1917808219178083) internal successors, (87), 83 states have internal predecessors, (87), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 22:29:20,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 93 transitions. [2023-02-15 22:29:20,004 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 93 transitions. Word has length 75 [2023-02-15 22:29:20,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:29:20,004 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 93 transitions. [2023-02-15 22:29:20,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.72972972972973) internal successors, (101), 33 states have internal predecessors, (101), 6 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) [2023-02-15 22:29:20,004 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 93 transitions. [2023-02-15 22:29:20,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-02-15 22:29:20,005 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:29:20,005 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:29:20,014 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2023-02-15 22:29:20,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:29:20,214 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2023-02-15 22:29:20,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:29:20,214 INFO L85 PathProgramCache]: Analyzing trace with hash -192357779, now seen corresponding path program 2 times [2023-02-15 22:29:20,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:29:20,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142414156] [2023-02-15 22:29:20,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:29:20,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:29:20,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:24,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 22:29:24,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:24,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 22:29:24,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:25,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-15 22:29:25,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:26,184 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 7 proven. 33 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 22:29:26,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:29:26,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142414156] [2023-02-15 22:29:26,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142414156] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:29:26,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1837319801] [2023-02-15 22:29:26,185 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 22:29:26,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:29:26,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:29:26,186 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:29:26,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2023-02-15 22:29:26,647 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 22:29:26,647 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 22:29:26,650 INFO L263 TraceCheckSpWp]: Trace formula consists of 609 conjuncts, 165 conjunts are in the unsatisfiable core [2023-02-15 22:29:26,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:29:27,181 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:29:27,375 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 22:29:27,375 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:29:27,631 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 22:29:27,639 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 22:29:27,753 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:29:27,753 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 54 [2023-02-15 22:29:27,757 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2023-02-15 22:29:28,243 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:29:28,243 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 30 [2023-02-15 22:29:28,249 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:29:28,250 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 22:29:28,254 INFO L350 Elim1Store]: Elim1 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 11 treesize of output 7 [2023-02-15 22:29:28,347 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:29:29,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:29:29,049 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 22:29:29,049 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 59 [2023-02-15 22:29:29,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:29:29,072 INFO L321 Elim1Store]: treesize reduction 31, result has 35.4 percent of original size [2023-02-15 22:29:29,073 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 38 [2023-02-15 22:29:29,111 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-02-15 22:29:29,111 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2023-02-15 22:29:30,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:29:30,289 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:29:30,310 INFO L321 Elim1Store]: treesize reduction 103, result has 14.9 percent of original size [2023-02-15 22:29:30,310 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 171 treesize of output 93 [2023-02-15 22:29:30,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:29:30,321 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-02-15 22:29:30,321 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 93 treesize of output 78 [2023-02-15 22:29:30,481 INFO L321 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2023-02-15 22:29:30,481 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 266 treesize of output 197 [2023-02-15 22:29:30,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:29:30,509 INFO L321 Elim1Store]: treesize reduction 110, result has 20.3 percent of original size [2023-02-15 22:29:30,509 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 226 treesize of output 189 [2023-02-15 22:29:32,233 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:29:32,252 INFO L321 Elim1Store]: treesize reduction 81, result has 12.0 percent of original size [2023-02-15 22:29:32,252 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 10 new quantified variables, introduced 10 case distinctions, treesize of input 256 treesize of output 113 [2023-02-15 22:29:32,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:29:32,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:29:32,274 INFO L321 Elim1Store]: treesize reduction 37, result has 21.3 percent of original size [2023-02-15 22:29:32,274 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 7 case distinctions, treesize of input 56 treesize of output 40 [2023-02-15 22:29:32,486 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 20 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:29:32,487 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:29:33,789 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_34| Int) (v_ArrVal_7301 (Array Int Int)) (v_ArrVal_7302 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_7302))) (or (<= 0 (+ (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_7301))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_34| 4))) (select (select .cse0 (select (select .cse1 .cse2) .cse3)) (+ (select (select .cse0 .cse2) .cse3) 4)))) 4)) (not (<= 0 |v_ULTIMATE.start_main_~ptr~0#1.offset_34|)) (< (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |v_ULTIMATE.start_main_~ptr~0#1.offset_34|)))) (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_34| Int) (v_ArrVal_7301 (Array Int Int)) (v_ArrVal_7302 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_7302))) (or (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_7301))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse9 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_34| 4))) (let ((.cse5 (select (select .cse7 .cse8) .cse9)) (.cse6 (+ (select (select .cse4 .cse8) .cse9) 4))) (<= (+ (select (select .cse4 .cse5) .cse6) 8) (select |c_#length| (select (select .cse7 .cse5) .cse6)))))) (not (<= 0 |v_ULTIMATE.start_main_~ptr~0#1.offset_34|)) (< (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |v_ULTIMATE.start_main_~ptr~0#1.offset_34|))))) is different from false