./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/dll2n_remove_all_reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 791161d1 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_remove_all_reverse.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 4d5c55d9a4a2ded389ff7ce077afdc88fb2d2855921e5fd1e3b93fbba7e140e8 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-23 06:32:13,866 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 06:32:13,868 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 06:32:13,911 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 06:32:13,916 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 06:32:13,917 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 06:32:13,918 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 06:32:13,922 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 06:32:13,923 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 06:32:13,924 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 06:32:13,924 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 06:32:13,925 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 06:32:13,926 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 06:32:13,926 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 06:32:13,927 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 06:32:13,928 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 06:32:13,929 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 06:32:13,930 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 06:32:13,931 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 06:32:13,933 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 06:32:13,934 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 06:32:13,935 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 06:32:13,936 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 06:32:13,937 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 06:32:13,938 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 06:32:13,941 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 06:32:13,941 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 06:32:13,941 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 06:32:13,942 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 06:32:13,942 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 06:32:13,943 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 06:32:13,943 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 06:32:13,944 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 06:32:13,946 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 06:32:13,947 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 06:32:13,948 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 06:32:13,949 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 06:32:13,950 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 06:32:13,950 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 06:32:13,950 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 06:32:13,951 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 06:32:13,956 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 06:32:13,956 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-23 06:32:13,990 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 06:32:13,993 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 06:32:13,993 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 06:32:13,993 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 06:32:13,994 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-23 06:32:13,994 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-23 06:32:13,994 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 06:32:13,995 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 06:32:13,995 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 06:32:13,996 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 06:32:13,996 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-23 06:32:13,996 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-23 06:32:13,996 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 06:32:13,996 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-23 06:32:13,996 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 06:32:13,997 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-23 06:32:13,997 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-23 06:32:13,997 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-23 06:32:13,997 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-23 06:32:13,997 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-23 06:32:13,998 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-23 06:32:13,998 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 06:32:13,998 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 06:32:13,998 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 06:32:13,998 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-23 06:32:13,999 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 06:32:13,999 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 06:32:13,999 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-23 06:32:13,999 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-23 06:32:13,999 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-23 06:32:14,000 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 -> 4d5c55d9a4a2ded389ff7ce077afdc88fb2d2855921e5fd1e3b93fbba7e140e8 [2022-07-23 06:32:14,237 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 06:32:14,278 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 06:32:14,281 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 06:32:14,282 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 06:32:14,283 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 06:32:14,284 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2n_remove_all_reverse.i [2022-07-23 06:32:14,341 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f94d712c1/97e3e0233e3746a6852849b432d1179f/FLAG4fb2189c9 [2022-07-23 06:32:14,836 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 06:32:14,837 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_remove_all_reverse.i [2022-07-23 06:32:14,856 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f94d712c1/97e3e0233e3746a6852849b432d1179f/FLAG4fb2189c9 [2022-07-23 06:32:15,359 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f94d712c1/97e3e0233e3746a6852849b432d1179f [2022-07-23 06:32:15,361 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 06:32:15,362 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 06:32:15,363 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 06:32:15,364 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 06:32:15,366 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 06:32:15,367 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 06:32:15" (1/1) ... [2022-07-23 06:32:15,368 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77e24f37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:32:15, skipping insertion in model container [2022-07-23 06:32:15,368 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 06:32:15" (1/1) ... [2022-07-23 06:32:15,374 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 06:32:15,400 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 06:32:15,688 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_remove_all_reverse.i[24275,24288] [2022-07-23 06:32:15,691 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 06:32:15,697 INFO L203 MainTranslator]: Completed pre-run [2022-07-23 06:32:15,734 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_remove_all_reverse.i[24275,24288] [2022-07-23 06:32:15,735 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 06:32:15,757 INFO L208 MainTranslator]: Completed translation [2022-07-23 06:32:15,758 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:32:15 WrapperNode [2022-07-23 06:32:15,758 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 06:32:15,759 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-23 06:32:15,759 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-23 06:32:15,759 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-23 06:32:15,765 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:32:15" (1/1) ... [2022-07-23 06:32:15,778 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:32:15" (1/1) ... [2022-07-23 06:32:15,797 INFO L137 Inliner]: procedures = 126, calls = 35, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 101 [2022-07-23 06:32:15,797 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-23 06:32:15,798 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-23 06:32:15,798 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-23 06:32:15,799 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-23 06:32:15,804 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:32:15" (1/1) ... [2022-07-23 06:32:15,805 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:32:15" (1/1) ... [2022-07-23 06:32:15,809 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:32:15" (1/1) ... [2022-07-23 06:32:15,809 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:32:15" (1/1) ... [2022-07-23 06:32:15,816 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:32:15" (1/1) ... [2022-07-23 06:32:15,822 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:32:15" (1/1) ... [2022-07-23 06:32:15,824 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:32:15" (1/1) ... [2022-07-23 06:32:15,826 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-23 06:32:15,827 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-23 06:32:15,828 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-23 06:32:15,828 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-23 06:32:15,829 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:32:15" (1/1) ... [2022-07-23 06:32:15,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 06:32:15,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:32:15,864 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-23 06:32:15,867 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-23 06:32:15,896 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2022-07-23 06:32:15,897 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2022-07-23 06:32:15,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-23 06:32:15,897 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-23 06:32:15,897 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-23 06:32:15,897 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-23 06:32:15,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-23 06:32:15,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-23 06:32:15,898 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-23 06:32:15,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-23 06:32:15,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-23 06:32:15,898 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-23 06:32:15,899 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-23 06:32:16,001 INFO L234 CfgBuilder]: Building ICFG [2022-07-23 06:32:16,003 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-23 06:32:16,060 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2022-07-23 06:32:16,268 INFO L275 CfgBuilder]: Performing block encoding [2022-07-23 06:32:16,275 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-23 06:32:16,275 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-23 06:32:16,277 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 06:32:16 BoogieIcfgContainer [2022-07-23 06:32:16,277 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-23 06:32:16,279 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-23 06:32:16,279 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-23 06:32:16,282 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-23 06:32:16,283 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.07 06:32:15" (1/3) ... [2022-07-23 06:32:16,283 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9888063 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 06:32:16, skipping insertion in model container [2022-07-23 06:32:16,284 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:32:15" (2/3) ... [2022-07-23 06:32:16,284 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9888063 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 06:32:16, skipping insertion in model container [2022-07-23 06:32:16,284 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 06:32:16" (3/3) ... [2022-07-23 06:32:16,285 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2n_remove_all_reverse.i [2022-07-23 06:32:16,299 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-23 06:32:16,299 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 34 error locations. [2022-07-23 06:32:16,341 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-23 06:32:16,347 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@6b279b9d, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@579b8e51 [2022-07-23 06:32:16,347 INFO L358 AbstractCegarLoop]: Starting to check reachability of 34 error locations. [2022-07-23 06:32:16,351 INFO L276 IsEmpty]: Start isEmpty. Operand has 76 states, 40 states have (on average 2.1) internal successors, (84), 74 states have internal predecessors, (84), 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-23 06:32:16,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-23 06:32:16,358 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:32:16,358 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-23 06:32:16,359 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-23 06:32:16,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:32:16,364 INFO L85 PathProgramCache]: Analyzing trace with hash 33471376, now seen corresponding path program 1 times [2022-07-23 06:32:16,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:32:16,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977426976] [2022-07-23 06:32:16,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:32:16,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:32:16,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:32:16,554 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-23 06:32:16,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:32:16,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977426976] [2022-07-23 06:32:16,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977426976] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:32:16,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:32:16,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 06:32:16,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725018655] [2022-07-23 06:32:16,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:32:16,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 06:32:16,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:32:16,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 06:32:16,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:32:16,601 INFO L87 Difference]: Start difference. First operand has 76 states, 40 states have (on average 2.1) internal successors, (84), 74 states have internal predecessors, (84), 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-23 06:32:16,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:32:16,737 INFO L93 Difference]: Finished difference Result 120 states and 129 transitions. [2022-07-23 06:32:16,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 06:32:16,741 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-23 06:32:16,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:32:16,749 INFO L225 Difference]: With dead ends: 120 [2022-07-23 06:32:16,749 INFO L226 Difference]: Without dead ends: 115 [2022-07-23 06:32:16,751 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-23 06:32:16,754 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 60 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:32:16,756 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 131 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:32:16,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-07-23 06:32:16,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 68. [2022-07-23 06:32:16,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 37 states have (on average 1.945945945945946) internal successors, (72), 67 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-23 06:32:16,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2022-07-23 06:32:16,787 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 5 [2022-07-23 06:32:16,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:32:16,788 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2022-07-23 06:32:16,788 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-23 06:32:16,788 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2022-07-23 06:32:16,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-23 06:32:16,789 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:32:16,789 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-23 06:32:16,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-23 06:32:16,789 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-23 06:32:16,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:32:16,790 INFO L85 PathProgramCache]: Analyzing trace with hash 33471377, now seen corresponding path program 1 times [2022-07-23 06:32:16,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:32:16,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079450841] [2022-07-23 06:32:16,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:32:16,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:32:16,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:32:16,879 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-23 06:32:16,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:32:16,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079450841] [2022-07-23 06:32:16,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079450841] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:32:16,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:32:16,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 06:32:16,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569606052] [2022-07-23 06:32:16,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:32:16,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 06:32:16,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:32:16,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 06:32:16,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:32:16,885 INFO L87 Difference]: Start difference. First operand 68 states and 72 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-23 06:32:16,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:32:16,959 INFO L93 Difference]: Finished difference Result 119 states and 126 transitions. [2022-07-23 06:32:16,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 06:32:16,964 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-23 06:32:16,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:32:16,966 INFO L225 Difference]: With dead ends: 119 [2022-07-23 06:32:16,967 INFO L226 Difference]: Without dead ends: 119 [2022-07-23 06:32:16,967 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-23 06:32:16,968 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 65 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:32:16,969 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 138 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:32:16,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-07-23 06:32:16,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 65. [2022-07-23 06:32:16,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 37 states have (on average 1.864864864864865) internal successors, (69), 64 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-23 06:32:16,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2022-07-23 06:32:16,984 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 5 [2022-07-23 06:32:16,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:32:16,986 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2022-07-23 06:32:16,987 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-23 06:32:16,987 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2022-07-23 06:32:16,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-23 06:32:16,988 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:32:16,988 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:32:16,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-23 06:32:16,989 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-23 06:32:16,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:32:16,991 INFO L85 PathProgramCache]: Analyzing trace with hash 2100113103, now seen corresponding path program 1 times [2022-07-23 06:32:16,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:32:16,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736015051] [2022-07-23 06:32:16,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:32:16,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:32:17,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:32:17,042 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-23 06:32:17,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:32:17,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736015051] [2022-07-23 06:32:17,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736015051] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:32:17,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:32:17,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 06:32:17,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252118847] [2022-07-23 06:32:17,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:32:17,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 06:32:17,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:32:17,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 06:32:17,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:32:17,047 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:32:17,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:32:17,059 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2022-07-23 06:32:17,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 06:32:17,059 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-07-23 06:32:17,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:32:17,060 INFO L225 Difference]: With dead ends: 75 [2022-07-23 06:32:17,060 INFO L226 Difference]: Without dead ends: 75 [2022-07-23 06:32:17,061 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-23 06:32:17,062 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 10 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 132 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-23 06:32:17,063 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 132 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 06:32:17,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-07-23 06:32:17,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 66. [2022-07-23 06:32:17,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 38 states have (on average 1.8421052631578947) internal successors, (70), 65 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-23 06:32:17,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2022-07-23 06:32:17,069 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 7 [2022-07-23 06:32:17,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:32:17,069 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2022-07-23 06:32:17,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:32:17,070 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2022-07-23 06:32:17,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-23 06:32:17,070 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:32:17,070 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:32:17,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-23 06:32:17,071 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-23 06:32:17,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:32:17,072 INFO L85 PathProgramCache]: Analyzing trace with hash 638916372, now seen corresponding path program 1 times [2022-07-23 06:32:17,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:32:17,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292555010] [2022-07-23 06:32:17,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:32:17,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:32:17,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:32:17,144 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-23 06:32:17,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:32:17,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292555010] [2022-07-23 06:32:17,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292555010] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:32:17,145 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:32:17,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 06:32:17,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663048871] [2022-07-23 06:32:17,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:32:17,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 06:32:17,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:32:17,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 06:32:17,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:32:17,147 INFO L87 Difference]: Start difference. First operand 66 states and 70 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-23 06:32:17,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:32:17,160 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2022-07-23 06:32:17,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 06:32:17,161 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-23 06:32:17,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:32:17,162 INFO L225 Difference]: With dead ends: 72 [2022-07-23 06:32:17,162 INFO L226 Difference]: Without dead ends: 72 [2022-07-23 06:32:17,162 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-23 06:32:17,163 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 1 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 127 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-23 06:32:17,164 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 127 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 06:32:17,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-07-23 06:32:17,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2022-07-23 06:32:17,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 43 states have (on average 1.744186046511628) internal successors, (75), 70 states have internal predecessors, (75), 0 states have call successors, (0), 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-23 06:32:17,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2022-07-23 06:32:17,169 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 9 [2022-07-23 06:32:17,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:32:17,169 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2022-07-23 06:32:17,169 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-23 06:32:17,169 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2022-07-23 06:32:17,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-23 06:32:17,170 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:32:17,170 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:32:17,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-23 06:32:17,170 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-23 06:32:17,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:32:17,171 INFO L85 PathProgramCache]: Analyzing trace with hash -763066850, now seen corresponding path program 1 times [2022-07-23 06:32:17,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:32:17,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293329643] [2022-07-23 06:32:17,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:32:17,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:32:17,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:32:17,236 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-23 06:32:17,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:32:17,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293329643] [2022-07-23 06:32:17,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293329643] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:32:17,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1160557423] [2022-07-23 06:32:17,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:32:17,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:32:17,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:32:17,244 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-23 06:32:17,246 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-23 06:32:17,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:32:17,322 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-23 06:32:17,326 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:32:17,389 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-23 06:32:17,390 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:32:17,433 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-23 06:32:17,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1160557423] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:32:17,434 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:32:17,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2022-07-23 06:32:17,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502634825] [2022-07-23 06:32:17,434 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:32:17,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 06:32:17,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:32:17,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 06:32:17,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-23 06:32:17,439 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 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-23 06:32:17,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:32:17,455 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2022-07-23 06:32:17,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 06:32:17,455 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 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 14 [2022-07-23 06:32:17,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:32:17,456 INFO L225 Difference]: With dead ends: 73 [2022-07-23 06:32:17,456 INFO L226 Difference]: Without dead ends: 73 [2022-07-23 06:32:17,461 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 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-23 06:32:17,463 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 16 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 188 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-23 06:32:17,464 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 188 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 06:32:17,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-07-23 06:32:17,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2022-07-23 06:32:17,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 45 states have (on average 1.711111111111111) internal successors, (77), 72 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-23 06:32:17,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2022-07-23 06:32:17,470 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 14 [2022-07-23 06:32:17,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:32:17,470 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2022-07-23 06:32:17,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 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-23 06:32:17,470 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2022-07-23 06:32:17,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-23 06:32:17,471 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:32:17,471 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-07-23 06:32:17,503 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-23 06:32:17,695 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-23 06:32:17,696 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-23 06:32:17,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:32:17,696 INFO L85 PathProgramCache]: Analyzing trace with hash -2097949021, now seen corresponding path program 1 times [2022-07-23 06:32:17,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:32:17,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354219750] [2022-07-23 06:32:17,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:32:17,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:32:17,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:32:17,834 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:32:17,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:32:17,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354219750] [2022-07-23 06:32:17,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354219750] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:32:17,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [301935258] [2022-07-23 06:32:17,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:32:17,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:32:17,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:32:17,837 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-23 06:32:17,838 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-23 06:32:17,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:32:17,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-23 06:32:17,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:32:17,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-23 06:32:17,972 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-23 06:32:17,973 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-23 06:32:17,983 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-23 06:32:17,983 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:32:18,080 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-23 06:32:18,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [301935258] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:32:18,081 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:32:18,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 6 [2022-07-23 06:32:18,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206957702] [2022-07-23 06:32:18,082 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:32:18,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-23 06:32:18,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:32:18,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 06:32:18,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-23 06:32:18,083 INFO L87 Difference]: Start difference. First operand 73 states and 77 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-23 06:32:18,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:32:18,172 INFO L93 Difference]: Finished difference Result 116 states and 123 transitions. [2022-07-23 06:32:18,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 06:32:18,172 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 16 [2022-07-23 06:32:18,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:32:18,173 INFO L225 Difference]: With dead ends: 116 [2022-07-23 06:32:18,173 INFO L226 Difference]: Without dead ends: 116 [2022-07-23 06:32:18,174 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 33 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-23 06:32:18,174 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 161 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 64 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:32:18,175 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 154 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 101 Invalid, 0 Unknown, 64 Unchecked, 0.1s Time] [2022-07-23 06:32:18,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-07-23 06:32:18,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 72. [2022-07-23 06:32:18,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 45 states have (on average 1.6888888888888889) internal successors, (76), 71 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-23 06:32:18,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2022-07-23 06:32:18,180 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 16 [2022-07-23 06:32:18,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:32:18,180 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2022-07-23 06:32:18,180 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-23 06:32:18,180 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2022-07-23 06:32:18,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-23 06:32:18,181 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:32:18,181 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-07-23 06:32:18,200 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-23 06:32:18,387 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-23 06:32:18,388 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-23 06:32:18,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:32:18,388 INFO L85 PathProgramCache]: Analyzing trace with hash -2097949020, now seen corresponding path program 1 times [2022-07-23 06:32:18,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:32:18,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367417816] [2022-07-23 06:32:18,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:32:18,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:32:18,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:32:18,496 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-23 06:32:18,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:32:18,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367417816] [2022-07-23 06:32:18,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367417816] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:32:18,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [768506562] [2022-07-23 06:32:18,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:32:18,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:32:18,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:32:18,499 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-23 06:32:18,501 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-23 06:32:18,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:32:18,591 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-23 06:32:18,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:32:18,606 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-23 06:32:18,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:32:18,702 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-23 06:32:18,710 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:32:18,711 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-23 06:32:18,740 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-23 06:32:18,741 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:32:18,892 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 50 treesize of output 46 [2022-07-23 06:32:18,947 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-23 06:32:18,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [768506562] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:32:18,947 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:32:18,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-07-23 06:32:18,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368049354] [2022-07-23 06:32:18,948 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:32:18,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-23 06:32:18,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:32:18,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-23 06:32:18,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-07-23 06:32:18,949 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand has 14 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 14 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-23 06:32:19,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:32:19,116 INFO L93 Difference]: Finished difference Result 115 states and 122 transitions. [2022-07-23 06:32:19,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 06:32:19,118 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 14 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 16 [2022-07-23 06:32:19,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:32:19,120 INFO L225 Difference]: With dead ends: 115 [2022-07-23 06:32:19,120 INFO L226 Difference]: Without dead ends: 115 [2022-07-23 06:32:19,120 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2022-07-23 06:32:19,121 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 223 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 120 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:32:19,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 128 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 148 Invalid, 0 Unknown, 120 Unchecked, 0.1s Time] [2022-07-23 06:32:19,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-07-23 06:32:19,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 71. [2022-07-23 06:32:19,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 45 states have (on average 1.6666666666666667) internal successors, (75), 70 states have internal predecessors, (75), 0 states have call successors, (0), 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-23 06:32:19,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2022-07-23 06:32:19,134 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 16 [2022-07-23 06:32:19,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:32:19,135 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2022-07-23 06:32:19,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 14 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-23 06:32:19,135 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2022-07-23 06:32:19,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-23 06:32:19,136 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:32:19,136 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:32:19,166 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-23 06:32:19,360 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-23 06:32:19,361 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-23 06:32:19,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:32:19,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1307957265, now seen corresponding path program 2 times [2022-07-23 06:32:19,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:32:19,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145204339] [2022-07-23 06:32:19,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:32:19,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:32:19,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:32:19,419 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-23 06:32:19,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:32:19,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145204339] [2022-07-23 06:32:19,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145204339] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:32:19,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1471897972] [2022-07-23 06:32:19,420 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 06:32:19,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:32:19,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:32:19,421 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-23 06:32:19,423 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-23 06:32:19,491 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-23 06:32:19,491 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 06:32:19,492 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-23 06:32:19,493 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:32:19,524 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-23 06:32:19,525 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:32:19,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1471897972] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:32:19,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-23 06:32:19,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-07-23 06:32:19,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126604158] [2022-07-23 06:32:19,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:32:19,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 06:32:19,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:32:19,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 06:32:19,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 06:32:19,527 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 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-23 06:32:19,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:32:19,540 INFO L93 Difference]: Finished difference Result 114 states and 120 transitions. [2022-07-23 06:32:19,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 06:32:19,540 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 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 21 [2022-07-23 06:32:19,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:32:19,542 INFO L225 Difference]: With dead ends: 114 [2022-07-23 06:32:19,542 INFO L226 Difference]: Without dead ends: 114 [2022-07-23 06:32:19,542 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 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-23 06:32:19,543 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 144 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 06:32:19,543 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 127 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 06:32:19,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-07-23 06:32:19,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 72. [2022-07-23 06:32:19,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 46 states have (on average 1.6521739130434783) internal successors, (76), 71 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-23 06:32:19,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2022-07-23 06:32:19,558 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 21 [2022-07-23 06:32:19,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:32:19,559 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2022-07-23 06:32:19,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 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-23 06:32:19,559 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2022-07-23 06:32:19,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-23 06:32:19,560 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:32:19,560 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:32:19,585 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-23 06:32:19,774 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-23 06:32:19,774 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-23 06:32:19,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:32:19,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1307957265, now seen corresponding path program 1 times [2022-07-23 06:32:19,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:32:19,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131458580] [2022-07-23 06:32:19,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:32:19,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:32:19,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:32:19,838 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-23 06:32:19,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:32:19,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131458580] [2022-07-23 06:32:19,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131458580] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:32:19,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [454565790] [2022-07-23 06:32:19,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:32:19,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:32:19,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:32:19,840 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-23 06:32:19,842 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-23 06:32:19,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:32:19,935 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-23 06:32:19,936 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:32:19,950 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-23 06:32:19,950 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:32:19,964 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-23 06:32:19,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [454565790] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:32:19,965 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:32:19,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2022-07-23 06:32:19,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796934695] [2022-07-23 06:32:19,965 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:32:19,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 06:32:19,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:32:19,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 06:32:19,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 06:32:19,966 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 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-23 06:32:19,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:32:19,989 INFO L93 Difference]: Finished difference Result 72 states and 75 transitions. [2022-07-23 06:32:19,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 06:32:19,990 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 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 21 [2022-07-23 06:32:19,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:32:19,990 INFO L225 Difference]: With dead ends: 72 [2022-07-23 06:32:19,990 INFO L226 Difference]: Without dead ends: 72 [2022-07-23 06:32:19,991 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 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-23 06:32:19,991 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 117 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 63 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-23 06:32:19,992 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 63 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 06:32:19,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-07-23 06:32:19,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2022-07-23 06:32:19,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 46 states have (on average 1.6304347826086956) internal successors, (75), 71 states have internal predecessors, (75), 0 states have call successors, (0), 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-23 06:32:19,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 75 transitions. [2022-07-23 06:32:19,994 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 75 transitions. Word has length 21 [2022-07-23 06:32:19,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:32:19,995 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 75 transitions. [2022-07-23 06:32:19,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 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-23 06:32:19,995 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 75 transitions. [2022-07-23 06:32:19,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-23 06:32:19,995 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:32:19,996 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:32:20,024 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-23 06:32:20,211 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-23 06:32:20,212 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-23 06:32:20,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:32:20,212 INFO L85 PathProgramCache]: Analyzing trace with hash 2020822154, now seen corresponding path program 1 times [2022-07-23 06:32:20,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:32:20,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120682598] [2022-07-23 06:32:20,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:32:20,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:32:20,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:32:20,310 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-23 06:32:20,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:32:20,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120682598] [2022-07-23 06:32:20,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120682598] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:32:20,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [475586284] [2022-07-23 06:32:20,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:32:20,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:32:20,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:32:20,313 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-23 06:32:20,315 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-23 06:32:20,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:32:20,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-23 06:32:20,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:32:20,444 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-23 06:32:20,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:32:20,461 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-23 06:32:20,491 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:32:20,491 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-07-23 06:32:20,510 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-23 06:32:20,510 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:32:20,562 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-23 06:32:20,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [475586284] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:32:20,563 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:32:20,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 7 [2022-07-23 06:32:20,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915580260] [2022-07-23 06:32:20,564 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:32:20,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-23 06:32:20,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:32:20,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-23 06:32:20,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-07-23 06:32:20,565 INFO L87 Difference]: Start difference. First operand 72 states and 75 transitions. Second operand has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 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-23 06:32:20,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:32:20,678 INFO L93 Difference]: Finished difference Result 113 states and 119 transitions. [2022-07-23 06:32:20,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-23 06:32:20,680 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 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 22 [2022-07-23 06:32:20,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:32:20,681 INFO L225 Difference]: With dead ends: 113 [2022-07-23 06:32:20,681 INFO L226 Difference]: Without dead ends: 113 [2022-07-23 06:32:20,682 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2022-07-23 06:32:20,683 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 200 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:32:20,684 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 94 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 112 Invalid, 0 Unknown, 2 Unchecked, 0.1s Time] [2022-07-23 06:32:20,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-07-23 06:32:20,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 71. [2022-07-23 06:32:20,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 47 states have (on average 1.5957446808510638) internal successors, (75), 70 states have internal predecessors, (75), 0 states have call successors, (0), 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-23 06:32:20,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2022-07-23 06:32:20,692 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 22 [2022-07-23 06:32:20,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:32:20,693 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2022-07-23 06:32:20,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 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-23 06:32:20,694 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2022-07-23 06:32:20,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-23 06:32:20,694 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:32:20,694 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:32:20,721 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-23 06:32:20,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:32:20,920 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-23 06:32:20,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:32:20,920 INFO L85 PathProgramCache]: Analyzing trace with hash 2020822155, now seen corresponding path program 1 times [2022-07-23 06:32:20,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:32:20,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224173503] [2022-07-23 06:32:20,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:32:20,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:32:20,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:32:21,049 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:32:21,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:32:21,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224173503] [2022-07-23 06:32:21,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224173503] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:32:21,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1662013094] [2022-07-23 06:32:21,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:32:21,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:32:21,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:32:21,052 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-23 06:32:21,054 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-23 06:32:21,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:32:21,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-23 06:32:21,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:32:21,159 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-23 06:32:21,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:32:21,180 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-23 06:32:21,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:32:21,216 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-23 06:32:21,267 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-23 06:32:21,267 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:32:26,043 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-23 06:32:26,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1662013094] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:32:26,043 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:32:26,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 13 [2022-07-23 06:32:26,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562178651] [2022-07-23 06:32:26,044 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:32:26,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-23 06:32:26,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:32:26,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-23 06:32:26,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2022-07-23 06:32:26,045 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand has 14 states, 13 states have (on average 4.923076923076923) internal successors, (64), 14 states have internal predecessors, (64), 0 states have call successors, (0), 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-23 06:32:26,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:32:26,188 INFO L93 Difference]: Finished difference Result 96 states and 101 transitions. [2022-07-23 06:32:26,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 06:32:26,188 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.923076923076923) internal successors, (64), 14 states have internal predecessors, (64), 0 states have call successors, (0), 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-23 06:32:26,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:32:26,189 INFO L225 Difference]: With dead ends: 96 [2022-07-23 06:32:26,189 INFO L226 Difference]: Without dead ends: 96 [2022-07-23 06:32:26,189 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2022-07-23 06:32:26,190 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 361 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:32:26,190 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 50 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:32:26,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-07-23 06:32:26,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 66. [2022-07-23 06:32:26,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 47 states have (on average 1.4680851063829787) internal successors, (69), 65 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-23 06:32:26,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2022-07-23 06:32:26,192 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 22 [2022-07-23 06:32:26,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:32:26,193 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2022-07-23 06:32:26,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.923076923076923) internal successors, (64), 14 states have internal predecessors, (64), 0 states have call successors, (0), 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-23 06:32:26,193 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2022-07-23 06:32:26,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-23 06:32:26,193 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:32:26,194 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:32:26,221 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-23 06:32:26,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:32:26,395 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-23 06:32:26,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:32:26,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1779022636, now seen corresponding path program 1 times [2022-07-23 06:32:26,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:32:26,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827852762] [2022-07-23 06:32:26,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:32:26,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:32:26,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:32:26,459 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-23 06:32:26,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:32:26,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827852762] [2022-07-23 06:32:26,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827852762] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:32:26,460 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:32:26,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-23 06:32:26,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965351381] [2022-07-23 06:32:26,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:32:26,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-23 06:32:26,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:32:26,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-23 06:32:26,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-23 06:32:26,462 INFO L87 Difference]: Start difference. First operand 66 states and 69 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 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-23 06:32:26,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:32:26,642 INFO L93 Difference]: Finished difference Result 95 states and 100 transitions. [2022-07-23 06:32:26,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-23 06:32:26,643 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 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-23 06:32:26,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:32:26,643 INFO L225 Difference]: With dead ends: 95 [2022-07-23 06:32:26,643 INFO L226 Difference]: Without dead ends: 95 [2022-07-23 06:32:26,644 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2022-07-23 06:32:26,644 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 156 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:32:26,644 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 181 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:32:26,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-07-23 06:32:26,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 67. [2022-07-23 06:32:26,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 48 states have (on average 1.4791666666666667) internal successors, (71), 66 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-23 06:32:26,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2022-07-23 06:32:26,646 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 23 [2022-07-23 06:32:26,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:32:26,646 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2022-07-23 06:32:26,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 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-23 06:32:26,647 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2022-07-23 06:32:26,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-23 06:32:26,648 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:32:26,648 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:32:26,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-23 06:32:26,649 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-23 06:32:26,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:32:26,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1779022635, now seen corresponding path program 1 times [2022-07-23 06:32:26,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:32:26,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427938107] [2022-07-23 06:32:26,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:32:26,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:32:26,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:32:26,750 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-23 06:32:26,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:32:26,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427938107] [2022-07-23 06:32:26,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427938107] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:32:26,751 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:32:26,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-23 06:32:26,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920503809] [2022-07-23 06:32:26,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:32:26,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-23 06:32:26,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:32:26,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-23 06:32:26,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-23 06:32:26,753 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 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-23 06:32:26,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:32:26,955 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2022-07-23 06:32:26,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-23 06:32:26,955 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 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-23 06:32:26,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:32:26,956 INFO L225 Difference]: With dead ends: 90 [2022-07-23 06:32:26,956 INFO L226 Difference]: Without dead ends: 90 [2022-07-23 06:32:26,956 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2022-07-23 06:32:26,957 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 282 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:32:26,957 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 132 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:32:26,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-07-23 06:32:26,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 67. [2022-07-23 06:32:26,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 48 states have (on average 1.4583333333333333) internal successors, (70), 66 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-23 06:32:26,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 70 transitions. [2022-07-23 06:32:26,959 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 70 transitions. Word has length 23 [2022-07-23 06:32:26,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:32:26,960 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 70 transitions. [2022-07-23 06:32:26,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 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-23 06:32:26,960 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2022-07-23 06:32:26,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-23 06:32:26,961 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:32:26,961 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] [2022-07-23 06:32:26,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-23 06:32:26,961 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-23 06:32:26,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:32:26,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1033118353, now seen corresponding path program 1 times [2022-07-23 06:32:26,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:32:26,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303366562] [2022-07-23 06:32:26,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:32:26,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:32:26,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:32:27,017 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-23 06:32:27,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:32:27,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303366562] [2022-07-23 06:32:27,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303366562] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:32:27,018 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:32:27,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-23 06:32:27,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404657460] [2022-07-23 06:32:27,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:32:27,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-23 06:32:27,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:32:27,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-23 06:32:27,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-23 06:32:27,020 INFO L87 Difference]: Start difference. First operand 67 states and 70 transitions. Second operand has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 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-23 06:32:27,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:32:27,128 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2022-07-23 06:32:27,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-23 06:32:27,129 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2022-07-23 06:32:27,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:32:27,129 INFO L225 Difference]: With dead ends: 66 [2022-07-23 06:32:27,129 INFO L226 Difference]: Without dead ends: 66 [2022-07-23 06:32:27,129 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2022-07-23 06:32:27,130 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 224 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:32:27,130 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 82 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:32:27,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-07-23 06:32:27,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2022-07-23 06:32:27,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 48 states have (on average 1.4375) internal successors, (69), 65 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-23 06:32:27,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2022-07-23 06:32:27,132 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 26 [2022-07-23 06:32:27,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:32:27,132 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2022-07-23 06:32:27,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 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-23 06:32:27,132 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2022-07-23 06:32:27,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-23 06:32:27,132 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:32:27,132 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] [2022-07-23 06:32:27,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-23 06:32:27,133 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-23 06:32:27,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:32:27,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1961897973, now seen corresponding path program 1 times [2022-07-23 06:32:27,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:32:27,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249969243] [2022-07-23 06:32:27,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:32:27,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:32:27,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:32:27,233 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-23 06:32:27,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:32:27,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249969243] [2022-07-23 06:32:27,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249969243] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:32:27,234 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:32:27,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-23 06:32:27,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102895868] [2022-07-23 06:32:27,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:32:27,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-23 06:32:27,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:32:27,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-23 06:32:27,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-23 06:32:27,236 INFO L87 Difference]: Start difference. First operand 66 states and 69 transitions. Second operand has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 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-23 06:32:27,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:32:27,413 INFO L93 Difference]: Finished difference Result 87 states and 92 transitions. [2022-07-23 06:32:27,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-23 06:32:27,414 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 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 27 [2022-07-23 06:32:27,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:32:27,415 INFO L225 Difference]: With dead ends: 87 [2022-07-23 06:32:27,415 INFO L226 Difference]: Without dead ends: 87 [2022-07-23 06:32:27,415 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2022-07-23 06:32:27,415 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 260 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:32:27,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 125 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:32:27,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-07-23 06:32:27,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 70. [2022-07-23 06:32:27,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 52 states have (on average 1.4230769230769231) internal successors, (74), 69 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-23 06:32:27,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2022-07-23 06:32:27,418 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 27 [2022-07-23 06:32:27,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:32:27,418 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2022-07-23 06:32:27,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 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-23 06:32:27,418 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2022-07-23 06:32:27,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-23 06:32:27,418 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:32:27,419 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] [2022-07-23 06:32:27,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-23 06:32:27,419 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-23 06:32:27,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:32:27,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1962328922, now seen corresponding path program 1 times [2022-07-23 06:32:27,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:32:27,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129412022] [2022-07-23 06:32:27,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:32:27,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:32:27,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:32:27,467 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-23 06:32:27,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:32:27,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129412022] [2022-07-23 06:32:27,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129412022] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:32:27,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:32:27,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 06:32:27,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111659559] [2022-07-23 06:32:27,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:32:27,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 06:32:27,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:32:27,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 06:32:27,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 06:32:27,469 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 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-23 06:32:27,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:32:27,567 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2022-07-23 06:32:27,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-23 06:32:27,568 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 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 27 [2022-07-23 06:32:27,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:32:27,568 INFO L225 Difference]: With dead ends: 70 [2022-07-23 06:32:27,568 INFO L226 Difference]: Without dead ends: 70 [2022-07-23 06:32:27,568 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-23 06:32:27,569 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 34 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:32:27,569 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 115 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:32:27,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-07-23 06:32:27,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2022-07-23 06:32:27,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 53 states have (on average 1.3962264150943395) internal successors, (74), 68 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-23 06:32:27,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 74 transitions. [2022-07-23 06:32:27,571 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 74 transitions. Word has length 27 [2022-07-23 06:32:27,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:32:27,571 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 74 transitions. [2022-07-23 06:32:27,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 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-23 06:32:27,571 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2022-07-23 06:32:27,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-23 06:32:27,572 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:32:27,572 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] [2022-07-23 06:32:27,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-23 06:32:27,572 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-23 06:32:27,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:32:27,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1962328923, now seen corresponding path program 1 times [2022-07-23 06:32:27,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:32:27,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76254997] [2022-07-23 06:32:27,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:32:27,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:32:27,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:32:27,717 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-23 06:32:27,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:32:27,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76254997] [2022-07-23 06:32:27,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76254997] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:32:27,717 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:32:27,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-23 06:32:27,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733621441] [2022-07-23 06:32:27,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:32:27,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-23 06:32:27,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:32:27,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-23 06:32:27,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-23 06:32:27,718 INFO L87 Difference]: Start difference. First operand 69 states and 74 transitions. Second operand has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 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-23 06:32:28,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:32:28,051 INFO L93 Difference]: Finished difference Result 106 states and 113 transitions. [2022-07-23 06:32:28,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-23 06:32:28,052 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 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 27 [2022-07-23 06:32:28,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:32:28,053 INFO L225 Difference]: With dead ends: 106 [2022-07-23 06:32:28,053 INFO L226 Difference]: Without dead ends: 106 [2022-07-23 06:32:28,053 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2022-07-23 06:32:28,054 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 317 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 06:32:28,054 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 184 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 06:32:28,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-07-23 06:32:28,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 76. [2022-07-23 06:32:28,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 60 states have (on average 1.4) internal successors, (84), 75 states have internal predecessors, (84), 0 states have call successors, (0), 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-23 06:32:28,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 84 transitions. [2022-07-23 06:32:28,056 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 84 transitions. Word has length 27 [2022-07-23 06:32:28,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:32:28,056 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 84 transitions. [2022-07-23 06:32:28,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 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-23 06:32:28,057 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 84 transitions. [2022-07-23 06:32:28,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-23 06:32:28,057 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:32:28,057 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] [2022-07-23 06:32:28,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-23 06:32:28,057 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-23 06:32:28,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:32:28,058 INFO L85 PathProgramCache]: Analyzing trace with hash 689295123, now seen corresponding path program 1 times [2022-07-23 06:32:28,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:32:28,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293047605] [2022-07-23 06:32:28,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:32:28,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:32:28,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:32:28,099 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-23 06:32:28,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:32:28,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293047605] [2022-07-23 06:32:28,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293047605] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:32:28,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:32:28,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 06:32:28,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657468323] [2022-07-23 06:32:28,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:32:28,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 06:32:28,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:32:28,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 06:32:28,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-23 06:32:28,101 INFO L87 Difference]: Start difference. First operand 76 states and 84 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 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-23 06:32:28,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:32:28,169 INFO L93 Difference]: Finished difference Result 75 states and 83 transitions. [2022-07-23 06:32:28,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 06:32:28,169 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 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 28 [2022-07-23 06:32:28,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:32:28,170 INFO L225 Difference]: With dead ends: 75 [2022-07-23 06:32:28,170 INFO L226 Difference]: Without dead ends: 75 [2022-07-23 06:32:28,170 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-23 06:32:28,171 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 21 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:32:28,171 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 113 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:32:28,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-07-23 06:32:28,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2022-07-23 06:32:28,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 60 states have (on average 1.3833333333333333) internal successors, (83), 74 states have internal predecessors, (83), 0 states have call successors, (0), 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-23 06:32:28,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 83 transitions. [2022-07-23 06:32:28,173 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 83 transitions. Word has length 28 [2022-07-23 06:32:28,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:32:28,174 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 83 transitions. [2022-07-23 06:32:28,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 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-23 06:32:28,174 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 83 transitions. [2022-07-23 06:32:28,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-23 06:32:28,174 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:32:28,174 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] [2022-07-23 06:32:28,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-23 06:32:28,175 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-23 06:32:28,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:32:28,175 INFO L85 PathProgramCache]: Analyzing trace with hash -106687560, now seen corresponding path program 1 times [2022-07-23 06:32:28,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:32:28,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562357752] [2022-07-23 06:32:28,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:32:28,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:32:28,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:32:28,294 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-23 06:32:28,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:32:28,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562357752] [2022-07-23 06:32:28,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562357752] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:32:28,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1793703920] [2022-07-23 06:32:28,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:32:28,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:32:28,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:32:28,300 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-23 06:32:28,302 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-23 06:32:28,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:32:28,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-23 06:32:28,426 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:32:28,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:32:28,525 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-23 06:32:28,530 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-23 06:32:28,530 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:32:28,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1793703920] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:32:28,531 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-23 06:32:28,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 13 [2022-07-23 06:32:28,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81279645] [2022-07-23 06:32:28,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:32:28,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-23 06:32:28,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:32:28,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 06:32:28,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-07-23 06:32:28,532 INFO L87 Difference]: Start difference. First operand 75 states and 83 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-23 06:32:28,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:32:28,628 INFO L93 Difference]: Finished difference Result 82 states and 91 transitions. [2022-07-23 06:32:28,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 06:32:28,628 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 29 [2022-07-23 06:32:28,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:32:28,629 INFO L225 Difference]: With dead ends: 82 [2022-07-23 06:32:28,629 INFO L226 Difference]: Without dead ends: 82 [2022-07-23 06:32:28,629 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2022-07-23 06:32:28,630 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 122 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:32:28,630 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 71 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:32:28,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-07-23 06:32:28,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 74. [2022-07-23 06:32:28,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 60 states have (on average 1.3666666666666667) internal successors, (82), 73 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-23 06:32:28,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 82 transitions. [2022-07-23 06:32:28,633 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 82 transitions. Word has length 29 [2022-07-23 06:32:28,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:32:28,633 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 82 transitions. [2022-07-23 06:32:28,633 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-23 06:32:28,633 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 82 transitions. [2022-07-23 06:32:28,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-23 06:32:28,634 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:32:28,634 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] [2022-07-23 06:32:28,652 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-23 06:32:28,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:32:28,840 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-23 06:32:28,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:32:28,840 INFO L85 PathProgramCache]: Analyzing trace with hash 307453124, now seen corresponding path program 1 times [2022-07-23 06:32:28,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:32:28,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894218646] [2022-07-23 06:32:28,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:32:28,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:32:28,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:32:29,016 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-23 06:32:29,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:32:29,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894218646] [2022-07-23 06:32:29,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894218646] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:32:29,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:32:29,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-23 06:32:29,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055877914] [2022-07-23 06:32:29,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:32:29,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-23 06:32:29,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:32:29,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-23 06:32:29,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2022-07-23 06:32:29,017 INFO L87 Difference]: Start difference. First operand 74 states and 82 transitions. Second operand has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:32:29,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:32:29,337 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2022-07-23 06:32:29,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-23 06:32:29,338 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-07-23 06:32:29,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:32:29,338 INFO L225 Difference]: With dead ends: 77 [2022-07-23 06:32:29,338 INFO L226 Difference]: Without dead ends: 77 [2022-07-23 06:32:29,338 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=149, Invalid=403, Unknown=0, NotChecked=0, Total=552 [2022-07-23 06:32:29,339 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 224 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:32:29,339 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 183 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:32:29,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-07-23 06:32:29,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 73. [2022-07-23 06:32:29,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 59 states have (on average 1.3220338983050848) internal successors, (78), 72 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-23 06:32:29,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2022-07-23 06:32:29,341 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 29 [2022-07-23 06:32:29,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:32:29,341 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2022-07-23 06:32:29,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:32:29,341 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2022-07-23 06:32:29,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-23 06:32:29,342 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:32:29,342 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] [2022-07-23 06:32:29,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-23 06:32:29,342 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-23 06:32:29,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:32:29,342 INFO L85 PathProgramCache]: Analyzing trace with hash -890236208, now seen corresponding path program 1 times [2022-07-23 06:32:29,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:32:29,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962589717] [2022-07-23 06:32:29,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:32:29,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:32:29,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:32:29,540 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:32:29,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:32:29,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962589717] [2022-07-23 06:32:29,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962589717] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:32:29,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1705134748] [2022-07-23 06:32:29,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:32:29,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:32:29,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:32:29,542 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-23 06:32:29,559 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-23 06:32:29,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:32:29,702 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 59 conjunts are in the unsatisfiable core [2022-07-23 06:32:29,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:32:29,724 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-23 06:32:29,796 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:32:29,796 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-23 06:32:29,832 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-23 06:32:29,868 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-23 06:32:29,869 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-23 06:32:29,888 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:32:29,888 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-23 06:32:30,080 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 49 treesize of output 37 [2022-07-23 06:32:30,186 INFO L356 Elim1Store]: treesize reduction 3, result has 78.6 percent of original size [2022-07-23 06:32:30,187 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 27 [2022-07-23 06:32:30,199 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:32:30,200 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:32:30,322 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 28 treesize of output 20 [2022-07-23 06:32:30,462 INFO L356 Elim1Store]: treesize reduction 5, result has 79.2 percent of original size [2022-07-23 06:32:30,463 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 27 [2022-07-23 06:32:30,470 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1200 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1200))) (let ((.cse1 (select (select .cse0 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select (select .cse0 .cse1) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))))) is different from false [2022-07-23 06:32:30,503 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1197 Int) (v_ArrVal_1200 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse1 (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_1197)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1200))) (let ((.cse0 (select (select .cse1 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse0)) (= (select (select .cse1 .cse0) (+ |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-23 06:32:30,522 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-07-23 06:32:30,522 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 76 treesize of output 51 [2022-07-23 06:32:30,550 INFO L356 Elim1Store]: treesize reduction 36, result has 48.6 percent of original size [2022-07-23 06:32:30,550 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 123 treesize of output 124 [2022-07-23 06:32:30,558 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:32:30,558 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 108 treesize of output 104 [2022-07-23 06:32:30,700 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-23 06:32:30,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1705134748] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:32:30,700 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:32:30,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 39 [2022-07-23 06:32:30,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567154407] [2022-07-23 06:32:30,701 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:32:30,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-07-23 06:32:30,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:32:30,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-07-23 06:32:30,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1299, Unknown=2, NotChecked=146, Total=1560 [2022-07-23 06:32:30,703 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand has 40 states, 39 states have (on average 2.2051282051282053) internal successors, (86), 40 states have internal predecessors, (86), 0 states have call successors, (0), 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-23 06:32:30,886 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) (= |c_ULTIMATE.start_main_~#s~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_1197 Int) (v_ArrVal_1200 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| 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_1197)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1200))) (let ((.cse1 (select (select .cse2 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse1)) (= (select (select .cse2 .cse1) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |c_#valid| .cse0) 1))) is different from false [2022-07-23 06:32:30,890 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~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|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (forall ((v_ArrVal_1200 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1200))) (let ((.cse1 (select (select .cse0 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select (select .cse0 .cse1) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) is different from false [2022-07-23 06:32:30,892 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~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|) (forall ((v_ArrVal_1200 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1200))) (let ((.cse1 (select (select .cse0 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select (select .cse0 .cse1) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) is different from false [2022-07-23 06:32:31,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:32:31,981 INFO L93 Difference]: Finished difference Result 154 states and 166 transitions. [2022-07-23 06:32:31,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-23 06:32:31,982 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 2.2051282051282053) internal successors, (86), 40 states have internal predecessors, (86), 0 states have call successors, (0), 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-23 06:32:31,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:32:31,982 INFO L225 Difference]: With dead ends: 154 [2022-07-23 06:32:31,982 INFO L226 Difference]: Without dead ends: 154 [2022-07-23 06:32:31,983 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=291, Invalid=2274, Unknown=5, NotChecked=510, Total=3080 [2022-07-23 06:32:31,984 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 299 mSDsluCounter, 717 mSDsCounter, 0 mSdLazyCounter, 1184 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 759 SdHoareTripleChecker+Invalid, 1765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 566 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-23 06:32:31,984 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 759 Invalid, 1765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1184 Invalid, 0 Unknown, 566 Unchecked, 0.6s Time] [2022-07-23 06:32:31,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2022-07-23 06:32:31,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 94. [2022-07-23 06:32:31,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 80 states have (on average 1.275) internal successors, (102), 93 states have internal predecessors, (102), 0 states have call successors, (0), 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-23 06:32:31,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 102 transitions. [2022-07-23 06:32:31,986 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 102 transitions. Word has length 31 [2022-07-23 06:32:31,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:32:31,987 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 102 transitions. [2022-07-23 06:32:31,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 2.2051282051282053) internal successors, (86), 40 states have internal predecessors, (86), 0 states have call successors, (0), 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-23 06:32:31,987 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 102 transitions. [2022-07-23 06:32:31,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-23 06:32:31,987 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:32:31,987 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] [2022-07-23 06:32:32,014 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-23 06:32:32,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:32:32,188 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-23 06:32:32,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:32:32,188 INFO L85 PathProgramCache]: Analyzing trace with hash -890236207, now seen corresponding path program 1 times [2022-07-23 06:32:32,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:32:32,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608517766] [2022-07-23 06:32:32,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:32:32,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:32:32,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:32:32,593 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:32:32,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:32:32,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608517766] [2022-07-23 06:32:32,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608517766] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:32:32,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1788306089] [2022-07-23 06:32:32,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:32:32,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:32:32,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:32:32,596 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-23 06:32:32,608 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-23 06:32:32,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:32:32,730 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 75 conjunts are in the unsatisfiable core [2022-07-23 06:32:32,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:32:32,754 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-23 06:32:32,832 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:32:32,833 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-23 06:32:32,870 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-23 06:32:32,874 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-23 06:32:32,922 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-23 06:32:32,922 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-23 06:32:32,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:32:32,930 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-23 06:32:32,955 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:32:32,955 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-23 06:32:32,963 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-23 06:32:33,335 INFO L356 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-07-23 06:32:33,336 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 54 [2022-07-23 06:32:33,345 INFO L356 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2022-07-23 06:32:33,345 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 28 [2022-07-23 06:32:33,368 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:32:33,368 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:32:33,859 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:32:33,859 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 137 treesize of output 141 [2022-07-23 06:32:33,914 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1306 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_ArrVal_1308 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1306))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1308) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select .cse2 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse2 .cse0) (+ .cse1 4)) 4)))))) (forall ((v_prenex_3 Int) (v_prenex_4 (Array Int Int))) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_4) v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (forall ((v_prenex_2 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse4 (select (select .cse3 v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (<= (select (select .cse3 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_4) v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ .cse4 4)) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) (not (= .cse4 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))))) (forall ((v_prenex_3 Int) (v_prenex_4 (Array Int Int))) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_4) v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (forall ((v_prenex_2 (Array Int Int))) (let ((.cse6 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2) v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_4))) (select .cse5 (select (select .cse5 v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ .cse6 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= .cse6 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))))) is different from false [2022-07-23 06:32:33,989 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_3 Int) (v_ArrVal_1303 Int) (v_ArrVal_1302 Int) (v_prenex_4 (Array Int Int))) (or (forall ((v_prenex_2 (Array Int Int))) (let ((.cse2 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (let ((.cse1 (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|) .cse2 v_ArrVal_1302)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse0 (select (select .cse1 v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse0)) (<= (select (select .cse1 (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|) .cse2 v_ArrVal_1303)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_4) v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 4 .cse0)) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4))))))) (not (= (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_1303)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_4) v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))) (forall ((v_prenex_3 Int) (v_ArrVal_1303 Int) (v_ArrVal_1302 Int) (v_prenex_4 (Array Int Int))) (or (forall ((v_prenex_2 (Array Int Int))) (let ((.cse5 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (let ((.cse3 (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|) .cse5 v_ArrVal_1302)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2) v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse3)) (= (select (let ((.cse4 (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_1303)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_4))) (select .cse4 (select (select .cse4 v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 4 .cse3)) |c_ULTIMATE.start_dll_create_~head~0#1.base|))))) (not (= (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_1303)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_4) v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))) (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1303 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_ArrVal_1302 Int) (v_ArrVal_1308 (Array Int Int))) (let ((.cse9 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (let ((.cse6 (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|) .cse9 v_ArrVal_1302)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1306))) (let ((.cse7 (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|) .cse9 v_ArrVal_1303)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1308) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse8 (select (select .cse6 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (<= 0 (+ (select (select .cse6 .cse7) (+ .cse8 4)) 4)) (not (= .cse7 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= .cse8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))))) is different from false [2022-07-23 06:32:34,008 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:32:34,013 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:32:34,014 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 100 treesize of output 90 [2022-07-23 06:32:34,018 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:32:34,022 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:32:34,023 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 85 treesize of output 60 [2022-07-23 06:32:34,035 INFO L356 Elim1Store]: treesize reduction 3, result has 85.0 percent of original size [2022-07-23 06:32:34,036 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 99 treesize of output 95 [2022-07-23 06:32:34,166 INFO L356 Elim1Store]: treesize reduction 182, result has 33.3 percent of original size [2022-07-23 06:32:34,166 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 8 new quantified variables, introduced 21 case distinctions, treesize of input 253 treesize of output 279 [2022-07-23 06:32:34,196 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:32:34,196 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 202 treesize of output 208 [2022-07-23 06:32:34,213 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 133 treesize of output 115 [2022-07-23 06:32:34,993 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:32:34,996 INFO L356 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-07-23 06:32:34,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 98 treesize of output 1 [2022-07-23 06:32:35,003 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:32:35,008 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:32:35,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 100 treesize of output 90 [2022-07-23 06:32:35,016 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:32:35,020 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:32:35,020 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 85 treesize of output 60 [2022-07-23 06:32:35,024 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:32:35,062 INFO L356 Elim1Store]: treesize reduction 80, result has 35.0 percent of original size [2022-07-23 06:32:35,062 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 124 treesize of output 118 [2022-07-23 06:32:35,101 INFO L356 Elim1Store]: treesize reduction 4, result has 89.7 percent of original size [2022-07-23 06:32:35,102 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 3 case distinctions, treesize of input 91 treesize of output 105 [2022-07-23 06:32:35,109 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 53 treesize of output 49 [2022-07-23 06:32:35,115 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 62 [2022-07-23 06:32:35,354 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-23 06:32:35,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1788306089] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:32:35,355 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:32:35,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 15] total 43 [2022-07-23 06:32:35,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144192047] [2022-07-23 06:32:35,355 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:32:35,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-07-23 06:32:35,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:32:35,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-07-23 06:32:35,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1606, Unknown=2, NotChecked=162, Total=1892 [2022-07-23 06:32:35,357 INFO L87 Difference]: Start difference. First operand 94 states and 102 transitions. Second operand has 44 states, 43 states have (on average 2.046511627906977) internal successors, (88), 44 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-23 06:32:35,561 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse14 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse6 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse14)) (.cse5 (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse14) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse0 (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0)) (.cse1 (select |c_#length| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (and .cse0 (<= .cse1 12) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (forall ((v_prenex_3 Int) (v_ArrVal_1303 Int) (v_ArrVal_1302 Int) (v_prenex_4 (Array Int Int))) (or (forall ((v_prenex_2 (Array Int Int))) (let ((.cse4 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (let ((.cse3 (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|) .cse4 v_ArrVal_1302)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse2 (select (select .cse3 v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse2)) (<= (select (select .cse3 (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|) .cse4 v_ArrVal_1303)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_4) v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 4 .cse2)) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4))))))) (not (= (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_1303)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_4) v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))) .cse5 (= .cse6 0) (forall ((v_prenex_3 Int) (v_ArrVal_1303 Int) (v_ArrVal_1302 Int) (v_prenex_4 (Array Int Int))) (or (forall ((v_prenex_2 (Array Int Int))) (let ((.cse9 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (let ((.cse7 (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|) .cse9 v_ArrVal_1302)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2) v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse7)) (= (select (let ((.cse8 (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|) .cse9 v_ArrVal_1303)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_4))) (select .cse8 (select (select .cse8 v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 4 .cse7)) |c_ULTIMATE.start_dll_create_~head~0#1.base|))))) (not (= (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_1303)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_4) v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|) |c_ULTIMATE.start_dll_create_~new_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 |c_#length| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 12) (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1303 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_ArrVal_1302 Int) (v_ArrVal_1308 (Array Int Int))) (let ((.cse13 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (let ((.cse10 (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|) .cse13 v_ArrVal_1302)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1306))) (let ((.cse11 (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|) .cse13 v_ArrVal_1303)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1308) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse12 (select (select .cse10 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (<= 0 (+ (select (select .cse10 .cse11) (+ .cse12 4)) 4)) (not (= .cse11 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= .cse12 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))))))) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| .cse6) (or (and .cse5 (<= 12 .cse1)) (and .cse0 (<= .cse1 11))) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)))) is different from false [2022-07-23 06:32:35,568 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse11 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse7 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse11)) (.cse6 (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse11) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse3 (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0))) (and (forall ((v_ArrVal_1306 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_ArrVal_1308 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1306))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1308) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select .cse2 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse2 .cse0) (+ .cse1 4)) 4)))))) .cse3 (forall ((v_prenex_3 Int) (v_prenex_4 (Array Int Int))) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_4) v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (forall ((v_prenex_2 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse5 (select (select .cse4 v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (<= (select (select .cse4 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_4) v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ .cse5 4)) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) (not (= .cse5 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))))) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) .cse6 (= .cse7 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) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| .cse7) (forall ((v_prenex_3 Int) (v_prenex_4 (Array Int Int))) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_4) v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (forall ((v_prenex_2 (Array Int Int))) (let ((.cse9 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2) v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_4))) (select .cse8 (select (select .cse8 v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ .cse9 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= .cse9 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))))))) (let ((.cse10 (select |c_#length| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (or (and .cse6 (<= 12 .cse10)) (and .cse3 (<= .cse10 11))))))) is different from false [2022-07-23 06:32:35,573 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse11 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse7 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse11)) (.cse6 (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse11) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse3 (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0))) (and (forall ((v_ArrVal_1306 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_ArrVal_1308 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1306))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1308) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select .cse2 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse2 .cse0) (+ .cse1 4)) 4)))))) .cse3 (forall ((v_prenex_3 Int) (v_prenex_4 (Array Int Int))) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_4) v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (forall ((v_prenex_2 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse5 (select (select .cse4 v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (<= (select (select .cse4 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_4) v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ .cse5 4)) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) (not (= .cse5 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))))) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) .cse6 (= .cse7 0) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| .cse7) (forall ((v_prenex_3 Int) (v_prenex_4 (Array Int Int))) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_4) v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (forall ((v_prenex_2 (Array Int Int))) (let ((.cse9 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2) v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_4))) (select .cse8 (select (select .cse8 v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ .cse9 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= .cse9 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))))))) (let ((.cse10 (select |c_#length| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (or (and .cse6 (<= 12 .cse10)) (and .cse3 (<= .cse10 11))))))) is different from false [2022-07-23 06:32:37,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:32:37,508 INFO L93 Difference]: Finished difference Result 269 states and 287 transitions. [2022-07-23 06:32:37,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-07-23 06:32:37,509 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 2.046511627906977) internal successors, (88), 44 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) Word has length 31 [2022-07-23 06:32:37,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:32:37,510 INFO L225 Difference]: With dead ends: 269 [2022-07-23 06:32:37,510 INFO L226 Difference]: Without dead ends: 269 [2022-07-23 06:32:37,511 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 501 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=355, Invalid=3200, Unknown=5, NotChecked=600, Total=4160 [2022-07-23 06:32:37,512 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 572 mSDsluCounter, 1349 mSDsCounter, 0 mSdLazyCounter, 1638 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 572 SdHoareTripleChecker+Valid, 1412 SdHoareTripleChecker+Invalid, 2408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 748 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-23 06:32:37,512 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [572 Valid, 1412 Invalid, 2408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1638 Invalid, 0 Unknown, 748 Unchecked, 0.9s Time] [2022-07-23 06:32:37,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2022-07-23 06:32:37,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 94. [2022-07-23 06:32:37,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 81 states have (on average 1.2839506172839505) internal successors, (104), 93 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:32:37,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 104 transitions. [2022-07-23 06:32:37,515 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 104 transitions. Word has length 31 [2022-07-23 06:32:37,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:32:37,515 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 104 transitions. [2022-07-23 06:32:37,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 2.046511627906977) internal successors, (88), 44 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-23 06:32:37,516 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 104 transitions. [2022-07-23 06:32:37,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-23 06:32:37,516 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:32:37,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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:32:37,535 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-23 06:32:37,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-07-23 06:32:37,717 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-23 06:32:37,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:32:37,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1649773349, now seen corresponding path program 1 times [2022-07-23 06:32:37,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:32:37,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793836244] [2022-07-23 06:32:37,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:32:37,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:32:37,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:32:37,780 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-23 06:32:37,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:32:37,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793836244] [2022-07-23 06:32:37,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793836244] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:32:37,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:32:37,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 06:32:37,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547935750] [2022-07-23 06:32:37,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:32:37,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 06:32:37,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:32:37,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 06:32:37,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 06:32:37,783 INFO L87 Difference]: Start difference. First operand 94 states and 104 transitions. Second operand has 4 states, 3 states have (on average 9.0) 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-23 06:32:37,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:32:37,825 INFO L93 Difference]: Finished difference Result 99 states and 110 transitions. [2022-07-23 06:32:37,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 06:32:37,826 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) 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-23 06:32:37,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:32:37,826 INFO L225 Difference]: With dead ends: 99 [2022-07-23 06:32:37,826 INFO L226 Difference]: Without dead ends: 99 [2022-07-23 06:32:37,827 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-23 06:32:37,827 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 74 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 06:32:37,827 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 41 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 06:32:37,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-07-23 06:32:37,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2022-07-23 06:32:37,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 86 states have (on average 1.2790697674418605) internal successors, (110), 98 states have internal predecessors, (110), 0 states have call successors, (0), 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-23 06:32:37,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 110 transitions. [2022-07-23 06:32:37,830 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 110 transitions. Word has length 33 [2022-07-23 06:32:37,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:32:37,830 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 110 transitions. [2022-07-23 06:32:37,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) 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-23 06:32:37,831 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 110 transitions. [2022-07-23 06:32:37,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-23 06:32:37,831 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:32:37,831 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:32:37,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-23 06:32:37,831 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-23 06:32:37,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:32:37,832 INFO L85 PathProgramCache]: Analyzing trace with hash -818501958, now seen corresponding path program 1 times [2022-07-23 06:32:37,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:32:37,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809767727] [2022-07-23 06:32:37,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:32:37,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:32:37,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:32:37,897 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-23 06:32:37,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:32:37,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809767727] [2022-07-23 06:32:37,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809767727] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:32:37,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [715284959] [2022-07-23 06:32:37,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:32:37,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:32:37,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:32:37,899 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-23 06:32:37,909 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-23 06:32:38,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:32:38,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-23 06:32:38,036 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:32:38,044 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 17 treesize of output 9 [2022-07-23 06:32:38,052 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-23 06:32:38,052 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:32:38,067 INFO L356 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2022-07-23 06:32:38,067 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 16 treesize of output 15 [2022-07-23 06:32:38,070 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-23 06:32:38,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [715284959] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:32:38,070 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:32:38,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2022-07-23 06:32:38,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838927693] [2022-07-23 06:32:38,071 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:32:38,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-23 06:32:38,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:32:38,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 06:32:38,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-23 06:32:38,072 INFO L87 Difference]: Start difference. First operand 99 states and 110 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-23 06:32:38,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:32:38,195 INFO L93 Difference]: Finished difference Result 99 states and 108 transitions. [2022-07-23 06:32:38,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-23 06:32:38,195 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 33 [2022-07-23 06:32:38,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:32:38,196 INFO L225 Difference]: With dead ends: 99 [2022-07-23 06:32:38,196 INFO L226 Difference]: Without dead ends: 99 [2022-07-23 06:32:38,196 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-07-23 06:32:38,196 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 35 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:32:38,197 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 130 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:32:38,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-07-23 06:32:38,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2022-07-23 06:32:38,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 86 states have (on average 1.255813953488372) internal successors, (108), 97 states have internal predecessors, (108), 0 states have call successors, (0), 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-23 06:32:38,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 108 transitions. [2022-07-23 06:32:38,199 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 108 transitions. Word has length 33 [2022-07-23 06:32:38,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:32:38,199 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 108 transitions. [2022-07-23 06:32:38,199 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-23 06:32:38,199 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 108 transitions. [2022-07-23 06:32:38,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-23 06:32:38,200 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:32:38,200 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:32:38,219 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-23 06:32:38,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-07-23 06:32:38,412 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-23 06:32:38,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:32:38,412 INFO L85 PathProgramCache]: Analyzing trace with hash -818501957, now seen corresponding path program 1 times [2022-07-23 06:32:38,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:32:38,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527987498] [2022-07-23 06:32:38,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:32:38,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:32:38,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:32:38,564 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-23 06:32:38,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:32:38,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527987498] [2022-07-23 06:32:38,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527987498] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:32:38,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [649245278] [2022-07-23 06:32:38,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:32:38,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:32:38,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:32:38,568 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-23 06:32:38,610 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-23 06:32:38,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:32:38,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-23 06:32:38,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:32:38,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 23 treesize of output 15 [2022-07-23 06:32:38,773 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 19 treesize of output 11 [2022-07-23 06:32:38,851 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-23 06:32:38,851 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:32:38,936 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:32:38,936 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 28 [2022-07-23 06:32:38,964 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-23 06:32:38,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [649245278] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:32:38,964 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:32:38,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 20 [2022-07-23 06:32:38,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520955880] [2022-07-23 06:32:38,965 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:32:38,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-23 06:32:38,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:32:38,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-23 06:32:38,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2022-07-23 06:32:38,966 INFO L87 Difference]: Start difference. First operand 98 states and 108 transitions. Second operand has 21 states, 20 states have (on average 2.85) internal successors, (57), 21 states have internal predecessors, (57), 0 states have call successors, (0), 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-23 06:32:39,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:32:39,749 INFO L93 Difference]: Finished difference Result 135 states and 144 transitions. [2022-07-23 06:32:39,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-23 06:32:39,749 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.85) internal successors, (57), 21 states have internal predecessors, (57), 0 states have call successors, (0), 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-23 06:32:39,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:32:39,750 INFO L225 Difference]: With dead ends: 135 [2022-07-23 06:32:39,750 INFO L226 Difference]: Without dead ends: 135 [2022-07-23 06:32:39,751 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=383, Invalid=1423, Unknown=0, NotChecked=0, Total=1806 [2022-07-23 06:32:39,751 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 411 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 411 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 06:32:39,752 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [411 Valid, 231 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 06:32:39,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-07-23 06:32:39,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 97. [2022-07-23 06:32:39,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 86 states have (on average 1.2325581395348837) internal successors, (106), 96 states have internal predecessors, (106), 0 states have call successors, (0), 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-23 06:32:39,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 106 transitions. [2022-07-23 06:32:39,754 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 106 transitions. Word has length 33 [2022-07-23 06:32:39,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:32:39,755 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 106 transitions. [2022-07-23 06:32:39,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.85) internal successors, (57), 21 states have internal predecessors, (57), 0 states have call successors, (0), 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-23 06:32:39,755 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 106 transitions. [2022-07-23 06:32:39,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-23 06:32:39,755 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:32:39,755 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, 1, 1, 1] [2022-07-23 06:32:39,777 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-23 06:32:39,971 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,SelfDestructingSolverStorable24 [2022-07-23 06:32:39,971 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-23 06:32:39,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:32:39,972 INFO L85 PathProgramCache]: Analyzing trace with hash 396633763, now seen corresponding path program 1 times [2022-07-23 06:32:39,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:32:39,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886988968] [2022-07-23 06:32:39,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:32:39,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:32:40,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:32:40,500 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:32:40,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:32:40,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886988968] [2022-07-23 06:32:40,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886988968] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:32:40,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1514486729] [2022-07-23 06:32:40,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:32:40,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:32:40,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:32:40,502 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-23 06:32:40,503 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-23 06:32:40,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:32:40,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 49 conjunts are in the unsatisfiable core [2022-07-23 06:32:40,630 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:32:40,649 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:32:40,712 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:32:40,712 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-23 06:32:40,760 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-23 06:32:40,802 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 19 treesize of output 18 [2022-07-23 06:32:40,840 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:32:40,841 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-07-23 06:32:41,083 INFO L356 Elim1Store]: treesize reduction 6, result has 83.8 percent of original size [2022-07-23 06:32:41,083 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 5 case distinctions, treesize of input 46 treesize of output 48 [2022-07-23 06:32:41,164 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-07-23 06:32:41,184 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:32:41,184 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:32:41,265 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 27 treesize of output 19 [2022-07-23 06:32:41,435 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1671 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1671))) (let ((.cse1 (select (select .cse0 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select (select .cse0 .cse1) 4) 0)) (not (= .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))))) is different from false [2022-07-23 06:32:41,448 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1671 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_ArrVal_1669 Int)) (let ((.cse1 (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_1669)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1671))) (let ((.cse0 (select (select .cse1 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse0)) (not (= (select (select .cse1 .cse0) 4) 0)))))) is different from false [2022-07-23 06:32:41,463 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-07-23 06:32:41,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 1 new quantified variables, introduced 2 case distinctions, treesize of input 75 treesize of output 50 [2022-07-23 06:32:41,496 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:32:41,496 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 121 treesize of output 168 [2022-07-23 06:32:41,508 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:32:41,508 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 123 treesize of output 117 [2022-07-23 06:32:42,166 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-23 06:32:42,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1514486729] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:32:42,166 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:32:42,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17, 16] total 50 [2022-07-23 06:32:42,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961443307] [2022-07-23 06:32:42,166 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:32:42,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-07-23 06:32:42,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:32:42,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-07-23 06:32:42,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=2115, Unknown=2, NotChecked=186, Total=2450 [2022-07-23 06:32:42,168 INFO L87 Difference]: Start difference. First operand 97 states and 106 transitions. Second operand has 50 states, 50 states have (on average 1.84) internal successors, (92), 50 states have internal predecessors, (92), 0 states have call successors, (0), 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-23 06:32:42,454 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse2 (not .cse5)) (.cse0 (select |c_#valid| 0)) (.cse1 (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 (= .cse0 0) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= .cse1 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse2 (not (= 0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (or .cse2 (= .cse0 1)) (forall ((v_ArrVal_1671 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_ArrVal_1669 Int)) (let ((.cse4 (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_1669)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1671))) (let ((.cse3 (select (select .cse4 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse3)) (not (= (select (select .cse4 .cse3) 4) 0)))))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 0)) (or .cse5 (not (= .cse1 0))) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)))) is different from false [2022-07-23 06:32:42,458 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse1 (not .cse5)) (.cse0 (select |c_#valid| 0)) (.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (and (= .cse0 0) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) .cse1 (forall ((v_ArrVal_1671 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1671))) (let ((.cse3 (select (select .cse2 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select (select .cse2 .cse3) 4) 0)) (not (= .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))))) (not (= 0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (or .cse1 (= .cse0 1)) (= (select .cse4 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 0)) (or .cse5 (not (= (select .cse4 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) 0)))))) is different from false [2022-07-23 06:32:42,460 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse0 (not .cse4)) (.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) .cse0 (forall ((v_ArrVal_1671 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1671))) (let ((.cse2 (select (select .cse1 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select (select .cse1 .cse2) 4) 0)) (not (= .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))))) (not (= 0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (or .cse0 (= (select |c_#valid| 0) 1)) (= (select .cse3 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 0)) (or .cse4 (not (= (select .cse3 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) 0)))))) is different from false [2022-07-23 06:32:43,407 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse1 (not .cse4)) (.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) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse1 (not (= 0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (or .cse1 (= (select |c_#valid| 0) 1)) (forall ((v_ArrVal_1671 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_ArrVal_1669 Int)) (let ((.cse3 (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_1669)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1671))) (let ((.cse2 (select (select .cse3 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse2)) (not (= (select (select .cse3 .cse2) 4) 0)))))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 0)) (or .cse4 (not (= .cse0 0)))))) is different from false [2022-07-23 06:32:43,425 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse0 (not .cse4)) (.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) .cse0 (forall ((v_ArrVal_1671 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1671))) (let ((.cse2 (select (select .cse1 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select (select .cse1 .cse2) 4) 0)) (not (= .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))))) (not (= 0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (or .cse0 (= (select |c_#valid| 0) 1)) (= (select .cse3 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 0)) (or .cse4 (not (= (select .cse3 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) 0)))))) is different from false [2022-07-23 06:32:43,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:32:43,666 INFO L93 Difference]: Finished difference Result 125 states and 135 transitions. [2022-07-23 06:32:43,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-07-23 06:32:43,667 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 1.84) internal successors, (92), 50 states have internal predecessors, (92), 0 states have call successors, (0), 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-23 06:32:43,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:32:43,668 INFO L225 Difference]: With dead ends: 125 [2022-07-23 06:32:43,668 INFO L226 Difference]: Without dead ends: 123 [2022-07-23 06:32:43,669 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 889 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=444, Invalid=3999, Unknown=7, NotChecked=952, Total=5402 [2022-07-23 06:32:43,670 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 353 mSDsluCounter, 909 mSDsCounter, 0 mSdLazyCounter, 1172 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 951 SdHoareTripleChecker+Invalid, 1583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 369 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-23 06:32:43,670 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 951 Invalid, 1583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1172 Invalid, 0 Unknown, 369 Unchecked, 0.5s Time] [2022-07-23 06:32:43,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-07-23 06:32:43,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 97. [2022-07-23 06:32:43,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 86 states have (on average 1.2209302325581395) internal successors, (105), 96 states have internal predecessors, (105), 0 states have call successors, (0), 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-23 06:32:43,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2022-07-23 06:32:43,674 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 34 [2022-07-23 06:32:43,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:32:43,675 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2022-07-23 06:32:43,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 1.84) internal successors, (92), 50 states have internal predecessors, (92), 0 states have call successors, (0), 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-23 06:32:43,675 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2022-07-23 06:32:43,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-23 06:32:43,676 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:32:43,676 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:32:43,699 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-23 06:32:43,891 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,SelfDestructingSolverStorable25 [2022-07-23 06:32:43,892 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-23 06:32:43,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:32:43,892 INFO L85 PathProgramCache]: Analyzing trace with hash -601364006, now seen corresponding path program 1 times [2022-07-23 06:32:43,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:32:43,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451972938] [2022-07-23 06:32:43,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:32:43,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:32:43,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:32:44,139 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:32:44,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:32:44,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451972938] [2022-07-23 06:32:44,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451972938] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:32:44,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1860339392] [2022-07-23 06:32:44,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:32:44,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:32:44,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:32:44,144 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-23 06:32:44,145 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-23 06:32:44,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:32:44,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 56 conjunts are in the unsatisfiable core [2022-07-23 06:32:44,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:32:44,316 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-23 06:32:44,374 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:32:44,375 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-23 06:32:44,405 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-23 06:32:44,441 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-23 06:32:44,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, 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-23 06:32:44,464 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:32:44,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 32 treesize of output 33 [2022-07-23 06:32:44,644 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 47 treesize of output 35 [2022-07-23 06:32:44,741 INFO L356 Elim1Store]: treesize reduction 3, result has 78.6 percent of original size [2022-07-23 06:32:44,742 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 25 [2022-07-23 06:32:44,764 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:32:44,765 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:32:44,864 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 28 treesize of output 20 [2022-07-23 06:32:44,976 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1785 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1785))) (let ((.cse0 (select (select .cse1 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (<= (+ (select (select .cse1 .cse0) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) 1) |c_#StackHeapBarrier|))))) is different from false [2022-07-23 06:32:44,990 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1785 (Array Int Int)) (v_ArrVal_1784 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse1 (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_1784)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1785))) (let ((.cse0 (select (select .cse1 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (<= (+ (select (select .cse1 .cse0) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) 1) |c_#StackHeapBarrier|))))) is different from false [2022-07-23 06:32:45,005 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-07-23 06:32:45,005 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 78 treesize of output 53 [2022-07-23 06:32:45,048 INFO L356 Elim1Store]: treesize reduction 23, result has 67.1 percent of original size [2022-07-23 06:32:45,049 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 122 treesize of output 136 [2022-07-23 06:32:45,057 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:32:45,057 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 107 treesize of output 99 [2022-07-23 06:32:45,455 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-23 06:32:45,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1860339392] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:32:45,455 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:32:45,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 15] total 40 [2022-07-23 06:32:45,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568234915] [2022-07-23 06:32:45,455 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:32:45,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-07-23 06:32:45,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:32:45,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-07-23 06:32:45,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1368, Unknown=2, NotChecked=150, Total=1640 [2022-07-23 06:32:45,457 INFO L87 Difference]: Start difference. First operand 97 states and 105 transitions. Second operand has 41 states, 40 states have (on average 2.175) internal successors, (87), 41 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-23 06:32:45,578 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) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= .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|)) (<= (+ 1 |c_ULTIMATE.start_dll_create_~head~0#1.base|) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_dll_create_~head~0#1.base| |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (forall ((v_ArrVal_1785 (Array Int Int)) (v_ArrVal_1784 Int) (|ULTIMATE.start_main_~#s~0#1.base| 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_1784)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1785))) (let ((.cse1 (select (select .cse2 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (<= (+ (select (select .cse2 .cse1) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) 1) |c_#StackHeapBarrier|))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (<= (+ .cse0 1) |c_#StackHeapBarrier|))) is different from false [2022-07-23 06:32:45,580 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) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (forall ((v_ArrVal_1785 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1785))) (let ((.cse1 (select (select .cse2 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (<= (+ (select (select .cse2 .cse1) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) 1) |c_#StackHeapBarrier|))))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (< |c_ULTIMATE.start_dll_create_~head~0#1.base| |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (<= (+ .cse0 1) |c_#StackHeapBarrier|))) is different from false [2022-07-23 06:32:45,582 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) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (forall ((v_ArrVal_1785 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1785))) (let ((.cse1 (select (select .cse2 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (<= (+ (select (select .cse2 .cse1) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) 1) |c_#StackHeapBarrier|))))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (< |c_ULTIMATE.start_dll_create_~head~0#1.base| |c_#StackHeapBarrier|) (<= (+ .cse0 1) |c_#StackHeapBarrier|))) is different from false [2022-07-23 06:32:46,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:32:46,422 INFO L93 Difference]: Finished difference Result 167 states and 178 transitions. [2022-07-23 06:32:46,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-23 06:32:46,422 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 2.175) internal successors, (87), 41 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 35 [2022-07-23 06:32:46,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:32:46,423 INFO L225 Difference]: With dead ends: 167 [2022-07-23 06:32:46,423 INFO L226 Difference]: Without dead ends: 167 [2022-07-23 06:32:46,423 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 450 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=315, Invalid=2456, Unknown=5, NotChecked=530, Total=3306 [2022-07-23 06:32:46,424 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 360 mSDsluCounter, 825 mSDsCounter, 0 mSdLazyCounter, 771 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 884 SdHoareTripleChecker+Invalid, 1297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 515 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-23 06:32:46,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 884 Invalid, 1297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 771 Invalid, 0 Unknown, 515 Unchecked, 0.3s Time] [2022-07-23 06:32:46,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-07-23 06:32:46,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 98. [2022-07-23 06:32:46,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 87 states have (on average 1.2183908045977012) internal successors, (106), 97 states have internal predecessors, (106), 0 states have call successors, (0), 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-23 06:32:46,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 106 transitions. [2022-07-23 06:32:46,427 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 106 transitions. Word has length 35 [2022-07-23 06:32:46,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:32:46,427 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 106 transitions. [2022-07-23 06:32:46,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 2.175) internal successors, (87), 41 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-23 06:32:46,428 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 106 transitions. [2022-07-23 06:32:46,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-23 06:32:46,428 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:32:46,428 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-23 06:32:46,451 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-07-23 06:32:46,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:32:46,647 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-23 06:32:46,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:32:46,648 INFO L85 PathProgramCache]: Analyzing trace with hash -601311418, now seen corresponding path program 2 times [2022-07-23 06:32:46,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:32:46,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497459735] [2022-07-23 06:32:46,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:32:46,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:32:46,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:32:47,166 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:32:47,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:32:47,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497459735] [2022-07-23 06:32:47,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497459735] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:32:47,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1289358164] [2022-07-23 06:32:47,166 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 06:32:47,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:32:47,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:32:47,172 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-23 06:32:47,173 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-23 06:32:47,358 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-23 06:32:47,359 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 06:32:47,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 100 conjunts are in the unsatisfiable core [2022-07-23 06:32:47,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:32:47,397 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-23 06:32:47,449 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-23 06:32:47,454 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-23 06:32:47,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:32:47,499 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-23 06:32:47,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:32:47,507 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-23 06:32:47,559 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:32:47,560 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-23 06:32:47,615 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-23 06:32:47,620 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-23 06:32:47,627 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-23 06:32:47,632 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-23 06:32:47,676 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-23 06:32:47,677 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 32 [2022-07-23 06:32:47,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:32:47,685 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 30 treesize of output 32 [2022-07-23 06:32:47,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:32:47,720 INFO L356 Elim1Store]: treesize reduction 61, result has 12.9 percent of original size [2022-07-23 06:32:47,721 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 2 case distinctions, treesize of input 99 treesize of output 68 [2022-07-23 06:32:47,730 INFO L356 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2022-07-23 06:32:47,731 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 75 treesize of output 62 [2022-07-23 06:32:48,360 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:32:48,360 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:32:50,865 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1904 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse5 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8))) (let ((.cse1 (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|) .cse5 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (.cse4 (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|) .cse5 v_ArrVal_1904)))) (let ((.cse0 (select (select .cse4 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select .cse1 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse0)) (= (let ((.cse3 (+ 4 .cse0))) (select (select .cse1 (select (select .cse1 .cse2) .cse3)) (+ (select (select .cse4 .cse2) .cse3) 4))) 0) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse2))))))) (forall ((v_ArrVal_1904 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse11 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8))) (let ((.cse7 (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|) .cse11 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (.cse6 (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|) .cse11 v_ArrVal_1904)))) (let ((.cse10 (select (select .cse6 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse8 (select (select .cse7 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (let ((.cse9 (+ 4 .cse10))) (select (select .cse6 (select (select .cse7 .cse8) .cse9)) (+ (select (select .cse6 .cse8) .cse9) 4))) 0) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse10)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse8)))))))) is different from false [2022-07-23 06:32:52,920 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1904 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_ArrVal_1898 Int) (v_ArrVal_1900 Int)) (let ((.cse6 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8)) (.cse7 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (let ((.cse2 (let ((.cse8 (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|) .cse7 v_ArrVal_1898)))) (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse6 v_ArrVal_1904)))) (.cse3 (let ((.cse5 (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|) .cse7 v_ArrVal_1900)))) (store .cse5 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse5 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse6 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))) (let ((.cse0 (select (select .cse3 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select .cse2 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse0)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse1)) (= (let ((.cse4 (+ .cse1 4))) (select (select .cse2 (select (select .cse3 .cse0) .cse4)) (+ (select (select .cse2 .cse0) .cse4) 4))) 0)))))) (forall ((v_ArrVal_1904 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_ArrVal_1898 Int) (v_ArrVal_1900 Int)) (let ((.cse15 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8)) (.cse16 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (let ((.cse12 (let ((.cse17 (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|) .cse16 v_ArrVal_1898)))) (store .cse17 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse17 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse15 v_ArrVal_1904)))) (.cse9 (let ((.cse14 (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|) .cse16 v_ArrVal_1900)))) (store .cse14 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse14 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse15 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))) (let ((.cse10 (select (select .cse9 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse13 (select (select .cse12 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (let ((.cse11 (+ .cse13 4))) (select (select .cse9 (select (select .cse9 .cse10) .cse11)) (+ (select (select .cse12 .cse10) .cse11) 4))) 0) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse10)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse13)))))))) is different from false [2022-07-23 06:32:54,948 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_dll_create_~new_head~0#1.offset| Int) (v_ArrVal_1904 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_ArrVal_1898 Int) (v_ArrVal_1900 Int)) (let ((.cse6 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8)) (.cse7 (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) (.cse8 (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 8))) (let ((.cse4 (let ((.cse9 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.offset|) .cse8 v_ArrVal_1898)))) (store .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse6 v_ArrVal_1904)))) (.cse2 (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse8 v_ArrVal_1900)))) (store .cse5 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse5 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse6 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))) (let ((.cse0 (select (select .cse2 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select .cse4 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= .cse1 |ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= (let ((.cse3 (+ .cse1 4))) (select (select .cse2 (select (select .cse2 .cse0) .cse3)) (+ 4 (select (select .cse4 .cse0) .cse3)))) 0)))))) (forall ((|ULTIMATE.start_dll_create_~new_head~0#1.offset| Int) (v_ArrVal_1904 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_ArrVal_1898 Int) (v_ArrVal_1900 Int)) (let ((.cse16 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8)) (.cse17 (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) (.cse18 (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 8))) (let ((.cse11 (let ((.cse19 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse17 |c_ULTIMATE.start_dll_create_~head~0#1.offset|) .cse18 v_ArrVal_1898)))) (store .cse19 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse19 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse16 v_ArrVal_1904)))) (.cse12 (let ((.cse15 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse17 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse18 v_ArrVal_1900)))) (store .cse15 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse15 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse16 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))) (let ((.cse10 (select (select .cse12 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse14 (select (select .cse11 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse10 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= (let ((.cse13 (+ .cse14 4))) (select (select .cse11 (select (select .cse12 .cse10) .cse13)) (+ 4 (select (select .cse11 .cse10) .cse13)))) 0) (not (= .cse14 |ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))))) is different from false [2022-07-23 06:32:54,976 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:32:54,985 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:32:54,985 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 334 treesize of output 270 [2022-07-23 06:32:54,992 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:32:55,000 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:32:55,000 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 674 treesize of output 230 [2022-07-23 06:32:55,018 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:32:55,028 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:32:55,028 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 334 treesize of output 250 [2022-07-23 06:32:55,033 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:32:55,041 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:32:55,042 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 574 treesize of output 230 [2022-07-23 06:32:55,064 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_arrayElimArr_11 (Array Int Int)) (v_ArrVal_1904 Int) (v_arrayElimArr_12 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse5 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8))) (let ((.cse2 (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_11))) (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse5 v_ArrVal_1904)))) (.cse3 (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_12))) (store .cse4 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse4 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse5 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))) (let ((.cse0 (select (select .cse3 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (+ (select (select .cse2 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (or (not (= .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| (select v_arrayElimArr_11 .cse1))) (= (select (select .cse2 (select (select .cse3 .cse0) .cse1)) (+ (select (select .cse2 .cse0) .cse1) 4)) 0) (not (= (select v_arrayElimArr_12 .cse1) |c_ULTIMATE.start_dll_create_~head~0#1.base|))))))) (forall ((v_arrayElimArr_10 (Array Int Int)) (v_ArrVal_1904 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_arrayElimArr_9 (Array Int Int))) (let ((.cse12 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8))) (let ((.cse10 (let ((.cse13 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_9))) (store .cse13 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse13 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse12 v_ArrVal_1904)))) (.cse9 (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_10))) (store .cse11 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse11 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse12 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))) (let ((.cse7 (select (select .cse9 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse8 (+ (select (select .cse10 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse7)) (not (= (select v_arrayElimArr_10 .cse8) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= (select (select .cse9 (select (select .cse9 .cse7) .cse8)) (+ (select (select .cse10 .cse7) .cse8) 4)) 0) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| (select v_arrayElimArr_9 .cse8))))))))) is different from false [2022-07-23 06:32:58,484 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:32:58,493 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:32:58,493 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 476 treesize of output 316 [2022-07-23 06:32:58,499 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:32:58,506 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:32:58,506 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 294 treesize of output 194 [2022-07-23 06:32:58,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:32:58,760 INFO L356 Elim1Store]: treesize reduction 231, result has 60.6 percent of original size [2022-07-23 06:32:58,761 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 29820 treesize of output 26721 [2022-07-23 06:32:59,110 INFO L356 Elim1Store]: treesize reduction 63, result has 62.0 percent of original size [2022-07-23 06:32:59,112 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 678749 treesize of output 618432 [2022-07-23 06:33:03,468 INFO L356 Elim1Store]: treesize reduction 75, result has 59.5 percent of original size [2022-07-23 06:33:03,471 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 743471 treesize of output 695716 [2022-07-23 06:33:38,931 WARN L233 SmtUtils]: Spent 35.45s on a formula simplification. DAG size of input: 1904 DAG size of output: 1893 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-23 06:33:42,758 INFO L356 Elim1Store]: treesize reduction 57, result has 94.5 percent of original size [2022-07-23 06:33:42,760 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 18 new quantified variables, introduced 66 case distinctions, treesize of input 699215 treesize of output 688683 [2022-07-23 06:33:49,230 WARN L233 SmtUtils]: Spent 6.47s on a formula simplification. DAG size of input: 2327 DAG size of output: 2321 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)