./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 a31fd051 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-?-a31fd05 [2023-02-15 13:25:59,875 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 13:25:59,877 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 13:25:59,909 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 13:25:59,909 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 13:25:59,912 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 13:25:59,913 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 13:25:59,915 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 13:25:59,917 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 13:25:59,921 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 13:25:59,922 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 13:25:59,923 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 13:25:59,923 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 13:25:59,924 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 13:25:59,925 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 13:25:59,926 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 13:25:59,927 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 13:25:59,928 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 13:25:59,929 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 13:25:59,931 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 13:25:59,931 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 13:25:59,932 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 13:25:59,937 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 13:25:59,937 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 13:25:59,939 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 13:25:59,939 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 13:25:59,940 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 13:25:59,940 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 13:25:59,940 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 13:25:59,941 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 13:25:59,941 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 13:25:59,941 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 13:25:59,942 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 13:25:59,942 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 13:25:59,942 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 13:25:59,943 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 13:25:59,943 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 13:25:59,943 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 13:25:59,943 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 13:25:59,944 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 13:25:59,944 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 13:25:59,945 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-15 13:25:59,964 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 13:25:59,965 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 13:25:59,965 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 13:25:59,965 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 13:25:59,966 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 13:25:59,966 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 13:25:59,967 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 13:25:59,967 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 13:25:59,967 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 13:25:59,968 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 13:25:59,968 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 13:25:59,968 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 13:25:59,969 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 13:25:59,969 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 13:25:59,969 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 13:25:59,969 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-15 13:25:59,969 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-15 13:25:59,969 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-15 13:25:59,969 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 13:25:59,970 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 13:25:59,970 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 13:25:59,970 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 13:25:59,970 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 13:25:59,970 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 13:25:59,970 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 13:25:59,970 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 13:25:59,971 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 13:25:59,971 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 13:25:59,971 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 13:25:59,971 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 13:25:59,971 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 13:25:59,971 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 13:25:59,972 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 13:25:59,972 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 13:25:59,972 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 13:26:00,169 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 13:26:00,189 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 13:26:00,191 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 13:26:00,192 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 13:26:00,192 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 13:26:00,193 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 13:26:01,140 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 13:26:01,371 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 13:26:01,372 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_append_unequal.i [2023-02-15 13:26:01,380 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5a3212c9/4c32b723ce26431c84326b283d02418f/FLAGc45af3bb4 [2023-02-15 13:26:01,391 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5a3212c9/4c32b723ce26431c84326b283d02418f [2023-02-15 13:26:01,393 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 13:26:01,394 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 13:26:01,395 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 13:26:01,395 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 13:26:01,397 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 13:26:01,397 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:26:01" (1/1) ... [2023-02-15 13:26:01,399 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e59e939 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:26:01, skipping insertion in model container [2023-02-15 13:26:01,400 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:26:01" (1/1) ... [2023-02-15 13:26:01,404 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 13:26:01,442 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 13:26:01,611 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 13:26:01,618 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 13:26:01,628 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 13:26:01,678 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 13:26:01,689 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 13:26:01,710 INFO L208 MainTranslator]: Completed translation [2023-02-15 13:26:01,710 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:26:01 WrapperNode [2023-02-15 13:26:01,710 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 13:26:01,711 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 13:26:01,712 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 13:26:01,712 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 13:26:01,716 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:26:01" (1/1) ... [2023-02-15 13:26:01,734 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:26:01" (1/1) ... [2023-02-15 13:26:01,749 INFO L138 Inliner]: procedures = 127, calls = 40, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 141 [2023-02-15 13:26:01,749 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 13:26:01,750 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 13:26:01,750 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 13:26:01,750 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 13:26:01,756 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:26:01" (1/1) ... [2023-02-15 13:26:01,757 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:26:01" (1/1) ... [2023-02-15 13:26:01,761 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:26:01" (1/1) ... [2023-02-15 13:26:01,761 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:26:01" (1/1) ... [2023-02-15 13:26:01,766 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:26:01" (1/1) ... [2023-02-15 13:26:01,771 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:26:01" (1/1) ... [2023-02-15 13:26:01,772 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:26:01" (1/1) ... [2023-02-15 13:26:01,773 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:26:01" (1/1) ... [2023-02-15 13:26:01,775 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 13:26:01,776 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 13:26:01,776 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 13:26:01,776 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 13:26:01,777 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:26:01" (1/1) ... [2023-02-15 13:26:01,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 13:26:01,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:26:01,804 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 13:26:01,806 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 13:26:01,831 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-15 13:26:01,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-15 13:26:01,832 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-02-15 13:26:01,832 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-02-15 13:26:01,832 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 13:26:01,832 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 13:26:01,832 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-15 13:26:01,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-15 13:26:01,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-15 13:26:01,833 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 13:26:01,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-15 13:26:01,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 13:26:01,833 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 13:26:01,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 13:26:01,923 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 13:26:01,925 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 13:26:02,152 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 13:26:02,157 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 13:26:02,158 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2023-02-15 13:26:02,159 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:26:02 BoogieIcfgContainer [2023-02-15 13:26:02,159 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 13:26:02,161 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 13:26:02,161 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 13:26:02,163 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 13:26:02,163 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 01:26:01" (1/3) ... [2023-02-15 13:26:02,163 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d841e3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:26:02, skipping insertion in model container [2023-02-15 13:26:02,164 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:26:01" (2/3) ... [2023-02-15 13:26:02,164 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d841e3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:26:02, skipping insertion in model container [2023-02-15 13:26:02,164 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:26:02" (3/3) ... [2023-02-15 13:26:02,165 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_append_unequal.i [2023-02-15 13:26:02,176 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 13:26:02,177 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 47 error locations. [2023-02-15 13:26:02,205 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 13:26:02,209 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;@6af1c8a4, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 13:26:02,210 INFO L358 AbstractCegarLoop]: Starting to check reachability of 47 error locations. [2023-02-15 13:26:02,216 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 13:26:02,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-02-15 13:26:02,221 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:26:02,222 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:26:02,222 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 13:26:02,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:26:02,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1815964311, now seen corresponding path program 1 times [2023-02-15 13:26:02,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:26:02,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101343209] [2023-02-15 13:26:02,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:26:02,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:26:02,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:02,460 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 13:26:02,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:26:02,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101343209] [2023-02-15 13:26:02,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101343209] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:26:02,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:26:02,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 13:26:02,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99155362] [2023-02-15 13:26:02,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:26:02,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 13:26:02,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:26:02,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 13:26:02,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 13:26:02,526 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 13:26:02,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:26:02,643 INFO L93 Difference]: Finished difference Result 105 states and 115 transitions. [2023-02-15 13:26:02,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 13:26:02,645 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 13:26:02,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:26:02,650 INFO L225 Difference]: With dead ends: 105 [2023-02-15 13:26:02,650 INFO L226 Difference]: Without dead ends: 102 [2023-02-15 13:26:02,652 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 13:26:02,655 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 13:26:02,655 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 13:26:02,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-02-15 13:26:02,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2023-02-15 13:26:02,687 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 13:26:02,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 111 transitions. [2023-02-15 13:26:02,692 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 111 transitions. Word has length 7 [2023-02-15 13:26:02,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:26:02,693 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 111 transitions. [2023-02-15 13:26:02,693 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 13:26:02,693 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 111 transitions. [2023-02-15 13:26:02,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-02-15 13:26:02,694 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:26:02,694 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:26:02,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 13:26:02,694 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 13:26:02,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:26:02,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1815964312, now seen corresponding path program 1 times [2023-02-15 13:26:02,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:26:02,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274807552] [2023-02-15 13:26:02,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:26:02,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:26:02,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:02,824 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 13:26:02,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:26:02,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274807552] [2023-02-15 13:26:02,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274807552] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:26:02,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:26:02,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 13:26:02,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479936316] [2023-02-15 13:26:02,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:26:02,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 13:26:02,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:26:02,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 13:26:02,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 13:26:02,827 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 13:26:02,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:26:02,886 INFO L93 Difference]: Finished difference Result 99 states and 108 transitions. [2023-02-15 13:26:02,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 13:26:02,886 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 13:26:02,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:26:02,887 INFO L225 Difference]: With dead ends: 99 [2023-02-15 13:26:02,887 INFO L226 Difference]: Without dead ends: 99 [2023-02-15 13:26:02,887 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 13:26:02,888 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 5 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2023-02-15 13:26:02,889 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.0s Time] [2023-02-15 13:26:02,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-02-15 13:26:02,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2023-02-15 13:26:02,893 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 13:26:02,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 108 transitions. [2023-02-15 13:26:02,894 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 108 transitions. Word has length 7 [2023-02-15 13:26:02,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:26:02,894 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 108 transitions. [2023-02-15 13:26:02,894 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 13:26:02,895 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 108 transitions. [2023-02-15 13:26:02,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-15 13:26:02,895 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:26:02,895 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:26:02,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 13:26:02,896 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 13:26:02,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:26:02,896 INFO L85 PathProgramCache]: Analyzing trace with hash -418267899, now seen corresponding path program 1 times [2023-02-15 13:26:02,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:26:02,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436134652] [2023-02-15 13:26:02,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:26:02,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:26:02,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:03,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 13:26:03,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:03,154 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 13:26:03,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:26:03,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436134652] [2023-02-15 13:26:03,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436134652] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:26:03,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:26:03,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 13:26:03,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079838845] [2023-02-15 13:26:03,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:26:03,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 13:26:03,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:26:03,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 13:26:03,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-02-15 13:26:03,158 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 13:26:03,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:26:03,353 INFO L93 Difference]: Finished difference Result 102 states and 114 transitions. [2023-02-15 13:26:03,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 13:26:03,354 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 13:26:03,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:26:03,357 INFO L225 Difference]: With dead ends: 102 [2023-02-15 13:26:03,358 INFO L226 Difference]: Without dead ends: 102 [2023-02-15 13:26:03,360 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-02-15 13:26:03,363 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 18 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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 13:26:03,364 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 13:26:03,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-02-15 13:26:03,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 97. [2023-02-15 13:26:03,378 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 13:26:03,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 106 transitions. [2023-02-15 13:26:03,380 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 106 transitions. Word has length 14 [2023-02-15 13:26:03,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:26:03,380 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 106 transitions. [2023-02-15 13:26:03,380 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 13:26:03,381 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 106 transitions. [2023-02-15 13:26:03,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-15 13:26:03,381 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:26:03,381 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:26:03,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-15 13:26:03,381 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 13:26:03,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:26:03,382 INFO L85 PathProgramCache]: Analyzing trace with hash -418267900, now seen corresponding path program 1 times [2023-02-15 13:26:03,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:26:03,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630045665] [2023-02-15 13:26:03,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:26:03,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:26:03,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:03,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 13:26:03,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:03,493 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 13:26:03,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:26:03,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630045665] [2023-02-15 13:26:03,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630045665] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:26:03,494 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:26:03,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 13:26:03,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764785817] [2023-02-15 13:26:03,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:26:03,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 13:26:03,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:26:03,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 13:26:03,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-15 13:26:03,497 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 13:26:03,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:26:03,638 INFO L93 Difference]: Finished difference Result 100 states and 112 transitions. [2023-02-15 13:26:03,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 13:26:03,639 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 13:26:03,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:26:03,640 INFO L225 Difference]: With dead ends: 100 [2023-02-15 13:26:03,640 INFO L226 Difference]: Without dead ends: 100 [2023-02-15 13:26:03,641 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 13:26:03,647 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.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:26:03,648 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.1s Time] [2023-02-15 13:26:03,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-02-15 13:26:03,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 95. [2023-02-15 13:26:03,658 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 13:26:03,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 104 transitions. [2023-02-15 13:26:03,659 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 104 transitions. Word has length 14 [2023-02-15 13:26:03,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:26:03,659 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 104 transitions. [2023-02-15 13:26:03,660 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 13:26:03,660 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 104 transitions. [2023-02-15 13:26:03,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-15 13:26:03,661 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:26:03,661 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:26:03,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-15 13:26:03,661 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 13:26:03,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:26:03,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1186059880, now seen corresponding path program 1 times [2023-02-15 13:26:03,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:26:03,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568742303] [2023-02-15 13:26:03,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:26:03,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:26:03,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:03,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-15 13:26:03,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:03,723 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 13:26:03,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:26:03,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568742303] [2023-02-15 13:26:03,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568742303] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:26:03,723 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:26:03,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 13:26:03,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360018245] [2023-02-15 13:26:03,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:26:03,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 13:26:03,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:26:03,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 13:26:03,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 13:26:03,725 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 13:26:03,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:26:03,785 INFO L93 Difference]: Finished difference Result 105 states and 116 transitions. [2023-02-15 13:26:03,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 13:26:03,786 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 13:26:03,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:26:03,786 INFO L225 Difference]: With dead ends: 105 [2023-02-15 13:26:03,786 INFO L226 Difference]: Without dead ends: 105 [2023-02-15 13:26:03,786 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 13:26:03,787 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 9 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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 13:26:03,788 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 13:26:03,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-02-15 13:26:03,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 96. [2023-02-15 13:26:03,794 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 13:26:03,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 105 transitions. [2023-02-15 13:26:03,795 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 105 transitions. Word has length 16 [2023-02-15 13:26:03,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:26:03,795 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 105 transitions. [2023-02-15 13:26:03,795 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 13:26:03,796 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 105 transitions. [2023-02-15 13:26:03,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-15 13:26:03,796 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:26:03,796 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 13:26:03,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-15 13:26:03,797 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 13:26:03,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:26:03,797 INFO L85 PathProgramCache]: Analyzing trace with hash -918895952, now seen corresponding path program 1 times [2023-02-15 13:26:03,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:26:03,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721812532] [2023-02-15 13:26:03,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:26:03,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:26:03,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:03,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 13:26:03,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:03,865 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 13:26:03,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:26:03,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721812532] [2023-02-15 13:26:03,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721812532] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:26:03,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:26:03,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 13:26:03,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099030247] [2023-02-15 13:26:03,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:26:03,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 13:26:03,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:26:03,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 13:26:03,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 13:26:03,867 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 13:26:03,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:26:03,926 INFO L93 Difference]: Finished difference Result 102 states and 112 transitions. [2023-02-15 13:26:03,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 13:26:03,927 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 13:26:03,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:26:03,927 INFO L225 Difference]: With dead ends: 102 [2023-02-15 13:26:03,927 INFO L226 Difference]: Without dead ends: 102 [2023-02-15 13:26:03,928 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 13:26:03,928 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 1 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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 13:26:03,929 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 13:26:03,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-02-15 13:26:03,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2023-02-15 13:26:03,935 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 13:26:03,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 111 transitions. [2023-02-15 13:26:03,936 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 111 transitions. Word has length 17 [2023-02-15 13:26:03,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:26:03,937 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 111 transitions. [2023-02-15 13:26:03,937 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 13:26:03,937 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 111 transitions. [2023-02-15 13:26:03,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-15 13:26:03,938 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:26:03,938 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 13:26:03,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-15 13:26:03,938 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 13:26:03,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:26:03,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1802773707, now seen corresponding path program 1 times [2023-02-15 13:26:03,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:26:03,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350117070] [2023-02-15 13:26:03,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:26:03,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:26:03,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:04,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 13:26:04,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:04,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-15 13:26:04,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:04,025 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 13:26:04,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:26:04,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350117070] [2023-02-15 13:26:04,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350117070] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:26:04,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [52315034] [2023-02-15 13:26:04,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:26:04,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:26:04,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:26:04,029 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 13:26:04,034 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 13:26:04,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:04,147 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-15 13:26:04,152 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:26:04,208 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 13:26:04,208 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:26:04,245 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 13:26:04,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [52315034] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:26:04,246 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:26:04,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2023-02-15 13:26:04,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662585157] [2023-02-15 13:26:04,246 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:26:04,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 13:26:04,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:26:04,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 13:26:04,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-02-15 13:26:04,247 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 13:26:04,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:26:04,309 INFO L93 Difference]: Finished difference Result 103 states and 113 transitions. [2023-02-15 13:26:04,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 13:26:04,309 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 13:26:04,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:26:04,310 INFO L225 Difference]: With dead ends: 103 [2023-02-15 13:26:04,310 INFO L226 Difference]: Without dead ends: 103 [2023-02-15 13:26:04,310 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 13:26:04,313 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 9 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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 13:26:04,314 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 13:26:04,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-02-15 13:26:04,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2023-02-15 13:26:04,319 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 13:26:04,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 113 transitions. [2023-02-15 13:26:04,320 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 113 transitions. Word has length 31 [2023-02-15 13:26:04,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:26:04,320 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 113 transitions. [2023-02-15 13:26:04,320 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 13:26:04,321 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 113 transitions. [2023-02-15 13:26:04,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-02-15 13:26:04,322 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:26:04,323 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 13:26:04,341 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 13:26:04,529 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 13:26:04,529 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 13:26:04,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:26:04,530 INFO L85 PathProgramCache]: Analyzing trace with hash 916543363, now seen corresponding path program 1 times [2023-02-15 13:26:04,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:26:04,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153850868] [2023-02-15 13:26:04,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:26:04,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:26:04,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:04,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 13:26:04,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:04,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 13:26:04,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:04,744 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 13:26:04,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:26:04,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153850868] [2023-02-15 13:26:04,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153850868] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:26:04,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1261267327] [2023-02-15 13:26:04,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:26:04,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:26:04,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:26:04,746 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 13:26:04,748 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 13:26:04,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:04,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-15 13:26:04,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:26:04,883 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 13:26:04,937 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_510 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_510))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-02-15 13:26:05,004 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 13:26:05,005 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 13:26:05,011 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2023-02-15 13:26:05,011 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:26:05,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1261267327] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:26:05,049 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:26:05,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11 [2023-02-15 13:26:05,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432402575] [2023-02-15 13:26:05,050 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 13:26:05,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-15 13:26:05,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:26:05,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-15 13:26:05,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=107, Unknown=1, NotChecked=20, Total=156 [2023-02-15 13:26:05,051 INFO L87 Difference]: Start difference. First operand 103 states and 113 transitions. Second operand has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 9 states have internal predecessors, (38), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 13:26:05,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:26:05,293 INFO L93 Difference]: Finished difference Result 114 states and 125 transitions. [2023-02-15 13:26:05,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 13:26:05,293 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 9 states have internal predecessors, (38), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 32 [2023-02-15 13:26:05,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:26:05,294 INFO L225 Difference]: With dead ends: 114 [2023-02-15 13:26:05,294 INFO L226 Difference]: Without dead ends: 114 [2023-02-15 13:26:05,294 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 40 SyntacticMatches, 0 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 13:26:05,294 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 168 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 117 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:26:05,295 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 329 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 376 Invalid, 0 Unknown, 117 Unchecked, 0.2s Time] [2023-02-15 13:26:05,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2023-02-15 13:26:05,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 102. [2023-02-15 13:26:05,296 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 13:26:05,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 112 transitions. [2023-02-15 13:26:05,297 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 112 transitions. Word has length 32 [2023-02-15 13:26:05,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:26:05,297 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 112 transitions. [2023-02-15 13:26:05,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 9 states have internal predecessors, (38), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 13:26:05,297 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 112 transitions. [2023-02-15 13:26:05,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-02-15 13:26:05,298 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:26:05,298 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 13:26:05,307 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 13:26:05,505 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 13:26:05,505 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 13:26:05,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:26:05,506 INFO L85 PathProgramCache]: Analyzing trace with hash 916543364, now seen corresponding path program 1 times [2023-02-15 13:26:05,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:26:05,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706932461] [2023-02-15 13:26:05,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:26:05,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:26:05,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:05,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 13:26:05,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:05,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 13:26:05,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:05,950 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 13:26:05,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:26:05,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706932461] [2023-02-15 13:26:05,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706932461] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:26:05,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1286024810] [2023-02-15 13:26:05,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:26:05,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:26:05,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:26:05,952 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 13:26:05,954 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 13:26:06,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:06,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 32 conjunts are in the unsatisfiable core [2023-02-15 13:26:06,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:26:06,067 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 13:26:06,071 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 13:26:06,167 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_688 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_688))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-02-15 13:26:06,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:26:06,220 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 13:26:06,226 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 13:26:06,226 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 13:26:06,235 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2023-02-15 13:26:06,236 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:26:08,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1286024810] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:26:08,356 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:26:08,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 14 [2023-02-15 13:26:08,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021088650] [2023-02-15 13:26:08,356 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 13:26:08,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-15 13:26:08,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:26:08,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-15 13:26:08,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=201, Unknown=1, NotChecked=28, Total=272 [2023-02-15 13:26:08,357 INFO L87 Difference]: Start difference. First operand 102 states and 112 transitions. Second operand has 15 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 12 states have internal predecessors, (39), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 13:26:08,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:26:08,717 INFO L93 Difference]: Finished difference Result 102 states and 112 transitions. [2023-02-15 13:26:08,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-15 13:26:08,717 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 12 states have internal predecessors, (39), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 32 [2023-02-15 13:26:08,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:26:08,718 INFO L225 Difference]: With dead ends: 102 [2023-02-15 13:26:08,718 INFO L226 Difference]: Without dead ends: 102 [2023-02-15 13:26:08,718 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=76, Invalid=347, Unknown=1, NotChecked=38, Total=462 [2023-02-15 13:26:08,718 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 97 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 104 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 13:26:08,718 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 344 Invalid, 616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 508 Invalid, 0 Unknown, 104 Unchecked, 0.3s Time] [2023-02-15 13:26:08,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-02-15 13:26:08,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2023-02-15 13:26:08,720 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 13:26:08,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 111 transitions. [2023-02-15 13:26:08,720 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 111 transitions. Word has length 32 [2023-02-15 13:26:08,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:26:08,720 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 111 transitions. [2023-02-15 13:26:08,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 12 states have internal predecessors, (39), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 13:26:08,721 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 111 transitions. [2023-02-15 13:26:08,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-15 13:26:08,721 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:26:08,721 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 13:26:08,739 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 13:26:08,927 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 13:26:08,927 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 13:26:08,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:26:08,928 INFO L85 PathProgramCache]: Analyzing trace with hash -2135424312, now seen corresponding path program 2 times [2023-02-15 13:26:08,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:26:08,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823044005] [2023-02-15 13:26:08,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:26:08,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:26:08,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:09,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 13:26:09,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:09,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 13:26:09,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:09,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-02-15 13:26:09,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:09,063 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 13:26:09,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:26:09,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823044005] [2023-02-15 13:26:09,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823044005] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:26:09,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1012840446] [2023-02-15 13:26:09,064 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 13:26:09,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:26:09,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:26:09,065 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 13:26:09,067 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 13:26:09,194 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 13:26:09,194 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 13:26:09,196 INFO L263 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-15 13:26:09,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:26:09,236 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 13:26:09,237 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:26:09,290 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 13:26:09,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1012840446] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:26:09,290 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:26:09,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 8 [2023-02-15 13:26:09,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462237506] [2023-02-15 13:26:09,291 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:26:09,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 13:26:09,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:26:09,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 13:26:09,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-02-15 13:26:09,292 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 13:26:09,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:26:09,414 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2023-02-15 13:26:09,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 13:26:09,414 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 13:26:09,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:26:09,415 INFO L225 Difference]: With dead ends: 101 [2023-02-15 13:26:09,415 INFO L226 Difference]: Without dead ends: 101 [2023-02-15 13:26:09,415 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 92 SyntacticMatches, 5 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 13:26:09,415 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 13:26:09,415 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 13:26:09,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2023-02-15 13:26:09,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2023-02-15 13:26:09,417 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 13:26:09,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 110 transitions. [2023-02-15 13:26:09,417 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 110 transitions. Word has length 46 [2023-02-15 13:26:09,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:26:09,417 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 110 transitions. [2023-02-15 13:26:09,417 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 13:26:09,417 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 110 transitions. [2023-02-15 13:26:09,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-02-15 13:26:09,418 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:26:09,418 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 13:26:09,426 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 13:26:09,618 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 13:26:09,619 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 13:26:09,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:26:09,619 INFO L85 PathProgramCache]: Analyzing trace with hash 568631680, now seen corresponding path program 1 times [2023-02-15 13:26:09,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:26:09,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240052575] [2023-02-15 13:26:09,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:26:09,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:26:09,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:09,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 13:26:09,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:09,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 13:26:09,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:09,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-15 13:26:09,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:09,950 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 13:26:09,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:26:09,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240052575] [2023-02-15 13:26:09,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240052575] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:26:09,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1931698154] [2023-02-15 13:26:09,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:26:09,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:26:09,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:26:09,966 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 13:26:09,967 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 13:26:10,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:10,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-15 13:26:10,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:26:10,115 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 13:26:10,123 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 13:26:10,135 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_1169 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_1169))))) is different from true [2023-02-15 13:26:10,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:26:10,167 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 13:26:10,181 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 13:26:10,197 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:26:10,198 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 13:26:10,239 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:26:10,239 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 13:26:10,246 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 14 not checked. [2023-02-15 13:26:10,246 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:26:10,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1931698154] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:26:10,425 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:26:10,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 12 [2023-02-15 13:26:10,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829491349] [2023-02-15 13:26:10,425 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 13:26:10,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-15 13:26:10,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:26:10,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-15 13:26:10,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=121, Unknown=2, NotChecked=46, Total=210 [2023-02-15 13:26:10,426 INFO L87 Difference]: Start difference. First operand 101 states and 110 transitions. Second operand has 13 states, 12 states have (on average 4.083333333333333) internal successors, (49), 11 states have internal predecessors, (49), 3 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-15 13:26:10,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:26:10,642 INFO L93 Difference]: Finished difference Result 108 states and 118 transitions. [2023-02-15 13:26:10,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 13:26:10,642 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.083333333333333) internal successors, (49), 11 states have internal predecessors, (49), 3 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 47 [2023-02-15 13:26:10,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:26:10,643 INFO L225 Difference]: With dead ends: 108 [2023-02-15 13:26:10,643 INFO L226 Difference]: Without dead ends: 108 [2023-02-15 13:26:10,643 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 76 SyntacticMatches, 8 SemanticMatches, 15 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=162, Unknown=2, NotChecked=54, Total=272 [2023-02-15 13:26:10,644 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 148 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 206 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:26:10,644 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 294 Invalid, 556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 345 Invalid, 0 Unknown, 206 Unchecked, 0.2s Time] [2023-02-15 13:26:10,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-02-15 13:26:10,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 96. [2023-02-15 13:26:10,645 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 13:26:10,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 105 transitions. [2023-02-15 13:26:10,646 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 105 transitions. Word has length 47 [2023-02-15 13:26:10,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:26:10,646 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 105 transitions. [2023-02-15 13:26:10,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.083333333333333) internal successors, (49), 11 states have internal predecessors, (49), 3 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-15 13:26:10,646 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 105 transitions. [2023-02-15 13:26:10,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-02-15 13:26:10,646 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:26:10,646 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 13:26:10,654 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 13:26:10,847 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 13:26:10,847 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 13:26:10,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:26:10,847 INFO L85 PathProgramCache]: Analyzing trace with hash 568631681, now seen corresponding path program 1 times [2023-02-15 13:26:10,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:26:10,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678579019] [2023-02-15 13:26:10,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:26:10,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:26:10,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:11,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 13:26:11,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:11,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 13:26:11,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:11,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-15 13:26:11,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:11,322 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-02-15 13:26:11,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:26:11,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678579019] [2023-02-15 13:26:11,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678579019] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:26:11,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [685942002] [2023-02-15 13:26:11,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:26:11,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:26:11,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:26:11,324 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 13:26:11,326 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 13:26:11,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:11,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 26 conjunts are in the unsatisfiable core [2023-02-15 13:26:11,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:26:11,486 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 13:26:11,498 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 13:26:11,508 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_1422 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1422) |c_#length|)))) is different from true [2023-02-15 13:26:11,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:26:11,532 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 13:26:11,555 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 13:26:11,578 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_1423 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1423))))) is different from true [2023-02-15 13:26:11,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:26:11,607 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 13:26:11,653 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 13:26:11,658 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_1424 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1424))))) is different from true [2023-02-15 13:26:11,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:26:11,681 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 13:26:11,686 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 13:26:11,687 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:26:11,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [685942002] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:26:11,743 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:26:11,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 14 [2023-02-15 13:26:11,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755716865] [2023-02-15 13:26:11,744 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 13:26:11,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-15 13:26:11,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:26:11,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-15 13:26:11,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=147, Unknown=3, NotChecked=78, Total=272 [2023-02-15 13:26:11,745 INFO L87 Difference]: Start difference. First operand 96 states and 105 transitions. Second operand has 15 states, 13 states have (on average 4.0) internal successors, (52), 13 states have internal predecessors, (52), 3 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-15 13:26:11,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:26:11,965 INFO L93 Difference]: Finished difference Result 103 states and 113 transitions. [2023-02-15 13:26:11,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 13:26:11,966 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 4.0) internal successors, (52), 13 states have internal predecessors, (52), 3 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 47 [2023-02-15 13:26:11,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:26:11,966 INFO L225 Difference]: With dead ends: 103 [2023-02-15 13:26:11,966 INFO L226 Difference]: Without dead ends: 103 [2023-02-15 13:26:11,967 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=215, Unknown=3, NotChecked=96, Total=380 [2023-02-15 13:26:11,967 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 243 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 303 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:26:11,967 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 193 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 259 Invalid, 0 Unknown, 303 Unchecked, 0.2s Time] [2023-02-15 13:26:11,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-02-15 13:26:11,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 91. [2023-02-15 13:26:11,969 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 13:26:11,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 100 transitions. [2023-02-15 13:26:11,969 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 100 transitions. Word has length 47 [2023-02-15 13:26:11,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:26:11,969 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 100 transitions. [2023-02-15 13:26:11,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 4.0) internal successors, (52), 13 states have internal predecessors, (52), 3 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-15 13:26:11,969 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 100 transitions. [2023-02-15 13:26:11,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-15 13:26:11,970 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:26:11,970 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 13:26:11,984 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 13:26:12,170 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 13:26:12,170 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 13:26:12,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:26:12,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1941985862, now seen corresponding path program 1 times [2023-02-15 13:26:12,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:26:12,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930410384] [2023-02-15 13:26:12,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:26:12,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:26:12,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:12,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 13:26:12,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:12,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 13:26:12,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:12,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-15 13:26:12,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:12,705 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 13:26:12,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:26:12,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930410384] [2023-02-15 13:26:12,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930410384] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:26:12,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1176792292] [2023-02-15 13:26:12,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:26:12,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:26:12,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:26:12,707 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 13:26:12,709 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 13:26:12,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:12,867 INFO L263 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 44 conjunts are in the unsatisfiable core [2023-02-15 13:26:12,869 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:26:12,907 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 13:26:13,050 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 13:26:13,159 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_1676 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1676) |c_#memory_$Pointer$.base|)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1)))) is different from true [2023-02-15 13:26:13,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:26:13,174 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 13:26:13,182 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2023-02-15 13:26:13,182 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 13:26:13,245 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 13:26:13,255 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 13:26:13,256 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:26:13,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1176792292] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:26:13,345 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:26:13,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 27 [2023-02-15 13:26:13,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896981115] [2023-02-15 13:26:13,345 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 13:26:13,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-02-15 13:26:13,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:26:13,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-02-15 13:26:13,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=659, Unknown=15, NotChecked=52, Total=812 [2023-02-15 13:26:13,346 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 13:26:14,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:26:14,218 INFO L93 Difference]: Finished difference Result 143 states and 158 transitions. [2023-02-15 13:26:14,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-15 13:26:14,219 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 13:26:14,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:26:14,220 INFO L225 Difference]: With dead ends: 143 [2023-02-15 13:26:14,220 INFO L226 Difference]: Without dead ends: 143 [2023-02-15 13:26:14,220 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=225, Invalid=1242, Unknown=19, NotChecked=74, Total=1560 [2023-02-15 13:26:14,221 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 400 mSDsluCounter, 878 mSDsCounter, 0 mSdLazyCounter, 1197 mSolverCounterSat, 11 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 948 SdHoareTripleChecker+Invalid, 1363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1197 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 152 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-15 13:26:14,221 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 948 Invalid, 1363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1197 Invalid, 3 Unknown, 152 Unchecked, 0.6s Time] [2023-02-15 13:26:14,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2023-02-15 13:26:14,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 90. [2023-02-15 13:26:14,222 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 13:26:14,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 100 transitions. [2023-02-15 13:26:14,223 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 100 transitions. Word has length 51 [2023-02-15 13:26:14,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:26:14,223 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 100 transitions. [2023-02-15 13:26:14,223 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 13:26:14,223 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 100 transitions. [2023-02-15 13:26:14,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-15 13:26:14,223 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:26:14,223 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 13:26:14,240 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 13:26:14,437 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 13:26:14,437 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 13:26:14,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:26:14,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1941985863, now seen corresponding path program 1 times [2023-02-15 13:26:14,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:26:14,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569676319] [2023-02-15 13:26:14,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:26:14,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:26:14,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:14,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 13:26:14,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:14,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 13:26:14,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:14,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-15 13:26:14,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:15,360 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 13:26:15,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:26:15,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569676319] [2023-02-15 13:26:15,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569676319] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:26:15,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [459692448] [2023-02-15 13:26:15,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:26:15,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:26:15,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:26:15,362 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 13:26:15,380 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 13:26:15,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:15,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 73 conjunts are in the unsatisfiable core [2023-02-15 13:26:15,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:26:15,591 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 13:26:15,879 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 13:26:15,883 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 13:26:16,069 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_1934 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1934))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_1933 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_1933) |c_#memory_$Pointer$.offset|)) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_1928 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1928) |c_#length|)))) is different from true [2023-02-15 13:26:16,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:26:16,100 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 13:26:16,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:26:16,107 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 13:26:16,114 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-15 13:26:16,115 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 13:26:16,118 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 16 treesize of output 18 [2023-02-15 13: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 17 treesize of output 9 [2023-02-15 13: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 13:26:16,220 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 13:26:16,220 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:26:16,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [459692448] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:26:16,471 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:26:16,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 32 [2023-02-15 13:26:16,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749576337] [2023-02-15 13:26:16,472 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 13:26:16,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-02-15 13:26:16,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:26:16,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-02-15 13:26:16,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=1158, Unknown=2, NotChecked=68, Total=1332 [2023-02-15 13:26:16,473 INFO L87 Difference]: Start difference. First operand 90 states and 100 transitions. Second operand has 33 states, 30 states have (on average 2.7) internal successors, (81), 29 states have internal predecessors, (81), 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 13:26:18,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:26:18,202 INFO L93 Difference]: Finished difference Result 139 states and 153 transitions. [2023-02-15 13:26:18,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-02-15 13:26:18,203 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 30 states have (on average 2.7) internal successors, (81), 29 states have internal predecessors, (81), 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 13:26:18,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:26:18,203 INFO L225 Difference]: With dead ends: 139 [2023-02-15 13:26:18,204 INFO L226 Difference]: Without dead ends: 139 [2023-02-15 13:26:18,204 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 464 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=275, Invalid=2376, Unknown=5, NotChecked=100, Total=2756 [2023-02-15 13:26:18,205 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 588 mSDsluCounter, 1209 mSDsCounter, 0 mSdLazyCounter, 1548 mSolverCounterSat, 16 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 588 SdHoareTripleChecker+Valid, 1285 SdHoareTripleChecker+Invalid, 1705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1548 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 138 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-02-15 13:26:18,205 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [588 Valid, 1285 Invalid, 1705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1548 Invalid, 3 Unknown, 138 Unchecked, 1.0s Time] [2023-02-15 13:26:18,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2023-02-15 13:26:18,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 93. [2023-02-15 13:26:18,206 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 13:26:18,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 103 transitions. [2023-02-15 13:26:18,207 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 103 transitions. Word has length 51 [2023-02-15 13:26:18,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:26:18,207 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 103 transitions. [2023-02-15 13:26:18,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 30 states have (on average 2.7) internal successors, (81), 29 states have internal predecessors, (81), 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 13:26:18,207 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 103 transitions. [2023-02-15 13:26:18,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-02-15 13:26:18,208 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:26:18,208 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 13:26:18,213 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 13:26:18,413 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 13:26:18,414 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 13:26:18,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:26:18,414 INFO L85 PathProgramCache]: Analyzing trace with hash 2085671715, now seen corresponding path program 1 times [2023-02-15 13:26:18,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:26:18,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873159357] [2023-02-15 13:26:18,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:26:18,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:26:18,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:18,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 13:26:18,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:18,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 13:26:18,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:18,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-15 13:26:18,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:18,631 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 13:26:18,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:26:18,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873159357] [2023-02-15 13:26:18,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873159357] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:26:18,631 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:26:18,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-15 13:26:18,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058678962] [2023-02-15 13:26:18,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:26:18,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-15 13:26:18,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:26:18,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 13:26:18,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2023-02-15 13:26:18,633 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 13:26:18,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:26:18,840 INFO L93 Difference]: Finished difference Result 141 states and 157 transitions. [2023-02-15 13:26:18,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-15 13:26:18,840 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 13:26:18,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:26:18,841 INFO L225 Difference]: With dead ends: 141 [2023-02-15 13:26:18,841 INFO L226 Difference]: Without dead ends: 141 [2023-02-15 13:26:18,841 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 13:26:18,841 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 222 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:26:18,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 346 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 13:26:18,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2023-02-15 13:26:18,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 94. [2023-02-15 13:26:18,843 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 13:26:18,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 106 transitions. [2023-02-15 13:26:18,843 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 106 transitions. Word has length 53 [2023-02-15 13:26:18,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:26:18,843 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 106 transitions. [2023-02-15 13:26:18,843 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 13:26:18,843 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 106 transitions. [2023-02-15 13:26:18,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-02-15 13:26:18,844 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:26:18,844 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 13:26:18,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-02-15 13:26:18,844 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 13:26:18,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:26:18,844 INFO L85 PathProgramCache]: Analyzing trace with hash 2085671716, now seen corresponding path program 1 times [2023-02-15 13:26:18,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:26:18,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532550099] [2023-02-15 13:26:18,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:26:18,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:26:18,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:19,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 13:26:19,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:19,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 13:26:19,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:19,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-15 13:26:19,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:19,232 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 13:26:19,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:26:19,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532550099] [2023-02-15 13:26:19,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532550099] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:26:19,233 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:26:19,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-15 13:26:19,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228908892] [2023-02-15 13:26:19,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:26:19,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-15 13:26:19,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:26:19,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 13:26:19,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2023-02-15 13:26:19,234 INFO L87 Difference]: Start difference. First operand 94 states and 106 transitions. Second operand has 11 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 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 13:26:19,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:26:19,451 INFO L93 Difference]: Finished difference Result 151 states and 170 transitions. [2023-02-15 13:26:19,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-15 13:26:19,452 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 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 13:26:19,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:26:19,452 INFO L225 Difference]: With dead ends: 151 [2023-02-15 13:26:19,452 INFO L226 Difference]: Without dead ends: 151 [2023-02-15 13:26:19,452 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2023-02-15 13:26:19,453 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 282 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:26:19,453 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 376 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 13:26:19,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2023-02-15 13:26:19,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 100. [2023-02-15 13:26:19,454 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 13:26:19,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 114 transitions. [2023-02-15 13:26:19,455 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 114 transitions. Word has length 53 [2023-02-15 13:26:19,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:26:19,455 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 114 transitions. [2023-02-15 13:26:19,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 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 13:26:19,455 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 114 transitions. [2023-02-15 13:26:19,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-02-15 13:26:19,455 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:26:19,455 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 13:26:19,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-02-15 13:26:19,456 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 13:26:19,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:26:19,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1947352068, now seen corresponding path program 1 times [2023-02-15 13:26:19,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:26:19,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503060870] [2023-02-15 13:26:19,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:26:19,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:26:19,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:20,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 13:26:20,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:20,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 13:26:20,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:20,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-15 13:26:20,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:20,885 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 13:26:20,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:26:20,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503060870] [2023-02-15 13:26:20,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503060870] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:26:20,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1121561983] [2023-02-15 13:26:20,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:26:20,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:26:20,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:26:20,887 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 13:26:20,889 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 13:26:21,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:21,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 91 conjunts are in the unsatisfiable core [2023-02-15 13:26:21,072 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:26:21,104 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 13:26:21,322 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 13:26:21,322 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 13:26:21,409 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 13:26:21,467 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:26:21,467 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 13:26:21,646 INFO L321 Elim1Store]: treesize reduction 3, result has 83.3 percent of original size [2023-02-15 13:26:21,647 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 13:26:21,651 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 13:26:21,654 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 13:26:21,818 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_2519 (Array Int Int)) (v_ArrVal_2518 (Array Int Int))) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_2519) |c_#memory_$Pointer$.offset|) (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_2518) |c_#memory_$Pointer$.base|))) is different from true [2023-02-15 13:26:21,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:26:21,858 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 13:26:21,858 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 13:26:21,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:26:21,863 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 13:26:21,887 INFO L321 Elim1Store]: treesize reduction 94, result has 36.9 percent of original size [2023-02-15 13:26:21,887 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 13:26:21,941 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 13:26:22,058 INFO L321 Elim1Store]: treesize reduction 3, result has 78.6 percent of original size [2023-02-15 13:26:22,058 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 13:26:22,143 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2023-02-15 13:26:22,143 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:26:22,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1121561983] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:26:22,360 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:26:22,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 47 [2023-02-15 13:26:22,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155957046] [2023-02-15 13:26:22,361 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 13:26:22,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2023-02-15 13:26:22,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:26:22,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2023-02-15 13:26:22,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=2366, Unknown=1, NotChecked=98, Total=2652 [2023-02-15 13:26:22,362 INFO L87 Difference]: Start difference. First operand 100 states and 114 transitions. Second operand has 48 states, 45 states have (on average 2.0) internal successors, (90), 41 states have internal predecessors, (90), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 13:26:24,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:26:24,676 INFO L93 Difference]: Finished difference Result 152 states and 172 transitions. [2023-02-15 13:26:24,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-02-15 13:26:24,676 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 45 states have (on average 2.0) internal successors, (90), 41 states have internal predecessors, (90), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 55 [2023-02-15 13:26:24,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:26:24,677 INFO L225 Difference]: With dead ends: 152 [2023-02-15 13:26:24,677 INFO L226 Difference]: Without dead ends: 152 [2023-02-15 13:26:24,679 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 43 SyntacticMatches, 4 SemanticMatches, 68 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1182 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=503, Invalid=4192, Unknown=1, NotChecked=134, Total=4830 [2023-02-15 13:26:24,679 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 752 mSDsluCounter, 1711 mSDsCounter, 0 mSdLazyCounter, 2131 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 752 SdHoareTripleChecker+Valid, 1780 SdHoareTripleChecker+Invalid, 2296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 2131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 131 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:26:24,679 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [752 Valid, 1780 Invalid, 2296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 2131 Invalid, 0 Unknown, 131 Unchecked, 1.2s Time] [2023-02-15 13:26:24,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2023-02-15 13:26:24,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 102. [2023-02-15 13:26:24,681 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 13:26:24,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 117 transitions. [2023-02-15 13:26:24,682 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 117 transitions. Word has length 55 [2023-02-15 13:26:24,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:26:24,682 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 117 transitions. [2023-02-15 13:26:24,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 45 states have (on average 2.0) internal successors, (90), 41 states have internal predecessors, (90), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 13:26:24,682 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 117 transitions. [2023-02-15 13:26:24,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-02-15 13:26:24,683 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:26:24,683 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 13:26:24,688 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 13:26:24,888 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 13:26:24,888 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 13:26:24,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:26:24,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1947352067, now seen corresponding path program 1 times [2023-02-15 13:26:24,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:26:24,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708432427] [2023-02-15 13:26:24,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:26:24,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:26:24,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:25,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 13:26:25,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:25,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 13:26:25,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:25,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-15 13:26:25,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:26,681 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 13:26:26,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:26:26,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708432427] [2023-02-15 13:26:26,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708432427] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:26:26,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1096817110] [2023-02-15 13:26:26,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:26:26,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:26:26,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:26:26,682 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 13:26:26,685 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 13:26:26,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:26,867 INFO L263 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 116 conjunts are in the unsatisfiable core [2023-02-15 13:26:26,883 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:26:26,929 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 13:26:27,225 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 13:26:27,225 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 13:26:27,334 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 13:26:27,344 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 13:26:27,427 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:26:27,428 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 13:26:27,431 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 13:26:27,703 INFO L321 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2023-02-15 13:26:27,703 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 13:26:27,713 INFO L321 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2023-02-15 13:26:27,713 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 13:26:27,717 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 13:26:27,724 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 13:26:27,932 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_2790 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_2790) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2791 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_2791))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_2785 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_2785))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-02-15 13:26:27,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:26:27,967 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 13:26:27,967 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 13:26:27,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:26:27,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:26:27,975 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-15 13:26:27,976 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 13:26:27,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:26:27,990 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 42 treesize of output 44 [2023-02-15 13:26:28,006 INFO L321 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2023-02-15 13:26:28,007 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 13:26:28,267 INFO L321 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2023-02-15 13:26:28,267 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 13:26:28,274 INFO L321 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2023-02-15 13:26:28,275 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 13:26:28,282 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 13:26:28,282 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:26:28,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1096817110] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:26:28,674 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:26:28,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 26] total 51 [2023-02-15 13:26:28,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814404753] [2023-02-15 13:26:28,675 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 13:26:28,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2023-02-15 13:26:28,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:26:28,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2023-02-15 13:26:28,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=3014, Unknown=2, NotChecked=110, Total=3306 [2023-02-15 13:26:28,676 INFO L87 Difference]: Start difference. First operand 102 states and 117 transitions. Second operand has 52 states, 49 states have (on average 1.9387755102040816) internal successors, (95), 45 states have internal predecessors, (95), 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 13:26:33,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:26:33,070 INFO L93 Difference]: Finished difference Result 208 states and 235 transitions. [2023-02-15 13:26:33,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-02-15 13:26:33,070 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 49 states have (on average 1.9387755102040816) internal successors, (95), 45 states have internal predecessors, (95), 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 13:26:33,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:26:33,071 INFO L225 Difference]: With dead ends: 208 [2023-02-15 13:26:33,071 INFO L226 Difference]: Without dead ends: 208 [2023-02-15 13:26:33,073 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 78 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1300 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=564, Invalid=5600, Unknown=2, NotChecked=154, Total=6320 [2023-02-15 13:26:33,073 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 1004 mSDsluCounter, 1786 mSDsCounter, 0 mSdLazyCounter, 3256 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1004 SdHoareTripleChecker+Valid, 1846 SdHoareTripleChecker+Invalid, 3487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 3256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 188 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-02-15 13:26:33,073 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1004 Valid, 1846 Invalid, 3487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 3256 Invalid, 0 Unknown, 188 Unchecked, 2.0s Time] [2023-02-15 13:26:33,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2023-02-15 13:26:33,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 104. [2023-02-15 13:26:33,075 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 13:26:33,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 119 transitions. [2023-02-15 13:26:33,076 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 119 transitions. Word has length 55 [2023-02-15 13:26:33,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:26:33,076 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 119 transitions. [2023-02-15 13:26:33,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 49 states have (on average 1.9387755102040816) internal successors, (95), 45 states have internal predecessors, (95), 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 13:26:33,076 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 119 transitions. [2023-02-15 13:26:33,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-02-15 13:26:33,077 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:26:33,077 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 13:26:33,083 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 13:26:33,282 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 13:26:33,283 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 13:26:33,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:26:33,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1045714181, now seen corresponding path program 1 times [2023-02-15 13:26:33,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:26:33,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962668931] [2023-02-15 13:26:33,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:26:33,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:26:33,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:33,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 13:26:33,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:33,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 13:26:33,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:33,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-15 13:26:33,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:33,660 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 13:26:33,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:26:33,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962668931] [2023-02-15 13:26:33,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962668931] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:26:33,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1466611957] [2023-02-15 13:26:33,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:26:33,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:26:33,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:26:33,662 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 13:26:33,664 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 13:26:33,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:33,863 INFO L263 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 34 conjunts are in the unsatisfiable core [2023-02-15 13:26:33,864 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:26:34,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 13:26:34,130 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3063 (Array Int Int)) (|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_3063) |c_#memory_$Pointer$.base|) (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|))) is different from true [2023-02-15 13:26:34,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:26:34,142 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 13:26:34,164 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 13:26:34,179 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 13:26:34,179 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:26:34,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1466611957] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:26:34,254 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:26:34,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 26 [2023-02-15 13:26:34,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365660872] [2023-02-15 13:26:34,254 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 13:26:34,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-02-15 13:26:34,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:26:34,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-02-15 13:26:34,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=616, Unknown=3, NotChecked=50, Total=756 [2023-02-15 13:26:34,255 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 13:26:34,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:26:34,703 INFO L93 Difference]: Finished difference Result 92 states and 103 transitions. [2023-02-15 13:26:34,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-15 13:26:34,703 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 13:26:34,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:26:34,704 INFO L225 Difference]: With dead ends: 92 [2023-02-15 13:26:34,704 INFO L226 Difference]: Without dead ends: 92 [2023-02-15 13:26:34,704 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 56 SyntacticMatches, 7 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=176, Invalid=1015, Unknown=3, NotChecked=66, Total=1260 [2023-02-15 13:26:34,705 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 283 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 87 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:26:34,705 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 574 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 464 Invalid, 0 Unknown, 87 Unchecked, 0.2s Time] [2023-02-15 13:26:34,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2023-02-15 13:26:34,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2023-02-15 13:26:34,707 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 13:26:34,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 103 transitions. [2023-02-15 13:26:34,709 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 103 transitions. Word has length 56 [2023-02-15 13:26:34,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:26:34,710 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 103 transitions. [2023-02-15 13:26:34,710 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 13:26:34,710 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 103 transitions. [2023-02-15 13:26:34,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-02-15 13:26:34,710 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:26:34,710 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 13:26:34,729 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 13:26:34,916 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 13:26:34,917 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 13:26:34,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:26:34,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1285343071, now seen corresponding path program 1 times [2023-02-15 13:26:34,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:26:34,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741938984] [2023-02-15 13:26:34,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:26:34,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:26:34,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:35,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 13:26:35,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:35,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 13:26:35,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:35,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-15 13:26:35,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:35,516 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 13:26:35,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:26:35,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741938984] [2023-02-15 13:26:35,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741938984] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:26:35,516 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:26:35,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2023-02-15 13:26:35,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627728883] [2023-02-15 13:26:35,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:26:35,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-02-15 13:26:35,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:26:35,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-02-15 13:26:35,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=450, Unknown=0, NotChecked=0, Total=506 [2023-02-15 13:26:35,517 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 13:26:36,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:26:36,290 INFO L93 Difference]: Finished difference Result 157 states and 174 transitions. [2023-02-15 13:26:36,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-02-15 13:26:36,290 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 13:26:36,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:26:36,291 INFO L225 Difference]: With dead ends: 157 [2023-02-15 13:26:36,291 INFO L226 Difference]: Without dead ends: 157 [2023-02-15 13:26:36,291 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=229, Invalid=1177, Unknown=0, NotChecked=0, Total=1406 [2023-02-15 13:26:36,293 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 927 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 814 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 928 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 814 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 13:26:36,293 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [928 Valid, 479 Invalid, 837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 814 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-15 13:26:36,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2023-02-15 13:26:36,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 98. [2023-02-15 13:26:36,296 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 13:26:36,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 110 transitions. [2023-02-15 13:26:36,297 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 110 transitions. Word has length 58 [2023-02-15 13:26:36,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:26:36,297 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 110 transitions. [2023-02-15 13:26:36,297 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 13:26:36,297 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 110 transitions. [2023-02-15 13:26:36,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-02-15 13:26:36,298 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:26:36,298 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 13:26:36,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-02-15 13:26:36,298 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 13:26:36,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:26:36,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1285343072, now seen corresponding path program 1 times [2023-02-15 13:26:36,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:26:36,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535000457] [2023-02-15 13:26:36,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:26:36,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:26:36,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:36,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 13:26:36,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:36,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 13:26:36,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:36,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-15 13:26:36,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:37,315 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 13:26:37,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:26:37,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535000457] [2023-02-15 13:26:37,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535000457] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:26:37,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1989950699] [2023-02-15 13:26:37,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:26:37,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:26:37,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:26:37,317 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 13:26:37,319 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 13:26:37,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:37,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 517 conjuncts, 98 conjunts are in the unsatisfiable core [2023-02-15 13:26:37,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:26:37,552 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 13:26:37,588 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 13:26:37,665 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:26:37,666 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 13:26:37,786 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 13:26:37,866 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 13:26:37,867 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 13:26:38,100 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 13:26:38,103 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 8 treesize of output 4 [2023-02-15 13:26:38,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:26:38,277 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 17 treesize of output 12 [2023-02-15 13:26:38,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:26:38,285 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 13:26:38,571 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:26:38,571 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 13:26:38,576 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 13:26:38,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:26:38,640 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 30 treesize of output 30 [2023-02-15 13:26:38,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:26:38,643 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 13:26:38,706 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 31 treesize of output 19 [2023-02-15 13:26:38,708 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 26 treesize of output 14 [2023-02-15 13:26:38,722 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 13:26:38,722 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:26:39,062 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:26:39,063 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 13:26:39,087 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3510 (Array Int Int)) (v_ArrVal_3512 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_3510) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_3512) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (forall ((v_prenex_8 (Array Int Int)) (v_prenex_7 (Array Int Int))) (< (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|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 1))) (forall ((v_ArrVal_3509 (Array Int Int)) (v_ArrVal_3511 (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_3509) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_3511) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2023-02-15 13:26:39,549 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_29| Int)) (or (forall ((v_prenex_8 (Array Int Int)) (v_ArrVal_3521 (Array Int Int)) (v_ArrVal_3522 (Array Int Int)) (v_prenex_7 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_29| v_ArrVal_3522))) (< (select (select (store (store .cse0 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_29| v_ArrVal_3521) |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) v_prenex_7) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_29| v_prenex_8) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (+ (select (select .cse0 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 1)))) (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_29| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_29| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_29| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_3509 (Array Int Int)) (v_ArrVal_3521 (Array Int Int)) (v_ArrVal_3511 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_29| v_ArrVal_3521))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (= (select (select (store (store .cse1 .cse2 v_ArrVal_3509) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_29| v_ArrVal_3511) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) .cse2)))))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_29| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_29| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_3521 (Array Int Int)) (v_ArrVal_3510 (Array Int Int)) (v_ArrVal_3522 (Array Int Int)) (v_ArrVal_3512 (Array Int Int))) (<= 0 (+ 4 (select (select (store (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_29| v_ArrVal_3522) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_29| v_ArrVal_3521) |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) v_ArrVal_3510) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_29| v_ArrVal_3512) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) is different from false [2023-02-15 13:26:39,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1989950699] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:26:39,551 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:26:39,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 27] total 44 [2023-02-15 13:26:39,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115217900] [2023-02-15 13:26:39,551 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 13:26:39,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2023-02-15 13:26:39,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:26:39,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-02-15 13:26:39,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=2553, Unknown=47, NotChecked=206, Total=2970 [2023-02-15 13:26:39,553 INFO L87 Difference]: Start difference. First operand 98 states and 110 transitions. Second operand has 45 states, 42 states have (on average 2.261904761904762) internal successors, (95), 37 states have internal predecessors, (95), 4 states have call successors, (4), 3 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 13:26:41,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:26:41,379 INFO L93 Difference]: Finished difference Result 192 states and 214 transitions. [2023-02-15 13:26:41,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-02-15 13:26:41,379 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 42 states have (on average 2.261904761904762) internal successors, (95), 37 states have internal predecessors, (95), 4 states have call successors, (4), 3 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 58 [2023-02-15 13:26:41,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:26:41,380 INFO L225 Difference]: With dead ends: 192 [2023-02-15 13:26:41,380 INFO L226 Difference]: Without dead ends: 192 [2023-02-15 13:26:41,381 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 39 SyntacticMatches, 6 SemanticMatches, 73 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1070 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=560, Invalid=4657, Unknown=47, NotChecked=286, Total=5550 [2023-02-15 13:26:41,381 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 1502 mSDsluCounter, 934 mSDsCounter, 0 mSdLazyCounter, 1653 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1502 SdHoareTripleChecker+Valid, 972 SdHoareTripleChecker+Invalid, 1689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-02-15 13:26:41,382 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1502 Valid, 972 Invalid, 1689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1653 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-02-15 13:26:41,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2023-02-15 13:26:41,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 105. [2023-02-15 13:26:41,384 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 13:26:41,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 119 transitions. [2023-02-15 13:26:41,385 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 119 transitions. Word has length 58 [2023-02-15 13:26:41,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:26:41,385 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 119 transitions. [2023-02-15 13:26:41,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 42 states have (on average 2.261904761904762) internal successors, (95), 37 states have internal predecessors, (95), 4 states have call successors, (4), 3 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 13:26:41,385 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 119 transitions. [2023-02-15 13:26:41,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-02-15 13:26:41,385 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:26:41,386 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 13:26:41,393 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-02-15 13:26:41,591 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 13:26:41,592 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 13:26:41,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:26:41,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1757191502, now seen corresponding path program 2 times [2023-02-15 13:26:41,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:26:41,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046550662] [2023-02-15 13:26:41,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:26:41,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:26:41,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:43,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 13:26:43,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:43,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 13:26:43,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:43,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-15 13:26:43,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:44,208 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 13:26:44,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:26:44,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046550662] [2023-02-15 13:26:44,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046550662] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:26:44,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [21600843] [2023-02-15 13:26:44,208 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 13:26:44,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:26:44,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:26:44,209 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 13:26:44,210 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 13:26:44,437 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 13:26:44,437 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 13:26:44,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 148 conjunts are in the unsatisfiable core [2023-02-15 13:26:44,445 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:26:44,491 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 13:26:44,640 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 13:26:44,647 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 13:26:45,036 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 13:26:45,036 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-02-15 13:26:45,048 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 13:26:45,048 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 13:26:45,054 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 13:26:45,202 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 13:26:45,210 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 13:26:45,277 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 13:26:45,286 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 13:26:45,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:26:45,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:26:45,374 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:26:45,376 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 13:26:45,376 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 13:26:45,387 INFO L321 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2023-02-15 13:26:45,387 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 13:26:45,714 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 13:26:45,714 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 13:26:45,718 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 13:26:45,724 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:26:45,724 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 13:26:45,862 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_3792 (Array Int Int)) (v_ArrVal_3793 (Array Int Int))) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_3793)) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_3792)))) is different from true [2023-02-15 13:26:45,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:26:45,897 INFO L321 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2023-02-15 13:26:45,898 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 13:26:45,912 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-02-15 13:26:45,912 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 13:26:45,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:26:45,919 INFO L321 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2023-02-15 13:26:45,919 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 13:26:46,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:26:46,390 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:26:46,408 INFO L321 Elim1Store]: treesize reduction 67, result has 9.5 percent of original size [2023-02-15 13:26:46,408 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 13:26:46,419 INFO L321 Elim1Store]: treesize reduction 34, result has 17.1 percent of original size [2023-02-15 13:26:46,419 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 13:26:46,463 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 6 proven. 26 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2023-02-15 13:26:46,463 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:26:46,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [21600843] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:26:46,926 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:26:46,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 30] total 56 [2023-02-15 13:26:46,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923804762] [2023-02-15 13:26:46,926 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 13:26:46,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2023-02-15 13:26:46,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:26:46,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2023-02-15 13:26:46,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=3484, Unknown=2, NotChecked=118, Total=3782 [2023-02-15 13:26:46,928 INFO L87 Difference]: Start difference. First operand 105 states and 119 transitions. Second operand has 56 states, 54 states have (on average 1.8148148148148149) internal successors, (98), 50 states have internal predecessors, (98), 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 13:26:49,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:26:49,576 INFO L93 Difference]: Finished difference Result 130 states and 149 transitions. [2023-02-15 13:26:49,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-02-15 13:26:49,576 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 54 states have (on average 1.8148148148148149) internal successors, (98), 50 states have internal predecessors, (98), 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 13:26:49,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:26:49,577 INFO L225 Difference]: With dead ends: 130 [2023-02-15 13:26:49,577 INFO L226 Difference]: Without dead ends: 130 [2023-02-15 13:26:49,578 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 50 SyntacticMatches, 6 SemanticMatches, 81 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1537 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=367, Invalid=6277, Unknown=2, NotChecked=160, Total=6806 [2023-02-15 13:26:49,579 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 52 mSDsluCounter, 1590 mSDsCounter, 0 mSdLazyCounter, 2025 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 1653 SdHoareTripleChecker+Invalid, 2149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2025 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 113 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-02-15 13:26:49,579 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 1653 Invalid, 2149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2025 Invalid, 0 Unknown, 113 Unchecked, 1.4s Time] [2023-02-15 13:26:49,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2023-02-15 13:26:49,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 127. [2023-02-15 13:26:49,581 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 13:26:49,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 145 transitions. [2023-02-15 13:26:49,582 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 145 transitions. Word has length 59 [2023-02-15 13:26:49,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:26:49,582 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 145 transitions. [2023-02-15 13:26:49,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 54 states have (on average 1.8148148148148149) internal successors, (98), 50 states have internal predecessors, (98), 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 13:26:49,582 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 145 transitions. [2023-02-15 13:26:49,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-02-15 13:26:49,583 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:26:49,583 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 13:26:49,601 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 13:26:49,801 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 13:26:49,801 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 13:26:49,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:26:49,801 INFO L85 PathProgramCache]: Analyzing trace with hash 2022079807, now seen corresponding path program 1 times [2023-02-15 13:26:49,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:26:49,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871033705] [2023-02-15 13:26:49,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:26:49,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:26:49,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:50,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 13:26:50,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:50,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 13:26:50,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:50,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-15 13:26:50,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:51,012 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 13:26:51,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:26:51,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871033705] [2023-02-15 13:26:51,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871033705] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:26:51,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1472893100] [2023-02-15 13:26:51,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:26:51,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:26:51,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:26:51,014 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 13:26:51,014 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 13:26:51,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:51,267 INFO L263 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 92 conjunts are in the unsatisfiable core [2023-02-15 13:26:51,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:26:51,298 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 13:26:51,560 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 13:26:51,560 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 13:26:51,656 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 13:26:51,714 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:26:51,714 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 13:26:51,911 INFO L321 Elim1Store]: treesize reduction 3, result has 83.3 percent of original size [2023-02-15 13:26:51,911 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 69 treesize of output 37 [2023-02-15 13:26:51,919 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 13:26:51,922 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 13:26:52,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:26:52,113 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-02-15 13:26:52,113 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 77 treesize of output 62 [2023-02-15 13:26:52,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:26:52,127 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 68 treesize of output 59 [2023-02-15 13:26:52,143 INFO L321 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2023-02-15 13:26:52,143 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 34 treesize of output 36 [2023-02-15 13:26:52,262 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 48 treesize of output 36 [2023-02-15 13:26:52,354 INFO L321 Elim1Store]: treesize reduction 3, result has 78.6 percent of original size [2023-02-15 13:26:52,355 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 46 treesize of output 26 [2023-02-15 13:26:52,384 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:26:52,385 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:26:52,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1472893100] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:26:52,598 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:26:52,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27] total 51 [2023-02-15 13:26:52,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142746397] [2023-02-15 13:26:52,598 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 13:26:52,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2023-02-15 13:26:52,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:26:52,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2023-02-15 13:26:52,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=2785, Unknown=1, NotChecked=0, Total=2970 [2023-02-15 13:26:52,600 INFO L87 Difference]: Start difference. First operand 127 states and 145 transitions. Second operand has 51 states, 49 states have (on average 1.9591836734693877) internal successors, (96), 43 states have internal predecessors, (96), 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 13:26:55,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:26:55,009 INFO L93 Difference]: Finished difference Result 126 states and 140 transitions. [2023-02-15 13:26:55,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-02-15 13:26:55,009 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 49 states have (on average 1.9591836734693877) internal successors, (96), 43 states have internal predecessors, (96), 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 61 [2023-02-15 13:26:55,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:26:55,010 INFO L225 Difference]: With dead ends: 126 [2023-02-15 13:26:55,010 INFO L226 Difference]: Without dead ends: 126 [2023-02-15 13:26:55,011 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 52 SyntacticMatches, 4 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1423 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=527, Invalid=5022, Unknown=1, NotChecked=0, Total=5550 [2023-02-15 13:26:55,011 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 586 mSDsluCounter, 1108 mSDsCounter, 0 mSdLazyCounter, 1544 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 586 SdHoareTripleChecker+Valid, 1153 SdHoareTripleChecker+Invalid, 1583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-02-15 13:26:55,012 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [586 Valid, 1153 Invalid, 1583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1544 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-02-15 13:26:55,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2023-02-15 13:26:55,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 114. [2023-02-15 13:26:55,014 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 13:26:55,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 127 transitions. [2023-02-15 13:26:55,014 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 127 transitions. Word has length 61 [2023-02-15 13:26:55,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:26:55,014 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 127 transitions. [2023-02-15 13:26:55,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 49 states have (on average 1.9591836734693877) internal successors, (96), 43 states have internal predecessors, (96), 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 13:26:55,015 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 127 transitions. [2023-02-15 13:26:55,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-02-15 13:26:55,015 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:26:55,015 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 13:26:55,021 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-02-15 13:26:55,221 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 13:26:55,222 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 13:26:55,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:26:55,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1296901353, now seen corresponding path program 1 times [2023-02-15 13:26:55,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:26:55,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158539803] [2023-02-15 13:26:55,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:26:55,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:26:55,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:55,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 13:26:55,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:55,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 13:26:55,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:55,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-15 13:26:55,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:56,103 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 13:26:56,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:26:56,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158539803] [2023-02-15 13:26:56,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158539803] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:26:56,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [319905585] [2023-02-15 13:26:56,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:26:56,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:26:56,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:26:56,105 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 13:26:56,106 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 13:26:56,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:56,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 104 conjunts are in the unsatisfiable core [2023-02-15 13:26:56,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:26:56,390 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 13:26:56,568 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 13:26:56,675 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 13:26:56,675 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 13:26:56,776 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 13:26:56,855 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:26:56,855 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 42 [2023-02-15 13:26:57,090 INFO L321 Elim1Store]: treesize reduction 3, result has 83.3 percent of original size [2023-02-15 13:26:57,090 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 68 treesize of output 36 [2023-02-15 13:26:57,094 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 13:26:57,099 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 13:26:57,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:26:57,454 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 13:26:57,454 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 76 treesize of output 68 [2023-02-15 13:26:57,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:26:57,459 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 67 treesize of output 65 [2023-02-15 13:26:57,481 INFO L321 Elim1Store]: treesize reduction 90, result has 37.9 percent of original size [2023-02-15 13:26:57,481 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 40 treesize of output 69 [2023-02-15 13:26:57,662 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 86 treesize of output 66 [2023-02-15 13:26:58,012 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-02-15 13:26:58,012 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 96 treesize of output 77 [2023-02-15 13:26:58,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:26:58,090 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 13:26:58,090 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 86 treesize of output 70 [2023-02-15 13:26:58,162 INFO L321 Elim1Store]: treesize reduction 3, result has 78.6 percent of original size [2023-02-15 13:26:58,162 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 65 treesize of output 37 [2023-02-15 13:26:58,265 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:26:58,265 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:27:00,335 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4373 (Array Int Int)) (v_ArrVal_4374 (Array Int Int))) (= (select |c_#valid| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_4373) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_4374) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) 1)) is different from false [2023-02-15 13:27:02,355 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4373 (Array Int Int)) (v_ArrVal_4374 (Array Int Int))) (= (select |c_#valid| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_#t~mem10#1.base| v_ArrVal_4373) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_4374) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) 1)) is different from false [2023-02-15 13:27:08,462 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4373 (Array Int Int)) (v_ArrVal_4374 (Array Int Int))) (= (select |c_#valid| (select (select (store (store |c_#memory_$Pointer$.base| (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)) v_ArrVal_4373) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_4374) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) 1)) is different from false [2023-02-15 13:27:14,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [319905585] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:27:14,826 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:27:14,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 31] total 58 [2023-02-15 13:27:14,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585256977] [2023-02-15 13:27:14,826 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 13:27:14,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2023-02-15 13:27:14,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:27:14,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2023-02-15 13:27:14,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=3706, Unknown=104, NotChecked=378, Total=4422 [2023-02-15 13:27:14,828 INFO L87 Difference]: Start difference. First operand 114 states and 127 transitions. Second operand has 59 states, 56 states have (on average 1.9642857142857142) internal successors, (110), 51 states have internal predecessors, (110), 5 states have call successors, (5), 4 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 13:27:19,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:27:19,802 INFO L93 Difference]: Finished difference Result 180 states and 201 transitions. [2023-02-15 13:27:19,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-02-15 13:27:19,802 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 56 states have (on average 1.9642857142857142) internal successors, (110), 51 states have internal predecessors, (110), 5 states have call successors, (5), 4 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 13:27:19,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:27:19,803 INFO L225 Difference]: With dead ends: 180 [2023-02-15 13:27:19,803 INFO L226 Difference]: Without dead ends: 180 [2023-02-15 13:27:19,804 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 99 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1994 ImplicationChecksByTransitivity, 21.9s TimeCoverageRelationStatistics Valid=1016, Invalid=8396, Unknown=106, NotChecked=582, Total=10100 [2023-02-15 13:27:19,804 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 1941 mSDsluCounter, 981 mSDsCounter, 0 mSdLazyCounter, 2079 mSolverCounterSat, 66 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1941 SdHoareTripleChecker+Valid, 1019 SdHoareTripleChecker+Invalid, 2147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 2079 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:27:19,804 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1941 Valid, 1019 Invalid, 2147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 2079 Invalid, 2 Unknown, 0 Unchecked, 1.2s Time] [2023-02-15 13:27:19,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2023-02-15 13:27:19,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 113. [2023-02-15 13:27:19,806 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 13:27:19,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 126 transitions. [2023-02-15 13:27:19,807 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 126 transitions. Word has length 62 [2023-02-15 13:27:19,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:27:19,807 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 126 transitions. [2023-02-15 13:27:19,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 56 states have (on average 1.9642857142857142) internal successors, (110), 51 states have internal predecessors, (110), 5 states have call successors, (5), 4 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 13:27:19,807 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 126 transitions. [2023-02-15 13:27:19,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-02-15 13:27:19,807 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:27:19,807 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 13:27:19,815 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 13:27:20,008 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 13:27:20,008 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 13:27:20,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:27:20,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1296901354, now seen corresponding path program 1 times [2023-02-15 13:27:20,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:27:20,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37031198] [2023-02-15 13:27:20,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:27:20,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:27:20,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:20,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 13:27:20,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:20,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 13:27:20,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:20,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-15 13:27:20,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:21,044 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 13:27:21,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:27:21,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37031198] [2023-02-15 13:27:21,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37031198] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:27:21,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1041919222] [2023-02-15 13:27:21,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:27:21,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:27:21,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:27:21,046 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 13:27:21,048 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 13:27:21,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:21,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 126 conjunts are in the unsatisfiable core [2023-02-15 13:27:21,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:27:21,325 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 13:27:21,363 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 13:27:21,466 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 13:27:21,466 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 13:27:21,615 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 13:27:21,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 13:27:21,732 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-02-15 13:27:21,733 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 13:27:21,882 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 13:27:21,984 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:27:21,984 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 44 treesize of output 43 [2023-02-15 13:27:22,277 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:27:22,277 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 68 treesize of output 31 [2023-02-15 13:27:22,281 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 0 case distinctions, treesize of input 16 treesize of output 10 [2023-02-15 13:27:22,284 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 13:27:22,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:27:22,605 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 16 treesize of output 18 [2023-02-15 13:27:22,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:27:22,615 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 13:27:22,616 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 62 [2023-02-15 13:27:22,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:27:22,634 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-02-15 13:27:22,634 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 33 [2023-02-15 13:27:22,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:27:22,641 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 13:27:23,170 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-02-15 13:27:23,170 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 106 treesize of output 85 [2023-02-15 13:27:23,181 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:27:23,181 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 28 treesize of output 31 [2023-02-15 13:27:23,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:27:23,251 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 13:27:23,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:27:23,261 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 13:27:23,262 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 72 treesize of output 60 [2023-02-15 13:27:23,326 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:27:23,326 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 53 treesize of output 24 [2023-02-15 13:27:23,328 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 15 treesize of output 7 [2023-02-15 13:27:23,399 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 18 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 13:27:23,399 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:27:23,529 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4673 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_4673) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (forall ((v_ArrVal_4672 (Array Int Int)) (v_ArrVal_4673 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_4673) |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_4672) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2023-02-15 13:27:24,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1041919222] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:27:24,663 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:27:24,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 31] total 58 [2023-02-15 13:27:24,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879652373] [2023-02-15 13:27:24,663 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 13:27:24,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2023-02-15 13:27:24,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:27:24,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2023-02-15 13:27:24,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=4368, Unknown=57, NotChecked=134, Total=4830 [2023-02-15 13:27:24,665 INFO L87 Difference]: Start difference. First operand 113 states and 126 transitions. Second operand has 59 states, 56 states have (on average 1.9642857142857142) internal successors, (110), 51 states have internal predecessors, (110), 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 13:27:29,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:27:29,774 INFO L93 Difference]: Finished difference Result 250 states and 277 transitions. [2023-02-15 13:27:29,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-02-15 13:27:29,774 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 56 states have (on average 1.9642857142857142) internal successors, (110), 51 states have internal predecessors, (110), 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 13:27:29,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:27:29,775 INFO L225 Difference]: With dead ends: 250 [2023-02-15 13:27:29,775 INFO L226 Difference]: Without dead ends: 250 [2023-02-15 13:27:29,776 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 105 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2741 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=1151, Invalid=9924, Unknown=59, NotChecked=208, Total=11342 [2023-02-15 13:27:29,776 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 2567 mSDsluCounter, 847 mSDsCounter, 0 mSdLazyCounter, 2024 mSolverCounterSat, 63 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2567 SdHoareTripleChecker+Valid, 882 SdHoareTripleChecker+Invalid, 2089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 2024 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:27:29,777 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2567 Valid, 882 Invalid, 2089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 2024 Invalid, 2 Unknown, 0 Unchecked, 1.1s Time] [2023-02-15 13:27:29,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2023-02-15 13:27:29,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 117. [2023-02-15 13:27:29,779 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 13:27:29,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 131 transitions. [2023-02-15 13:27:29,779 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 131 transitions. Word has length 62 [2023-02-15 13:27:29,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:27:29,780 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 131 transitions. [2023-02-15 13:27:29,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 56 states have (on average 1.9642857142857142) internal successors, (110), 51 states have internal predecessors, (110), 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 13:27:29,780 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 131 transitions. [2023-02-15 13:27:29,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-02-15 13:27:29,780 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:27:29,780 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 13:27:29,788 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-02-15 13:27:29,988 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 13:27:29,989 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 13:27:29,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:27:29,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1537492107, now seen corresponding path program 1 times [2023-02-15 13:27:29,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:27:29,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968590804] [2023-02-15 13:27:29,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:27:29,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:27:30,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:31,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 13:27:31,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:31,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 13:27:31,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:31,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-15 13:27:31,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:31,708 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 13:27:31,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:27:31,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968590804] [2023-02-15 13:27:31,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968590804] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:27:31,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [119492623] [2023-02-15 13:27:31,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:27:31,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:27:31,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:27:31,709 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 13:27:31,712 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 13:27:31,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:31,997 INFO L263 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 124 conjunts are in the unsatisfiable core [2023-02-15 13:27:32,000 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:27:32,040 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 13:27:32,316 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 13:27:32,506 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 13:27:32,506 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 13:27:32,663 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 13:27:32,753 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:27:32,753 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 13:27:33,056 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:27:33,057 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 13:27:33,061 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 13:27:33,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 7 treesize of output 3 [2023-02-15 13:27:33,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:27:33,348 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 13:27:33,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:27:33,363 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-02-15 13:27:33,363 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 80 treesize of output 57 [2023-02-15 13:27:33,377 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-02-15 13:27:33,377 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 13:27:34,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:27:34,123 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:27:34,145 INFO L321 Elim1Store]: treesize reduction 135, result has 17.2 percent of original size [2023-02-15 13:27:34,146 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 6 new quantified variables, introduced 9 case distinctions, treesize of input 154 treesize of output 77 [2023-02-15 13:27:34,157 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:27:34,157 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 28 treesize of output 31 [2023-02-15 13:27:34,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:27:34,242 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 13:27:34,243 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 76 treesize of output 60 [2023-02-15 13:27:34,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:27:34,250 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 13:27:34,324 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 13:27:34,471 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:27:34,471 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 61 treesize of output 24 [2023-02-15 13:27:34,473 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:27:34,473 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:27:34,639 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4970 (Array Int Int)) (v_ArrVal_4969 (Array Int Int))) (not (= (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_4969))) (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_4970) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) 0))) is different from false [2023-02-15 13:27:34,668 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4970 (Array Int Int)) (v_ArrVal_4966 Int) (v_ArrVal_4967 (Array Int Int)) (v_ArrVal_4969 (Array Int Int))) (not (= (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_4966)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_4969))) (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_4967) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_4970) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) 0))) is different from false [2023-02-15 13:27:35,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [119492623] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:27:35,620 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:27:35,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 65 [2023-02-15 13:27:35,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052968624] [2023-02-15 13:27:35,620 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 13:27:35,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2023-02-15 13:27:35,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:27:35,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2023-02-15 13:27:35,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=5412, Unknown=5, NotChecked=298, Total=6006 [2023-02-15 13:27:35,622 INFO L87 Difference]: Start difference. First operand 117 states and 131 transitions. Second operand has 65 states, 63 states have (on average 1.746031746031746) internal successors, (110), 56 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 13:27:41,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:27:41,449 INFO L93 Difference]: Finished difference Result 217 states and 241 transitions. [2023-02-15 13:27:41,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-02-15 13:27:41,449 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 63 states have (on average 1.746031746031746) internal successors, (110), 56 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 13:27:41,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:27:41,450 INFO L225 Difference]: With dead ends: 217 [2023-02-15 13:27:41,450 INFO L226 Difference]: Without dead ends: 217 [2023-02-15 13:27:41,451 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 106 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2132 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=1009, Invalid=10124, Unknown=5, NotChecked=418, Total=11556 [2023-02-15 13:27:41,451 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 1697 mSDsluCounter, 1415 mSDsCounter, 0 mSdLazyCounter, 2374 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1697 SdHoareTripleChecker+Valid, 1457 SdHoareTripleChecker+Invalid, 2426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 2374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-02-15 13:27:41,451 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1697 Valid, 1457 Invalid, 2426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 2374 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-02-15 13:27:41,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2023-02-15 13:27:41,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 123. [2023-02-15 13:27:41,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 101 states have (on average 1.2574257425742574) internal successors, (127), 116 states have internal predecessors, (127), 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 13:27:41,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 137 transitions. [2023-02-15 13:27:41,454 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 137 transitions. Word has length 65 [2023-02-15 13:27:41,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:27:41,454 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 137 transitions. [2023-02-15 13:27:41,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 63 states have (on average 1.746031746031746) internal successors, (110), 56 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 13:27:41,455 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 137 transitions. [2023-02-15 13:27:41,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-02-15 13:27:41,455 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:27:41,455 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 13:27:41,463 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 13:27:41,663 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 13:27:41,664 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 13:27:41,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:27:41,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1304596198, now seen corresponding path program 1 times [2023-02-15 13:27:41,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:27:41,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644227195] [2023-02-15 13:27:41,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:27:41,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:27:41,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:41,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 13:27:41,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:41,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 13:27:41,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:41,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-15 13:27:41,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:41,763 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 13:27:41,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:27:41,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644227195] [2023-02-15 13:27:41,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644227195] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:27:41,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:27:41,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 13:27:41,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858428155] [2023-02-15 13:27:41,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:27:41,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 13:27:41,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:27:41,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 13:27:41,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 13:27:41,765 INFO L87 Difference]: Start difference. First operand 123 states and 137 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 13:27:41,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:27:41,848 INFO L93 Difference]: Finished difference Result 125 states and 137 transitions. [2023-02-15 13:27:41,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 13:27:41,848 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 13:27:41,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:27:41,849 INFO L225 Difference]: With dead ends: 125 [2023-02-15 13:27:41,849 INFO L226 Difference]: Without dead ends: 125 [2023-02-15 13:27:41,849 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 13:27:41,850 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 7 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:27:41,850 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 280 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:27:41,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2023-02-15 13:27:41,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 122. [2023-02-15 13:27:41,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 100 states have (on average 1.25) internal successors, (125), 115 states have internal predecessors, (125), 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 13:27:41,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 135 transitions. [2023-02-15 13:27:41,852 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 135 transitions. Word has length 68 [2023-02-15 13:27:41,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:27:41,852 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 135 transitions. [2023-02-15 13:27:41,852 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 13:27:41,852 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 135 transitions. [2023-02-15 13:27:41,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-02-15 13:27:41,853 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:27:41,853 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 13:27:41,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-02-15 13:27:41,853 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 13:27:41,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:27:41,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1304640900, now seen corresponding path program 1 times [2023-02-15 13:27:41,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:27:41,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904479991] [2023-02-15 13:27:41,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:27:41,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:27:41,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:42,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 13:27:42,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:43,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 13:27:43,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:43,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-15 13:27:43,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:43,643 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 13:27:43,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:27:43,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904479991] [2023-02-15 13:27:43,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904479991] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:27:43,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1032105751] [2023-02-15 13:27:43,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:27:43,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:27:43,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:27:43,644 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 13:27:43,645 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 13:27:43,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:43,940 INFO L263 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 144 conjunts are in the unsatisfiable core [2023-02-15 13:27:43,957 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:27:43,962 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 13:27:44,012 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 13:27:44,130 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 13:27:44,130 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 13:27:44,330 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 13:27:44,449 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-02-15 13:27:44,449 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 13:27:44,586 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 11 treesize of output 7 [2023-02-15 13:27:44,665 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 13:27:44,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:27:44,673 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 21 treesize of output 20 [2023-02-15 13:27:44,766 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:27:44,766 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 56 treesize of output 53 [2023-02-15 13:27:44,774 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 20 treesize of output 22 [2023-02-15 13:27:45,100 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:27:45,101 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 33 [2023-02-15 13:27:45,105 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 0 case distinctions, treesize of input 16 treesize of output 10 [2023-02-15 13:27:45,121 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 13:27:45,124 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 13:27:45,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:27:45,421 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 13:27:45,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:27:45,434 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-02-15 13:27:45,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 78 treesize of output 59 [2023-02-15 13:27:45,447 INFO L321 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-02-15 13:27:45,448 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 20 treesize of output 23 [2023-02-15 13:27:45,452 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 13:27:45,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:27:45,469 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-02-15 13:27:45,469 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 33 [2023-02-15 13:27:46,117 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-02-15 13:27:46,117 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 128 treesize of output 101 [2023-02-15 13:27:46,132 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:27:46,132 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 13:27:46,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:27:46,137 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 32 treesize of output 34 [2023-02-15 13:27:46,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:27:46,221 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 13:27:46,222 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 62 [2023-02-15 13:27:46,226 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 18 treesize of output 20 [2023-02-15 13:27:46,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:27:46,238 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 13:27:46,313 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:27:46,314 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 55 treesize of output 26 [2023-02-15 13:27:46,316 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 15 treesize of output 7 [2023-02-15 13:27:46,423 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 13:27:46,467 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 13 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 13:27:46,467 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:27:46,481 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5437 (Array Int Int)) (v_ArrVal_5436 (Array Int Int)) (v_ArrVal_5438 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5436) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5438) |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_5437) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2023-02-15 13:27:46,487 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5433 (Array Int Int)) (v_ArrVal_5435 (Array Int Int)) (v_ArrVal_5434 (Array Int Int)) (v_ArrVal_5437 (Array Int Int)) (v_ArrVal_5436 (Array Int Int)) (v_ArrVal_5438 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_5435) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5436) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_5434) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5438) |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_5433) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5437) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2023-02-15 13:27:46,499 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5433 (Array Int Int)) (v_ArrVal_5435 (Array Int Int)) (v_ArrVal_5434 (Array Int Int)) (v_ArrVal_5437 (Array Int Int)) (v_ArrVal_5436 (Array Int Int)) (v_ArrVal_5438 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_append_#t~mem10#1.base| v_ArrVal_5435) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5436) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_#t~mem10#1.base| v_ArrVal_5434) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5438) |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_5433) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5437) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2023-02-15 13:27:46,506 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5433 (Array Int Int)) (v_ArrVal_5435 (Array Int Int)) (v_ArrVal_5434 (Array Int Int)) (v_ArrVal_5437 (Array Int Int)) (v_ArrVal_5436 (Array Int Int)) (v_ArrVal_5438 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4)))) (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_5435) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5436) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_5434) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5438) |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_5433) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5437) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2023-02-15 13:27:46,519 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5433 (Array Int Int)) (v_ArrVal_5435 (Array Int Int)) (v_ArrVal_5434 (Array Int Int)) (v_ArrVal_5437 (Array Int Int)) (v_ArrVal_5436 (Array Int Int)) (v_ArrVal_5438 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (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_5435) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5436) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_5434) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5438) |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_5433) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5437) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2023-02-15 13:27:46,528 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5433 (Array Int Int)) (v_ArrVal_5435 (Array Int Int)) (v_ArrVal_5434 (Array Int Int)) (v_ArrVal_5437 (Array Int Int)) (v_ArrVal_5436 (Array Int Int)) (v_ArrVal_5438 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (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_5435) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5436) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_5434) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5438) |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_5433) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5437) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2023-02-15 13:27:46,542 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5433 (Array Int Int)) (v_ArrVal_5435 (Array Int Int)) (v_ArrVal_5434 (Array Int Int)) (v_ArrVal_5437 (Array Int Int)) (v_ArrVal_5436 (Array Int Int)) (v_ArrVal_5438 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (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_5435) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_5436) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_5434) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_5438) |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_5433) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_5437) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2023-02-15 13:27:46,614 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5451 (Array Int Int)) (v_ArrVal_5453 (Array Int Int)) (v_ArrVal_5452 (Array Int Int)) (v_ArrVal_5433 (Array Int Int)) (|v_ULTIMATE.start_dll_append_#t~ret7#1.base_46| Int) (v_ArrVal_5435 (Array Int Int)) (v_ArrVal_5434 (Array Int Int)) (v_ArrVal_5437 (Array Int Int)) (v_ArrVal_5436 (Array Int Int)) (v_ArrVal_5438 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_46|) 0)) (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_46| |c_#StackHeapBarrier|)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_46| v_ArrVal_5451)) (.cse2 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_46| v_ArrVal_5452))) (let ((.cse0 (select (select .cse1 (select (select .cse1 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (+ 4 (select (select .cse2 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))))) (select (select (store (store (store |c_#memory_int| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_46| v_ArrVal_5453) .cse0 v_ArrVal_5435) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_46| v_ArrVal_5436) (select (select (store (store .cse1 .cse0 v_ArrVal_5434) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_46| v_ArrVal_5438) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store .cse2 .cse0 v_ArrVal_5433) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_46| v_ArrVal_5437) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) is different from false [2023-02-15 13:27:46,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1032105751] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:27:46,615 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:27:46,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 34] total 65 [2023-02-15 13:27:46,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948097568] [2023-02-15 13:27:46,616 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 13:27:46,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2023-02-15 13:27:46,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:27:46,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2023-02-15 13:27:46,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=3941, Unknown=8, NotChecked=1064, Total=5256 [2023-02-15 13:27:46,617 INFO L87 Difference]: Start difference. First operand 122 states and 135 transitions. Second operand has 65 states, 63 states have (on average 1.873015873015873) internal successors, (118), 56 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 13:27:49,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:27:49,576 INFO L93 Difference]: Finished difference Result 183 states and 202 transitions. [2023-02-15 13:27:49,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-02-15 13:27:49,577 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 63 states have (on average 1.873015873015873) internal successors, (118), 56 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 13:27:49,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:27:49,577 INFO L225 Difference]: With dead ends: 183 [2023-02-15 13:27:49,577 INFO L226 Difference]: Without dead ends: 183 [2023-02-15 13:27:49,578 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 55 SyntacticMatches, 4 SemanticMatches, 97 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 1755 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=757, Invalid=7457, Unknown=8, NotChecked=1480, Total=9702 [2023-02-15 13:27:49,578 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 881 mSDsluCounter, 1321 mSDsCounter, 0 mSdLazyCounter, 2272 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 881 SdHoareTripleChecker+Valid, 1364 SdHoareTripleChecker+Invalid, 2310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 2272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:27:49,578 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [881 Valid, 1364 Invalid, 2310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 2272 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-02-15 13:27:49,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2023-02-15 13:27:49,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 126. [2023-02-15 13:27:49,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 104 states have (on average 1.2403846153846154) internal successors, (129), 119 states have internal predecessors, (129), 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 13:27:49,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 139 transitions. [2023-02-15 13:27:49,581 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 139 transitions. Word has length 68 [2023-02-15 13:27:49,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:27:49,581 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 139 transitions. [2023-02-15 13:27:49,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 63 states have (on average 1.873015873015873) internal successors, (118), 56 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 13:27:49,582 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 139 transitions. [2023-02-15 13:27:49,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-02-15 13:27:49,582 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:27:49,582 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 13:27:49,589 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2023-02-15 13:27:49,785 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 13:27:49,785 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 13:27:49,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:27:49,785 INFO L85 PathProgramCache]: Analyzing trace with hash -370531362, now seen corresponding path program 1 times [2023-02-15 13:27:49,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:27:49,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787484817] [2023-02-15 13:27:49,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:27:49,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:27:49,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:51,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 13:27:51,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:51,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 13:27:51,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:51,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-15 13:27:51,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:52,132 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 13:27:52,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:27:52,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787484817] [2023-02-15 13:27:52,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787484817] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:27:52,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [817477375] [2023-02-15 13:27:52,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:27:52,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:27:52,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:27:52,134 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 13:27:52,135 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 13:27:52,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:52,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 147 conjunts are in the unsatisfiable core [2023-02-15 13:27:52,468 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:27:52,473 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 13:27:52,476 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 13:27:52,526 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 13:27:52,528 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 13:27:52,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:27:52,682 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 13:27:52,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:27:52,693 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 13:27:52,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:27:52,891 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 13:27:52,893 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 13:27:53,050 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 13:27:53,050 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 12 treesize of output 18 [2023-02-15 13:27:53,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:27:53,073 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-02-15 13:27:53,074 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2023-02-15 13:27:53,614 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 18 [2023-02-15 13:27:53,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:27:53,619 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2023-02-15 13:27:53,625 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 13:27:53,628 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 13:27:54,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:27:54,017 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 13:27:54,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:27:54,022 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 13:27:54,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:27:54,033 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 40 treesize of output 36 [2023-02-15 13:27:54,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:27:54,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:27:54,049 INFO L321 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2023-02-15 13:27:54,050 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 25 [2023-02-15 13:27:54,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:27:54,808 INFO L321 Elim1Store]: treesize reduction 77, result has 34.2 percent of original size [2023-02-15 13:27:54,808 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 5 case distinctions, treesize of input 226 treesize of output 138 [2023-02-15 13:27:54,827 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2023-02-15 13:27:54,827 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 5 new quantified variables, introduced 2 case distinctions, treesize of input 180 treesize of output 111 [2023-02-15 13:27:54,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:27:54,937 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 13:27:54,937 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 148 treesize of output 130 [2023-02-15 13:27:54,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:27:54,941 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 131 treesize of output 110 [2023-02-15 13:27:55,662 INFO L321 Elim1Store]: treesize reduction 48, result has 70.2 percent of original size [2023-02-15 13:27:55,663 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 285 treesize of output 279 [2023-02-15 13:27:55,756 INFO L321 Elim1Store]: treesize reduction 40, result has 68.0 percent of original size [2023-02-15 13:27:55,756 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 271 treesize of output 265 [2023-02-15 13:27:58,606 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 13:27:58,606 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:27:58,963 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5740 (Array Int Int)) (v_ArrVal_5739 (Array Int Int))) (<= 0 (+ (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5739))) (select (select .cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5740) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 4 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) 4))) (forall ((v_ArrVal_5740 (Array Int Int)) (v_ArrVal_5739 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5739)) (.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5740))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (+ 4 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (<= (+ (select (select .cse1 .cse2) .cse3) 8) (select |c_#length| (select (select .cse4 .cse2) .cse3))))))) is different from false [2023-02-15 13:27:58,974 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_5736 Int) (v_ArrVal_5735 Int) (v_ArrVal_5740 (Array Int Int)) (v_ArrVal_5739 (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_5736)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5739)) (.cse3 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store .cse4 .cse5 v_ArrVal_5735)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5740))) (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_5736 Int) (v_ArrVal_5735 Int) (v_ArrVal_5740 (Array Int Int)) (v_ArrVal_5739 (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_5736)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5739))) (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_5735)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5740) |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 13:28:01,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [817477375] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:28:01,430 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:28:01,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 33] total 67 [2023-02-15 13:28:01,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668102662] [2023-02-15 13:28:01,430 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 13:28:01,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2023-02-15 13:28:01,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:28:01,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2023-02-15 13:28:01,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=6226, Unknown=6, NotChecked=318, Total=6806 [2023-02-15 13:28:01,434 INFO L87 Difference]: Start difference. First operand 126 states and 139 transitions. Second operand has 68 states, 65 states have (on average 1.9538461538461538) internal successors, (127), 59 states have internal predecessors, (127), 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 13:28:12,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:28:12,206 INFO L93 Difference]: Finished difference Result 223 states and 246 transitions. [2023-02-15 13:28:12,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-02-15 13:28:12,207 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 65 states have (on average 1.9538461538461538) internal successors, (127), 59 states have internal predecessors, (127), 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 13:28:12,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:28:12,208 INFO L225 Difference]: With dead ends: 223 [2023-02-15 13:28:12,208 INFO L226 Difference]: Without dead ends: 223 [2023-02-15 13:28:12,208 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 115 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1907 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=1042, Invalid=12070, Unknown=6, NotChecked=454, Total=13572 [2023-02-15 13:28:12,209 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 2137 mSDsluCounter, 1433 mSDsCounter, 0 mSdLazyCounter, 3543 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2137 SdHoareTripleChecker+Valid, 1470 SdHoareTripleChecker+Invalid, 3596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 3543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2023-02-15 13:28:12,209 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2137 Valid, 1470 Invalid, 3596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 3543 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2023-02-15 13:28:12,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2023-02-15 13:28:12,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 131. [2023-02-15 13:28:12,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 109 states have (on average 1.2477064220183487) internal successors, (136), 124 states have internal predecessors, (136), 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 13:28:12,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 146 transitions. [2023-02-15 13:28:12,212 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 146 transitions. Word has length 70 [2023-02-15 13:28:12,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:28:12,212 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 146 transitions. [2023-02-15 13:28:12,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 65 states have (on average 1.9538461538461538) internal successors, (127), 59 states have internal predecessors, (127), 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 13:28:12,212 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 146 transitions. [2023-02-15 13:28:12,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-02-15 13:28:12,213 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:28:12,213 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 13:28:12,221 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 13:28:12,419 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 13:28:12,420 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 13:28:12,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:28:12,420 INFO L85 PathProgramCache]: Analyzing trace with hash -370531363, now seen corresponding path program 1 times [2023-02-15 13:28:12,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:28:12,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521314638] [2023-02-15 13:28:12,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:28:12,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:28:12,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:13,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 13:28:13,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:13,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 13:28:13,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:13,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-15 13:28:13,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:14,514 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 31 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 13:28:14,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:28:14,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521314638] [2023-02-15 13:28:14,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521314638] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:28:14,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [445299874] [2023-02-15 13:28:14,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:28:14,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:28:14,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:28:14,516 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 13:28:14,518 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 13:28:14,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:14,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 94 conjunts are in the unsatisfiable core [2023-02-15 13:28:14,862 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:28:14,895 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 13:28:15,285 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 13:28:15,285 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 13:28:15,415 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 13:28:15,497 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:28:15,497 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 44 treesize of output 43 [2023-02-15 13:28:15,777 INFO L321 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2023-02-15 13:28:15,777 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 84 treesize of output 29 [2023-02-15 13:28:15,780 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 13:28:16,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:28:16,227 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 13:28:16,227 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 92 treesize of output 80 [2023-02-15 13:28:16,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:28:16,234 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 66 treesize of output 64 [2023-02-15 13:28:16,258 INFO L321 Elim1Store]: treesize reduction 90, result has 37.9 percent of original size [2023-02-15 13:28:16,259 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 69 [2023-02-15 13:28:16,733 INFO L321 Elim1Store]: treesize reduction 90, result has 33.3 percent of original size [2023-02-15 13:28:16,733 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 4 new quantified variables, introduced 5 case distinctions, treesize of input 134 treesize of output 95 [2023-02-15 13:28:16,747 INFO L321 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2023-02-15 13:28:16,748 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 108 treesize of output 91 [2023-02-15 13:28:16,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:28:16,775 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 13:28:16,775 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 118 treesize of output 98 [2023-02-15 13:28:16,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:28:16,782 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 84 treesize of output 80 [2023-02-15 13:28:16,862 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 13:28:17,102 INFO L321 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2023-02-15 13:28:17,102 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 87 treesize of output 34 [2023-02-15 13:28:17,267 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 13:28:17,267 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:28:17,426 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6038 (Array Int Int)) (v_ArrVal_6039 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6038))) (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_6039) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) 1)) is different from false [2023-02-15 13:28:18,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [445299874] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:28:18,351 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:28:18,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 30] total 65 [2023-02-15 13:28:18,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253507147] [2023-02-15 13:28:18,351 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 13:28:18,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2023-02-15 13:28:18,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:28:18,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2023-02-15 13:28:18,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=244, Invalid=5111, Unknown=51, NotChecked=144, Total=5550 [2023-02-15 13:28:18,353 INFO L87 Difference]: Start difference. First operand 131 states and 146 transitions. Second operand has 66 states, 63 states have (on average 2.015873015873016) internal successors, (127), 57 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 13:28:27,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:28:27,206 INFO L93 Difference]: Finished difference Result 255 states and 283 transitions. [2023-02-15 13:28:27,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2023-02-15 13:28:27,207 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 63 states have (on average 2.015873015873016) internal successors, (127), 57 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 13:28:27,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:28:27,207 INFO L225 Difference]: With dead ends: 255 [2023-02-15 13:28:27,207 INFO L226 Difference]: Without dead ends: 255 [2023-02-15 13:28:27,208 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 112 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2482 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=1224, Invalid=11381, Unknown=55, NotChecked=222, Total=12882 [2023-02-15 13:28:27,208 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 2435 mSDsluCounter, 1688 mSDsCounter, 0 mSdLazyCounter, 3482 mSolverCounterSat, 74 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2435 SdHoareTripleChecker+Valid, 1736 SdHoareTripleChecker+Invalid, 3558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 3482 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:28:27,208 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2435 Valid, 1736 Invalid, 3558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 3482 Invalid, 2 Unknown, 0 Unchecked, 2.1s Time] [2023-02-15 13:28:27,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2023-02-15 13:28:27,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 136. [2023-02-15 13:28:27,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 114 states have (on average 1.2456140350877194) internal successors, (142), 129 states have internal predecessors, (142), 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 13:28:27,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 152 transitions. [2023-02-15 13:28:27,211 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 152 transitions. Word has length 70 [2023-02-15 13:28:27,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:28:27,212 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 152 transitions. [2023-02-15 13:28:27,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 63 states have (on average 2.015873015873016) internal successors, (127), 57 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 13:28:27,212 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 152 transitions. [2023-02-15 13:28:27,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-02-15 13:28:27,212 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:28:27,213 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 13:28:27,223 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 13:28:27,419 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 13:28:27,420 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 13:28:27,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:28:27,420 INFO L85 PathProgramCache]: Analyzing trace with hash -563372747, now seen corresponding path program 1 times [2023-02-15 13:28:27,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:28:27,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366090792] [2023-02-15 13:28:27,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:28:27,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:28:27,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:29,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 13:28:29,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:29,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 13:28:29,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:29,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-15 13:28:29,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:29,589 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 13:28:29,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:28:29,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366090792] [2023-02-15 13:28:29,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366090792] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:28:29,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [756539202] [2023-02-15 13:28:29,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:28:29,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:28:29,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:28:29,591 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 13:28:29,591 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 13:28:29,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:29,916 INFO L263 TraceCheckSpWp]: Trace formula consists of 597 conjuncts, 159 conjunts are in the unsatisfiable core [2023-02-15 13:28:29,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:28:29,922 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 13:28:29,965 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 13:28:30,101 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 13:28:30,101 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 13:28:30,285 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 13:28:30,331 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-02-15 13:28:30,332 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 13:28:30,486 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 13:28:30,493 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 13:28:30,583 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:28:30,583 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 56 treesize of output 53 [2023-02-15 13:28:30,590 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 13:28:30,916 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:28:30,917 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 33 [2023-02-15 13:28:30,920 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 15 treesize of output 7 [2023-02-15 13:28:30,922 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 0 case distinctions, treesize of input 16 treesize of output 10 [2023-02-15 13:28:31,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:28:31,234 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-02-15 13:28:31,234 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 33 [2023-02-15 13:28:31,897 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:28:31,913 INFO L321 Elim1Store]: treesize reduction 97, result has 19.8 percent of original size [2023-02-15 13:28:31,914 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 143 treesize of output 85 [2023-02-15 13:28:31,927 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2023-02-15 13:28:31,927 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 134 treesize of output 124 [2023-02-15 13:28:32,055 INFO L321 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2023-02-15 13:28:32,056 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 289 treesize of output 196 [2023-02-15 13:28:32,070 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2023-02-15 13:28:32,070 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 248 treesize of output 202 [2023-02-15 13:28:32,566 INFO L321 Elim1Store]: treesize reduction 20, result has 25.9 percent of original size [2023-02-15 13:28:32,567 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 228 treesize of output 133 [2023-02-15 13:28:32,755 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:28:32,768 INFO L321 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2023-02-15 13:28:32,768 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 8 new quantified variables, introduced 10 case distinctions, treesize of input 115 treesize of output 48 [2023-02-15 13:28:32,813 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 11 proven. 18 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-15 13:28:32,813 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:28:33,190 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6339 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_28| Int) (v_ArrVal_6340 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6339))) (or (< (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_28|) (not (= (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6340))) (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_28| 4))) (select (select .cse1 (select (select .cse1 .cse2) .cse3)) (+ (select (select .cse0 .cse2) .cse3) 4)))) 0)) (not (<= 0 |v_ULTIMATE.start_main_~ptr~0#1.offset_28|))))) is different from false [2023-02-15 13:28:33,482 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6336 (Array Int Int)) (v_ArrVal_6339 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_28| Int) (v_ArrVal_6340 (Array Int Int))) (let ((.cse5 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse5))) (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_6336) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6339))) (or (not (= (let ((.cse0 (store (store |c_#memory_$Pointer$.base| .cse4 (store (select |c_#memory_$Pointer$.base| .cse4) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse5) 4) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6340))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 4))) (select (select .cse0 (select (select .cse0 .cse1) .cse2)) (+ (select (select .cse3 .cse1) .cse2) 4)))) 0)) (not (<= 0 |v_ULTIMATE.start_main_~ptr~0#1.offset_28|)) (< (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|)))))) is different from false [2023-02-15 13:28:33,509 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6336 (Array Int Int)) (v_ArrVal_6339 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_28| Int) (v_ArrVal_6340 (Array Int Int))) (let ((.cse5 (+ |c_ULTIMATE.start_dll_append_#t~mem9#1.offset| 4))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) .cse5))) (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_6336) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6339))) (or (not (= (let ((.cse0 (store (store |c_#memory_$Pointer$.base| .cse4 (store (select |c_#memory_$Pointer$.base| .cse4) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) .cse5) 4) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6340))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 4))) (select (select .cse0 (select (select .cse0 .cse1) .cse2)) (+ (select (select .cse3 .cse1) .cse2) 4)))) 0)) (< (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|) (not (<= 0 |v_ULTIMATE.start_main_~ptr~0#1.offset_28|))))))) is different from false [2023-02-15 13:28:33,521 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6336 (Array Int Int)) (v_ArrVal_6339 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_28| Int) (v_ArrVal_6340 (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse6 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse5) .cse6))) (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_6336) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6339))) (or (< (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_28|) (not (= (let ((.cse1 (store (store |c_#memory_$Pointer$.base| .cse4 (store (select |c_#memory_$Pointer$.base| .cse4) (+ (select (select |c_#memory_$Pointer$.offset| .cse5) .cse6) 4) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6340))) (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_28| 4))) (select (select .cse1 (select (select .cse1 .cse2) .cse3)) (+ (select (select .cse0 .cse2) .cse3) 4)))) 0)) (not (<= 0 |v_ULTIMATE.start_main_~ptr~0#1.offset_28|))))))) is different from false [2023-02-15 13:28:33,549 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6336 (Array Int Int)) (v_ArrVal_6339 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_28| Int) (v_ArrVal_6340 (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse6 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse5) .cse6))) (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_6336) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_6339))) (or (not (= (let ((.cse0 (store (store |c_#memory_$Pointer$.base| .cse4 (store (select |c_#memory_$Pointer$.base| .cse4) (+ (select (select |c_#memory_$Pointer$.offset| .cse5) .cse6) 4) |c_ULTIMATE.start_dll_append_#t~ret7#1.base|)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_6340))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 4))) (select (select .cse0 (select (select .cse0 .cse1) .cse2)) (+ (select (select .cse3 .cse1) .cse2) 4)))) 0)) (< (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|) (not (<= 0 |v_ULTIMATE.start_main_~ptr~0#1.offset_28|))))))) is different from false [2023-02-15 13:28:33,619 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_55| Int) (v_ArrVal_6336 (Array Int Int)) (v_ArrVal_6339 (Array Int Int)) (v_ArrVal_6349 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_28| Int) (v_ArrVal_6340 (Array Int Int)) (v_ArrVal_6350 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_55| v_ArrVal_6350)) (.cse4 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_55| v_ArrVal_6349))) (let ((.cse7 (select (select .cse4 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse8 (+ (select (select .cse6 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse5 (select (select .cse4 .cse7) .cse8))) (let ((.cse0 (store (store .cse6 .cse5 v_ArrVal_6336) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_55| v_ArrVal_6339))) (or (< (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_28|) (not (= (let ((.cse1 (store (store .cse4 .cse5 (store (select .cse4 .cse5) (+ (select (select .cse6 .cse7) .cse8) 4) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_55|)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_55| v_ArrVal_6340))) (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_28| 4))) (select (select .cse1 (select (select .cse1 .cse2) .cse3)) (+ (select (select .cse0 .cse2) .cse3) 4)))) 0)) (= |v_ULTIMATE.start_dll_append_#t~ret7#1.base_55| 0) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_55|) 0)) (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_55| |c_#StackHeapBarrier|)) (not (<= 0 |v_ULTIMATE.start_main_~ptr~0#1.offset_28|)))))))) is different from false [2023-02-15 13:28:33,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [756539202] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:28:33,621 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:28:33,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 34] total 67 [2023-02-15 13:28:33,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804528134] [2023-02-15 13:28:33,622 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 13:28:33,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2023-02-15 13:28:33,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:28:33,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2023-02-15 13:28:33,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=5311, Unknown=9, NotChecked=906, Total=6480 [2023-02-15 13:28:33,623 INFO L87 Difference]: Start difference. First operand 136 states and 152 transitions. Second operand has 67 states, 65 states have (on average 1.8307692307692307) internal successors, (119), 58 states have internal predecessors, (119), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 13:28:38,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:28:38,239 INFO L93 Difference]: Finished difference Result 193 states and 213 transitions. [2023-02-15 13:28:38,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-02-15 13:28:38,239 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 65 states have (on average 1.8307692307692307) internal successors, (119), 58 states have internal predecessors, (119), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 74 [2023-02-15 13:28:38,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:28:38,240 INFO L225 Difference]: With dead ends: 193 [2023-02-15 13:28:38,240 INFO L226 Difference]: Without dead ends: 193 [2023-02-15 13:28:38,241 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 63 SyntacticMatches, 5 SemanticMatches, 106 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1953 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=803, Invalid=9514, Unknown=9, NotChecked=1230, Total=11556 [2023-02-15 13:28:38,241 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 929 mSDsluCounter, 1613 mSDsCounter, 0 mSdLazyCounter, 2818 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 929 SdHoareTripleChecker+Valid, 1657 SdHoareTripleChecker+Invalid, 2852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 2818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-02-15 13:28:38,241 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [929 Valid, 1657 Invalid, 2852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 2818 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-02-15 13:28:38,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2023-02-15 13:28:38,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 135. [2023-02-15 13:28:38,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 113 states have (on average 1.238938053097345) internal successors, (140), 128 states have internal predecessors, (140), 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 13:28:38,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 150 transitions. [2023-02-15 13:28:38,244 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 150 transitions. Word has length 74 [2023-02-15 13:28:38,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:28:38,244 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 150 transitions. [2023-02-15 13:28:38,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 65 states have (on average 1.8307692307692307) internal successors, (119), 58 states have internal predecessors, (119), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 13:28:38,244 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 150 transitions. [2023-02-15 13:28:38,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-02-15 13:28:38,245 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:28:38,245 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 13:28:38,253 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 13:28:38,451 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 13:28:38,451 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 13:28:38,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:28:38,452 INFO L85 PathProgramCache]: Analyzing trace with hash -563328045, now seen corresponding path program 1 times [2023-02-15 13:28:38,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:28:38,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789972571] [2023-02-15 13:28:38,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:28:38,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:28:38,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:40,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 13:28:40,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:40,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 13:28:40,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:40,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-15 13:28:40,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:41,303 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 13:28:41,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:28:41,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789972571] [2023-02-15 13:28:41,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789972571] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:28:41,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [491556454] [2023-02-15 13:28:41,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:28:41,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:28:41,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:28:41,305 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 13:28:41,306 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 13:28:41,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:41,647 INFO L263 TraceCheckSpWp]: Trace formula consists of 594 conjuncts, 201 conjunts are in the unsatisfiable core [2023-02-15 13:28:41,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:28:41,663 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 13:28:41,717 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 13:28:41,866 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 13:28:41,866 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 13:28:42,001 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 13:28:42,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:28:42,068 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 13:28:42,161 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 13:28:42,582 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-02-15 13:28:42,583 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 13:28:42,594 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 13:28:42,761 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 13:28:42,776 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 13:28:42,785 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 13:28:42,790 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 13:28:42,902 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:28:42,902 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 13:28:42,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:28:42,908 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 13:28:42,913 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 13:28:43,296 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:28:43,297 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 85 treesize of output 40 [2023-02-15 13:28:43,300 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 15 treesize of output 7 [2023-02-15 13:28:43,303 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 0 case distinctions, treesize of input 16 treesize of output 10 [2023-02-15 13:28:43,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:28:43,757 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 13:28:43,758 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 13:28:43,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:28:43,770 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-02-15 13:28:43,770 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 33 [2023-02-15 13:28:43,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:28:43,777 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 13:28:43,789 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 22 treesize of output 24 [2023-02-15 13:28:44,785 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-02-15 13:28:44,785 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 250 treesize of output 193 [2023-02-15 13:28:44,814 INFO L321 Elim1Store]: treesize reduction 148, result has 16.9 percent of original size [2023-02-15 13:28:44,814 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 7 case distinctions, treesize of input 166 treesize of output 102 [2023-02-15 13:28:44,821 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:28:44,830 INFO L321 Elim1Store]: treesize reduction 37, result has 48.6 percent of original size [2023-02-15 13:28:44,831 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 1 case distinctions, treesize of input 71 treesize of output 76 [2023-02-15 13:28:44,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:28:44,984 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 13:28:44,985 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 126 treesize of output 100 [2023-02-15 13:28:44,991 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 22 treesize of output 24 [2023-02-15 13:28:44,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:28:45,002 INFO L321 Elim1Store]: treesize reduction 35, result has 12.5 percent of original size [2023-02-15 13:28:45,002 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 63 [2023-02-15 13:28:45,413 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:28:45,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:28:45,416 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:28:45,416 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 134 treesize of output 68 [2023-02-15 13:28:45,422 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-15 13:28:45,422 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 26 [2023-02-15 13:28:45,548 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 13:28:45,602 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 13:28:45,602 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:28:45,788 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6654 (Array Int Int)) (v_ArrVal_6653 (Array Int Int)) (v_ArrVal_6655 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6655)) (.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6653))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6654) (select (select .cse0 .cse1) .cse2)) (select (select .cse3 .cse1) .cse2)))))) is different from false [2023-02-15 13:28:45,810 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6654 (Array Int Int)) (v_ArrVal_6653 (Array Int Int)) (v_ArrVal_6655 (Array Int Int)) (v_ArrVal_6649 (Array Int Int)) (v_ArrVal_6651 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (let ((.cse4 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6655)) (.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_6649) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6653))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (+ (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0 v_ArrVal_6651)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6654) (select (select .cse1 .cse2) .cse3)) (select (select .cse4 .cse2) .cse3))))))) is different from false [2023-02-15 13:28:46,815 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6654 (Array Int Int)) (v_ArrVal_6653 (Array Int Int)) (|v_ULTIMATE.start_dll_append_#t~ret7#1.base_58| Int) (v_ArrVal_6655 (Array Int Int)) (v_ArrVal_6669 (Array Int Int)) (v_ArrVal_6668 (Array Int Int)) (v_ArrVal_6649 (Array Int Int)) (v_ArrVal_6651 Int) (v_ArrVal_6670 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_58| v_ArrVal_6668)) (.cse7 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_58| v_ArrVal_6670))) (let ((.cse10 (select (select .cse7 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse11 (+ (select (select .cse8 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse1 (select (select .cse7 .cse10) .cse11))) (let ((.cse9 (select .cse8 .cse1)) (.cse2 (+ (select (select .cse8 .cse10) .cse11) 4))) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_58| |c_#StackHeapBarrier|)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse6 (store (store .cse8 .cse1 (store .cse9 .cse2 0)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_58| v_ArrVal_6655)) (.cse3 (store (store .cse7 .cse1 v_ArrVal_6649) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_58| v_ArrVal_6653))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (+ (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store (let ((.cse0 (store |c_#memory_int| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_58| v_ArrVal_6669))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_6651))) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_58| v_ArrVal_6654) (select (select .cse3 .cse4) .cse5)) (select (select .cse6 .cse4) .cse5))))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_58|) 0)) (not (= 0 (select .cse9 .cse2))))))))) is different from false [2023-02-15 13:28:46,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [491556454] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:28:46,817 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:28:46,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 40] total 79 [2023-02-15 13:28:46,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792574965] [2023-02-15 13:28:46,817 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 13:28:46,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 79 states [2023-02-15 13:28:46,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:28:46,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2023-02-15 13:28:46,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=321, Invalid=7515, Unknown=8, NotChecked=528, Total=8372 [2023-02-15 13:28:46,819 INFO L87 Difference]: Start difference. First operand 135 states and 150 transitions. Second operand has 79 states, 77 states have (on average 1.7402597402597402) internal successors, (134), 69 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 13:28:52,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:28:52,505 INFO L93 Difference]: Finished difference Result 191 states and 211 transitions. [2023-02-15 13:28:52,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-02-15 13:28:52,506 INFO L78 Accepts]: Start accepts. Automaton has has 79 states, 77 states have (on average 1.7402597402597402) internal successors, (134), 69 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 13:28:52,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:28:52,507 INFO L225 Difference]: With dead ends: 191 [2023-02-15 13:28:52,507 INFO L226 Difference]: Without dead ends: 191 [2023-02-15 13:28:52,507 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 59 SyntacticMatches, 4 SemanticMatches, 123 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 3068 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=1123, Invalid=13640, Unknown=11, NotChecked=726, Total=15500 [2023-02-15 13:28:52,508 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 1247 mSDsluCounter, 1557 mSDsCounter, 0 mSdLazyCounter, 3307 mSolverCounterSat, 58 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1247 SdHoareTripleChecker+Valid, 1597 SdHoareTripleChecker+Invalid, 3369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 3307 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-02-15 13:28:52,508 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1247 Valid, 1597 Invalid, 3369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 3307 Invalid, 4 Unknown, 0 Unchecked, 1.9s Time] [2023-02-15 13:28:52,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2023-02-15 13:28:52,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 135. [2023-02-15 13:28:52,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 113 states have (on average 1.2300884955752212) internal successors, (139), 128 states have internal predecessors, (139), 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 13:28:52,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 149 transitions. [2023-02-15 13:28:52,511 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 149 transitions. Word has length 74 [2023-02-15 13:28:52,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:28:52,511 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 149 transitions. [2023-02-15 13:28:52,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 79 states, 77 states have (on average 1.7402597402597402) internal successors, (134), 69 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 13:28:52,511 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 149 transitions. [2023-02-15 13:28:52,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-02-15 13:28:52,511 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:28:52,512 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 13:28:52,518 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 13:28:52,712 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 13:28:52,712 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 13:28:52,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:28:52,713 INFO L85 PathProgramCache]: Analyzing trace with hash 364845693, now seen corresponding path program 3 times [2023-02-15 13:28:52,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:28:52,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269373843] [2023-02-15 13:28:52,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:28:52,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:28:52,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:52,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 13:28:52,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:52,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 13:28:52,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:52,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-15 13:28:52,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:52,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-02-15 13:28:52,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:52,810 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 13:28:52,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:28:52,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269373843] [2023-02-15 13:28:52,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269373843] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:28:52,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [670792431] [2023-02-15 13:28:52,810 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-15 13:28:52,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:28:52,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:28:52,812 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 13:28:52,814 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 13:28:53,374 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-02-15 13:28:53,374 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 13:28:53,378 INFO L263 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 137 conjunts are in the unsatisfiable core [2023-02-15 13:28:53,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:28:53,467 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 13:28:53,500 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-02-15 13:28:53,500 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 13:28:53,691 INFO L321 Elim1Store]: treesize reduction 60, result has 31.0 percent of original size [2023-02-15 13:28:53,691 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 13:28:53,701 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 13:28:53,701 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 13:28:53,786 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 13:28:53,786 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 13:28:53,843 INFO L321 Elim1Store]: treesize reduction 45, result has 16.7 percent of original size [2023-02-15 13:28:53,844 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 13:28:53,852 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 13:28:53,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:28:53,948 INFO L321 Elim1Store]: treesize reduction 106, result has 23.7 percent of original size [2023-02-15 13:28:53,948 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 119 treesize of output 88 [2023-02-15 13:28:53,952 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 13:28:54,226 INFO L321 Elim1Store]: treesize reduction 70, result has 13.6 percent of original size [2023-02-15 13:28:54,226 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 158 treesize of output 60 [2023-02-15 13:28:54,236 INFO L321 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2023-02-15 13:28:54,236 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 18 [2023-02-15 13:28:54,243 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 13:28:54,244 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 13:28:54,377 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_7032 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_7032))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_7033 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_7033) |c_#memory_$Pointer$.base|)) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1)))) is different from true [2023-02-15 13:28:54,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:28:54,421 INFO L321 Elim1Store]: treesize reduction 90, result has 15.1 percent of original size [2023-02-15 13:28:54,421 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 164 treesize of output 126 [2023-02-15 13:28:54,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:28:54,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:28:54,427 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-15 13:28:54,428 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 155 treesize of output 148 [2023-02-15 13:28:54,464 INFO L321 Elim1Store]: treesize reduction 202, result has 33.1 percent of original size [2023-02-15 13:28:54,465 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 63 treesize of output 117 [2023-02-15 13:28:54,860 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2023-02-15 13:28:54,861 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 223 treesize of output 164 [2023-02-15 13:28:55,068 INFO L321 Elim1Store]: treesize reduction 46, result has 31.3 percent of original size [2023-02-15 13:28:55,068 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 156 treesize of output 71 [2023-02-15 13:28:55,206 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 46 proven. 24 refuted. 0 times theorem prover too weak. 3 trivial. 6 not checked. [2023-02-15 13:28:55,206 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:28:55,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [670792431] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:28:55,630 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:28:55,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 33] total 38 [2023-02-15 13:28:55,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521423498] [2023-02-15 13:28:55,631 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 13:28:55,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-02-15 13:28:55,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:28:55,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-02-15 13:28:55,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1927, Unknown=6, NotChecked=88, Total=2162 [2023-02-15 13:28:55,632 INFO L87 Difference]: Start difference. First operand 135 states and 149 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 13:28:57,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:28:57,023 INFO L93 Difference]: Finished difference Result 102 states and 108 transitions. [2023-02-15 13:28:57,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-02-15 13:28:57,024 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 13:28:57,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:28:57,024 INFO L225 Difference]: With dead ends: 102 [2023-02-15 13:28:57,024 INFO L226 Difference]: Without dead ends: 102 [2023-02-15 13:28:57,025 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 53 SyntacticMatches, 5 SemanticMatches, 61 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 862 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=264, Invalid=3513, Unknown=9, NotChecked=120, Total=3906 [2023-02-15 13:28:57,025 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 182 mSDsluCounter, 798 mSDsCounter, 0 mSdLazyCounter, 1310 mSolverCounterSat, 8 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 835 SdHoareTripleChecker+Invalid, 1415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1310 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 93 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-02-15 13:28:57,025 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 835 Invalid, 1415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1310 Invalid, 4 Unknown, 93 Unchecked, 0.9s Time] [2023-02-15 13:28:57,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-02-15 13:28:57,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 90. [2023-02-15 13:28:57,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 74 states have (on average 1.2027027027027026) internal successors, (89), 85 states have internal predecessors, (89), 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 13:28:57,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 95 transitions. [2023-02-15 13:28:57,027 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 95 transitions. Word has length 75 [2023-02-15 13:28:57,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:28:57,027 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 95 transitions. [2023-02-15 13:28:57,028 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 13:28:57,028 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 95 transitions. [2023-02-15 13:28:57,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-02-15 13:28:57,028 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:28:57,028 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 13:28:57,037 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 13:28:57,228 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 13:28:57,229 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 13:28:57,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:28:57,229 INFO L85 PathProgramCache]: Analyzing trace with hash -192357779, now seen corresponding path program 2 times [2023-02-15 13:28:57,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:28:57,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107501648] [2023-02-15 13:28:57,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:28:57,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:28:57,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:29:01,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 13:29:01,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:29:01,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 13:29:01,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:29:01,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-15 13:29:01,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:29:02,230 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 13 proven. 27 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 13:29:02,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:29:02,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107501648] [2023-02-15 13:29:02,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107501648] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:29:02,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1082111279] [2023-02-15 13:29:02,230 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 13:29:02,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:29:02,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:29:02,231 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 13:29:02,234 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 13:29:02,620 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 13:29:02,620 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 13:29:02,624 INFO L263 TraceCheckSpWp]: Trace formula consists of 609 conjuncts, 190 conjunts are in the unsatisfiable core [2023-02-15 13:29:02,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:29:02,631 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 13:29:02,684 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 13:29:02,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:29:02,861 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 13:29:03,128 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 13:29:03,131 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 13:29:03,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:29:03,353 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 13:29:03,365 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 13:29:03,365 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 11 treesize of output 11 [2023-02-15 13:29:03,608 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 13:29:03,612 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 13:29:03,737 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:29:03,737 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 55 treesize of output 52 [2023-02-15 13:29:03,742 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 13:29:04,153 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:29:04,154 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 76 treesize of output 35 [2023-02-15 13:29:04,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:29:04,158 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 15 treesize of output 7 [2023-02-15 13:29:04,160 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 13:29:04,163 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 13:29:04,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:29:04,693 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 13:29:04,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:29:04,706 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 13:29:04,707 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 86 treesize of output 72 [2023-02-15 13:29:04,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:29:04,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:29:04,723 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-02-15 13:29:04,723 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 25 treesize of output 38 [2023-02-15 13:29:04,743 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-02-15 13:29:04,743 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 13:29:05,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:29:05,938 INFO L321 Elim1Store]: treesize reduction 120, result has 15.5 percent of original size [2023-02-15 13:29:05,939 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 4 new quantified variables, introduced 4 case distinctions, treesize of input 66 treesize of output 58 [2023-02-15 13:29:05,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:29:05,944 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:29:05,944 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:29:05,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:29:05,961 INFO L321 Elim1Store]: treesize reduction 67, result has 14.1 percent of original size [2023-02-15 13:29:05,961 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 107 treesize of output 71 [2023-02-15 13:29:06,136 INFO L321 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2023-02-15 13:29:06,136 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 348 treesize of output 259 [2023-02-15 13:29:06,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:29:06,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:29:06,175 INFO L321 Elim1Store]: treesize reduction 98, result has 22.2 percent of original size [2023-02-15 13:29:06,175 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 4 new quantified variables, introduced 4 case distinctions, treesize of input 291 treesize of output 226 [2023-02-15 13:29:07,735 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:29:07,752 INFO L321 Elim1Store]: treesize reduction 81, result has 12.0 percent of original size [2023-02-15 13:29:07,752 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 338 treesize of output 163 [2023-02-15 13:29:07,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:29:07,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:29:07,767 INFO L321 Elim1Store]: treesize reduction 12, result has 36.8 percent of original size [2023-02-15 13:29:07,767 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 2 case distinctions, treesize of input 102 treesize of output 51 [2023-02-15 13:29:08,010 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 24 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:29:08,011 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:29:15,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1082111279] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:29:15,674 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:29:15,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 41] total 87 [2023-02-15 13:29:15,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406739177] [2023-02-15 13:29:15,674 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 13:29:15,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 88 states [2023-02-15 13:29:15,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:29:15,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2023-02-15 13:29:15,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=10997, Unknown=20, NotChecked=0, Total=11342 [2023-02-15 13:29:15,675 INFO L87 Difference]: Start difference. First operand 90 states and 95 transitions. Second operand has 88 states, 85 states have (on average 1.6352941176470588) internal successors, (139), 78 states have internal predecessors, (139), 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 13:29:28,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:29:28,560 INFO L93 Difference]: Finished difference Result 119 states and 127 transitions. [2023-02-15 13:29:28,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-02-15 13:29:28,565 INFO L78 Accepts]: Start accepts. Automaton has has 88 states, 85 states have (on average 1.6352941176470588) internal successors, (139), 78 states have internal predecessors, (139), 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 76 [2023-02-15 13:29:28,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:29:28,565 INFO L225 Difference]: With dead ends: 119 [2023-02-15 13:29:28,565 INFO L226 Difference]: Without dead ends: 119 [2023-02-15 13:29:28,566 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4236 ImplicationChecksByTransitivity, 22.1s TimeCoverageRelationStatistics Valid=1026, Invalid=19258, Unknown=22, NotChecked=0, Total=20306 [2023-02-15 13:29:28,566 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 1055 mSDsluCounter, 1452 mSDsCounter, 0 mSdLazyCounter, 4361 mSolverCounterSat, 38 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1055 SdHoareTripleChecker+Valid, 1483 SdHoareTripleChecker+Invalid, 4401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 4361 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2023-02-15 13:29:28,566 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1055 Valid, 1483 Invalid, 4401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 4361 Invalid, 2 Unknown, 0 Unchecked, 3.4s Time] [2023-02-15 13:29:28,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2023-02-15 13:29:28,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 97. [2023-02-15 13:29:28,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 81 states have (on average 1.2222222222222223) internal successors, (99), 92 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 13:29:28,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2023-02-15 13:29:28,568 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 76 [2023-02-15 13:29:28,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:29:28,568 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2023-02-15 13:29:28,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 88 states, 85 states have (on average 1.6352941176470588) internal successors, (139), 78 states have internal predecessors, (139), 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 13:29:28,568 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2023-02-15 13:29:28,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-02-15 13:29:28,569 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:29:28,569 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 13:29:28,576 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2023-02-15 13:29:28,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:29:28,769 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2023-02-15 13:29:28,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:29:28,769 INFO L85 PathProgramCache]: Analyzing trace with hash -192357780, now seen corresponding path program 2 times [2023-02-15 13:29:28,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:29:28,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390711194] [2023-02-15 13:29:28,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:29:28,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:29:28,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:29:30,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 13:29:30,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:29:31,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 13:29:31,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:29:31,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-15 13:29:31,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:29:31,735 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 36 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 13:29:31,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:29:31,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390711194] [2023-02-15 13:29:31,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390711194] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:29:31,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2007183103] [2023-02-15 13:29:31,736 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 13:29:31,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:29:31,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:29:31,738 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 13:29:31,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2023-02-15 13:29:32,153 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 13:29:32,153 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 13:29:32,157 INFO L263 TraceCheckSpWp]: Trace formula consists of 609 conjuncts, 155 conjunts are in the unsatisfiable core [2023-02-15 13:29:32,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:29:32,519 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 13:29:32,657 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 13:29:32,657 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 13:29:32,859 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 13:29:32,866 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 13:29:32,951 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:29:32,951 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 13:29:32,955 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 13:29:33,286 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:29:33,287 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 13:29:33,291 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:29:33,291 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 13:29:33,294 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 13:29:33,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:29:33,723 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 13:29:33,723 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 13:29:33,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:29:33,734 INFO L321 Elim1Store]: treesize reduction 31, result has 35.4 percent of original size [2023-02-15 13:29:33,734 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 13:29:33,762 INFO L321 Elim1Store]: treesize reduction 72, result has 37.4 percent of original size [2023-02-15 13:29:33,762 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 34 treesize of output 57 [2023-02-15 13:29:34,576 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:29:34,594 INFO L321 Elim1Store]: treesize reduction 97, result has 19.8 percent of original size [2023-02-15 13:29:34,595 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 158 treesize of output 92 [2023-02-15 13:29:34,611 INFO L321 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2023-02-15 13:29:34,611 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 154 treesize of output 142 [2023-02-15 13:29:34,744 INFO L321 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2023-02-15 13:29:34,744 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 311 treesize of output 212 [2023-02-15 13:29:34,760 INFO L321 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2023-02-15 13:29:34,760 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 269 treesize of output 221 [2023-02-15 13:29:35,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:29:35,398 INFO L321 Elim1Store]: treesize reduction 36, result has 16.3 percent of original size [2023-02-15 13:29:35,398 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 249 treesize of output 150 [2023-02-15 13:29:35,712 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:29:35,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:29:35,724 INFO L321 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2023-02-15 13:29:35,724 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 8 new quantified variables, introduced 10 case distinctions, treesize of input 131 treesize of output 56 [2023-02-15 13:29:35,914 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 6 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:29:35,914 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:29:37,037 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7634 (Array Int Int)) (v_ArrVal_7635 (Array Int Int)) (v_ArrVal_7633 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_38| Int)) (let ((.cse5 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse5))) (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_7633) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_7635))) (or (< (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_38|) (= (select |c_#valid| (let ((.cse1 (store (store |c_#memory_$Pointer$.base| .cse4 (store (select |c_#memory_$Pointer$.base| .cse4) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse5) 4) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_7634))) (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_38| 4))) (select (select .cse1 (select (select .cse1 .cse2) .cse3)) (+ (select (select .cse0 .cse2) .cse3) 4))))) 1) (not (<= 0 |v_ULTIMATE.start_main_~ptr~0#1.offset_38|))))))) is different from false [2023-02-15 13:29:37,852 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_66| Int) (v_ArrVal_7645 (Array Int Int)) (v_ArrVal_7634 (Array Int Int)) (v_ArrVal_7646 (Array Int Int)) (v_ArrVal_7635 (Array Int Int)) (v_ArrVal_7633 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_38| Int)) (let ((.cse6 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_66| v_ArrVal_7646)) (.cse4 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_66| v_ArrVal_7645))) (let ((.cse7 (select (select .cse4 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse8 (+ 4 (select (select .cse6 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)))) (let ((.cse5 (select (select .cse4 .cse7) .cse8))) (let ((.cse0 (store (store .cse6 .cse5 v_ArrVal_7633) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_66| v_ArrVal_7635))) (or (< (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_38|) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_66|) 0)) (not (<= 0 |v_ULTIMATE.start_main_~ptr~0#1.offset_38|)) (= (select (store |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_66| 1) (let ((.cse1 (store (store .cse4 .cse5 (store (select .cse4 .cse5) (+ 4 (select (select .cse6 .cse7) .cse8)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_66|)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_66| v_ArrVal_7634))) (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_38| 4))) (select (select .cse1 (select (select .cse1 .cse2) .cse3)) (+ (select (select .cse0 .cse2) .cse3) 4))))) 1) (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_66| |c_#StackHeapBarrier|)))))))) is different from false [2023-02-15 13:29:37,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2007183103] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:29:37,854 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:29:37,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 38] total 76 [2023-02-15 13:29:37,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34102882] [2023-02-15 13:29:37,854 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 13:29:37,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2023-02-15 13:29:37,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:29:37,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2023-02-15 13:29:37,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=7553, Unknown=38, NotChecked=350, Total=8190 [2023-02-15 13:29:37,856 INFO L87 Difference]: Start difference. First operand 97 states and 105 transitions. Second operand has 77 states, 74 states have (on average 1.864864864864865) internal successors, (138), 68 states have internal predecessors, (138), 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 13:29:46,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:29:46,571 INFO L93 Difference]: Finished difference Result 109 states and 117 transitions. [2023-02-15 13:29:46,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-02-15 13:29:46,571 INFO L78 Accepts]: Start accepts. Automaton has has 77 states, 74 states have (on average 1.864864864864865) internal successors, (138), 68 states have internal predecessors, (138), 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 76 [2023-02-15 13:29:46,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:29:46,572 INFO L225 Difference]: With dead ends: 109 [2023-02-15 13:29:46,572 INFO L226 Difference]: Without dead ends: 109 [2023-02-15 13:29:46,572 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 63 SyntacticMatches, 3 SemanticMatches, 120 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2006 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=825, Invalid=13423, Unknown=40, NotChecked=474, Total=14762 [2023-02-15 13:29:46,572 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 765 mSDsluCounter, 1284 mSDsCounter, 0 mSdLazyCounter, 3229 mSolverCounterSat, 48 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 765 SdHoareTripleChecker+Valid, 1315 SdHoareTripleChecker+Invalid, 3279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 3229 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-02-15 13:29:46,573 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [765 Valid, 1315 Invalid, 3279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 3229 Invalid, 2 Unknown, 0 Unchecked, 1.9s Time] [2023-02-15 13:29:46,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-02-15 13:29:46,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 97. [2023-02-15 13:29:46,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 81 states have (on average 1.2098765432098766) internal successors, (98), 92 states have internal predecessors, (98), 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 13:29:46,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 104 transitions. [2023-02-15 13:29:46,574 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 104 transitions. Word has length 76 [2023-02-15 13:29:46,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:29:46,575 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 104 transitions. [2023-02-15 13:29:46,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 74 states have (on average 1.864864864864865) internal successors, (138), 68 states have internal predecessors, (138), 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 13:29:46,575 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 104 transitions. [2023-02-15 13:29:46,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-02-15 13:29:46,575 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:29:46,575 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:29:46,588 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2023-02-15 13:29:46,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2023-02-15 13:29:46,782 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2023-02-15 13:29:46,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:29:46,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1990095940, now seen corresponding path program 2 times [2023-02-15 13:29:46,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:29:46,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610209333] [2023-02-15 13:29:46,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:29:46,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:29:46,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:29:49,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 13:29:49,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:29:49,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 13:29:49,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:29:49,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-15 13:29:49,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:29:49,659 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 4 proven. 38 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 13:29:49,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:29:49,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610209333] [2023-02-15 13:29:49,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610209333] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:29:49,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1891338537] [2023-02-15 13:29:49,660 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 13:29:49,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:29:49,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:29:49,661 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 13:29:49,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2023-02-15 13:29:50,100 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 13:29:50,100 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 13:29:50,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 628 conjuncts, 190 conjunts are in the unsatisfiable core [2023-02-15 13:29:50,108 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:29:50,113 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 13:29:50,161 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 13:29:50,256 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 13:29:50,257 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 13:29:50,492 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 13:29:50,493 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 11 treesize of output 11 [2023-02-15 13:29:50,684 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 13:29:50,689 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 13:29:50,773 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:29:50,774 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 13:29:50,776 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 13:29:51,094 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:29:51,094 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 13:29:51,098 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 13:29:51,101 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:29:51,101 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 13:29:51,311 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 11 treesize of output 7 [2023-02-15 13:29:51,464 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-02-15 13:29:51,464 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 13:29:52,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:29:52,187 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:29:52,204 INFO L321 Elim1Store]: treesize reduction 97, result has 19.8 percent of original size [2023-02-15 13:29:52,205 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 190 treesize of output 104 [2023-02-15 13:29:52,228 INFO L321 Elim1Store]: treesize reduction 128, result has 14.7 percent of original size [2023-02-15 13:29:52,228 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 189 treesize of output 139 [2023-02-15 13:29:52,240 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 28 treesize of output 30 [2023-02-15 13:29:52,361 INFO L321 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2023-02-15 13:29:52,362 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 406 treesize of output 271 [2023-02-15 13:29:52,383 INFO L321 Elim1Store]: treesize reduction 86, result has 18.9 percent of original size [2023-02-15 13:29:52,384 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 5 new quantified variables, introduced 6 case distinctions, treesize of input 373 treesize of output 301 [2023-02-15 13:29:52,406 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 121 treesize of output 86 [2023-02-15 13:29:53,454 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:29:53,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:29:53,471 INFO L321 Elim1Store]: treesize reduction 93, result has 10.6 percent of original size [2023-02-15 13:29:53,471 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 305 treesize of output 120 [2023-02-15 13:29:53,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:29:53,485 INFO L321 Elim1Store]: treesize reduction 24, result has 22.6 percent of original size [2023-02-15 13:29:53,485 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 4 case distinctions, treesize of input 62 treesize of output 37 [2023-02-15 13:29:53,600 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 13:29:53,602 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 16 proven. 21 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-15 13:29:53,602 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:29:56,907 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:29:56,907 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 1015 treesize of output 1008 [2023-02-15 13:29:56,938 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:29:56,939 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 16792 treesize of output 15856 [2023-02-15 13:29:56,959 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 19144 treesize of output 15868 [2023-02-15 13:29:56,984 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:29:56,984 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 6213 treesize of output 5749 [2023-02-15 13:29:57,118 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:29:57,118 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 15891 treesize of output 14491