./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/dll2n_update_all.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-simple/dll2n_update_all.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 c46cc56772f2c3f0b073640343b328fb3b128ed13803ffe5a04f6290fe624494 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 19:14:28,845 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 19:14:28,846 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 19:14:28,863 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 19:14:28,864 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 19:14:28,865 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 19:14:28,866 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 19:14:28,867 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 19:14:28,868 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 19:14:28,869 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 19:14:28,870 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 19:14:28,870 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 19:14:28,871 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 19:14:28,871 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 19:14:28,872 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 19:14:28,873 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 19:14:28,873 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 19:14:28,874 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 19:14:28,875 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 19:14:28,876 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 19:14:28,877 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 19:14:28,878 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 19:14:28,879 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 19:14:28,879 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 19:14:28,883 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 19:14:28,886 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 19:14:28,890 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 19:14:28,890 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 19:14:28,891 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 19:14:28,891 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 19:14:28,892 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 19:14:28,893 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 19:14:28,893 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 19:14:28,894 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 19:14:28,895 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 19:14:28,896 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 19:14:28,896 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 19:14:28,897 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 19:14:28,897 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 19:14:28,897 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 19:14:28,898 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 19:14:28,899 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 19:14:28,901 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-12 19:14:28,917 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 19:14:28,917 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 19:14:28,918 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 19:14:28,918 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 19:14:28,918 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 19:14:28,918 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 19:14:28,919 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 19:14:28,919 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 19:14:28,919 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 19:14:28,920 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 19:14:28,920 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 19:14:28,920 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-12 19:14:28,920 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 19:14:28,920 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 19:14:28,920 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 19:14:28,921 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-12 19:14:28,921 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-12 19:14:28,921 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-12 19:14:28,921 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 19:14:28,921 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-12 19:14:28,921 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 19:14:28,922 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 19:14:28,922 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 19:14:28,922 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 19:14:28,922 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 19:14:28,922 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 19:14:28,922 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 19:14:28,922 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 19:14:28,923 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 19:14:28,923 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 19:14:28,923 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c46cc56772f2c3f0b073640343b328fb3b128ed13803ffe5a04f6290fe624494 [2022-07-12 19:14:29,116 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 19:14:29,136 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 19:14:29,138 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 19:14:29,139 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 19:14:29,140 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 19:14:29,141 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2n_update_all.i [2022-07-12 19:14:29,192 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01aba931b/2ff04815d41f4c5c900a700233a7eeac/FLAGcf85b9d8c [2022-07-12 19:14:29,532 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 19:14:29,533 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_update_all.i [2022-07-12 19:14:29,543 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01aba931b/2ff04815d41f4c5c900a700233a7eeac/FLAGcf85b9d8c [2022-07-12 19:14:29,929 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01aba931b/2ff04815d41f4c5c900a700233a7eeac [2022-07-12 19:14:29,932 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 19:14:29,933 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 19:14:29,937 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 19:14:29,937 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 19:14:29,939 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 19:14:29,940 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 07:14:29" (1/1) ... [2022-07-12 19:14:29,940 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@683fc63d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:14:29, skipping insertion in model container [2022-07-12 19:14:29,941 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 07:14:29" (1/1) ... [2022-07-12 19:14:29,945 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 19:14:29,979 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 19:14:30,270 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_update_all.i[24455,24468] [2022-07-12 19:14:30,273 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 19:14:30,280 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 19:14:30,320 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_update_all.i[24455,24468] [2022-07-12 19:14:30,322 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 19:14:30,342 INFO L208 MainTranslator]: Completed translation [2022-07-12 19:14:30,344 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:14:30 WrapperNode [2022-07-12 19:14:30,344 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 19:14:30,345 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 19:14:30,346 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 19:14:30,346 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 19:14:30,351 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:14:30" (1/1) ... [2022-07-12 19:14:30,373 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:14:30" (1/1) ... [2022-07-12 19:14:30,395 INFO L137 Inliner]: procedures = 126, calls = 27, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 114 [2022-07-12 19:14:30,396 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 19:14:30,396 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 19:14:30,396 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 19:14:30,397 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 19:14:30,402 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:14:30" (1/1) ... [2022-07-12 19:14:30,402 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:14:30" (1/1) ... [2022-07-12 19:14:30,414 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:14:30" (1/1) ... [2022-07-12 19:14:30,415 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:14:30" (1/1) ... [2022-07-12 19:14:30,425 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:14:30" (1/1) ... [2022-07-12 19:14:30,427 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:14:30" (1/1) ... [2022-07-12 19:14:30,431 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:14:30" (1/1) ... [2022-07-12 19:14:30,436 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 19:14:30,438 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 19:14:30,439 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 19:14:30,439 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 19:14:30,439 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:14:30" (1/1) ... [2022-07-12 19:14:30,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 19:14:30,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:14:30,460 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 19:14:30,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 19:14:30,490 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2022-07-12 19:14:30,490 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2022-07-12 19:14:30,490 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 19:14:30,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 19:14:30,491 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 19:14:30,491 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 19:14:30,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 19:14:30,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 19:14:30,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 19:14:30,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 19:14:30,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 19:14:30,491 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 19:14:30,570 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 19:14:30,571 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 19:14:30,597 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2022-07-12 19:14:30,745 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 19:14:30,749 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 19:14:30,750 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-07-12 19:14:30,752 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 07:14:30 BoogieIcfgContainer [2022-07-12 19:14:30,753 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 19:14:30,754 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 19:14:30,755 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 19:14:30,757 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 19:14:30,757 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 07:14:29" (1/3) ... [2022-07-12 19:14:30,758 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35ff0af9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 07:14:30, skipping insertion in model container [2022-07-12 19:14:30,758 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:14:30" (2/3) ... [2022-07-12 19:14:30,758 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35ff0af9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 07:14:30, skipping insertion in model container [2022-07-12 19:14:30,759 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 07:14:30" (3/3) ... [2022-07-12 19:14:30,759 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2n_update_all.i [2022-07-12 19:14:30,768 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 19:14:30,769 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 23 error locations. [2022-07-12 19:14:30,805 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 19:14:30,809 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@660affd8, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@8d1d9fd [2022-07-12 19:14:30,809 INFO L358 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2022-07-12 19:14:30,812 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 42 states have (on average 1.9047619047619047) internal successors, (80), 65 states have internal predecessors, (80), 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) [2022-07-12 19:14:30,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-12 19:14:30,816 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:14:30,816 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-12 19:14:30,817 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-12 19:14:30,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:14:30,820 INFO L85 PathProgramCache]: Analyzing trace with hash 33471376, now seen corresponding path program 1 times [2022-07-12 19:14:30,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:14:30,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000648] [2022-07-12 19:14:30,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:14:30,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:14:30,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:14:30,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:14:30,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:14:30,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000648] [2022-07-12 19:14:30,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000648] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:14:30,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:14:30,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 19:14:30,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638795209] [2022-07-12 19:14:30,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:14:30,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:14:30,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:14:31,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:14:31,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:14:31,011 INFO L87 Difference]: Start difference. First operand has 67 states, 42 states have (on average 1.9047619047619047) internal successors, (80), 65 states have internal predecessors, (80), 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) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:14:31,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:14:31,107 INFO L93 Difference]: Finished difference Result 111 states and 123 transitions. [2022-07-12 19:14:31,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:14:31,111 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-07-12 19:14:31,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:14:31,116 INFO L225 Difference]: With dead ends: 111 [2022-07-12 19:14:31,118 INFO L226 Difference]: Without dead ends: 104 [2022-07-12 19:14:31,119 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:14:31,122 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 63 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:14:31,123 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 136 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:14:31,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-07-12 19:14:31,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 59. [2022-07-12 19:14:31,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 39 states have (on average 1.6666666666666667) internal successors, (65), 58 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:14:31,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2022-07-12 19:14:31,154 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 65 transitions. Word has length 5 [2022-07-12 19:14:31,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:14:31,154 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 65 transitions. [2022-07-12 19:14:31,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:14:31,155 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2022-07-12 19:14:31,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-12 19:14:31,155 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:14:31,156 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-12 19:14:31,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 19:14:31,156 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-12 19:14:31,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:14:31,157 INFO L85 PathProgramCache]: Analyzing trace with hash 33471377, now seen corresponding path program 1 times [2022-07-12 19:14:31,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:14:31,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596672021] [2022-07-12 19:14:31,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:14:31,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:14:31,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:14:31,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:14:31,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:14:31,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596672021] [2022-07-12 19:14:31,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596672021] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:14:31,221 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:14:31,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 19:14:31,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547167875] [2022-07-12 19:14:31,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:14:31,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:14:31,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:14:31,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:14:31,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:14:31,224 INFO L87 Difference]: Start difference. First operand 59 states and 65 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:14:31,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:14:31,288 INFO L93 Difference]: Finished difference Result 101 states and 112 transitions. [2022-07-12 19:14:31,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:14:31,289 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-07-12 19:14:31,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:14:31,289 INFO L225 Difference]: With dead ends: 101 [2022-07-12 19:14:31,289 INFO L226 Difference]: Without dead ends: 101 [2022-07-12 19:14:31,290 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:14:31,290 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 58 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:14:31,291 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 133 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:14:31,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-07-12 19:14:31,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 56. [2022-07-12 19:14:31,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 39 states have (on average 1.5897435897435896) internal successors, (62), 55 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:14:31,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 62 transitions. [2022-07-12 19:14:31,298 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 62 transitions. Word has length 5 [2022-07-12 19:14:31,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:14:31,299 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 62 transitions. [2022-07-12 19:14:31,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:14:31,300 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2022-07-12 19:14:31,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-12 19:14:31,300 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:14:31,301 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:14:31,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 19:14:31,301 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-12 19:14:31,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:14:31,304 INFO L85 PathProgramCache]: Analyzing trace with hash 678997037, now seen corresponding path program 1 times [2022-07-12 19:14:31,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:14:31,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390958502] [2022-07-12 19:14:31,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:14:31,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:14:31,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:14:31,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:14:31,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:14:31,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390958502] [2022-07-12 19:14:31,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390958502] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:14:31,321 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:14:31,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 19:14:31,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702585983] [2022-07-12 19:14:31,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:14:31,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:14:31,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:14:31,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:14:31,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:14:31,323 INFO L87 Difference]: Start difference. First operand 56 states and 62 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:14:31,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:14:31,332 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2022-07-12 19:14:31,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:14:31,333 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-07-12 19:14:31,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:14:31,333 INFO L225 Difference]: With dead ends: 66 [2022-07-12 19:14:31,334 INFO L226 Difference]: Without dead ends: 66 [2022-07-12 19:14:31,335 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:14:31,336 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 10 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:14:31,337 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 118 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:14:31,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-07-12 19:14:31,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 57. [2022-07-12 19:14:31,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 40 states have (on average 1.575) internal successors, (63), 56 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:14:31,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions. [2022-07-12 19:14:31,344 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 63 transitions. Word has length 8 [2022-07-12 19:14:31,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:14:31,345 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 63 transitions. [2022-07-12 19:14:31,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:14:31,345 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2022-07-12 19:14:31,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-12 19:14:31,345 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:14:31,346 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:14:31,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 19:14:31,346 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-12 19:14:31,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:14:31,346 INFO L85 PathProgramCache]: Analyzing trace with hash 638916372, now seen corresponding path program 1 times [2022-07-12 19:14:31,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:14:31,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332433740] [2022-07-12 19:14:31,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:14:31,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:14:31,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:14:31,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:14:31,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:14:31,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332433740] [2022-07-12 19:14:31,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332433740] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:14:31,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:14:31,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 19:14:31,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422267911] [2022-07-12 19:14:31,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:14:31,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:14:31,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:14:31,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:14:31,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:14:31,411 INFO L87 Difference]: Start difference. First operand 57 states and 63 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:14:31,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:14:31,428 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2022-07-12 19:14:31,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:14:31,428 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-07-12 19:14:31,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:14:31,429 INFO L225 Difference]: With dead ends: 63 [2022-07-12 19:14:31,429 INFO L226 Difference]: Without dead ends: 63 [2022-07-12 19:14:31,429 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:14:31,436 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 1 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:14:31,437 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 113 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:14:31,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-07-12 19:14:31,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2022-07-12 19:14:31,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 45 states have (on average 1.511111111111111) internal successors, (68), 61 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:14:31,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2022-07-12 19:14:31,447 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 9 [2022-07-12 19:14:31,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:14:31,448 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2022-07-12 19:14:31,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:14:31,448 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2022-07-12 19:14:31,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-12 19:14:31,449 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:14:31,449 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:14:31,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 19:14:31,449 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-12 19:14:31,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:14:31,450 INFO L85 PathProgramCache]: Analyzing trace with hash 2114731710, now seen corresponding path program 1 times [2022-07-12 19:14:31,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:14:31,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595299] [2022-07-12 19:14:31,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:14:31,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:14:31,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:14:31,496 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:14:31,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:14:31,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595299] [2022-07-12 19:14:31,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595299] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:14:31,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1025823230] [2022-07-12 19:14:31,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:14:31,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:14:31,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:14:31,499 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 19:14:31,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-12 19:14:31,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:14:31,581 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-12 19:14:31,584 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:14:31,621 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:14:31,621 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:14:31,654 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:14:31,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1025823230] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:14:31,655 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 19:14:31,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2022-07-12 19:14:31,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078071884] [2022-07-12 19:14:31,655 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 19:14:31,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 19:14:31,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:14:31,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 19:14:31,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-12 19:14:31,656 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:14:31,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:14:31,669 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2022-07-12 19:14:31,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 19:14:31,670 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-07-12 19:14:31,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:14:31,670 INFO L225 Difference]: With dead ends: 64 [2022-07-12 19:14:31,670 INFO L226 Difference]: Without dead ends: 64 [2022-07-12 19:14:31,671 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-12 19:14:31,671 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 16 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:14:31,671 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 167 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:14:31,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-07-12 19:14:31,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2022-07-12 19:14:31,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 47 states have (on average 1.4893617021276595) internal successors, (70), 63 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:14:31,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2022-07-12 19:14:31,674 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 15 [2022-07-12 19:14:31,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:14:31,674 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2022-07-12 19:14:31,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:14:31,674 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2022-07-12 19:14:31,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-12 19:14:31,674 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:14:31,674 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-07-12 19:14:31,696 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-12 19:14:31,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:14:31,887 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-12 19:14:31,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:14:31,888 INFO L85 PathProgramCache]: Analyzing trace with hash -2097949021, now seen corresponding path program 1 times [2022-07-12 19:14:31,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:14:31,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304792312] [2022-07-12 19:14:31,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:14:31,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:14:31,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:14:31,956 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:14:31,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:14:31,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304792312] [2022-07-12 19:14:31,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304792312] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:14:31,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1560535485] [2022-07-12 19:14:31,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:14:31,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:14:31,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:14:31,959 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 19:14:31,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-12 19:14:32,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:14:32,036 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-12 19:14:32,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:14:32,066 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:14:32,110 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-12 19:14:32,111 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-12 19:14:32,121 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:14:32,121 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:14:32,236 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:14:32,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1560535485] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:14:32,237 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 19:14:32,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 6 [2022-07-12 19:14:32,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355691803] [2022-07-12 19:14:32,237 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 19:14:32,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 19:14:32,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:14:32,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 19:14:32,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:14:32,239 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:14:32,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:14:32,292 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2022-07-12 19:14:32,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 19:14:32,292 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-12 19:14:32,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:14:32,293 INFO L225 Difference]: With dead ends: 77 [2022-07-12 19:14:32,293 INFO L226 Difference]: Without dead ends: 77 [2022-07-12 19:14:32,293 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-07-12 19:14:32,294 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 266 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 23 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:14:32,294 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 66 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 23 Unchecked, 0.0s Time] [2022-07-12 19:14:32,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-07-12 19:14:32,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 63. [2022-07-12 19:14:32,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 47 states have (on average 1.4680851063829787) internal successors, (69), 62 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:14:32,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2022-07-12 19:14:32,297 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 16 [2022-07-12 19:14:32,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:14:32,297 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2022-07-12 19:14:32,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:14:32,298 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2022-07-12 19:14:32,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-12 19:14:32,298 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:14:32,298 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-07-12 19:14:32,314 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-12 19:14:32,517 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,SelfDestructingSolverStorable5 [2022-07-12 19:14:32,517 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-12 19:14:32,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:14:32,518 INFO L85 PathProgramCache]: Analyzing trace with hash -2097949020, now seen corresponding path program 1 times [2022-07-12 19:14:32,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:14:32,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194641621] [2022-07-12 19:14:32,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:14:32,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:14:32,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:14:32,601 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:14:32,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:14:32,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194641621] [2022-07-12 19:14:32,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194641621] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:14:32,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1697814481] [2022-07-12 19:14:32,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:14:32,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:14:32,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:14:32,604 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 19:14:32,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-12 19:14:32,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:14:32,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-12 19:14:32,670 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:14:32,677 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:14:32,680 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:14:32,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:14:32,714 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-12 19:14:32,719 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:14:32,720 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 19:14:32,734 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:14:32,734 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:14:32,915 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:14:32,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1697814481] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:14:32,915 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 19:14:32,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 9 [2022-07-12 19:14:32,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878965566] [2022-07-12 19:14:32,916 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 19:14:32,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 19:14:32,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:14:32,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 19:14:32,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-07-12 19:14:32,917 INFO L87 Difference]: Start difference. First operand 63 states and 69 transitions. Second operand has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:14:32,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:14:32,982 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2022-07-12 19:14:32,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 19:14:32,984 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-12 19:14:32,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:14:32,986 INFO L225 Difference]: With dead ends: 76 [2022-07-12 19:14:32,986 INFO L226 Difference]: Without dead ends: 76 [2022-07-12 19:14:32,987 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-07-12 19:14:32,988 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 294 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 24 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:14:32,988 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 67 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 70 Invalid, 0 Unknown, 24 Unchecked, 0.0s Time] [2022-07-12 19:14:32,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-07-12 19:14:32,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 62. [2022-07-12 19:14:32,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 47 states have (on average 1.446808510638298) internal successors, (68), 61 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:14:32,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2022-07-12 19:14:32,991 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 16 [2022-07-12 19:14:32,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:14:32,991 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2022-07-12 19:14:32,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:14:32,992 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2022-07-12 19:14:32,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-12 19:14:32,992 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:14:32,992 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:14:33,009 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-12 19:14:33,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:14:33,208 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-12 19:14:33,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:14:33,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1891969267, now seen corresponding path program 2 times [2022-07-12 19:14:33,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:14:33,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300949505] [2022-07-12 19:14:33,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:14:33,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:14:33,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:14:33,265 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:14:33,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:14:33,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300949505] [2022-07-12 19:14:33,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300949505] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:14:33,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1656483093] [2022-07-12 19:14:33,266 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 19:14:33,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:14:33,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:14:33,267 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 19:14:33,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-12 19:14:33,321 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-12 19:14:33,322 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 19:14:33,322 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 19:14:33,323 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:14:33,332 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-12 19:14:33,332 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:14:33,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1656483093] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:14:33,333 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 19:14:33,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-07-12 19:14:33,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167530558] [2022-07-12 19:14:33,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:14:33,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 19:14:33,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:14:33,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 19:14:33,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 19:14:33,334 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:14:33,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:14:33,357 INFO L93 Difference]: Finished difference Result 160 states and 173 transitions. [2022-07-12 19:14:33,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 19:14:33,358 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-12 19:14:33,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:14:33,359 INFO L225 Difference]: With dead ends: 160 [2022-07-12 19:14:33,359 INFO L226 Difference]: Without dead ends: 160 [2022-07-12 19:14:33,359 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:14:33,359 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 113 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:14:33,360 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 212 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:14:33,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-07-12 19:14:33,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 64. [2022-07-12 19:14:33,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 49 states have (on average 1.4489795918367347) internal successors, (71), 63 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:14:33,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 71 transitions. [2022-07-12 19:14:33,363 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 71 transitions. Word has length 22 [2022-07-12 19:14:33,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:14:33,363 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 71 transitions. [2022-07-12 19:14:33,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:14:33,363 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 71 transitions. [2022-07-12 19:14:33,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-12 19:14:33,364 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:14:33,364 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:14:33,382 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-07-12 19:14:33,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:14:33,580 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-12 19:14:33,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:14:33,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1891969322, now seen corresponding path program 1 times [2022-07-12 19:14:33,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:14:33,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526452430] [2022-07-12 19:14:33,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:14:33,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:14:33,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:14:33,632 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:14:33,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:14:33,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526452430] [2022-07-12 19:14:33,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526452430] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:14:33,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [960183450] [2022-07-12 19:14:33,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:14:33,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:14:33,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:14:33,634 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 19:14:33,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-12 19:14:33,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:14:33,728 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-12 19:14:33,728 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:14:33,740 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:14:33,740 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:14:33,760 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:14:33,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [960183450] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:14:33,770 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 19:14:33,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2022-07-12 19:14:33,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690085796] [2022-07-12 19:14:33,770 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 19:14:33,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 19:14:33,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:14:33,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 19:14:33,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 19:14:33,771 INFO L87 Difference]: Start difference. First operand 64 states and 71 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:14:33,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:14:33,790 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2022-07-12 19:14:33,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 19:14:33,791 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-12 19:14:33,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:14:33,791 INFO L225 Difference]: With dead ends: 64 [2022-07-12 19:14:33,791 INFO L226 Difference]: Without dead ends: 64 [2022-07-12 19:14:33,791 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 19:14:33,792 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 103 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:14:33,792 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 56 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:14:33,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-07-12 19:14:33,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2022-07-12 19:14:33,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 49 states have (on average 1.4285714285714286) internal successors, (70), 63 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:14:33,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2022-07-12 19:14:33,794 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 22 [2022-07-12 19:14:33,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:14:33,794 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2022-07-12 19:14:33,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:14:33,794 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2022-07-12 19:14:33,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-12 19:14:33,795 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:14:33,795 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:14:33,830 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-12 19:14:34,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:14:34,003 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-12 19:14:34,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:14:34,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1779022437, now seen corresponding path program 1 times [2022-07-12 19:14:34,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:14:34,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722606087] [2022-07-12 19:14:34,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:14:34,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:14:34,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:14:34,042 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-12 19:14:34,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:14:34,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722606087] [2022-07-12 19:14:34,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722606087] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:14:34,042 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:14:34,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 19:14:34,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097799779] [2022-07-12 19:14:34,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:14:34,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 19:14:34,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:14:34,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 19:14:34,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:14:34,044 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:14:34,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:14:34,154 INFO L93 Difference]: Finished difference Result 114 states and 123 transitions. [2022-07-12 19:14:34,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 19:14:34,155 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-07-12 19:14:34,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:14:34,155 INFO L225 Difference]: With dead ends: 114 [2022-07-12 19:14:34,155 INFO L226 Difference]: Without dead ends: 114 [2022-07-12 19:14:34,156 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-07-12 19:14:34,156 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 259 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:14:34,156 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 123 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:14:34,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-07-12 19:14:34,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 67. [2022-07-12 19:14:34,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 52 states have (on average 1.4615384615384615) internal successors, (76), 66 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:14:34,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 76 transitions. [2022-07-12 19:14:34,159 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 76 transitions. Word has length 23 [2022-07-12 19:14:34,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:14:34,159 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 76 transitions. [2022-07-12 19:14:34,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:14:34,160 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 76 transitions. [2022-07-12 19:14:34,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-12 19:14:34,160 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:14:34,160 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:14:34,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-12 19:14:34,161 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-12 19:14:34,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:14:34,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1779022436, now seen corresponding path program 1 times [2022-07-12 19:14:34,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:14:34,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713310729] [2022-07-12 19:14:34,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:14:34,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:14:34,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:14:34,224 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:14:34,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:14:34,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713310729] [2022-07-12 19:14:34,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713310729] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:14:34,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:14:34,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 19:14:34,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58244720] [2022-07-12 19:14:34,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:14:34,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 19:14:34,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:14:34,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 19:14:34,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:14:34,227 INFO L87 Difference]: Start difference. First operand 67 states and 76 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:14:34,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:14:34,338 INFO L93 Difference]: Finished difference Result 102 states and 112 transitions. [2022-07-12 19:14:34,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 19:14:34,343 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-07-12 19:14:34,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:14:34,345 INFO L225 Difference]: With dead ends: 102 [2022-07-12 19:14:34,345 INFO L226 Difference]: Without dead ends: 102 [2022-07-12 19:14:34,345 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-07-12 19:14:34,346 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 265 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:14:34,346 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 101 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:14:34,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-07-12 19:14:34,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 67. [2022-07-12 19:14:34,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 52 states have (on average 1.4230769230769231) internal successors, (74), 66 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:14:34,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 74 transitions. [2022-07-12 19:14:34,349 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 74 transitions. Word has length 23 [2022-07-12 19:14:34,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:14:34,349 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 74 transitions. [2022-07-12 19:14:34,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:14:34,349 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2022-07-12 19:14:34,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-12 19:14:34,350 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:14:34,350 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:14:34,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-12 19:14:34,350 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-12 19:14:34,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:14:34,351 INFO L85 PathProgramCache]: Analyzing trace with hash -244809887, now seen corresponding path program 1 times [2022-07-12 19:14:34,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:14:34,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735496014] [2022-07-12 19:14:34,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:14:34,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:14:34,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:14:34,388 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-12 19:14:34,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:14:34,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735496014] [2022-07-12 19:14:34,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735496014] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:14:34,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:14:34,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 19:14:34,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187648114] [2022-07-12 19:14:34,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:14:34,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 19:14:34,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:14:34,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 19:14:34,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:14:34,391 INFO L87 Difference]: Start difference. First operand 67 states and 74 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:14:34,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:14:34,510 INFO L93 Difference]: Finished difference Result 102 states and 111 transitions. [2022-07-12 19:14:34,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 19:14:34,511 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-07-12 19:14:34,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:14:34,511 INFO L225 Difference]: With dead ends: 102 [2022-07-12 19:14:34,511 INFO L226 Difference]: Without dead ends: 102 [2022-07-12 19:14:34,512 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-07-12 19:14:34,512 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 243 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:14:34,512 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 106 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:14:34,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-07-12 19:14:34,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 70. [2022-07-12 19:14:34,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 55 states have (on average 1.4545454545454546) internal successors, (80), 69 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:14:34,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 80 transitions. [2022-07-12 19:14:34,515 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 80 transitions. Word has length 25 [2022-07-12 19:14:34,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:14:34,515 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 80 transitions. [2022-07-12 19:14:34,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:14:34,515 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 80 transitions. [2022-07-12 19:14:34,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-12 19:14:34,516 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:14:34,516 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:14:34,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-12 19:14:34,516 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-12 19:14:34,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:14:34,516 INFO L85 PathProgramCache]: Analyzing trace with hash -244809886, now seen corresponding path program 1 times [2022-07-12 19:14:34,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:14:34,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207503528] [2022-07-12 19:14:34,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:14:34,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:14:34,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:14:34,551 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:14:34,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:14:34,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207503528] [2022-07-12 19:14:34,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207503528] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:14:34,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1463886099] [2022-07-12 19:14:34,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:14:34,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:14:34,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:14:34,553 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 19:14:34,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-12 19:14:34,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:14:34,630 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 19:14:34,631 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:14:34,678 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-12 19:14:34,678 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:14:34,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1463886099] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:14:34,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 19:14:34,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2022-07-12 19:14:34,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275295141] [2022-07-12 19:14:34,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:14:34,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 19:14:34,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:14:34,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 19:14:34,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-12 19:14:34,680 INFO L87 Difference]: Start difference. First operand 70 states and 80 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:14:34,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:14:34,691 INFO L93 Difference]: Finished difference Result 91 states and 104 transitions. [2022-07-12 19:14:34,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 19:14:34,691 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-07-12 19:14:34,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:14:34,692 INFO L225 Difference]: With dead ends: 91 [2022-07-12 19:14:34,692 INFO L226 Difference]: Without dead ends: 91 [2022-07-12 19:14:34,692 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-12 19:14:34,692 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 85 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:14:34,693 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 105 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:14:34,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-07-12 19:14:34,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 71. [2022-07-12 19:14:34,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 56 states have (on average 1.4285714285714286) internal successors, (80), 70 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:14:34,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 80 transitions. [2022-07-12 19:14:34,706 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 80 transitions. Word has length 25 [2022-07-12 19:14:34,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:14:34,706 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 80 transitions. [2022-07-12 19:14:34,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:14:34,706 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 80 transitions. [2022-07-12 19:14:34,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-12 19:14:34,707 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:14:34,707 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:14:34,739 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-12 19:14:34,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:14:34,923 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-12 19:14:34,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:14:34,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1962551634, now seen corresponding path program 1 times [2022-07-12 19:14:34,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:14:34,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367365415] [2022-07-12 19:14:34,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:14:34,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:14:34,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:14:34,989 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 19:14:34,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:14:34,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367365415] [2022-07-12 19:14:34,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367365415] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:14:34,989 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:14:34,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 19:14:34,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708844243] [2022-07-12 19:14:34,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:14:34,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 19:14:34,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:14:34,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 19:14:34,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:14:34,991 INFO L87 Difference]: Start difference. First operand 71 states and 80 transitions. Second operand has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:14:35,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:14:35,096 INFO L93 Difference]: Finished difference Result 94 states and 102 transitions. [2022-07-12 19:14:35,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 19:14:35,096 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-07-12 19:14:35,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:14:35,097 INFO L225 Difference]: With dead ends: 94 [2022-07-12 19:14:35,097 INFO L226 Difference]: Without dead ends: 94 [2022-07-12 19:14:35,097 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-07-12 19:14:35,098 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 324 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:14:35,098 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 75 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:14:35,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-07-12 19:14:35,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 71. [2022-07-12 19:14:35,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 70 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:14:35,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 78 transitions. [2022-07-12 19:14:35,100 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 78 transitions. Word has length 30 [2022-07-12 19:14:35,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:14:35,100 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 78 transitions. [2022-07-12 19:14:35,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:14:35,100 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 78 transitions. [2022-07-12 19:14:35,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-12 19:14:35,101 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:14:35,101 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:14:35,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-12 19:14:35,101 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-12 19:14:35,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:14:35,102 INFO L85 PathProgramCache]: Analyzing trace with hash -669697558, now seen corresponding path program 1 times [2022-07-12 19:14:35,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:14:35,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558293555] [2022-07-12 19:14:35,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:14:35,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:14:35,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:14:35,136 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-12 19:14:35,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:14:35,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558293555] [2022-07-12 19:14:35,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558293555] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:14:35,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [966873682] [2022-07-12 19:14:35,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:14:35,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:14:35,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:14:35,138 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 19:14:35,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-12 19:14:35,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:14:35,240 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 19:14:35,242 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:14:35,260 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-12 19:14:35,260 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:14:35,277 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-12 19:14:35,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [966873682] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:14:35,277 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 19:14:35,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 7 [2022-07-12 19:14:35,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051145579] [2022-07-12 19:14:35,278 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 19:14:35,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 19:14:35,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:14:35,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 19:14:35,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:14:35,279 INFO L87 Difference]: Start difference. First operand 71 states and 78 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:14:35,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:14:35,322 INFO L93 Difference]: Finished difference Result 136 states and 150 transitions. [2022-07-12 19:14:35,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 19:14:35,323 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-07-12 19:14:35,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:14:35,324 INFO L225 Difference]: With dead ends: 136 [2022-07-12 19:14:35,324 INFO L226 Difference]: Without dead ends: 136 [2022-07-12 19:14:35,325 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-07-12 19:14:35,326 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 152 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:14:35,326 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 232 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:14:35,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-07-12 19:14:35,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 79. [2022-07-12 19:14:35,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 64 states have (on average 1.375) internal successors, (88), 78 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:14:35,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 88 transitions. [2022-07-12 19:14:35,328 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 88 transitions. Word has length 31 [2022-07-12 19:14:35,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:14:35,330 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 88 transitions. [2022-07-12 19:14:35,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:14:35,330 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 88 transitions. [2022-07-12 19:14:35,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-12 19:14:35,333 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:14:35,333 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:14:35,353 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-12 19:14:35,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:14:35,547 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-12 19:14:35,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:14:35,547 INFO L85 PathProgramCache]: Analyzing trace with hash -669697613, now seen corresponding path program 1 times [2022-07-12 19:14:35,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:14:35,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322774358] [2022-07-12 19:14:35,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:14:35,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:14:35,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:14:35,691 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:14:35,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:14:35,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322774358] [2022-07-12 19:14:35,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322774358] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:14:35,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [665461959] [2022-07-12 19:14:35,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:14:35,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:14:35,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:14:35,693 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 19:14:35,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-12 19:14:35,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:14:35,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 51 conjunts are in the unsatisfiable core [2022-07-12 19:14:35,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:14:35,801 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:14:35,825 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:14:35,825 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 19:14:35,842 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 19:14:35,866 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-12 19:14:35,866 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-07-12 19:14:35,884 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:14:35,884 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2022-07-12 19:14:36,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:14:36,007 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2022-07-12 19:14:36,060 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-07-12 19:14:36,064 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:14:36,064 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:14:41,297 INFO L356 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2022-07-12 19:14:41,297 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 19:14:41,301 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_886 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_886) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) is different from false [2022-07-12 19:14:41,321 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_884 Int) (v_ArrVal_886 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_884)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_886) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) is different from false [2022-07-12 19:14:41,335 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-07-12 19:14:41,336 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 33 [2022-07-12 19:14:41,339 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-12 19:14:41,342 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-12 19:14:41,384 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2022-07-12 19:14:41,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [665461959] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:14:41,385 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 19:14:41,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 14] total 32 [2022-07-12 19:14:41,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271452788] [2022-07-12 19:14:41,386 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 19:14:41,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-07-12 19:14:41,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:14:41,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-12 19:14:41,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=844, Unknown=3, NotChecked=118, Total=1056 [2022-07-12 19:14:41,390 INFO L87 Difference]: Start difference. First operand 79 states and 88 transitions. Second operand has 33 states, 32 states have (on average 2.46875) internal successors, (79), 33 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:14:42,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:14:42,302 INFO L93 Difference]: Finished difference Result 217 states and 242 transitions. [2022-07-12 19:14:42,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-12 19:14:42,303 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.46875) internal successors, (79), 33 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-07-12 19:14:42,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:14:42,304 INFO L225 Difference]: With dead ends: 217 [2022-07-12 19:14:42,304 INFO L226 Difference]: Without dead ends: 217 [2022-07-12 19:14:42,305 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 402 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=332, Invalid=1927, Unknown=5, NotChecked=186, Total=2450 [2022-07-12 19:14:42,305 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 1050 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 713 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1050 SdHoareTripleChecker+Valid, 734 SdHoareTripleChecker+Invalid, 1240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 464 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 19:14:42,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1050 Valid, 734 Invalid, 1240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 713 Invalid, 0 Unknown, 464 Unchecked, 0.4s Time] [2022-07-12 19:14:42,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2022-07-12 19:14:42,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 109. [2022-07-12 19:14:42,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 94 states have (on average 1.3404255319148937) internal successors, (126), 108 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:14:42,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 126 transitions. [2022-07-12 19:14:42,309 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 126 transitions. Word has length 31 [2022-07-12 19:14:42,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:14:42,309 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 126 transitions. [2022-07-12 19:14:42,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.46875) internal successors, (79), 33 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:14:42,309 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 126 transitions. [2022-07-12 19:14:42,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-12 19:14:42,309 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:14:42,309 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:14:42,326 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-07-12 19:14:42,510 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,SelfDestructingSolverStorable15 [2022-07-12 19:14:42,510 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-12 19:14:42,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:14:42,511 INFO L85 PathProgramCache]: Analyzing trace with hash -669697612, now seen corresponding path program 1 times [2022-07-12 19:14:42,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:14:42,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28499823] [2022-07-12 19:14:42,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:14:42,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:14:42,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:14:42,761 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:14:42,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:14:42,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28499823] [2022-07-12 19:14:42,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28499823] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:14:42,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [196647816] [2022-07-12 19:14:42,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:14:42,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:14:42,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:14:42,763 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 19:14:42,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-12 19:14:42,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:14:42,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 65 conjunts are in the unsatisfiable core [2022-07-12 19:14:42,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:14:42,868 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:14:42,915 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:14:42,916 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 19:14:42,944 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 19:14:42,948 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 19:14:42,981 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-12 19:14:42,982 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-07-12 19:14:42,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:14:42,991 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-12 19:14:43,014 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:14:43,014 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 53 [2022-07-12 19:14:43,018 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 41 [2022-07-12 19:14:43,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:14:43,178 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 33 [2022-07-12 19:14:43,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:14:43,182 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2022-07-12 19:14:43,229 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2022-07-12 19:14:43,232 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2022-07-12 19:14:43,279 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:14:43,279 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:14:44,033 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_18| Int)) (or (forall ((v_ArrVal_1006 Int) (v_ArrVal_1005 Int)) (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (<= (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_ArrVal_1005) .cse0) 4) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_ArrVal_1006) .cse0))))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_18|))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_18| Int)) (or (forall ((v_ArrVal_1005 Int)) (<= 0 (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_ArrVal_1005) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_18|)))) is different from false [2022-07-12 19:14:44,603 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_18| Int)) (or (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_18|) (forall ((v_ArrVal_1005 Int)) (<= 0 (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_ArrVal_1005) (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)))))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_18| Int)) (or (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_18|) (forall ((v_ArrVal_1006 Int) (v_ArrVal_1005 Int)) (let ((.cse0 (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4))) (<= (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_ArrVal_1005) .cse0) 4) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_ArrVal_1006) .cse0)))))))) is different from false [2022-07-12 19:14:46,621 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_18| Int)) (or (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_18|) (forall ((v_ArrVal_1006 Int) (v_ArrVal_1005 Int)) (let ((.cse0 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4))) (<= (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_ArrVal_1005) .cse0) 4) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_ArrVal_1006) .cse0))))))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_18| Int)) (or (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_18|) (forall ((v_ArrVal_1005 Int)) (<= 0 (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_ArrVal_1005) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4))))))) is different from false [2022-07-12 19:14:48,654 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_18| Int)) (or (forall ((v_ArrVal_1006 Int) (v_ArrVal_1005 Int)) (let ((.cse0 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (<= (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_ArrVal_1005) .cse0) 4) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_ArrVal_1006) .cse0))))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_18|))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_18| Int)) (or (forall ((v_ArrVal_1005 Int)) (<= 0 (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_ArrVal_1005) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_18|)))) is different from false [2022-07-12 19:14:48,669 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:14:48,669 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 67 [2022-07-12 19:14:48,707 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1003 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_18| Int) (v_ArrVal_1005 Int)) (or (<= 0 (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1003) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_ArrVal_1005) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_18|))) (forall ((v_prenex_2 Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_2) (forall ((v_prenex_3 Int) (v_prenex_1 (Array Int Int))) (<= (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_1) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) v_prenex_2 v_prenex_3) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8))))) (forall ((v_prenex_2 Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_2) (forall ((v_ArrVal_1004 (Array Int Int)) (v_ArrVal_1006 Int)) (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1004) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) v_prenex_2 v_ArrVal_1006) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|))))) is different from false [2022-07-12 19:14:48,750 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1001 Int) (v_ArrVal_1003 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_18| Int) (v_ArrVal_1005 Int)) (or (<= 0 (select (store (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_1001)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1003) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_ArrVal_1005) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_18|))) (forall ((v_prenex_2 Int) (v_ArrVal_1001 Int)) (or (forall ((v_prenex_3 Int) (v_prenex_1 (Array Int Int))) (<= (select (store (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_1001)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_1) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) v_prenex_2 v_prenex_3) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_2))) (forall ((v_ArrVal_1000 Int) (v_prenex_2 Int)) (or (forall ((v_ArrVal_1004 (Array Int Int)) (v_ArrVal_1006 Int)) (= (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_1000)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1004) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) v_prenex_2 v_ArrVal_1006) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_2)))) is different from false [2022-07-12 19:14:48,764 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:14:48,767 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:14:48,767 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 36 [2022-07-12 19:14:48,771 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2022-07-12 19:14:48,773 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:14:48,774 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-07-12 19:14:48,777 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:14:48,778 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-12 19:14:48,781 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:14:48,783 INFO L356 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-07-12 19:14:48,784 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 1 [2022-07-12 19:14:48,786 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:14:48,789 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:14:48,789 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 36 [2022-07-12 19:14:48,792 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:14:48,794 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2022-07-12 19:14:48,795 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:14:48,796 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-07-12 19:14:48,888 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-07-12 19:14:48,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [196647816] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:14:48,888 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 19:14:48,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 15] total 39 [2022-07-12 19:14:48,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976849085] [2022-07-12 19:14:48,889 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 19:14:48,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-07-12 19:14:48,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:14:48,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-07-12 19:14:48,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1035, Unknown=6, NotChecked=414, Total=1560 [2022-07-12 19:14:48,890 INFO L87 Difference]: Start difference. First operand 109 states and 126 transitions. Second operand has 40 states, 39 states have (on average 2.230769230769231) internal successors, (87), 40 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:14:54,916 WARN L233 SmtUtils]: Spent 5.75s on a formula simplification. DAG size of input: 66 DAG size of output: 49 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 19:14:58,551 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse4)) (.cse1 (select |c_#length| .cse2))) (and (<= 0 .cse0) (<= (+ .cse0 12) .cse1) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (not (= .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= .cse0 0) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_18| Int)) (or (forall ((v_ArrVal_1006 Int) (v_ArrVal_1005 Int)) (let ((.cse3 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (<= (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_ArrVal_1005) .cse3) 4) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_ArrVal_1006) .cse3))))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_18|))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_18| Int)) (or (forall ((v_ArrVal_1005 Int)) (<= 0 (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_ArrVal_1005) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_18|))) (= .cse1 12))))) is different from false [2022-07-12 19:14:59,101 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse5 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4))) (let ((.cse1 (select .cse3 .cse5)) (.cse2 (select .cse4 .cse5))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_18| Int)) (or (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_18|) (forall ((v_ArrVal_1006 Int) (v_ArrVal_1005 Int)) (let ((.cse0 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4))) (<= (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_ArrVal_1005) .cse0) 4) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_ArrVal_1006) .cse0))))))) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (not (= .cse1 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_18| Int)) (or (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_18|) (forall ((v_ArrVal_1005 Int)) (<= 0 (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_ArrVal_1005) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)))))) (<= (+ .cse2 12) (select |c_#length| .cse1)) (= (select |c_#length| (select .cse3 4)) 12) (= (select .cse4 4) 0) (<= 0 .cse2)))) is different from false [2022-07-12 19:14:59,655 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_#res#1.base|)) (.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|)) (.cse5 (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4))) (let ((.cse1 (select .cse2 .cse5)) (.cse0 (select .cse4 .cse5))) (and (<= (+ 12 .cse0) (select |c_#length| .cse1)) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_18| Int)) (or (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_18|) (forall ((v_ArrVal_1005 Int)) (<= 0 (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_ArrVal_1005) (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)))))) (= (select |c_#length| (select .cse2 4)) 12) (not (= .cse1 |c_ULTIMATE.start_dll_create_#res#1.base|)) (<= 0 .cse0) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_18| Int)) (or (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_18|) (forall ((v_ArrVal_1006 Int) (v_ArrVal_1005 Int)) (let ((.cse3 (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4))) (<= (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_ArrVal_1005) .cse3) 4) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_ArrVal_1006) .cse3))))))) (= |c_ULTIMATE.start_dll_create_#res#1.offset| 0) (= (select .cse4 4) 0)))) is different from false [2022-07-12 19:15:00,229 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse4 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse5 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse0 (select .cse4 .cse5)) (.cse1 (select .cse2 .cse5))) (and (<= (+ 12 .cse0) (select |c_#length| .cse1)) (= 12 (select |c_#length| (select .cse2 4))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_18| Int)) (or (forall ((v_ArrVal_1006 Int) (v_ArrVal_1005 Int)) (let ((.cse3 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (<= (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_ArrVal_1005) .cse3) 4) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_ArrVal_1006) .cse3))))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_18|))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_18| Int)) (or (forall ((v_ArrVal_1005 Int)) (<= 0 (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_ArrVal_1005) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_18|))) (= (select .cse4 4) 0) (<= 0 .cse0) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse1))))) is different from false [2022-07-12 19:15:00,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:15:00,754 INFO L93 Difference]: Finished difference Result 236 states and 271 transitions. [2022-07-12 19:15:00,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-12 19:15:00,755 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 2.230769230769231) internal successors, (87), 40 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-07-12 19:15:00,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:15:00,756 INFO L225 Difference]: With dead ends: 236 [2022-07-12 19:15:00,756 INFO L226 Difference]: Without dead ends: 236 [2022-07-12 19:15:00,757 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 17.1s TimeCoverageRelationStatistics Valid=231, Invalid=1689, Unknown=12, NotChecked=930, Total=2862 [2022-07-12 19:15:00,757 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 540 mSDsluCounter, 1278 mSDsCounter, 0 mSdLazyCounter, 821 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 540 SdHoareTripleChecker+Valid, 1346 SdHoareTripleChecker+Invalid, 1619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 774 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 19:15:00,757 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [540 Valid, 1346 Invalid, 1619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 821 Invalid, 0 Unknown, 774 Unchecked, 0.4s Time] [2022-07-12 19:15:00,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2022-07-12 19:15:00,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 147. [2022-07-12 19:15:00,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 132 states have (on average 1.3257575757575757) internal successors, (175), 146 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:00,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 175 transitions. [2022-07-12 19:15:00,760 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 175 transitions. Word has length 31 [2022-07-12 19:15:00,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:15:00,761 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 175 transitions. [2022-07-12 19:15:00,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 2.230769230769231) internal successors, (87), 40 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:00,761 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 175 transitions. [2022-07-12 19:15:00,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-12 19:15:00,761 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:15:00,761 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:15:00,780 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-12 19:15:00,975 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 [2022-07-12 19:15:00,976 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-12 19:15:00,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:15:00,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1015753968, now seen corresponding path program 1 times [2022-07-12 19:15:00,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:15:00,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585252123] [2022-07-12 19:15:00,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:15:00,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:15:01,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:15:01,019 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-12 19:15:01,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:15:01,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585252123] [2022-07-12 19:15:01,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585252123] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:15:01,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:15:01,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 19:15:01,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657804243] [2022-07-12 19:15:01,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:15:01,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 19:15:01,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:15:01,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 19:15:01,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 19:15:01,021 INFO L87 Difference]: Start difference. First operand 147 states and 175 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:01,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:15:01,036 INFO L93 Difference]: Finished difference Result 171 states and 200 transitions. [2022-07-12 19:15:01,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 19:15:01,037 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-07-12 19:15:01,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:15:01,038 INFO L225 Difference]: With dead ends: 171 [2022-07-12 19:15:01,038 INFO L226 Difference]: Without dead ends: 171 [2022-07-12 19:15:01,038 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 19:15:01,039 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 35 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:15:01,039 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 161 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:15:01,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-07-12 19:15:01,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 148. [2022-07-12 19:15:01,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 133 states have (on average 1.3233082706766917) internal successors, (176), 147 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:01,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 176 transitions. [2022-07-12 19:15:01,042 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 176 transitions. Word has length 33 [2022-07-12 19:15:01,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:15:01,042 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 176 transitions. [2022-07-12 19:15:01,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:01,042 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 176 transitions. [2022-07-12 19:15:01,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-12 19:15:01,042 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:15:01,043 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-12 19:15:01,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-12 19:15:01,043 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-12 19:15:01,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:15:01,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1373031599, now seen corresponding path program 1 times [2022-07-12 19:15:01,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:15:01,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310191677] [2022-07-12 19:15:01,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:15:01,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:15:01,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:15:01,089 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:15:01,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:15:01,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310191677] [2022-07-12 19:15:01,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310191677] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:15:01,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [692105166] [2022-07-12 19:15:01,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:15:01,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:15:01,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:15:01,091 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 19:15:01,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-12 19:15:01,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:15:01,205 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 19:15:01,206 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:15:01,246 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-12 19:15:01,246 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:15:01,275 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-12 19:15:01,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [692105166] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:15:01,276 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 19:15:01,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2022-07-12 19:15:01,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280340074] [2022-07-12 19:15:01,276 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 19:15:01,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 19:15:01,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:15:01,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 19:15:01,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-07-12 19:15:01,277 INFO L87 Difference]: Start difference. First operand 148 states and 176 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:01,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:15:01,313 INFO L93 Difference]: Finished difference Result 189 states and 217 transitions. [2022-07-12 19:15:01,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 19:15:01,313 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-07-12 19:15:01,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:15:01,314 INFO L225 Difference]: With dead ends: 189 [2022-07-12 19:15:01,314 INFO L226 Difference]: Without dead ends: 189 [2022-07-12 19:15:01,314 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-07-12 19:15:01,314 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 103 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:15:01,315 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 249 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:15:01,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2022-07-12 19:15:01,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 154. [2022-07-12 19:15:01,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 139 states have (on average 1.2949640287769784) internal successors, (180), 153 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:01,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 180 transitions. [2022-07-12 19:15:01,317 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 180 transitions. Word has length 34 [2022-07-12 19:15:01,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:15:01,317 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 180 transitions. [2022-07-12 19:15:01,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:01,317 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 180 transitions. [2022-07-12 19:15:01,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-12 19:15:01,318 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:15:01,318 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:15:01,337 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-12 19:15:01,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:15:01,531 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-12 19:15:01,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:15:01,531 INFO L85 PathProgramCache]: Analyzing trace with hash -833185593, now seen corresponding path program 2 times [2022-07-12 19:15:01,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:15:01,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098343261] [2022-07-12 19:15:01,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:15:01,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:15:01,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:15:01,564 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 17 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-12 19:15:01,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:15:01,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098343261] [2022-07-12 19:15:01,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098343261] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:15:01,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1246777197] [2022-07-12 19:15:01,564 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 19:15:01,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:15:01,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:15:01,565 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) [2022-07-12 19:15:01,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-12 19:15:01,696 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 19:15:01,697 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 19:15:01,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 19:15:01,703 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:15:01,722 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-12 19:15:01,722 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:15:01,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1246777197] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:15:01,723 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 19:15:01,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2022-07-12 19:15:01,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344108387] [2022-07-12 19:15:01,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:15:01,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 19:15:01,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:15:01,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 19:15:01,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-12 19:15:01,724 INFO L87 Difference]: Start difference. First operand 154 states and 180 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:01,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:15:01,731 INFO L93 Difference]: Finished difference Result 104 states and 120 transitions. [2022-07-12 19:15:01,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 19:15:01,731 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-07-12 19:15:01,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:15:01,732 INFO L225 Difference]: With dead ends: 104 [2022-07-12 19:15:01,732 INFO L226 Difference]: Without dead ends: 104 [2022-07-12 19:15:01,732 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-12 19:15:01,733 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 149 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:15:01,733 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 73 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:15:01,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-07-12 19:15:01,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2022-07-12 19:15:01,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 89 states have (on average 1.348314606741573) internal successors, (120), 103 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:01,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 120 transitions. [2022-07-12 19:15:01,740 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 120 transitions. Word has length 39 [2022-07-12 19:15:01,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:15:01,741 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 120 transitions. [2022-07-12 19:15:01,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:01,741 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 120 transitions. [2022-07-12 19:15:01,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-12 19:15:01,742 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:15:01,742 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:15:01,759 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-12 19:15:01,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:15:01,959 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-12 19:15:01,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:15:01,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1013618178, now seen corresponding path program 2 times [2022-07-12 19:15:01,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:15:01,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357949006] [2022-07-12 19:15:01,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:15:01,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:15:01,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:15:02,019 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-12 19:15:02,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:15:02,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357949006] [2022-07-12 19:15:02,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357949006] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:15:02,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1257159543] [2022-07-12 19:15:02,020 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 19:15:02,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:15:02,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:15:02,024 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) [2022-07-12 19:15:02,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-12 19:15:02,145 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 19:15:02,145 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 19:15:02,147 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-12 19:15:02,149 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:15:02,214 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-12 19:15:02,214 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:15:02,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1257159543] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:15:02,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 19:15:02,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 10 [2022-07-12 19:15:02,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611579399] [2022-07-12 19:15:02,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:15:02,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 19:15:02,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:15:02,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 19:15:02,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-12 19:15:02,216 INFO L87 Difference]: Start difference. First operand 104 states and 120 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:02,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:15:02,231 INFO L93 Difference]: Finished difference Result 82 states and 85 transitions. [2022-07-12 19:15:02,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 19:15:02,232 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-07-12 19:15:02,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:15:02,232 INFO L225 Difference]: With dead ends: 82 [2022-07-12 19:15:02,232 INFO L226 Difference]: Without dead ends: 82 [2022-07-12 19:15:02,233 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-12 19:15:02,233 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 65 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:15:02,233 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 115 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:15:02,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-07-12 19:15:02,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 76. [2022-07-12 19:15:02,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 65 states have (on average 1.2307692307692308) internal successors, (80), 75 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:02,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2022-07-12 19:15:02,235 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 80 transitions. Word has length 39 [2022-07-12 19:15:02,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:15:02,235 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 80 transitions. [2022-07-12 19:15:02,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:02,236 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2022-07-12 19:15:02,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-12 19:15:02,236 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:15:02,236 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-12 19:15:02,253 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-12 19:15:02,439 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 [2022-07-12 19:15:02,440 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-12 19:15:02,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:15:02,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1273435421, now seen corresponding path program 2 times [2022-07-12 19:15:02,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:15:02,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610276965] [2022-07-12 19:15:02,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:15:02,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:15:02,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:15:02,509 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 19:15:02,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:15:02,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610276965] [2022-07-12 19:15:02,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610276965] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:15:02,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1453589474] [2022-07-12 19:15:02,510 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 19:15:02,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:15:02,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:15:02,511 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) [2022-07-12 19:15:02,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-12 19:15:02,648 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 19:15:02,649 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 19:15:02,650 INFO L263 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-12 19:15:02,651 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:15:02,671 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-12 19:15:02,671 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:15:02,683 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-12 19:15:02,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1453589474] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:15:02,683 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 19:15:02,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 10 [2022-07-12 19:15:02,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412366490] [2022-07-12 19:15:02,683 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 19:15:02,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 19:15:02,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:15:02,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 19:15:02,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-07-12 19:15:02,684 INFO L87 Difference]: Start difference. First operand 76 states and 80 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:02,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:15:02,766 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2022-07-12 19:15:02,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 19:15:02,768 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-07-12 19:15:02,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:15:02,768 INFO L225 Difference]: With dead ends: 78 [2022-07-12 19:15:02,768 INFO L226 Difference]: Without dead ends: 78 [2022-07-12 19:15:02,768 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2022-07-12 19:15:02,769 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 171 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:15:02,769 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 271 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:15:02,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-07-12 19:15:02,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2022-07-12 19:15:02,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 65 states have (on average 1.2153846153846153) internal successors, (79), 75 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:02,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2022-07-12 19:15:02,770 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 39 [2022-07-12 19:15:02,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:15:02,770 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2022-07-12 19:15:02,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:02,771 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2022-07-12 19:15:02,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-12 19:15:02,771 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:15:02,771 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-12 19:15:02,791 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-07-12 19:15:02,983 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 [2022-07-12 19:15:02,983 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-12 19:15:02,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:15:02,984 INFO L85 PathProgramCache]: Analyzing trace with hash 993974679, now seen corresponding path program 1 times [2022-07-12 19:15:02,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:15:02,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498782095] [2022-07-12 19:15:02,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:15:02,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:15:03,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:15:03,314 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:15:03,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:15:03,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498782095] [2022-07-12 19:15:03,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498782095] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:15:03,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2110538518] [2022-07-12 19:15:03,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:15:03,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:15:03,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:15:03,316 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) [2022-07-12 19:15:03,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-12 19:15:03,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:15:03,463 INFO L263 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 86 conjunts are in the unsatisfiable core [2022-07-12 19:15:03,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:15:03,483 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:15:03,540 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:15:03,540 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 19:15:03,572 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 19:15:03,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:15:03,605 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-12 19:15:03,622 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:15:03,622 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2022-07-12 19:15:03,772 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2022-07-12 19:15:03,775 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 19:15:03,862 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:15:03,863 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 8 [2022-07-12 19:15:03,928 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 19:15:04,033 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-07-12 19:15:04,104 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:15:04,104 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:15:04,187 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1680 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1680) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~len~0#1|)) (forall ((v_ArrVal_1680 (Array Int Int))) (<= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1680) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) is different from false [2022-07-12 19:15:04,194 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1680 (Array Int Int))) (<= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_1680) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (forall ((v_ArrVal_1680 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_1680) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~len~0#1|))) is different from false [2022-07-12 19:15:04,200 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1680 (Array Int Int))) (<= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_dll_update_at_~head#1.offset| 4)) v_ArrVal_1680) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~len~0#1|)) (forall ((v_ArrVal_1680 (Array Int Int))) (<= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_dll_update_at_~head#1.offset| 4)) v_ArrVal_1680) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) is different from false [2022-07-12 19:15:04,210 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1680 (Array Int Int))) (<= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_1680) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~len~0#1|)) (forall ((v_ArrVal_1680 (Array Int Int))) (<= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_1680) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) is different from false [2022-07-12 19:15:04,221 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:15:04,221 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2022-07-12 19:15:04,228 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:15:04,228 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 61 [2022-07-12 19:15:04,232 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2022-07-12 19:15:04,249 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:15:04,250 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2022-07-12 19:15:04,253 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 50 [2022-07-12 19:15:04,256 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2022-07-12 19:15:04,424 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1674 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1674) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) is different from false [2022-07-12 19:15:04,429 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1673 Int) (v_ArrVal_1674 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_1673)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1674) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))))) is different from false [2022-07-12 19:15:04,444 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-07-12 19:15:04,444 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 34 [2022-07-12 19:15:04,447 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 27 [2022-07-12 19:15:04,449 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-07-12 19:15:04,522 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2022-07-12 19:15:04,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2110538518] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:15:04,522 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 19:15:04,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 58 [2022-07-12 19:15:04,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122150610] [2022-07-12 19:15:04,522 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 19:15:04,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2022-07-12 19:15:04,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:15:04,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2022-07-12 19:15:04,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=2465, Unknown=6, NotChecked=630, Total=3306 [2022-07-12 19:15:04,524 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand has 58 states, 58 states have (on average 1.9482758620689655) internal successors, (113), 58 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:05,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:15:05,459 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2022-07-12 19:15:05,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-12 19:15:05,459 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 58 states have (on average 1.9482758620689655) internal successors, (113), 58 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-07-12 19:15:05,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:15:05,459 INFO L225 Difference]: With dead ends: 76 [2022-07-12 19:15:05,460 INFO L226 Difference]: Without dead ends: 76 [2022-07-12 19:15:05,461 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 48 SyntacticMatches, 5 SemanticMatches, 74 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1420 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=472, Invalid=4376, Unknown=6, NotChecked=846, Total=5700 [2022-07-12 19:15:05,461 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 109 mSDsluCounter, 922 mSDsCounter, 0 mSdLazyCounter, 803 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 956 SdHoareTripleChecker+Invalid, 1289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 803 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 444 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 19:15:05,461 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 956 Invalid, 1289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 803 Invalid, 0 Unknown, 444 Unchecked, 0.3s Time] [2022-07-12 19:15:05,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-07-12 19:15:05,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-07-12 19:15:05,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 65 states have (on average 1.2) internal successors, (78), 75 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:05,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 78 transitions. [2022-07-12 19:15:05,462 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 78 transitions. Word has length 42 [2022-07-12 19:15:05,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:15:05,463 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 78 transitions. [2022-07-12 19:15:05,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 1.9482758620689655) internal successors, (113), 58 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:05,463 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2022-07-12 19:15:05,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-12 19:15:05,463 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:15:05,463 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-12 19:15:05,482 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-07-12 19:15:05,675 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 [2022-07-12 19:15:05,676 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-12 19:15:05,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:15:05,676 INFO L85 PathProgramCache]: Analyzing trace with hash 594303695, now seen corresponding path program 1 times [2022-07-12 19:15:05,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:15:05,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467655301] [2022-07-12 19:15:05,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:15:05,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:15:05,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:15:06,192 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:15:06,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:15:06,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467655301] [2022-07-12 19:15:06,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467655301] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:15:06,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [13320960] [2022-07-12 19:15:06,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:15:06,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:15:06,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:15:06,194 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) [2022-07-12 19:15:06,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-12 19:15:06,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:15:06,325 INFO L263 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 64 conjunts are in the unsatisfiable core [2022-07-12 19:15:06,327 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:15:06,329 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:15:06,374 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:15:06,374 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 19:15:06,396 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 19:15:06,428 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-12 19:15:06,428 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-07-12 19:15:06,440 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:15:06,441 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2022-07-12 19:15:06,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:15:06,626 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2022-07-12 19:15:06,732 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:15:06,733 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2022-07-12 19:15:06,829 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-07-12 19:15:06,833 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 19:15:06,834 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:15:06,907 INFO L356 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2022-07-12 19:15:06,907 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 19:15:06,910 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1806 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1806) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_dll_update_at_~head#1.base|)) is different from false [2022-07-12 19:15:06,918 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1806 (Array Int Int))) (= |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_1806) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) is different from false [2022-07-12 19:15:06,922 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1806 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_dll_update_at_~head#1.offset| 4)))) (= .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1806) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))))) is different from false [2022-07-12 19:15:06,927 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1806 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1806) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) .cse0)))) is different from false [2022-07-12 19:15:06,934 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1805 Int) (v_ArrVal_1806 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) |c_ULTIMATE.start_dll_update_at_~head#1.offset| v_ArrVal_1805))) (.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_1806) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) .cse1)))) is different from false [2022-07-12 19:15:06,943 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1805 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_27| Int) (v_ArrVal_1806 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_27|) (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_27| v_ArrVal_1805)) (.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse1 (select .cse0 .cse2))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse0) .cse1 v_ArrVal_1806) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) .cse1))))) is different from false [2022-07-12 19:15:06,950 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1805 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_27| Int) (v_ArrVal_1806 (Array Int Int))) (or (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_27| v_ArrVal_1805)) (.cse2 (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4))) (let ((.cse0 (select .cse1 .cse2))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base| .cse1) .cse0 v_ArrVal_1806) |c_ULTIMATE.start_dll_create_#res#1.base|) .cse2)))) (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_27|))) is different from false [2022-07-12 19:15:06,956 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1805 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_27| Int) (v_ArrVal_1806 (Array Int Int))) (or (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_27|) (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_27| v_ArrVal_1805)) (.cse2 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4))) (let ((.cse1 (select .cse0 .cse2))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse0) .cse1 v_ArrVal_1806) |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse2) .cse1))))) is different from false [2022-07-12 19:15:06,967 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1805 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_27| Int) (v_ArrVal_1806 (Array Int Int))) (or (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_27| v_ArrVal_1805)) (.cse2 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse1 (select .cse0 .cse2))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse0) .cse1 v_ArrVal_1806) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2) .cse1))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_27|))) is different from false [2022-07-12 19:15:06,975 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1805 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_27| Int) (v_ArrVal_1806 (Array Int Int)) (v_ArrVal_1803 (Array Int Int))) (or (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1803))) (let ((.cse2 (store (select .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_27| v_ArrVal_1805)) (.cse3 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse0 (select .cse2 .cse3))) (= .cse0 (select (select (store (store .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse2) .cse0 v_ArrVal_1806) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3))))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_27|))) is different from false [2022-07-12 19:15:06,986 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1805 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_27| Int) (v_ArrVal_1806 (Array Int Int)) (v_ArrVal_1801 Int) (v_ArrVal_1803 (Array Int Int))) (or (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_1801)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1803))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_27| v_ArrVal_1805)) (.cse3 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse2 (select .cse1 .cse3))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse1) .cse2 v_ArrVal_1806) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3) .cse2)))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_27|))) is different from false [2022-07-12 19:15:06,993 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:15:06,997 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:15:06,997 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 110 treesize of output 71 [2022-07-12 19:15:07,001 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 92 [2022-07-12 19:15:07,003 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:15:07,005 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2022-07-12 19:15:07,008 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:15:07,009 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2022-07-12 19:15:07,012 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-12 19:15:07,069 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 13 not checked. [2022-07-12 19:15:07,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [13320960] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:15:07,070 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 19:15:07,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 17, 19] total 54 [2022-07-12 19:15:07,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145886034] [2022-07-12 19:15:07,070 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 19:15:07,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-07-12 19:15:07,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:15:07,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-07-12 19:15:07,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1785, Unknown=11, NotChecked=1034, Total=2970 [2022-07-12 19:15:07,072 INFO L87 Difference]: Start difference. First operand 76 states and 78 transitions. Second operand has 55 states, 54 states have (on average 2.4444444444444446) internal successors, (132), 55 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:07,277 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) (forall ((v_ArrVal_1805 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_27| Int) (v_ArrVal_1806 (Array Int Int)) (v_ArrVal_1803 (Array Int Int))) (or (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1803))) (let ((.cse3 (store (select .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_27| v_ArrVal_1805)) (.cse4 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse1 (select .cse3 .cse4))) (= .cse1 (select (select (store (store .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse3) .cse1 v_ArrVal_1806) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse4))))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_27|))) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) is different from false [2022-07-12 19:15:07,280 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) (forall ((v_ArrVal_1805 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_27| Int) (v_ArrVal_1806 (Array Int Int)) (v_ArrVal_1803 (Array Int Int))) (or (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1803))) (let ((.cse3 (store (select .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_27| v_ArrVal_1805)) (.cse4 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse1 (select .cse3 .cse4))) (= .cse1 (select (select (store (store .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse3) .cse1 v_ArrVal_1806) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse4))))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_27|))))) is different from false [2022-07-12 19:15:07,282 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (forall ((v_ArrVal_1805 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_27| Int) (v_ArrVal_1806 (Array Int Int))) (or (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_27| v_ArrVal_1805)) (.cse2 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse1 (select .cse0 .cse2))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse0) .cse1 v_ArrVal_1806) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2) .cse1))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_27|))) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) is different from false [2022-07-12 19:15:07,284 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4)) (forall ((v_ArrVal_1805 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_27| Int) (v_ArrVal_1806 (Array Int Int))) (or (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_27|) (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_27| v_ArrVal_1805)) (.cse2 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4))) (let ((.cse1 (select .cse0 .cse2))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse0) .cse1 v_ArrVal_1806) |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse2) .cse1)))))) is different from false [2022-07-12 19:15:07,292 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1805 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_27| Int) (v_ArrVal_1806 (Array Int Int))) (or (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_27| v_ArrVal_1805)) (.cse2 (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4))) (let ((.cse0 (select .cse1 .cse2))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base| .cse1) .cse0 v_ArrVal_1806) |c_ULTIMATE.start_dll_create_#res#1.base|) .cse2)))) (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_27|))) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)) |c_ULTIMATE.start_dll_create_#res#1.base|)) (= |c_ULTIMATE.start_dll_create_#res#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_#res#1.base|) 4)) (= |c_ULTIMATE.start_dll_create_#res#1.offset| 0)) is different from false [2022-07-12 19:15:07,294 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~s~0#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) 4)) (= |c_ULTIMATE.start_main_~i~0#1| 0) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (forall ((v_ArrVal_1805 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_27| Int) (v_ArrVal_1806 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_27|) (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_27| v_ArrVal_1805)) (.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse1 (select .cse0 .cse2))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse0) .cse1 v_ArrVal_1806) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) .cse1)))))) is different from false [2022-07-12 19:15:08,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:15:08,145 INFO L93 Difference]: Finished difference Result 118 states and 121 transitions. [2022-07-12 19:15:08,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-12 19:15:08,146 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 2.4444444444444446) internal successors, (132), 55 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2022-07-12 19:15:08,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:15:08,146 INFO L225 Difference]: With dead ends: 118 [2022-07-12 19:15:08,146 INFO L226 Difference]: Without dead ends: 118 [2022-07-12 19:15:08,147 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 75 ConstructedPredicates, 17 IntricatePredicates, 0 DeprecatedPredicates, 624 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=387, Invalid=3204, Unknown=17, NotChecked=2244, Total=5852 [2022-07-12 19:15:08,148 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 950 mSDsluCounter, 712 mSDsCounter, 0 mSdLazyCounter, 988 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 950 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 2094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 988 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 991 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 19:15:08,148 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [950 Valid, 744 Invalid, 2094 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 988 Invalid, 0 Unknown, 991 Unchecked, 0.4s Time] [2022-07-12 19:15:08,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-07-12 19:15:08,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 80. [2022-07-12 19:15:08,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 69 states have (on average 1.2318840579710144) internal successors, (85), 79 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:08,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 85 transitions. [2022-07-12 19:15:08,149 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 85 transitions. Word has length 48 [2022-07-12 19:15:08,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:15:08,149 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 85 transitions. [2022-07-12 19:15:08,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 2.4444444444444446) internal successors, (132), 55 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:08,150 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2022-07-12 19:15:08,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-12 19:15:08,150 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:15:08,150 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-12 19:15:08,167 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-07-12 19:15:08,363 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 [2022-07-12 19:15:08,363 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-12 19:15:08,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:15:08,364 INFO L85 PathProgramCache]: Analyzing trace with hash 594303696, now seen corresponding path program 1 times [2022-07-12 19:15:08,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:15:08,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777163676] [2022-07-12 19:15:08,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:15:08,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:15:08,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:15:08,808 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 19:15:08,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:15:08,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777163676] [2022-07-12 19:15:08,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777163676] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:15:08,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [338019089] [2022-07-12 19:15:08,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:15:08,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:15:08,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:15:08,810 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) [2022-07-12 19:15:08,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-07-12 19:15:08,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:15:08,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 73 conjunts are in the unsatisfiable core [2022-07-12 19:15:08,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:15:08,948 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:15:08,990 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:15:08,990 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 19:15:09,009 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 19:15:09,034 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-12 19:15:09,034 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-07-12 19:15:09,049 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:15:09,049 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2022-07-12 19:15:09,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:15:09,148 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2022-07-12 19:15:09,256 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:15:09,257 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 53 [2022-07-12 19:15:09,259 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 41 [2022-07-12 19:15:09,365 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2022-07-12 19:15:09,373 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2022-07-12 19:15:09,419 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 19:15:09,419 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:15:09,529 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:15:09,529 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 51 [2022-07-12 19:15:09,659 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:15:09,660 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 124 treesize of output 109 [2022-07-12 19:15:09,667 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-12 19:15:10,062 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_30| Int) (v_ArrVal_1930 Int)) (or (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_30| v_ArrVal_1930) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_main_~s~0#1.base|)) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_30|))) is different from false [2022-07-12 19:15:10,357 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_30| Int) (v_ArrVal_1930 Int)) (or (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_30|) (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_30| v_ArrVal_1930) (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)) |c_ULTIMATE.start_dll_create_#res#1.base|)))) is different from false [2022-07-12 19:15:10,651 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_30| Int) (v_ArrVal_1930 Int)) (or (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_30| v_ArrVal_1930) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_30|))) is different from false [2022-07-12 19:15:10,954 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_30| Int) (v_ArrVal_1930 Int)) (or (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_30| v_ArrVal_1930) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_30|))) is different from false [2022-07-12 19:15:10,962 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_30| Int) (v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1930 Int)) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1929) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_30| v_ArrVal_1930) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_30|))) is different from false [2022-07-12 19:15:10,972 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_30| Int) (v_ArrVal_1926 Int) (v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1930 Int)) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_1926)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1929) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_30| v_ArrVal_1930) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_30|))) is different from false [2022-07-12 19:15:10,977 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:15:10,980 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:15:10,980 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 37 [2022-07-12 19:15:10,983 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 41 [2022-07-12 19:15:10,984 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:15:10,986 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2022-07-12 19:15:10,988 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:15:10,989 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-07-12 19:15:11,040 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2022-07-12 19:15:11,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [338019089] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:15:11,040 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 19:15:11,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 19] total 47 [2022-07-12 19:15:11,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195836911] [2022-07-12 19:15:11,040 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 19:15:11,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-07-12 19:15:11,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:15:11,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-07-12 19:15:11,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1592, Unknown=6, NotChecked=510, Total=2256 [2022-07-12 19:15:11,041 INFO L87 Difference]: Start difference. First operand 80 states and 85 transitions. Second operand has 48 states, 47 states have (on average 2.7872340425531914) internal successors, (131), 48 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:11,580 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse5)) (.cse6 (select |c_#length| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse2 (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0)) (.cse3 (<= .cse6 12)) (.cse1 (= .cse6 12)) (.cse0 (= .cse4 |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (and (or .cse0 (not .cse1)) .cse2 .cse3 (or (and .cse2 .cse3) .cse1) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_30| Int) (v_ArrVal_1930 Int)) (or (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_30| v_ArrVal_1930) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_30|))) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (not (= .cse4 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) .cse0 (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse5) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) (<= (select |c_#length| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 12) (= (select |c_#length| .cse4) 12) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))))) is different from false [2022-07-12 19:15:11,890 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (<= (select |c_#length| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 12) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_30| Int) (v_ArrVal_1930 Int)) (or (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_30| v_ArrVal_1930) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_30|))) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4)) (= (select |c_#length| .cse0) 12) (not (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1))) is different from false [2022-07-12 19:15:12,192 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_30| Int) (v_ArrVal_1930 Int)) (or (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_30| v_ArrVal_1930) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_30|))) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4)) (= (select |c_#length| .cse0) 12) (not (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)))) is different from false [2022-07-12 19:15:12,491 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) 4))) (and (= (select |c_#length| .cse0) 12) (not (= .cse0 |c_ULTIMATE.start_dll_create_#res#1.base|)) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_30| Int) (v_ArrVal_1930 Int)) (or (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_30|) (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_30| v_ArrVal_1930) (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)) |c_ULTIMATE.start_dll_create_#res#1.base|)))) (= |c_ULTIMATE.start_dll_create_#res#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_#res#1.base|) 4)) (= |c_ULTIMATE.start_dll_create_#res#1.offset| 0))) is different from false [2022-07-12 19:15:12,791 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (and (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse0)) (= 12 (select |c_#length| .cse0)) (= |c_ULTIMATE.start_main_~s~0#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) 4)) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_30| Int) (v_ArrVal_1930 Int)) (or (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_30| v_ArrVal_1930) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_main_~s~0#1.base|)) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_30|))))) is different from false [2022-07-12 19:15:13,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:15:13,256 INFO L93 Difference]: Finished difference Result 103 states and 106 transitions. [2022-07-12 19:15:13,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-12 19:15:13,257 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 2.7872340425531914) internal successors, (131), 48 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2022-07-12 19:15:13,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:15:13,257 INFO L225 Difference]: With dead ends: 103 [2022-07-12 19:15:13,257 INFO L226 Difference]: Without dead ends: 103 [2022-07-12 19:15:13,258 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 67 SyntacticMatches, 5 SemanticMatches, 61 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 541 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=278, Invalid=2407, Unknown=11, NotChecked=1210, Total=3906 [2022-07-12 19:15:13,259 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 164 mSDsluCounter, 1029 mSDsCounter, 0 mSdLazyCounter, 598 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 1087 SdHoareTripleChecker+Invalid, 1247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 618 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 19:15:13,259 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 1087 Invalid, 1247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 598 Invalid, 0 Unknown, 618 Unchecked, 0.3s Time] [2022-07-12 19:15:13,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-07-12 19:15:13,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 79. [2022-07-12 19:15:13,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 68 states have (on average 1.2058823529411764) internal successors, (82), 78 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:13,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 82 transitions. [2022-07-12 19:15:13,260 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 82 transitions. Word has length 48 [2022-07-12 19:15:13,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:15:13,260 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 82 transitions. [2022-07-12 19:15:13,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 2.7872340425531914) internal successors, (131), 48 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:13,261 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2022-07-12 19:15:13,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-12 19:15:13,261 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:15:13,261 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 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] [2022-07-12 19:15:13,279 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-07-12 19:15:13,476 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 [2022-07-12 19:15:13,477 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-12 19:15:13,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:15:13,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1192975024, now seen corresponding path program 1 times [2022-07-12 19:15:13,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:15:13,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092070706] [2022-07-12 19:15:13,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:15:13,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:15:13,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:15:13,520 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-12 19:15:13,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:15:13,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092070706] [2022-07-12 19:15:13,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092070706] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:15:13,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [585815439] [2022-07-12 19:15:13,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:15:13,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:15:13,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:15:13,523 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) [2022-07-12 19:15:13,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-07-12 19:15:13,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:15:13,666 INFO L263 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-12 19:15:13,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:15:13,686 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-12 19:15:13,686 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:15:13,697 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-12 19:15:13,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [585815439] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:15:13,698 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 19:15:13,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2022-07-12 19:15:13,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415000902] [2022-07-12 19:15:13,698 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 19:15:13,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 19:15:13,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:15:13,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 19:15:13,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-12 19:15:13,699 INFO L87 Difference]: Start difference. First operand 79 states and 82 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:13,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:15:13,723 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2022-07-12 19:15:13,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 19:15:13,723 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-07-12 19:15:13,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:15:13,724 INFO L225 Difference]: With dead ends: 79 [2022-07-12 19:15:13,724 INFO L226 Difference]: Without dead ends: 79 [2022-07-12 19:15:13,724 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:15:13,724 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 47 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:15:13,724 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 184 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:15:13,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-07-12 19:15:13,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2022-07-12 19:15:13,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 68 states have (on average 1.1911764705882353) internal successors, (81), 78 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:13,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 81 transitions. [2022-07-12 19:15:13,726 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 81 transitions. Word has length 49 [2022-07-12 19:15:13,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:15:13,726 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 81 transitions. [2022-07-12 19:15:13,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:13,727 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 81 transitions. [2022-07-12 19:15:13,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-12 19:15:13,727 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:15:13,727 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 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] [2022-07-12 19:15:13,747 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-07-12 19:15:13,944 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 [2022-07-12 19:15:13,944 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-12 19:15:13,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:15:13,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1047895438, now seen corresponding path program 2 times [2022-07-12 19:15:13,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:15:13,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129635435] [2022-07-12 19:15:13,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:15:13,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:15:13,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:15:13,991 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-12 19:15:13,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:15:13,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129635435] [2022-07-12 19:15:13,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129635435] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:15:13,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [475015121] [2022-07-12 19:15:13,992 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 19:15:13,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:15:13,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:15:13,994 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) [2022-07-12 19:15:13,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-07-12 19:15:14,149 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 19:15:14,150 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 19:15:14,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 19:15:14,152 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:15:14,204 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-12 19:15:14,204 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:15:14,250 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-12 19:15:14,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [475015121] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:15:14,251 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 19:15:14,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2022-07-12 19:15:14,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106824352] [2022-07-12 19:15:14,251 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 19:15:14,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 19:15:14,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:15:14,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 19:15:14,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:15:14,252 INFO L87 Difference]: Start difference. First operand 79 states and 81 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:14,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:15:14,295 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2022-07-12 19:15:14,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 19:15:14,296 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-07-12 19:15:14,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:15:14,296 INFO L225 Difference]: With dead ends: 70 [2022-07-12 19:15:14,296 INFO L226 Difference]: Without dead ends: 70 [2022-07-12 19:15:14,296 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 100 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2022-07-12 19:15:14,297 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 74 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:15:14,297 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 154 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:15:14,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-07-12 19:15:14,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-07-12 19:15:14,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 63 states have (on average 1.1111111111111112) internal successors, (70), 69 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:14,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2022-07-12 19:15:14,299 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 51 [2022-07-12 19:15:14,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:15:14,299 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2022-07-12 19:15:14,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:14,299 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2022-07-12 19:15:14,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-12 19:15:14,299 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:15:14,299 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 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] [2022-07-12 19:15:14,318 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-07-12 19:15:14,513 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,SelfDestructingSolverStorable26 [2022-07-12 19:15:14,514 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-12 19:15:14,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:15:14,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1925550127, now seen corresponding path program 1 times [2022-07-12 19:15:14,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:15:14,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086887084] [2022-07-12 19:15:14,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:15:14,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:15:14,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:15:14,928 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:15:14,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:15:14,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086887084] [2022-07-12 19:15:14,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086887084] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:15:14,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1012382630] [2022-07-12 19:15:14,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:15:14,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:15:14,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:15:14,930 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) [2022-07-12 19:15:14,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-07-12 19:15:15,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:15:15,085 INFO L263 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 95 conjunts are in the unsatisfiable core [2022-07-12 19:15:15,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:15:15,095 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:15:15,134 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:15:15,134 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 19:15:15,156 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 19:15:15,183 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-12 19:15:15,183 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-07-12 19:15:15,194 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:15:15,194 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2022-07-12 19:15:15,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:15:15,318 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2022-07-12 19:15:15,467 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:15:15,469 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 63 [2022-07-12 19:15:15,472 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 21 [2022-07-12 19:15:15,474 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2022-07-12 19:15:15,661 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2022-07-12 19:15:15,664 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-07-12 19:15:15,686 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-07-12 19:15:15,711 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:15:15,711 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:15:15,931 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 64 [2022-07-12 19:15:15,942 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 64 [2022-07-12 19:15:15,951 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~len~0#1| 1))) (and (forall ((v_ArrVal_2292 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_2292) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_dll_update_at_~head#1.base|)) (<= |c_ULTIMATE.start_dll_update_at_~data#1| .cse0) (<= .cse0 |c_ULTIMATE.start_dll_update_at_~data#1|) (forall ((v_ArrVal_2290 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_2290) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_dll_update_at_~head#1.offset|)))) is different from false [2022-07-12 19:15:15,964 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~len~0#1| 1))) (and (forall ((v_ArrVal_2290 (Array Int Int))) (= |c_ULTIMATE.start_dll_update_at_#t~mem10#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_2290) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (forall ((v_ArrVal_2292 (Array Int Int))) (= |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_2292) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (<= |c_ULTIMATE.start_dll_update_at_~data#1| .cse0) (<= .cse0 |c_ULTIMATE.start_dll_update_at_~data#1|))) is different from false [2022-07-12 19:15:15,985 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:15:15,986 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 47 [2022-07-12 19:15:15,988 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2022-07-12 19:15:16,446 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_36| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_36|) (forall ((v_ArrVal_2288 Int)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_36| v_ArrVal_2288) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))))))) (= |c_ULTIMATE.start_main_~i~0#1| 0)) is different from false [2022-07-12 19:15:16,751 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2288 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_36| Int)) (or (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_36| v_ArrVal_2288) (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)) |c_ULTIMATE.start_dll_create_#res#1.base|)) (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_36|))) is different from false [2022-07-12 19:15:17,046 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2288 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_36| Int)) (or (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_36|) (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_36| v_ArrVal_2288) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)))) is different from false [2022-07-12 19:15:17,350 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2288 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_36| Int)) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_36| v_ArrVal_2288) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_36|))) is different from false [2022-07-12 19:15:17,356 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2288 Int) (v_ArrVal_2287 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_36| Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_36|) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2287) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_36| v_ArrVal_2288) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))) is different from false [2022-07-12 19:15:17,366 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2285 Int) (v_ArrVal_2288 Int) (v_ArrVal_2287 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_36| Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_36|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_2285)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2287) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_36| v_ArrVal_2288) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))))) is different from false [2022-07-12 19:15:17,378 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:15:17,381 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:15:17,381 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 37 [2022-07-12 19:15:17,384 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 41 [2022-07-12 19:15:17,385 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:15:17,386 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2022-07-12 19:15:17,393 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:15:17,394 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2022-07-12 19:15:17,470 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2022-07-12 19:15:17,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1012382630] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:15:17,470 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 19:15:17,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 26] total 56 [2022-07-12 19:15:17,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877456035] [2022-07-12 19:15:17,471 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 19:15:17,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-07-12 19:15:17,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:15:17,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-07-12 19:15:17,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=2127, Unknown=8, NotChecked=792, Total=3080 [2022-07-12 19:15:17,472 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand has 56 states, 56 states have (on average 2.357142857142857) internal successors, (132), 56 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:18,025 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (not (= .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (forall ((v_ArrVal_2288 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_36| Int)) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_36| v_ArrVal_2288) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_36|))) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1))) is different from false [2022-07-12 19:15:18,313 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (forall ((v_ArrVal_2288 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_36| Int)) (or (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_36|) (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_36| v_ArrVal_2288) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)))) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)) is different from false [2022-07-12 19:15:18,597 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (forall ((v_ArrVal_2288 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_36| Int)) (or (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_36|) (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_36| v_ArrVal_2288) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)))) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|))) is different from false [2022-07-12 19:15:18,880 WARN L833 $PredicateComparison]: unable to prove that (and (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) 4) |c_ULTIMATE.start_dll_create_#res#1.base|)) (forall ((v_ArrVal_2288 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_36| Int)) (or (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_36| v_ArrVal_2288) (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)) |c_ULTIMATE.start_dll_create_#res#1.base|)) (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_36|))) (= |c_ULTIMATE.start_dll_create_#res#1.offset| 0)) is different from false [2022-07-12 19:15:19,169 WARN L833 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_36| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_36|) (forall ((v_ArrVal_2288 Int)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_36| v_ArrVal_2288) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))))))) (= |c_ULTIMATE.start_main_~i~0#1| 0) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0)) is different from false [2022-07-12 19:15:19,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:15:19,988 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2022-07-12 19:15:19,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-12 19:15:19,989 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 56 states have (on average 2.357142857142857) internal successors, (132), 56 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-07-12 19:15:19,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:15:19,989 INFO L225 Difference]: With dead ends: 68 [2022-07-12 19:15:19,989 INFO L226 Difference]: Without dead ends: 68 [2022-07-12 19:15:19,991 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 69 SyntacticMatches, 8 SemanticMatches, 76 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 895 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=355, Invalid=3844, Unknown=13, NotChecked=1794, Total=6006 [2022-07-12 19:15:19,991 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 187 mSDsluCounter, 736 mSDsCounter, 0 mSdLazyCounter, 889 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 766 SdHoareTripleChecker+Invalid, 1437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 496 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 19:15:19,991 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 766 Invalid, 1437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 889 Invalid, 0 Unknown, 496 Unchecked, 0.4s Time] [2022-07-12 19:15:19,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-07-12 19:15:19,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-07-12 19:15:19,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 62 states have (on average 1.096774193548387) internal successors, (68), 67 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:19,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2022-07-12 19:15:19,993 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 52 [2022-07-12 19:15:19,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:15:19,993 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2022-07-12 19:15:19,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 2.357142857142857) internal successors, (132), 56 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:19,993 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2022-07-12 19:15:19,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-12 19:15:19,994 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:15:19,994 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 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] [2022-07-12 19:15:20,011 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-07-12 19:15:20,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:15:20,199 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-12 19:15:20,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:15:20,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1981317609, now seen corresponding path program 1 times [2022-07-12 19:15:20,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:15:20,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173022017] [2022-07-12 19:15:20,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:15:20,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:15:20,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:15:20,255 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-07-12 19:15:20,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:15:20,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173022017] [2022-07-12 19:15:20,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173022017] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:15:20,255 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:15:20,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 19:15:20,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324752212] [2022-07-12 19:15:20,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:15:20,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 19:15:20,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:15:20,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 19:15:20,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:15:20,257 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand has 7 states, 6 states have (on average 7.0) internal successors, (42), 7 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:20,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:15:20,337 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2022-07-12 19:15:20,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 19:15:20,338 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.0) internal successors, (42), 7 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2022-07-12 19:15:20,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:15:20,338 INFO L225 Difference]: With dead ends: 79 [2022-07-12 19:15:20,338 INFO L226 Difference]: Without dead ends: 79 [2022-07-12 19:15:20,338 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-07-12 19:15:20,339 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 141 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:15:20,339 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 75 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:15:20,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-07-12 19:15:20,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 69. [2022-07-12 19:15:20,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 64 states have (on average 1.109375) internal successors, (71), 68 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:20,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 71 transitions. [2022-07-12 19:15:20,340 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 71 transitions. Word has length 56 [2022-07-12 19:15:20,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:15:20,340 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 71 transitions. [2022-07-12 19:15:20,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.0) internal successors, (42), 7 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:20,340 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 71 transitions. [2022-07-12 19:15:20,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-12 19:15:20,341 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:15:20,341 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 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] [2022-07-12 19:15:20,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-07-12 19:15:20,341 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-12 19:15:20,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:15:20,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1981317608, now seen corresponding path program 1 times [2022-07-12 19:15:20,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:15:20,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895203232] [2022-07-12 19:15:20,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:15:20,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:15:20,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:15:20,419 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-12 19:15:20,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:15:20,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895203232] [2022-07-12 19:15:20,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895203232] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:15:20,420 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:15:20,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 19:15:20,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914456937] [2022-07-12 19:15:20,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:15:20,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 19:15:20,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:15:20,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 19:15:20,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:15:20,421 INFO L87 Difference]: Start difference. First operand 69 states and 71 transitions. Second operand has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:20,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:15:20,520 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2022-07-12 19:15:20,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 19:15:20,521 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2022-07-12 19:15:20,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:15:20,521 INFO L225 Difference]: With dead ends: 77 [2022-07-12 19:15:20,521 INFO L226 Difference]: Without dead ends: 77 [2022-07-12 19:15:20,521 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-07-12 19:15:20,521 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 177 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:15:20,522 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 50 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:15:20,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-07-12 19:15:20,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 71. [2022-07-12 19:15:20,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 66 states have (on average 1.0909090909090908) internal successors, (72), 70 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:20,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2022-07-12 19:15:20,523 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 56 [2022-07-12 19:15:20,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:15:20,523 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2022-07-12 19:15:20,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:20,523 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2022-07-12 19:15:20,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-12 19:15:20,523 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:15:20,523 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 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] [2022-07-12 19:15:20,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-07-12 19:15:20,524 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-12 19:15:20,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:15:20,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1291305133, now seen corresponding path program 1 times [2022-07-12 19:15:20,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:15:20,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646489376] [2022-07-12 19:15:20,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:15:20,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:15:20,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:15:20,570 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-12 19:15:20,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:15:20,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646489376] [2022-07-12 19:15:20,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646489376] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:15:20,571 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:15:20,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 19:15:20,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403205664] [2022-07-12 19:15:20,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:15:20,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 19:15:20,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:15:20,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 19:15:20,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:15:20,573 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:20,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:15:20,638 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2022-07-12 19:15:20,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 19:15:20,639 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2022-07-12 19:15:20,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:15:20,639 INFO L225 Difference]: With dead ends: 74 [2022-07-12 19:15:20,639 INFO L226 Difference]: Without dead ends: 74 [2022-07-12 19:15:20,640 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-07-12 19:15:20,641 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 164 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:15:20,641 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 76 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:15:20,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-07-12 19:15:20,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 71. [2022-07-12 19:15:20,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 66 states have (on average 1.0757575757575757) internal successors, (71), 70 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:20,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2022-07-12 19:15:20,643 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 57 [2022-07-12 19:15:20,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:15:20,643 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2022-07-12 19:15:20,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:20,643 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2022-07-12 19:15:20,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-12 19:15:20,643 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:15:20,644 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 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] [2022-07-12 19:15:20,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-07-12 19:15:20,644 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-12 19:15:20,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:15:20,645 INFO L85 PathProgramCache]: Analyzing trace with hash 302765524, now seen corresponding path program 1 times [2022-07-12 19:15:20,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:15:20,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335251747] [2022-07-12 19:15:20,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:15:20,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:15:20,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:15:20,693 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-12 19:15:20,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:15:20,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335251747] [2022-07-12 19:15:20,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335251747] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:15:20,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:15:20,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 19:15:20,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116181914] [2022-07-12 19:15:20,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:15:20,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 19:15:20,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:15:20,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 19:15:20,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:15:20,696 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:20,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:15:20,775 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2022-07-12 19:15:20,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 19:15:20,775 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2022-07-12 19:15:20,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:15:20,776 INFO L225 Difference]: With dead ends: 72 [2022-07-12 19:15:20,776 INFO L226 Difference]: Without dead ends: 72 [2022-07-12 19:15:20,776 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-07-12 19:15:20,776 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 150 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:15:20,776 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 63 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:15:20,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-07-12 19:15:20,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2022-07-12 19:15:20,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 67 states have (on average 1.0746268656716418) internal successors, (72), 71 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:20,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2022-07-12 19:15:20,778 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 59 [2022-07-12 19:15:20,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:15:20,778 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2022-07-12 19:15:20,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:20,778 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2022-07-12 19:15:20,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-12 19:15:20,778 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:15:20,778 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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] [2022-07-12 19:15:20,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-07-12 19:15:20,778 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-12 19:15:20,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:15:20,779 INFO L85 PathProgramCache]: Analyzing trace with hash 256575356, now seen corresponding path program 1 times [2022-07-12 19:15:20,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:15:20,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466825875] [2022-07-12 19:15:20,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:15:20,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:15:20,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:15:21,093 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-12 19:15:21,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:15:21,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466825875] [2022-07-12 19:15:21,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466825875] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:15:21,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2057585126] [2022-07-12 19:15:21,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:15:21,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:15:21,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:15:21,096 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) [2022-07-12 19:15:21,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-07-12 19:15:21,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:15:21,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 71 conjunts are in the unsatisfiable core [2022-07-12 19:15:21,283 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:15:21,285 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:15:21,306 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:15:21,306 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 19:15:21,314 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 19:15:21,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:15:21,325 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2022-07-12 19:15:21,340 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:15:21,341 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2022-07-12 19:15:21,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:15:21,455 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2022-07-12 19:15:21,536 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:15:21,536 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-07-12 19:15:21,617 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:15:21,617 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 23 [2022-07-12 19:15:21,699 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-12 19:15:21,701 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-12 19:15:21,702 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:15:21,838 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:15:21,838 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 35 [2022-07-12 19:15:21,849 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2653 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_2653) |c_ULTIMATE.start_main_~s~0#1.base|) 4)))) (forall ((v_prenex_5 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_prenex_5) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_ULTIMATE.start_dll_update_at_~head#1.base|))) is different from false [2022-07-12 19:15:21,868 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2653 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_2653) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_ULTIMATE.start_main_~s~0#1.base|))) (forall ((v_prenex_5 (Array Int Int))) (= |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_prenex_5) |c_ULTIMATE.start_main_~s~0#1.base|) 4)))) is different from false [2022-07-12 19:15:21,873 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2653 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_dll_update_at_~head#1.offset| 4)) v_ArrVal_2653) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_ULTIMATE.start_main_~s~0#1.base|))) (forall ((v_prenex_5 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_dll_update_at_~head#1.offset| 4)))) (= .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_prenex_5) |c_ULTIMATE.start_main_~s~0#1.base|) 4))))) is different from false [2022-07-12 19:15:21,881 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_5 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_prenex_5) |c_ULTIMATE.start_main_~s~0#1.base|) 4) .cse0))) (forall ((v_ArrVal_2653 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2653) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_ULTIMATE.start_main_~s~0#1.base|)))) is different from false [2022-07-12 19:15:21,892 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2652 Int) (v_prenex_5 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) |c_ULTIMATE.start_dll_update_at_~head#1.offset| v_ArrVal_2652)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (= .cse0 (select (select (store .cse1 .cse0 v_prenex_5) |c_ULTIMATE.start_main_~s~0#1.base|) 4))))) (forall ((v_ArrVal_2652 Int) (v_ArrVal_2653 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) |c_ULTIMATE.start_dll_update_at_~head#1.offset| v_ArrVal_2652)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2653)) |c_ULTIMATE.start_main_~s~0#1.base|) 4))))) is different from false [2022-07-12 19:15:21,912 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_39| Int)) (or (forall ((v_ArrVal_2652 Int) (v_ArrVal_2653 (Array Int Int))) (not (= (select (select (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_ArrVal_2652))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse0) (select .cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2653)) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_ULTIMATE.start_main_~s~0#1.base|))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_39|))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_39| Int)) (or (forall ((v_ArrVal_2652 Int) (v_prenex_5 (Array Int Int))) (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_ArrVal_2652))) (let ((.cse2 (select .cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse1) .cse2 v_prenex_5) |c_ULTIMATE.start_main_~s~0#1.base|) 4) .cse2)))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_39|)))) is different from false [2022-07-12 19:15:21,924 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_39| Int)) (or (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_39|) (forall ((v_ArrVal_2652 Int) (v_ArrVal_2653 (Array Int Int))) (not (= (select (select (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_ArrVal_2652))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base| .cse0) (select .cse0 (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)) v_ArrVal_2653)) |c_ULTIMATE.start_dll_create_#res#1.base|) 4) |c_ULTIMATE.start_dll_create_#res#1.base|))))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_39| Int)) (or (forall ((v_ArrVal_2652 Int) (v_prenex_5 (Array Int Int))) (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_ArrVal_2652))) (let ((.cse2 (select .cse1 (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base| .cse1) .cse2 v_prenex_5) |c_ULTIMATE.start_dll_create_#res#1.base|) 4) .cse2)))) (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_39|)))) is different from false [2022-07-12 19:15:21,950 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_39| Int)) (or (forall ((v_ArrVal_2652 Int) (v_ArrVal_2653 (Array Int Int))) (not (= (select (select (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_ArrVal_2652))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse0) (select .cse0 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) v_ArrVal_2653)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_39|))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_39| Int)) (or (forall ((v_ArrVal_2652 Int) (v_prenex_5 (Array Int Int))) (let ((.cse2 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_ArrVal_2652))) (let ((.cse1 (select .cse2 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)))) (= .cse1 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse2) .cse1 v_prenex_5) |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))))) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_39|)))) is different from false [2022-07-12 19:15:21,976 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_39| Int)) (or (forall ((v_ArrVal_2652 Int) (v_prenex_5 (Array Int Int))) (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_ArrVal_2652))) (let ((.cse1 (select .cse0 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse0) .cse1 v_prenex_5) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) .cse1)))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_39|))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_39| Int)) (or (forall ((v_ArrVal_2652 Int) (v_ArrVal_2653 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select (select (let ((.cse2 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_ArrVal_2652))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse2) (select .cse2 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_2653)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_39|)))) is different from false [2022-07-12 19:15:21,989 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2650 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_39| Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_39|) (forall ((v_ArrVal_2652 Int) (v_ArrVal_2653 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2650))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_ArrVal_2652))) (store (store .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse1) (select .cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_2653))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)))))) (forall ((v_ArrVal_2650 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_39| Int)) (or (forall ((v_ArrVal_2652 Int) (v_prenex_5 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2650))) (let ((.cse3 (store (select .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_ArrVal_2652))) (let ((.cse4 (select .cse3 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (= (select (select (store (store .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse3) .cse4 v_prenex_5) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) .cse4))))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_39|)))) is different from false [2022-07-12 19:15:22,010 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2650 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_39| Int) (v_ArrVal_2648 Int)) (or (forall ((v_ArrVal_2652 Int) (v_ArrVal_2653 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_2648)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2650))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_ArrVal_2652))) (store (store .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse1) (select .cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_2653))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_39|))) (forall ((v_ArrVal_2650 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_39| Int) (v_ArrVal_2648 Int)) (or (forall ((v_ArrVal_2652 Int) (v_prenex_5 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_2648)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2650))) (let ((.cse3 (store (select .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_ArrVal_2652))) (let ((.cse4 (select .cse3 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (= (select (select (store (store .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse3) .cse4 v_prenex_5) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) .cse4))))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_39|)))) is different from false [2022-07-12 19:15:22,021 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:15:22,025 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:15:22,025 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 82 treesize of output 58 [2022-07-12 19:15:22,028 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 97 [2022-07-12 19:15:22,030 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:15:22,034 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:15:22,035 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 93 treesize of output 94 [2022-07-12 19:15:22,037 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 79 [2022-07-12 19:15:22,039 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:15:22,045 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:15:22,045 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 93 treesize of output 89 [2022-07-12 19:15:22,081 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:15:22,083 INFO L356 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-07-12 19:15:22,083 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 108 treesize of output 1 [2022-07-12 19:15:22,135 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 13 not checked. [2022-07-12 19:15:22,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2057585126] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:15:22,136 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 19:15:22,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 21] total 48 [2022-07-12 19:15:22,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736850962] [2022-07-12 19:15:22,136 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 19:15:22,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-07-12 19:15:22,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:15:22,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-07-12 19:15:22,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1302, Unknown=11, NotChecked=902, Total=2352 [2022-07-12 19:15:22,138 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand has 49 states, 48 states have (on average 2.6458333333333335) internal successors, (127), 49 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:23,651 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (not (= .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (forall ((v_ArrVal_2650 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_39| Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_39|) (forall ((v_ArrVal_2652 Int) (v_ArrVal_2653 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2650))) (let ((.cse2 (store (select .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_ArrVal_2652))) (store (store .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse2) (select .cse2 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_2653))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)))))) (forall ((v_ArrVal_2650 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_39| Int)) (or (forall ((v_ArrVal_2652 Int) (v_prenex_5 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2650))) (let ((.cse4 (store (select .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_ArrVal_2652))) (let ((.cse5 (select .cse4 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (= (select (select (store (store .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse4) .cse5 v_prenex_5) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) .cse5))))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_39|))) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |c_#valid| .cse0) 1))) is different from false [2022-07-12 19:15:23,654 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (not (= .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (forall ((v_ArrVal_2650 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_39| Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_39|) (forall ((v_ArrVal_2652 Int) (v_ArrVal_2653 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2650))) (let ((.cse2 (store (select .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_ArrVal_2652))) (store (store .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse2) (select .cse2 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_2653))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)))))) (forall ((v_ArrVal_2650 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_39| Int)) (or (forall ((v_ArrVal_2652 Int) (v_prenex_5 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2650))) (let ((.cse4 (store (select .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_ArrVal_2652))) (let ((.cse5 (select .cse4 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (= (select (select (store (store .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse4) .cse5 v_prenex_5) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) .cse5))))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_39|))))) is different from false [2022-07-12 19:15:23,657 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_39| Int)) (or (forall ((v_ArrVal_2652 Int) (v_prenex_5 (Array Int Int))) (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_ArrVal_2652))) (let ((.cse1 (select .cse0 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse0) .cse1 v_prenex_5) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) .cse1)))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_39|))) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (not (= .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_39| Int)) (or (forall ((v_ArrVal_2652 Int) (v_ArrVal_2653 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select (select (let ((.cse3 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_ArrVal_2652))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse3) (select .cse3 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_2653)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_39|))) (= (select |c_#valid| .cse2) 1))) is different from false [2022-07-12 19:15:23,660 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_39| Int)) (or (forall ((v_ArrVal_2652 Int) (v_ArrVal_2653 (Array Int Int))) (not (= (select (select (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_ArrVal_2652))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse0) (select .cse0 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) v_ArrVal_2653)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_39|))) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (not (= .cse1 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_39| Int)) (or (forall ((v_ArrVal_2652 Int) (v_prenex_5 (Array Int Int))) (let ((.cse3 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_ArrVal_2652))) (let ((.cse2 (select .cse3 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)))) (= .cse2 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse3) .cse2 v_prenex_5) |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))))) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_39|))) (= (select |c_#valid| .cse1) 1))) is different from false [2022-07-12 19:15:23,662 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) 4))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_39| Int)) (or (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_39|) (forall ((v_ArrVal_2652 Int) (v_ArrVal_2653 (Array Int Int))) (not (= (select (select (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_ArrVal_2652))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base| .cse0) (select .cse0 (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)) v_ArrVal_2653)) |c_ULTIMATE.start_dll_create_#res#1.base|) 4) |c_ULTIMATE.start_dll_create_#res#1.base|))))) (not (= .cse1 |c_ULTIMATE.start_dll_create_#res#1.base|)) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_39| Int)) (or (forall ((v_ArrVal_2652 Int) (v_prenex_5 (Array Int Int))) (let ((.cse2 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_ArrVal_2652))) (let ((.cse3 (select .cse2 (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base| .cse2) .cse3 v_prenex_5) |c_ULTIMATE.start_dll_create_#res#1.base|) 4) .cse3)))) (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_39|))) (= |c_ULTIMATE.start_dll_create_#res#1.offset| 0) (= (select |c_#valid| .cse1) 1))) is different from false [2022-07-12 19:15:23,667 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (and (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse0)) (= (select |c_#valid| .cse0) 1) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_39| Int)) (or (forall ((v_ArrVal_2652 Int) (v_ArrVal_2653 (Array Int Int))) (not (= (select (select (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_ArrVal_2652))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse1) (select .cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2653)) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_ULTIMATE.start_main_~s~0#1.base|))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_39|))) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_39| Int)) (or (forall ((v_ArrVal_2652 Int) (v_prenex_5 (Array Int Int))) (let ((.cse2 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_ArrVal_2652))) (let ((.cse3 (select .cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse2) .cse3 v_prenex_5) |c_ULTIMATE.start_main_~s~0#1.base|) 4) .cse3)))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_39|))))) is different from false [2022-07-12 19:15:24,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:15:24,082 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2022-07-12 19:15:24,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-12 19:15:24,082 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 48 states have (on average 2.6458333333333335) internal successors, (127), 49 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2022-07-12 19:15:24,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:15:24,082 INFO L225 Difference]: With dead ends: 79 [2022-07-12 19:15:24,082 INFO L226 Difference]: Without dead ends: 79 [2022-07-12 19:15:24,083 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 95 SyntacticMatches, 7 SemanticMatches, 64 ConstructedPredicates, 17 IntricatePredicates, 0 DeprecatedPredicates, 552 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=249, Invalid=2154, Unknown=17, NotChecked=1870, Total=4290 [2022-07-12 19:15:24,084 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 96 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 701 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 1424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 701 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 19:15:24,084 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 456 Invalid, 1424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 701 Invalid, 0 Unknown, 701 Unchecked, 0.3s Time] [2022-07-12 19:15:24,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-07-12 19:15:24,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 75. [2022-07-12 19:15:24,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 70 states have (on average 1.1) internal successors, (77), 74 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:24,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 77 transitions. [2022-07-12 19:15:24,085 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 77 transitions. Word has length 62 [2022-07-12 19:15:24,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:15:24,086 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 77 transitions. [2022-07-12 19:15:24,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 2.6458333333333335) internal successors, (127), 49 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:24,086 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 77 transitions. [2022-07-12 19:15:24,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-12 19:15:24,086 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:15:24,086 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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] [2022-07-12 19:15:24,104 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-07-12 19:15:24,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-07-12 19:15:24,294 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-12 19:15:24,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:15:24,295 INFO L85 PathProgramCache]: Analyzing trace with hash 256575357, now seen corresponding path program 1 times [2022-07-12 19:15:24,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:15:24,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880926340] [2022-07-12 19:15:24,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:15:24,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:15:24,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:15:24,741 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-12 19:15:24,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:15:24,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880926340] [2022-07-12 19:15:24,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880926340] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:15:24,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [690353463] [2022-07-12 19:15:24,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:15:24,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:15:24,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:15:24,743 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) [2022-07-12 19:15:24,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-07-12 19:15:24,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:15:24,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 87 conjunts are in the unsatisfiable core [2022-07-12 19:15:24,939 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:15:24,943 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:15:24,994 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:15:24,995 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 19:15:25,030 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 19:15:25,049 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 19:15:25,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:15:25,084 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-12 19:15:25,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:15:25,093 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-12 19:15:25,116 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:15:25,116 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 53 [2022-07-12 19:15:25,118 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 41 [2022-07-12 19:15:25,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:15:25,317 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 29 [2022-07-12 19:15:25,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:15:25,320 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 30 [2022-07-12 19:15:25,464 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:15:25,464 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2022-07-12 19:15:25,468 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 33 [2022-07-12 19:15:25,619 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:15:25,620 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 28 [2022-07-12 19:15:25,626 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:15:25,626 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 25 [2022-07-12 19:15:25,792 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-12 19:15:25,793 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:15:26,068 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2790 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_2790) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 4))) (forall ((v_ArrVal_2789 (Array Int Int)) (v_ArrVal_2790 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_2790) |c_ULTIMATE.start_main_~s~0#1.base|) 4)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_2789) |c_ULTIMATE.start_main_~s~0#1.base|) 4))))) is different from false [2022-07-12 19:15:26,077 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2789 (Array Int Int)) (v_ArrVal_2790 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_2790) |c_ULTIMATE.start_main_~s~0#1.base|) 4)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_2789) |c_ULTIMATE.start_main_~s~0#1.base|) 4)))) (forall ((v_ArrVal_2790 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_2790) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 4)))) is different from false [2022-07-12 19:15:26,084 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2789 (Array Int Int)) (v_ArrVal_2790 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_dll_update_at_~head#1.offset| 4)))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2790) |c_ULTIMATE.start_main_~s~0#1.base|) 4)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2789) |c_ULTIMATE.start_main_~s~0#1.base|) 4))))) (forall ((v_ArrVal_2790 (Array Int Int))) (<= 0 (+ 4 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_dll_update_at_~head#1.offset| 4)) v_ArrVal_2790) |c_ULTIMATE.start_main_~s~0#1.base|) 4))))) is different from false [2022-07-12 19:15:26,093 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2789 (Array Int Int)) (v_ArrVal_2790 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2790) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2789) |c_ULTIMATE.start_main_~s~0#1.base|) 4))))) (forall ((v_ArrVal_2790 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2790) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 4)))) is different from false [2022-07-12 19:15:26,109 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2786 Int) (v_ArrVal_2788 Int) (v_ArrVal_2790 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base|) |c_ULTIMATE.start_dll_update_at_~head#1.offset| v_ArrVal_2788)) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) |c_ULTIMATE.start_dll_update_at_~head#1.offset| v_ArrVal_2786)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2790) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 4))) (forall ((v_ArrVal_2789 (Array Int Int)) (v_ArrVal_2786 Int) (v_ArrVal_2788 Int) (v_ArrVal_2790 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) |c_ULTIMATE.start_dll_update_at_~head#1.offset| v_ArrVal_2786)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base|) |c_ULTIMATE.start_dll_update_at_~head#1.offset| v_ArrVal_2788)) .cse0 v_ArrVal_2790) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 8) (select |c_#length| (select (select (store .cse1 .cse0 v_ArrVal_2789) |c_ULTIMATE.start_main_~s~0#1.base|) 4))))))) is different from false [2022-07-12 19:15:26,144 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_42| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_42|) (forall ((v_ArrVal_2789 (Array Int Int)) (v_ArrVal_2786 Int) (v_ArrVal_2788 Int) (v_ArrVal_2790 (Array Int Int))) (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2786))) (let ((.cse0 (select .cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2788)) .cse0 v_ArrVal_2790) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 8) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse1) .cse0 v_ArrVal_2789) |c_ULTIMATE.start_main_~s~0#1.base|) 4)))))))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_42| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_42|) (forall ((v_ArrVal_2786 Int) (v_ArrVal_2788 Int) (v_ArrVal_2790 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2788)) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2786) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2790) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 4)))))) is different from false [2022-07-12 19:15:26,158 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_42| Int)) (or (forall ((v_ArrVal_2786 Int) (v_ArrVal_2788 Int) (v_ArrVal_2790 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_#res#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2788)) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2786) (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)) v_ArrVal_2790) |c_ULTIMATE.start_dll_create_#res#1.base|) 4) 4))) (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_42|))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_42| Int)) (or (forall ((v_ArrVal_2789 (Array Int Int)) (v_ArrVal_2786 Int) (v_ArrVal_2788 Int) (v_ArrVal_2790 (Array Int Int))) (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2786))) (let ((.cse0 (select .cse1 (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_#res#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2788)) .cse0 v_ArrVal_2790) |c_ULTIMATE.start_dll_create_#res#1.base|) 4) 8) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base| .cse1) .cse0 v_ArrVal_2789) |c_ULTIMATE.start_dll_create_#res#1.base|) 4)))))) (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_42|)))) is different from false [2022-07-12 19:15:26,172 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_42| Int)) (or (forall ((v_ArrVal_2789 (Array Int Int)) (v_ArrVal_2786 Int) (v_ArrVal_2788 Int) (v_ArrVal_2790 (Array Int Int))) (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2786))) (let ((.cse0 (select .cse1 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)))) (<= (+ 8 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2788)) .cse0 v_ArrVal_2790) |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4)) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse1) .cse0 v_ArrVal_2789) |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4)))))) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_42|))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_42| Int)) (or (forall ((v_ArrVal_2786 Int) (v_ArrVal_2788 Int) (v_ArrVal_2790 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2788)) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2786) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) v_ArrVal_2790) |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) 4))) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_42|)))) is different from false [2022-07-12 19:15:26,196 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_42| Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_42|) (forall ((v_ArrVal_2789 (Array Int Int)) (v_ArrVal_2786 Int) (v_ArrVal_2788 Int) (v_ArrVal_2790 (Array Int Int))) (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2786))) (let ((.cse0 (select .cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2788)) .cse0 v_ArrVal_2790) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 8) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse1) .cse0 v_ArrVal_2789) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)))))))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_42| Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_42|) (forall ((v_ArrVal_2786 Int) (v_ArrVal_2788 Int) (v_ArrVal_2790 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2788)) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2786) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_2790) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 4)))))) is different from false [2022-07-12 19:15:26,215 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:15:26,216 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 128 treesize of output 132 [2022-07-12 19:15:26,271 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_6 Int)) (or (forall ((v_prenex_8 (Array Int Int)) (v_prenex_9 (Array Int Int)) (v_prenex_7 Int) (v_prenex_10 Int) (v_prenex_11 (Array Int Int))) (<= (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_8))) (store .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) v_prenex_6 v_prenex_10))) (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_9) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) v_prenex_6 v_prenex_7) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_prenex_11) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_6))) (forall ((v_prenex_6 Int)) (or (forall ((v_prenex_9 (Array Int Int)) (v_prenex_7 Int) (v_ArrVal_2789 (Array Int Int))) (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_9))) (let ((.cse2 (store (select .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) v_prenex_6 v_prenex_7))) (store (store .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse2) (select .cse2 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_2789))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_6))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_42| Int) (v_ArrVal_2786 Int) (v_ArrVal_2783 (Array Int Int)) (v_ArrVal_2782 (Array Int Int)) (v_ArrVal_2788 Int) (v_ArrVal_2790 (Array Int Int))) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_42|) (<= 0 (+ (select (select (store (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2783))) (store .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2788))) (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2782) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2786) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_2790) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 4))))) is different from false [2022-07-12 19:15:26,307 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_6 Int) (v_ArrVal_2778 Int)) (or (forall ((v_prenex_9 (Array Int Int)) (v_prenex_7 Int) (v_ArrVal_2789 (Array Int Int))) (= (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_2778)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_9))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) v_prenex_6 v_prenex_7))) (store (store .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse1) (select .cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_2789))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_6))) (forall ((v_ArrVal_2780 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_42| Int) (v_ArrVal_2786 Int) (v_ArrVal_2783 (Array Int Int)) (v_ArrVal_2782 (Array Int Int)) (v_ArrVal_2788 Int) (v_ArrVal_2778 Int) (v_ArrVal_2790 (Array Int Int))) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_42|) (<= 0 (+ (select (select (let ((.cse3 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (store (let ((.cse2 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3 v_ArrVal_2780)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2783))) (store .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2788))) (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3 v_ArrVal_2778)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2782) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2786) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_2790)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 4)))) (forall ((v_prenex_6 Int) (v_ArrVal_2780 Int) (v_ArrVal_2778 Int)) (or (forall ((v_prenex_8 (Array Int Int)) (v_prenex_9 (Array Int Int)) (v_prenex_7 Int) (v_prenex_10 Int) (v_prenex_11 (Array Int Int))) (<= (select (select (let ((.cse5 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (store (let ((.cse4 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse5 v_ArrVal_2780)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_8))) (store .cse4 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse4 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) v_prenex_6 v_prenex_10))) (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse5 v_ArrVal_2778)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_9) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) v_prenex_6 v_prenex_7) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_prenex_11)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_6)))) is different from false [2022-07-12 19:15:26,317 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:15:26,321 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:15:26,322 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 83 treesize of output 74 [2022-07-12 19:15:26,325 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:15:26,329 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:15:26,329 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 59 [2022-07-12 19:15:26,332 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 84 [2022-07-12 19:15:26,335 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 208 treesize of output 202 [2022-07-12 19:15:26,338 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:15:26,339 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 68 [2022-07-12 19:15:26,342 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:15:26,343 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 74 [2022-07-12 19:15:26,357 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:15:26,358 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 170 treesize of output 172 [2022-07-12 19:15:26,362 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 158 treesize of output 150 [2022-07-12 19:15:26,365 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 174 treesize of output 170 [2022-07-12 19:15:26,433 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:15:26,435 INFO L356 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-07-12 19:15:26,435 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 81 treesize of output 1 [2022-07-12 19:15:26,438 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:15:26,440 INFO L356 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-07-12 19:15:26,440 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 83 treesize of output 1 [2022-07-12 19:15:26,583 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 13 not checked. [2022-07-12 19:15:26,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [690353463] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:15:26,583 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 19:15:26,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19, 21] total 59 [2022-07-12 19:15:26,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406244430] [2022-07-12 19:15:26,584 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 19:15:26,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-07-12 19:15:26,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:15:26,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-07-12 19:15:26,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=2198, Unknown=11, NotChecked=1144, Total=3540 [2022-07-12 19:15:26,585 INFO L87 Difference]: Start difference. First operand 75 states and 77 transitions. Second operand has 60 states, 59 states have (on average 2.7457627118644066) internal successors, (162), 60 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:26,927 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse8 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse8))) (let ((.cse3 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse8)) (.cse2 (= .cse1 |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (and (forall ((v_prenex_6 Int)) (or (forall ((v_prenex_8 (Array Int Int)) (v_prenex_9 (Array Int Int)) (v_prenex_7 Int) (v_prenex_10 Int) (v_prenex_11 (Array Int Int))) (<= (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_8))) (store .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) v_prenex_6 v_prenex_10))) (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_9) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) v_prenex_6 v_prenex_7) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_prenex_11) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_6))) (<= 0 |c_ULTIMATE.start_dll_create_~head~0#1.offset|) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (not (= .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) .cse2 (= .cse3 0) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (<= (select |c_#length| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 12) (forall ((v_prenex_6 Int)) (or (forall ((v_prenex_9 (Array Int Int)) (v_prenex_7 Int) (v_ArrVal_2789 (Array Int Int))) (= (select (select (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_9))) (let ((.cse5 (store (select .cse4 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) v_prenex_6 v_prenex_7))) (store (store .cse4 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse5) (select .cse5 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_2789))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_6))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_42| Int) (v_ArrVal_2786 Int) (v_ArrVal_2783 (Array Int Int)) (v_ArrVal_2782 (Array Int Int)) (v_ArrVal_2788 Int) (v_ArrVal_2790 (Array Int Int))) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_42|) (<= 0 (+ (select (select (store (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2783))) (store .cse6 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse6 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2788))) (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2782) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2786) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_2790) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 4)))) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| .cse3) (let ((.cse7 (select |c_#length| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (or (and .cse2 (<= 12 .cse7)) (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (<= .cse7 11)))))))) is different from false [2022-07-12 19:15:26,932 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse8 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse8))) (let ((.cse3 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse8)) (.cse2 (= .cse1 |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (and (forall ((v_prenex_6 Int)) (or (forall ((v_prenex_8 (Array Int Int)) (v_prenex_9 (Array Int Int)) (v_prenex_7 Int) (v_prenex_10 Int) (v_prenex_11 (Array Int Int))) (<= (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_8))) (store .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) v_prenex_6 v_prenex_10))) (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_9) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) v_prenex_6 v_prenex_7) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_prenex_11) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_6))) (<= 0 |c_ULTIMATE.start_dll_create_~head~0#1.offset|) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (not (= .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) .cse2 (= .cse3 0) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (forall ((v_prenex_6 Int)) (or (forall ((v_prenex_9 (Array Int Int)) (v_prenex_7 Int) (v_ArrVal_2789 (Array Int Int))) (= (select (select (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_9))) (let ((.cse5 (store (select .cse4 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) v_prenex_6 v_prenex_7))) (store (store .cse4 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse5) (select .cse5 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_2789))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_6))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_42| Int) (v_ArrVal_2786 Int) (v_ArrVal_2783 (Array Int Int)) (v_ArrVal_2782 (Array Int Int)) (v_ArrVal_2788 Int) (v_ArrVal_2790 (Array Int Int))) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_42|) (<= 0 (+ (select (select (store (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2783))) (store .cse6 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse6 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2788))) (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2782) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2786) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_2790) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 4)))) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| .cse3) (let ((.cse7 (select |c_#length| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (or (and .cse2 (<= 12 .cse7)) (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (<= .cse7 11)))))))) is different from false [2022-07-12 19:15:26,936 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_42| Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_42|) (forall ((v_ArrVal_2789 (Array Int Int)) (v_ArrVal_2786 Int) (v_ArrVal_2788 Int) (v_ArrVal_2790 (Array Int Int))) (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2786))) (let ((.cse0 (select .cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2788)) .cse0 v_ArrVal_2790) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 8) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse1) .cse0 v_ArrVal_2789) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)))))))) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (not (= .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3) 0) (<= 12 (select |c_#length| .cse2)) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_42| Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_42|) (forall ((v_ArrVal_2786 Int) (v_ArrVal_2788 Int) (v_ArrVal_2790 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2788)) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2786) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_2790) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 4)))))))) is different from false [2022-07-12 19:15:26,940 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_42| Int)) (or (forall ((v_ArrVal_2789 (Array Int Int)) (v_ArrVal_2786 Int) (v_ArrVal_2788 Int) (v_ArrVal_2790 (Array Int Int))) (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2786))) (let ((.cse0 (select .cse1 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)))) (<= (+ 8 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2788)) .cse0 v_ArrVal_2790) |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4)) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse1) .cse0 v_ArrVal_2789) |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4)))))) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_42|))) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_42| Int)) (or (forall ((v_ArrVal_2786 Int) (v_ArrVal_2788 Int) (v_ArrVal_2790 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2788)) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2786) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) v_ArrVal_2790) |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) 4))) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_42|))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0) (<= 12 (select |c_#length| .cse2)) (not (= .cse2 |c_ULTIMATE.start_dll_create_~head~0#1.base|)))) is different from false [2022-07-12 19:15:26,943 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) 4))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_42| Int)) (or (forall ((v_ArrVal_2786 Int) (v_ArrVal_2788 Int) (v_ArrVal_2790 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_#res#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2788)) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2786) (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)) v_ArrVal_2790) |c_ULTIMATE.start_dll_create_#res#1.base|) 4) 4))) (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_42|))) (not (= .cse0 |c_ULTIMATE.start_dll_create_#res#1.base|)) (<= 12 (select |c_#length| .cse0)) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_42| Int)) (or (forall ((v_ArrVal_2789 (Array Int Int)) (v_ArrVal_2786 Int) (v_ArrVal_2788 Int) (v_ArrVal_2790 (Array Int Int))) (let ((.cse2 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2786))) (let ((.cse1 (select .cse2 (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_#res#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2788)) .cse1 v_ArrVal_2790) |c_ULTIMATE.start_dll_create_#res#1.base|) 4) 8) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base| .cse2) .cse1 v_ArrVal_2789) |c_ULTIMATE.start_dll_create_#res#1.base|) 4)))))) (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_42|))) (= |c_ULTIMATE.start_dll_create_#res#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_#res#1.base|) 4) 0))) is different from false [2022-07-12 19:15:26,947 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (and (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse0)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) 4) 0) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_42| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_42|) (forall ((v_ArrVal_2789 (Array Int Int)) (v_ArrVal_2786 Int) (v_ArrVal_2788 Int) (v_ArrVal_2790 (Array Int Int))) (let ((.cse2 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2786))) (let ((.cse1 (select .cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2788)) .cse1 v_ArrVal_2790) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 8) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse2) .cse1 v_ArrVal_2789) |c_ULTIMATE.start_main_~s~0#1.base|) 4)))))))) (<= 12 (select |c_#length| .cse0)) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_42| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_42|) (forall ((v_ArrVal_2786 Int) (v_ArrVal_2788 Int) (v_ArrVal_2790 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2788)) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2786) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2790) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 4))))))) is different from false [2022-07-12 19:15:27,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:15:27,774 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2022-07-12 19:15:27,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-12 19:15:27,774 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 59 states have (on average 2.7457627118644066) internal successors, (162), 60 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2022-07-12 19:15:27,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:15:27,774 INFO L225 Difference]: With dead ends: 83 [2022-07-12 19:15:27,775 INFO L226 Difference]: Without dead ends: 83 [2022-07-12 19:15:27,776 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 88 SyntacticMatches, 3 SemanticMatches, 78 ConstructedPredicates, 17 IntricatePredicates, 0 DeprecatedPredicates, 657 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=372, Invalid=3585, Unknown=17, NotChecked=2346, Total=6320 [2022-07-12 19:15:27,776 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 134 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 813 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 1690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 813 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 850 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 19:15:27,776 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 575 Invalid, 1690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 813 Invalid, 0 Unknown, 850 Unchecked, 0.3s Time] [2022-07-12 19:15:27,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-07-12 19:15:27,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 77. [2022-07-12 19:15:27,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 72 states have (on average 1.0833333333333333) internal successors, (78), 76 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:27,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2022-07-12 19:15:27,778 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 62 [2022-07-12 19:15:27,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:15:27,778 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2022-07-12 19:15:27,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 59 states have (on average 2.7457627118644066) internal successors, (162), 60 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:27,778 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2022-07-12 19:15:27,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-07-12 19:15:27,779 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:15:27,779 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 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] [2022-07-12 19:15:27,796 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-07-12 19:15:27,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2022-07-12 19:15:27,995 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-12 19:15:27,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:15:27,996 INFO L85 PathProgramCache]: Analyzing trace with hash -636099954, now seen corresponding path program 1 times [2022-07-12 19:15:27,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:15:27,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553953563] [2022-07-12 19:15:27,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:15:27,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:15:28,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:15:28,320 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-12 19:15:28,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:15:28,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553953563] [2022-07-12 19:15:28,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553953563] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:15:28,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [285376065] [2022-07-12 19:15:28,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:15:28,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:15:28,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:15:28,322 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) [2022-07-12 19:15:28,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-07-12 19:15:28,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:15:28,497 INFO L263 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 77 conjunts are in the unsatisfiable core [2022-07-12 19:15:28,499 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:15:28,517 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-12 19:15:28,585 INFO L356 Elim1Store]: treesize reduction 26, result has 27.8 percent of original size [2022-07-12 19:15:28,585 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 29 [2022-07-12 19:15:28,625 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 19:15:28,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:15:28,659 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-12 19:15:28,679 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:15:28,679 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2022-07-12 19:15:28,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:15:28,863 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2022-07-12 19:15:28,927 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-07-12 19:15:28,927 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 32 [2022-07-12 19:15:29,362 INFO L356 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2022-07-12 19:15:29,362 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-07-12 19:15:29,425 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:15:29,426 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18 [2022-07-12 19:15:29,474 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 25 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-12 19:15:29,474 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:16:33,133 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:16:33,139 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:16:33,139 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 213 treesize of output 113 [2022-07-12 19:16:33,152 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:16:33,152 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1447 treesize of output 1389 [2022-07-12 19:16:33,164 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:16:33,174 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:16:33,175 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1981 treesize of output 1887 [2022-07-12 19:16:33,564 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:16:33,572 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:16:33,573 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 196 treesize of output 190 [2022-07-12 19:16:55,067 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 9 proven. 9 refuted. 9 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-12 19:16:55,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [285376065] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:16:55,068 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 19:16:55,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 56 [2022-07-12 19:16:55,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325832043] [2022-07-12 19:16:55,068 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 19:16:55,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-07-12 19:16:55,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:16:55,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-07-12 19:16:55,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=2741, Unknown=72, NotChecked=0, Total=3080 [2022-07-12 19:16:55,070 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand has 56 states, 56 states have (on average 3.0535714285714284) internal successors, (171), 56 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:16:57,175 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0)) (.cse0 (select |c_#valid| 0))) (and (= .cse0 0) .cse1 (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (or .cse1 (forall ((v_prenex_17 Int)) (not (= (select |c_#valid| v_prenex_17) 1)))) (forall ((v_ArrVal_2919 Int) (v_ArrVal_2918 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.base_47| Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_45| Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_46| Int)) (let ((.cse2 (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_46| v_ArrVal_2918)))) (store .cse3 |v_ULTIMATE.start_dll_update_at_~head#1.base_47| (store (select .cse3 |v_ULTIMATE.start_dll_update_at_~head#1.base_47|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_45| v_ArrVal_2919))) |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (or (not (= (select |c_#valid| (select .cse2 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4))) 1)) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_46|) (not (= (select .cse2 4) 0))))) (not (= .cse0 1)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 0)) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1))) is different from false [2022-07-12 19:16:58,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:16:58,735 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2022-07-12 19:16:58,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-12 19:16:58,735 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 56 states have (on average 3.0535714285714284) internal successors, (171), 56 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2022-07-12 19:16:58,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:16:58,735 INFO L225 Difference]: With dead ends: 77 [2022-07-12 19:16:58,735 INFO L226 Difference]: Without dead ends: 77 [2022-07-12 19:16:58,736 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 96 SyntacticMatches, 9 SemanticMatches, 77 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1450 ImplicationChecksByTransitivity, 88.7s TimeCoverageRelationStatistics Valid=860, Invalid=5077, Unknown=73, NotChecked=152, Total=6162 [2022-07-12 19:16:58,736 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 580 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 685 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 580 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 989 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 217 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 19:16:58,736 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [580 Valid, 614 Invalid, 989 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 685 Invalid, 0 Unknown, 217 Unchecked, 0.3s Time] [2022-07-12 19:16:58,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-07-12 19:16:58,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2022-07-12 19:16:58,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 72 states have (on average 1.0694444444444444) internal successors, (77), 76 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:16:58,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2022-07-12 19:16:58,737 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 63 [2022-07-12 19:16:58,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:16:58,738 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2022-07-12 19:16:58,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 3.0535714285714284) internal successors, (171), 56 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:16:58,738 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2022-07-12 19:16:58,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-12 19:16:58,738 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:16:58,738 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-12 19:16:58,756 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-07-12 19:16:58,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:16:58,943 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-12 19:16:58,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:16:58,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1405249969, now seen corresponding path program 1 times [2022-07-12 19:16:58,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:16:58,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769939327] [2022-07-12 19:16:58,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:16:58,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:16:58,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:59,294 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 21 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-12 19:16:59,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:16:59,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769939327] [2022-07-12 19:16:59,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769939327] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:16:59,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1380500175] [2022-07-12 19:16:59,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:16:59,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:16:59,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:16:59,296 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) [2022-07-12 19:16:59,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-07-12 19:16:59,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:59,474 INFO L263 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 62 conjunts are in the unsatisfiable core [2022-07-12 19:16:59,476 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:16:59,480 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:16:59,522 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:16:59,523 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 19:16:59,536 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 19:16:59,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:16:59,565 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-12 19:16:59,584 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:16:59,585 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2022-07-12 19:16:59,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:16:59,647 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2022-07-12 19:16:59,757 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:16:59,757 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-07-12 19:16:59,867 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:16:59,867 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 23 [2022-07-12 19:16:59,932 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-12 19:16:59,932 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:17:00,041 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3048 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_3048) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 1) |c_#StackHeapBarrier|)) is different from false [2022-07-12 19:17:00,046 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3048 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_3048) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 1) |c_#StackHeapBarrier|)) is different from false [2022-07-12 19:17:00,053 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3048 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_dll_update_at_~head#1.offset| 4)) v_ArrVal_3048) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 1) |c_#StackHeapBarrier|)) is different from false [2022-07-12 19:17:00,059 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3048 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_3048) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 1) |c_#StackHeapBarrier|)) is different from false [2022-07-12 19:17:00,066 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3048 (Array Int Int)) (v_ArrVal_3046 Int)) (<= (+ (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) |c_ULTIMATE.start_dll_update_at_~head#1.offset| v_ArrVal_3046)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_3048)) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 1) |c_#StackHeapBarrier|)) is different from false [2022-07-12 19:17:00,076 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3048 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_49| Int) (v_ArrVal_3046 Int)) (or (<= (+ (select (select (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_49| v_ArrVal_3046))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse0) (select .cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_3048)) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 1) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_49|))) is different from false [2022-07-12 19:17:00,096 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3048 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_49| Int) (v_ArrVal_3046 Int)) (or (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_49|) (<= (+ (select (select (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_49| v_ArrVal_3046))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base| .cse0) (select .cse0 (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)) v_ArrVal_3048)) |c_ULTIMATE.start_dll_create_#res#1.base|) 4) 1) |c_#StackHeapBarrier|))) is different from false [2022-07-12 19:17:00,104 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3048 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_49| Int) (v_ArrVal_3046 Int)) (or (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_49|) (<= (+ (select (select (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_49| v_ArrVal_3046))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse0) (select .cse0 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) v_ArrVal_3048)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) 1) |c_#StackHeapBarrier|))) is different from false [2022-07-12 19:17:00,116 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3048 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_49| Int) (v_ArrVal_3046 Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_49|) (<= (+ (select (select (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_49| v_ArrVal_3046))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse0) (select .cse0 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_3048)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 1) |c_#StackHeapBarrier|))) is different from false [2022-07-12 19:17:00,124 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3044 (Array Int Int)) (v_ArrVal_3048 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_49| Int) (v_ArrVal_3046 Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_49|) (<= (+ 1 (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_3044))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_49| v_ArrVal_3046))) (store (store .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse1) (select .cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_3048))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)) |c_#StackHeapBarrier|))) is different from false [2022-07-12 19:17:00,138 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3044 (Array Int Int)) (v_ArrVal_3048 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_49| Int) (v_ArrVal_3046 Int) (v_ArrVal_3042 Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_49|) (<= (+ (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_3042)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_3044))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_49| v_ArrVal_3046))) (store (store .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse1) (select .cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_3048))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 1) |c_#StackHeapBarrier|))) is different from false [2022-07-12 19:17:00,143 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:17:00,147 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:17:00,147 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 83 treesize of output 59 [2022-07-12 19:17:00,150 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 100 [2022-07-12 19:17:00,152 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:17:00,158 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:17:00,159 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 52 [2022-07-12 19:17:00,162 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:17:00,169 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:17:00,169 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 57 [2022-07-12 19:17:00,172 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 80 [2022-07-12 19:17:00,346 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 13 not checked. [2022-07-12 19:17:00,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1380500175] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:17:00,346 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 19:17:00,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19, 21] total 46 [2022-07-12 19:17:00,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147221935] [2022-07-12 19:17:00,346 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 19:17:00,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-07-12 19:17:00,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:17:00,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-07-12 19:17:00,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1159, Unknown=11, NotChecked=858, Total=2162 [2022-07-12 19:17:00,348 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand has 47 states, 46 states have (on average 3.130434782608696) internal successors, (144), 47 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:17:00,570 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3044 (Array Int Int)) (v_ArrVal_3048 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_49| Int) (v_ArrVal_3046 Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_49|) (<= (+ 1 (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_3044))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_49| v_ArrVal_3046))) (store (store .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse1) (select .cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_3048))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)) |c_#StackHeapBarrier|))) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (<= (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 1) |c_#StackHeapBarrier|) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (<= (+ 1 |c_ULTIMATE.start_dll_create_~head~0#1.base|) |c_#StackHeapBarrier|)) is different from false [2022-07-12 19:17:00,574 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3044 (Array Int Int)) (v_ArrVal_3048 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_49| Int) (v_ArrVal_3046 Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_49|) (<= (+ 1 (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_3044))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_49| v_ArrVal_3046))) (store (store .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse1) (select .cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_3048))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)) |c_#StackHeapBarrier|))) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (<= (+ 1 |c_ULTIMATE.start_dll_create_~head~0#1.base|) |c_#StackHeapBarrier|)) is different from false [2022-07-12 19:17:00,579 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (not (= .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (forall ((v_ArrVal_3048 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_49| Int) (v_ArrVal_3046 Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_49|) (<= (+ (select (select (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_49| v_ArrVal_3046))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse1) (select .cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_3048)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 1) |c_#StackHeapBarrier|))) (<= (+ .cse0 1) |c_#StackHeapBarrier|))) is different from false [2022-07-12 19:17:00,582 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (forall ((v_ArrVal_3048 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_49| Int) (v_ArrVal_3046 Int)) (or (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_49|) (<= (+ (select (select (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_49| v_ArrVal_3046))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse0) (select .cse0 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) v_ArrVal_3048)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) 1) |c_#StackHeapBarrier|))) (<= (+ .cse1 1) |c_#StackHeapBarrier|) (not (= .cse1 |c_ULTIMATE.start_dll_create_~head~0#1.base|)))) is different from false [2022-07-12 19:17:00,584 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) 4))) (and (forall ((v_ArrVal_3048 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_49| Int) (v_ArrVal_3046 Int)) (or (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_49|) (<= (+ (select (select (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_49| v_ArrVal_3046))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base| .cse0) (select .cse0 (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)) v_ArrVal_3048)) |c_ULTIMATE.start_dll_create_#res#1.base|) 4) 1) |c_#StackHeapBarrier|))) (not (= .cse1 |c_ULTIMATE.start_dll_create_#res#1.base|)) (<= (+ .cse1 1) |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_dll_create_#res#1.offset| 0))) is different from false [2022-07-12 19:17:00,587 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (and (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse0)) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (<= (+ .cse0 1) |c_#StackHeapBarrier|) (forall ((v_ArrVal_3048 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_49| Int) (v_ArrVal_3046 Int)) (or (<= (+ (select (select (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_49| v_ArrVal_3046))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse1) (select .cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_3048)) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 1) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_49|))))) is different from false [2022-07-12 19:17:01,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:17:01,229 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2022-07-12 19:17:01,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-12 19:17:01,229 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 3.130434782608696) internal successors, (144), 47 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2022-07-12 19:17:01,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:17:01,230 INFO L225 Difference]: With dead ends: 78 [2022-07-12 19:17:01,230 INFO L226 Difference]: Without dead ends: 78 [2022-07-12 19:17:01,230 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 105 SyntacticMatches, 5 SemanticMatches, 65 ConstructedPredicates, 17 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=310, Invalid=2191, Unknown=17, NotChecked=1904, Total=4422 [2022-07-12 19:17:01,231 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 197 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 674 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 1444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 733 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 19:17:01,231 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 586 Invalid, 1444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 674 Invalid, 0 Unknown, 733 Unchecked, 0.3s Time] [2022-07-12 19:17:01,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-07-12 19:17:01,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-07-12 19:17:01,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 73 states have (on average 1.0684931506849316) internal successors, (78), 77 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:17:01,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2022-07-12 19:17:01,232 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 65 [2022-07-12 19:17:01,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:17:01,233 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2022-07-12 19:17:01,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 3.130434782608696) internal successors, (144), 47 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:17:01,233 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2022-07-12 19:17:01,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-07-12 19:17:01,233 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:17:01,233 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-12 19:17:01,253 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-07-12 19:17:01,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:17:01,447 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-12 19:17:01,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:17:01,448 INFO L85 PathProgramCache]: Analyzing trace with hash -755420895, now seen corresponding path program 2 times [2022-07-12 19:17:01,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:17:01,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859975592] [2022-07-12 19:17:01,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:17:01,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:17:01,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:02,233 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-12 19:17:02,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:17:02,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859975592] [2022-07-12 19:17:02,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859975592] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:17:02,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1314273070] [2022-07-12 19:17:02,234 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 19:17:02,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:17:02,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:17:02,236 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) [2022-07-12 19:17:02,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-07-12 19:17:02,436 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 19:17:02,436 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 19:17:02,439 INFO L263 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 145 conjunts are in the unsatisfiable core [2022-07-12 19:17:02,442 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:17:02,448 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:17:02,463 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 19:17:02,467 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 19:17:02,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:17:02,474 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-12 19:17:02,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:17:02,478 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-12 19:17:02,496 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:17:02,496 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 19:17:02,519 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 19:17:02,524 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 19:17:02,532 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 19:17:02,537 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 19:17:02,584 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 26 treesize of output 28 [2022-07-12 19:17:02,590 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 26 treesize of output 28 [2022-07-12 19:17:02,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:17:02,647 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-12 19:17:02,647 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 62 [2022-07-12 19:17:02,657 INFO L356 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-07-12 19:17:02,657 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 54 [2022-07-12 19:17:02,928 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-07-12 19:17:02,929 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 36 [2022-07-12 19:17:02,953 INFO L356 Elim1Store]: treesize reduction 68, result has 27.7 percent of original size [2022-07-12 19:17:02,953 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 53 [2022-07-12 19:17:03,581 INFO L356 Elim1Store]: treesize reduction 182, result has 50.1 percent of original size [2022-07-12 19:17:03,581 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 21 case distinctions, treesize of input 131 treesize of output 259 [2022-07-12 19:17:03,692 INFO L356 Elim1Store]: treesize reduction 98, result has 49.7 percent of original size [2022-07-12 19:17:03,693 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 270 treesize of output 305 [2022-07-12 19:17:09,359 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:17:09,464 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:17:09,469 INFO L356 Elim1Store]: treesize reduction 17, result has 15.0 percent of original size [2022-07-12 19:17:09,469 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 6 case distinctions, treesize of input 77 treesize of output 41 [2022-07-12 19:17:09,476 INFO L356 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-07-12 19:17:09,476 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 16 [2022-07-12 19:17:09,600 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-12 19:17:09,600 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:17:09,685 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-12 19:17:33,135 WARN L233 SmtUtils]: Spent 5.48s on a formula simplification that was a NOOP. DAG size: 44 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 19:17:45,638 WARN L233 SmtUtils]: Spent 5.02s on a formula simplification that was a NOOP. DAG size: 44 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 19:18:16,142 INFO L356 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-07-12 19:18:16,142 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 884 treesize of output 680 [2022-07-12 19:18:16,146 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:18:16,162 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:18:16,162 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 664 treesize of output 480 [2022-07-12 19:18:16,253 INFO L356 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-07-12 19:18:16,253 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 1179 treesize of output 795 [2022-07-12 19:18:16,257 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:18:16,273 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:18:16,273 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 779 treesize of output 635 [2022-07-12 19:18:16,324 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_arrayElimArr_22 (Array Int Int)) (v_arrayElimArr_21 (Array Int Int)) (v_ArrVal_3194 Int) (v_ArrVal_3192 Int) (v_ArrVal_3199 Int) (v_ArrVal_3189 Int) (v_ArrVal_3198 Int)) (let ((.cse12 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8))) (let ((.cse9 (let ((.cse13 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_21))) (store .cse13 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse13 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse12 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))) (.cse5 (let ((.cse11 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_22))) (store .cse11 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse11 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse12 v_ArrVal_3189))))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse10 (select .cse9 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (let ((.cse3 (select .cse10 4)) (.cse4 (select .cse6 4))) (let ((.cse7 (let ((.cse8 (store .cse9 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse10 0 v_ArrVal_3194)))) (store .cse8 .cse3 (store (select .cse8 .cse3) .cse4 v_ArrVal_3199))))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)) (.cse0 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (or (not (= (select v_arrayElimArr_21 .cse0) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse1) (not (= (select (select (let ((.cse2 (store .cse5 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse6 0 v_ArrVal_3192)))) (store .cse2 .cse3 (store (select .cse2 .cse3) .cse4 v_ArrVal_3198))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0)) (= (select (select .cse7 .cse1) 4) 0) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| (select v_arrayElimArr_22 .cse0))))))))))) (forall ((v_ArrVal_3194 Int) (v_ArrVal_3192 Int) (v_arrayElimArr_19 (Array Int Int)) (v_ArrVal_3199 Int) (v_ArrVal_3189 Int) (v_ArrVal_3198 Int) (v_arrayElimArr_20 (Array Int Int))) (let ((.cse25 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8))) (let ((.cse19 (let ((.cse26 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_20))) (store .cse26 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse26 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse25 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))) (.cse22 (let ((.cse24 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_19))) (store .cse24 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse24 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse25 v_ArrVal_3189))))) (let ((.cse23 (select .cse22 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse20 (select .cse19 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (let ((.cse17 (select .cse20 4)) (.cse18 (select .cse23 4))) (let ((.cse14 (let ((.cse21 (store .cse22 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse23 0 v_ArrVal_3192)))) (store .cse21 .cse17 (store (select .cse21 .cse17) .cse18 v_ArrVal_3198)))) (.cse15 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (or (not (= (select (select .cse14 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0)) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| (select v_arrayElimArr_19 .cse15))) (= (select (select .cse14 (select (select (let ((.cse16 (store .cse19 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse20 0 v_ArrVal_3194)))) (store .cse16 .cse17 (store (select .cse16 .cse17) .cse18 v_ArrVal_3199))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)) 4) 0) (not (= (select v_arrayElimArr_20 .cse15) |c_ULTIMATE.start_dll_create_~head~0#1.base|)))))))))) is different from false [2022-07-12 19:18:21,316 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:18:21,325 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:18:21,325 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 1094 treesize of output 784 [2022-07-12 19:18:21,709 INFO L356 Elim1Store]: treesize reduction 1410, result has 49.9 percent of original size [2022-07-12 19:18:21,711 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 6 new quantified variables, introduced 10 case distinctions, treesize of input 6747556 treesize of output 6501059 [2022-07-12 19:18:22,833 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:18:22,873 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:18:22,875 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 6501362 treesize of output 2896822 [2022-07-12 19:18:24,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:18:24,806 INFO L356 Elim1Store]: treesize reduction 26, result has 33.3 percent of original size [2022-07-12 19:18:24,811 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 108628176 treesize of output 99803149