./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/heap-manipulation/dll_of_dll-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 35987657 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/heap-manipulation/dll_of_dll-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-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-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0eca46c14885d62179341dcc13b398752af03e020a80dcf533f4c9afc7372707 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 16:41:35,052 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 16:41:35,054 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 16:41:35,103 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 16:41:35,103 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 16:41:35,104 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 16:41:35,108 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 16:41:35,111 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 16:41:35,113 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 16:41:35,118 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 16:41:35,119 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 16:41:35,121 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 16:41:35,121 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 16:41:35,123 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 16:41:35,124 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 16:41:35,129 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 16:41:35,130 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 16:41:35,132 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 16:41:35,134 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 16:41:35,139 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 16:41:35,140 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 16:41:35,142 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 16:41:35,144 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 16:41:35,145 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 16:41:35,146 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 16:41:35,151 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 16:41:35,152 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 16:41:35,152 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 16:41:35,153 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 16:41:35,154 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 16:41:35,155 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 16:41:35,155 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 16:41:35,157 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 16:41:35,157 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 16:41:35,159 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 16:41:35,160 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 16:41:35,160 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 16:41:35,161 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 16:41:35,161 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 16:41:35,161 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 16:41:35,162 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 16:41:35,163 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 16:41:35,168 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2022-07-21 16:41:35,203 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 16:41:35,204 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 16:41:35,204 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 16:41:35,205 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 16:41:35,205 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 16:41:35,206 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 16:41:35,206 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 16:41:35,207 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 16:41:35,207 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 16:41:35,208 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 16:41:35,208 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 16:41:35,208 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-21 16:41:35,208 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 16:41:35,209 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 16:41:35,209 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 16:41:35,209 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-21 16:41:35,209 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-21 16:41:35,209 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 16:41:35,210 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-21 16:41:35,210 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 16:41:35,210 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 16:41:35,210 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 16:41:35,210 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 16:41:35,211 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 16:41:35,211 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 16:41:35,211 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 16:41:35,211 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 16:41:35,212 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 16:41:35,212 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 16:41:35,212 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-memcleanup) ) 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 -> 0eca46c14885d62179341dcc13b398752af03e020a80dcf533f4c9afc7372707 [2022-07-21 16:41:35,525 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 16:41:35,544 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 16:41:35,547 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 16:41:35,548 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 16:41:35,548 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 16:41:35,550 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/dll_of_dll-2.i [2022-07-21 16:41:35,614 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47602718f/7160a07a07044b9ca85f148c52b688b5/FLAG68bfb7a1a [2022-07-21 16:41:36,106 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 16:41:36,106 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/dll_of_dll-2.i [2022-07-21 16:41:36,132 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47602718f/7160a07a07044b9ca85f148c52b688b5/FLAG68bfb7a1a [2022-07-21 16:41:36,445 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47602718f/7160a07a07044b9ca85f148c52b688b5 [2022-07-21 16:41:36,447 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 16:41:36,448 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 16:41:36,450 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 16:41:36,450 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 16:41:36,453 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 16:41:36,454 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 04:41:36" (1/1) ... [2022-07-21 16:41:36,455 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5909ed40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:41:36, skipping insertion in model container [2022-07-21 16:41:36,455 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 04:41:36" (1/1) ... [2022-07-21 16:41:36,463 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 16:41:36,504 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 16:41:36,761 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/heap-manipulation/dll_of_dll-2.i[22634,22647] [2022-07-21 16:41:36,833 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 16:41:36,843 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 16:41:36,878 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/heap-manipulation/dll_of_dll-2.i[22634,22647] [2022-07-21 16:41:36,908 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 16:41:36,940 INFO L208 MainTranslator]: Completed translation [2022-07-21 16:41:36,940 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:41:36 WrapperNode [2022-07-21 16:41:36,940 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 16:41:36,942 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 16:41:36,942 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 16:41:36,943 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 16:41:36,950 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:41:36" (1/1) ... [2022-07-21 16:41:36,975 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:41:36" (1/1) ... [2022-07-21 16:41:37,004 INFO L137 Inliner]: procedures = 140, calls = 94, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 234 [2022-07-21 16:41:37,007 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 16:41:37,008 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 16:41:37,009 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 16:41:37,009 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 16:41:37,016 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:41:36" (1/1) ... [2022-07-21 16:41:37,017 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:41:36" (1/1) ... [2022-07-21 16:41:37,036 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:41:36" (1/1) ... [2022-07-21 16:41:37,036 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:41:36" (1/1) ... [2022-07-21 16:41:37,048 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:41:36" (1/1) ... [2022-07-21 16:41:37,069 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:41:36" (1/1) ... [2022-07-21 16:41:37,074 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:41:36" (1/1) ... [2022-07-21 16:41:37,083 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 16:41:37,092 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 16:41:37,093 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 16:41:37,093 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 16:41:37,094 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:41:36" (1/1) ... [2022-07-21 16:41:37,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 16:41:37,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:41:37,126 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-21 16:41:37,139 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-21 16:41:37,165 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2022-07-21 16:41:37,166 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2022-07-21 16:41:37,166 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_base [2022-07-21 16:41:37,166 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_base [2022-07-21 16:41:37,167 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-21 16:41:37,167 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 16:41:37,167 INFO L130 BoogieDeclarations]: Found specification of procedure dll_insert_master [2022-07-21 16:41:37,167 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_insert_master [2022-07-21 16:41:37,167 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-21 16:41:37,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-21 16:41:37,175 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-07-21 16:41:37,175 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-07-21 16:41:37,176 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-21 16:41:37,176 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 16:41:37,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-21 16:41:37,176 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create_generic [2022-07-21 16:41:37,176 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create_generic [2022-07-21 16:41:37,177 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create_slave [2022-07-21 16:41:37,177 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create_slave [2022-07-21 16:41:37,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 16:41:37,177 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 16:41:37,177 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 16:41:37,359 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 16:41:37,361 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 16:41:38,016 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 16:41:38,025 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 16:41:38,026 INFO L299 CfgBuilder]: Removed 38 assume(true) statements. [2022-07-21 16:41:38,028 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 04:41:38 BoogieIcfgContainer [2022-07-21 16:41:38,028 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 16:41:38,030 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 16:41:38,030 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 16:41:38,032 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 16:41:38,033 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 04:41:36" (1/3) ... [2022-07-21 16:41:38,033 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29c891ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 04:41:38, skipping insertion in model container [2022-07-21 16:41:38,034 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:41:36" (2/3) ... [2022-07-21 16:41:38,034 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29c891ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 04:41:38, skipping insertion in model container [2022-07-21 16:41:38,034 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 04:41:38" (3/3) ... [2022-07-21 16:41:38,035 INFO L111 eAbstractionObserver]: Analyzing ICFG dll_of_dll-2.i [2022-07-21 16:41:38,048 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 16:41:38,049 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 98 error locations. [2022-07-21 16:41:38,101 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 16:41:38,108 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@56fa05e2, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@cfe338f [2022-07-21 16:41:38,108 INFO L358 AbstractCegarLoop]: Starting to check reachability of 98 error locations. [2022-07-21 16:41:38,112 INFO L276 IsEmpty]: Start isEmpty. Operand has 271 states, 142 states have (on average 2.1619718309859155) internal successors, (307), 259 states have internal predecessors, (307), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-07-21 16:41:38,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-21 16:41:38,119 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:41:38,120 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:41:38,122 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ##fun~$Pointer$~TO~VOIDErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-07-21 16:41:38,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:41:38,129 INFO L85 PathProgramCache]: Analyzing trace with hash -853608627, now seen corresponding path program 1 times [2022-07-21 16:41:38,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:41:38,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787935297] [2022-07-21 16:41:38,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:41:38,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:41:38,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:41:38,329 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-21 16:41:38,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:41:38,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787935297] [2022-07-21 16:41:38,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787935297] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:41:38,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:41:38,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 16:41:38,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171941953] [2022-07-21 16:41:38,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:41:38,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-21 16:41:38,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:41:38,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-21 16:41:38,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-21 16:41:38,372 INFO L87 Difference]: Start difference. First operand has 271 states, 142 states have (on average 2.1619718309859155) internal successors, (307), 259 states have internal predecessors, (307), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:41:38,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:41:38,428 INFO L93 Difference]: Finished difference Result 269 states and 299 transitions. [2022-07-21 16:41:38,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-21 16:41:38,430 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-07-21 16:41:38,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:41:38,449 INFO L225 Difference]: With dead ends: 269 [2022-07-21 16:41:38,450 INFO L226 Difference]: Without dead ends: 267 [2022-07-21 16:41:38,451 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-21 16:41:38,456 INFO L413 NwaCegarLoop]: 299 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 16:41:38,457 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 16:41:38,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2022-07-21 16:41:38,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2022-07-21 16:41:38,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 140 states have (on average 1.8785714285714286) internal successors, (263), 255 states have internal predecessors, (263), 24 states have call successors, (24), 6 states have call predecessors, (24), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-21 16:41:38,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 297 transitions. [2022-07-21 16:41:38,532 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 297 transitions. Word has length 9 [2022-07-21 16:41:38,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:41:38,533 INFO L495 AbstractCegarLoop]: Abstraction has 267 states and 297 transitions. [2022-07-21 16:41:38,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:41:38,534 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 297 transitions. [2022-07-21 16:41:38,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-21 16:41:38,534 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:41:38,535 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:41:38,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 16:41:38,535 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ##fun~$Pointer$~TO~VOIDErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-07-21 16:41:38,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:41:38,536 INFO L85 PathProgramCache]: Analyzing trace with hash -853608565, now seen corresponding path program 1 times [2022-07-21 16:41:38,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:41:38,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183576986] [2022-07-21 16:41:38,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:41:38,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:41:38,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:41:38,611 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-21 16:41:38,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:41:38,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183576986] [2022-07-21 16:41:38,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183576986] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:41:38,613 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:41:38,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 16:41:38,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711849231] [2022-07-21 16:41:38,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:41:38,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 16:41:38,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:41:38,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 16:41:38,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 16:41:38,622 INFO L87 Difference]: Start difference. First operand 267 states and 297 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:41:38,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:41:38,832 INFO L93 Difference]: Finished difference Result 267 states and 299 transitions. [2022-07-21 16:41:38,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 16:41:38,833 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-07-21 16:41:38,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:41:38,835 INFO L225 Difference]: With dead ends: 267 [2022-07-21 16:41:38,835 INFO L226 Difference]: Without dead ends: 267 [2022-07-21 16:41:38,835 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-21 16:41:38,836 INFO L413 NwaCegarLoop]: 282 mSDtfsCounter, 23 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 16:41:38,837 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 463 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 16:41:38,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2022-07-21 16:41:38,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 265. [2022-07-21 16:41:38,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 140 states have (on average 1.8642857142857143) internal successors, (261), 253 states have internal predecessors, (261), 24 states have call successors, (24), 6 states have call predecessors, (24), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-21 16:41:38,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 295 transitions. [2022-07-21 16:41:38,856 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 295 transitions. Word has length 9 [2022-07-21 16:41:38,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:41:38,856 INFO L495 AbstractCegarLoop]: Abstraction has 265 states and 295 transitions. [2022-07-21 16:41:38,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:41:38,857 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 295 transitions. [2022-07-21 16:41:38,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-21 16:41:38,857 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:41:38,857 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:41:38,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-21 16:41:38,858 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ##fun~$Pointer$~TO~VOIDErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-07-21 16:41:38,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:41:38,859 INFO L85 PathProgramCache]: Analyzing trace with hash -853608564, now seen corresponding path program 1 times [2022-07-21 16:41:38,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:41:38,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615255376] [2022-07-21 16:41:38,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:41:38,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:41:38,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:41:38,959 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-21 16:41:38,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:41:38,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615255376] [2022-07-21 16:41:38,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615255376] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:41:38,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:41:38,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 16:41:38,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562721526] [2022-07-21 16:41:38,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:41:38,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 16:41:38,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:41:38,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 16:41:38,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 16:41:38,963 INFO L87 Difference]: Start difference. First operand 265 states and 295 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:41:39,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:41:39,042 INFO L93 Difference]: Finished difference Result 291 states and 329 transitions. [2022-07-21 16:41:39,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 16:41:39,042 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-07-21 16:41:39,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:41:39,051 INFO L225 Difference]: With dead ends: 291 [2022-07-21 16:41:39,052 INFO L226 Difference]: Without dead ends: 291 [2022-07-21 16:41:39,052 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-21 16:41:39,053 INFO L413 NwaCegarLoop]: 313 mSDtfsCounter, 19 mSDsluCounter, 892 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 1205 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 16:41:39,054 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 1205 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 16:41:39,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2022-07-21 16:41:39,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 283. [2022-07-21 16:41:39,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 151 states have (on average 1.8278145695364238) internal successors, (276), 264 states have internal predecessors, (276), 29 states have call successors, (29), 8 states have call predecessors, (29), 7 states have return successors, (18), 13 states have call predecessors, (18), 15 states have call successors, (18) [2022-07-21 16:41:39,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 323 transitions. [2022-07-21 16:41:39,069 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 323 transitions. Word has length 9 [2022-07-21 16:41:39,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:41:39,071 INFO L495 AbstractCegarLoop]: Abstraction has 283 states and 323 transitions. [2022-07-21 16:41:39,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:41:39,071 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 323 transitions. [2022-07-21 16:41:39,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-21 16:41:39,072 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:41:39,072 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:41:39,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-21 16:41:39,073 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-07-21 16:41:39,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:41:39,076 INFO L85 PathProgramCache]: Analyzing trace with hash 33414869, now seen corresponding path program 1 times [2022-07-21 16:41:39,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:41:39,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760728949] [2022-07-21 16:41:39,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:41:39,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:41:39,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:41:39,130 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-21 16:41:39,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:41:39,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760728949] [2022-07-21 16:41:39,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760728949] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:41:39,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:41:39,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 16:41:39,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431795514] [2022-07-21 16:41:39,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:41:39,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 16:41:39,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:41:39,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 16:41:39,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 16:41:39,133 INFO L87 Difference]: Start difference. First operand 283 states and 323 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:41:39,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:41:39,244 INFO L93 Difference]: Finished difference Result 280 states and 320 transitions. [2022-07-21 16:41:39,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 16:41:39,245 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-21 16:41:39,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:41:39,247 INFO L225 Difference]: With dead ends: 280 [2022-07-21 16:41:39,247 INFO L226 Difference]: Without dead ends: 280 [2022-07-21 16:41:39,247 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-21 16:41:39,249 INFO L413 NwaCegarLoop]: 278 mSDtfsCounter, 20 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 16:41:39,249 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 460 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 16:41:39,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2022-07-21 16:41:39,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 280. [2022-07-21 16:41:39,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 151 states have (on average 1.8079470198675496) internal successors, (273), 261 states have internal predecessors, (273), 29 states have call successors, (29), 8 states have call predecessors, (29), 7 states have return successors, (18), 13 states have call predecessors, (18), 15 states have call successors, (18) [2022-07-21 16:41:39,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 320 transitions. [2022-07-21 16:41:39,260 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 320 transitions. Word has length 11 [2022-07-21 16:41:39,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:41:39,261 INFO L495 AbstractCegarLoop]: Abstraction has 280 states and 320 transitions. [2022-07-21 16:41:39,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:41:39,261 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 320 transitions. [2022-07-21 16:41:39,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-21 16:41:39,261 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:41:39,262 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:41:39,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-21 16:41:39,262 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-07-21 16:41:39,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:41:39,263 INFO L85 PathProgramCache]: Analyzing trace with hash 33414870, now seen corresponding path program 1 times [2022-07-21 16:41:39,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:41:39,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323329942] [2022-07-21 16:41:39,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:41:39,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:41:39,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:41:39,302 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-21 16:41:39,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:41:39,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323329942] [2022-07-21 16:41:39,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323329942] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:41:39,303 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:41:39,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 16:41:39,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825257937] [2022-07-21 16:41:39,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:41:39,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 16:41:39,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:41:39,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 16:41:39,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 16:41:39,306 INFO L87 Difference]: Start difference. First operand 280 states and 320 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:41:39,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:41:39,425 INFO L93 Difference]: Finished difference Result 277 states and 317 transitions. [2022-07-21 16:41:39,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 16:41:39,426 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-21 16:41:39,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:41:39,431 INFO L225 Difference]: With dead ends: 277 [2022-07-21 16:41:39,431 INFO L226 Difference]: Without dead ends: 277 [2022-07-21 16:41:39,432 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-21 16:41:39,439 INFO L413 NwaCegarLoop]: 278 mSDtfsCounter, 17 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 16:41:39,441 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 465 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 16:41:39,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2022-07-21 16:41:39,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 277. [2022-07-21 16:41:39,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 151 states have (on average 1.7880794701986755) internal successors, (270), 258 states have internal predecessors, (270), 29 states have call successors, (29), 8 states have call predecessors, (29), 7 states have return successors, (18), 13 states have call predecessors, (18), 15 states have call successors, (18) [2022-07-21 16:41:39,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 317 transitions. [2022-07-21 16:41:39,459 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 317 transitions. Word has length 11 [2022-07-21 16:41:39,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:41:39,459 INFO L495 AbstractCegarLoop]: Abstraction has 277 states and 317 transitions. [2022-07-21 16:41:39,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:41:39,460 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 317 transitions. [2022-07-21 16:41:39,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-21 16:41:39,460 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:41:39,461 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:41:39,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-21 16:41:39,461 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting dll_insert_masterErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-07-21 16:41:39,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:41:39,462 INFO L85 PathProgramCache]: Analyzing trace with hash -226556130, now seen corresponding path program 1 times [2022-07-21 16:41:39,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:41:39,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074811191] [2022-07-21 16:41:39,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:41:39,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:41:39,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:41:39,620 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-21 16:41:39,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:41:39,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074811191] [2022-07-21 16:41:39,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074811191] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:41:39,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:41:39,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 16:41:39,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557997355] [2022-07-21 16:41:39,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:41:39,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 16:41:39,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:41:39,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 16:41:39,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-21 16:41:39,624 INFO L87 Difference]: Start difference. First operand 277 states and 317 transitions. Second operand has 8 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:41:39,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:41:39,971 INFO L93 Difference]: Finished difference Result 300 states and 343 transitions. [2022-07-21 16:41:39,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 16:41:39,971 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-21 16:41:39,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:41:39,974 INFO L225 Difference]: With dead ends: 300 [2022-07-21 16:41:39,975 INFO L226 Difference]: Without dead ends: 300 [2022-07-21 16:41:39,975 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-07-21 16:41:39,978 INFO L413 NwaCegarLoop]: 266 mSDtfsCounter, 120 mSDsluCounter, 887 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 1153 SdHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 16:41:39,981 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 1153 Invalid, 562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-21 16:41:39,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2022-07-21 16:41:39,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 289. [2022-07-21 16:41:39,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 162 states have (on average 1.7469135802469136) internal successors, (283), 268 states have internal predecessors, (283), 30 states have call successors, (30), 10 states have call predecessors, (30), 7 states have return successors, (19), 13 states have call predecessors, (19), 16 states have call successors, (19) [2022-07-21 16:41:39,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 332 transitions. [2022-07-21 16:41:39,993 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 332 transitions. Word has length 16 [2022-07-21 16:41:39,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:41:39,994 INFO L495 AbstractCegarLoop]: Abstraction has 289 states and 332 transitions. [2022-07-21 16:41:39,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:41:39,995 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 332 transitions. [2022-07-21 16:41:39,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-21 16:41:39,996 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:41:39,996 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:41:39,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-21 16:41:39,996 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting dll_insert_masterErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-07-21 16:41:39,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:41:39,997 INFO L85 PathProgramCache]: Analyzing trace with hash -226556129, now seen corresponding path program 1 times [2022-07-21 16:41:39,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:41:39,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300774780] [2022-07-21 16:41:39,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:41:39,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:41:40,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:41:40,158 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-21 16:41:40,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:41:40,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300774780] [2022-07-21 16:41:40,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300774780] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:41:40,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:41:40,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 16:41:40,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128134743] [2022-07-21 16:41:40,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:41:40,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 16:41:40,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:41:40,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 16:41:40,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-21 16:41:40,161 INFO L87 Difference]: Start difference. First operand 289 states and 332 transitions. Second operand has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:41:40,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:41:40,649 INFO L93 Difference]: Finished difference Result 299 states and 342 transitions. [2022-07-21 16:41:40,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 16:41:40,649 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-21 16:41:40,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:41:40,651 INFO L225 Difference]: With dead ends: 299 [2022-07-21 16:41:40,651 INFO L226 Difference]: Without dead ends: 299 [2022-07-21 16:41:40,651 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-21 16:41:40,652 INFO L413 NwaCegarLoop]: 260 mSDtfsCounter, 80 mSDsluCounter, 756 mSDsCounter, 0 mSdLazyCounter, 697 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 1016 SdHoareTripleChecker+Invalid, 706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-21 16:41:40,652 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 1016 Invalid, 706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 697 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-21 16:41:40,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2022-07-21 16:41:40,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 289. [2022-07-21 16:41:40,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 162 states have (on average 1.7345679012345678) internal successors, (281), 268 states have internal predecessors, (281), 30 states have call successors, (30), 10 states have call predecessors, (30), 7 states have return successors, (19), 13 states have call predecessors, (19), 16 states have call successors, (19) [2022-07-21 16:41:40,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 330 transitions. [2022-07-21 16:41:40,660 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 330 transitions. Word has length 16 [2022-07-21 16:41:40,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:41:40,660 INFO L495 AbstractCegarLoop]: Abstraction has 289 states and 330 transitions. [2022-07-21 16:41:40,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:41:40,661 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 330 transitions. [2022-07-21 16:41:40,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-21 16:41:40,661 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:41:40,661 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:41:40,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-21 16:41:40,662 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting dll_insert_masterErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-07-21 16:41:40,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:41:40,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1322891007, now seen corresponding path program 1 times [2022-07-21 16:41:40,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:41:40,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042812331] [2022-07-21 16:41:40,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:41:40,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:41:40,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:41:40,719 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-21 16:41:40,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:41:40,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042812331] [2022-07-21 16:41:40,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042812331] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:41:40,720 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:41:40,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 16:41:40,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971305720] [2022-07-21 16:41:40,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:41:40,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 16:41:40,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:41:40,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 16:41:40,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 16:41:40,724 INFO L87 Difference]: Start difference. First operand 289 states and 330 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:41:40,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:41:40,904 INFO L93 Difference]: Finished difference Result 288 states and 329 transitions. [2022-07-21 16:41:40,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 16:41:40,905 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-21 16:41:40,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:41:40,907 INFO L225 Difference]: With dead ends: 288 [2022-07-21 16:41:40,907 INFO L226 Difference]: Without dead ends: 288 [2022-07-21 16:41:40,907 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-21 16:41:40,909 INFO L413 NwaCegarLoop]: 274 mSDtfsCounter, 40 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 813 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 16:41:40,910 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 813 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 16:41:40,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2022-07-21 16:41:40,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2022-07-21 16:41:40,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 162 states have (on average 1.728395061728395) internal successors, (280), 267 states have internal predecessors, (280), 30 states have call successors, (30), 10 states have call predecessors, (30), 7 states have return successors, (19), 13 states have call predecessors, (19), 16 states have call successors, (19) [2022-07-21 16:41:40,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 329 transitions. [2022-07-21 16:41:40,923 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 329 transitions. Word has length 18 [2022-07-21 16:41:40,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:41:40,924 INFO L495 AbstractCegarLoop]: Abstraction has 288 states and 329 transitions. [2022-07-21 16:41:40,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:41:40,924 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 329 transitions. [2022-07-21 16:41:40,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-21 16:41:40,925 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:41:40,925 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:41:40,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-21 16:41:40,926 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting dll_insert_masterErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-07-21 16:41:40,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:41:40,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1322891008, now seen corresponding path program 1 times [2022-07-21 16:41:40,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:41:40,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372027066] [2022-07-21 16:41:40,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:41:40,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:41:40,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:41:41,003 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-21 16:41:41,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:41:41,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372027066] [2022-07-21 16:41:41,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372027066] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:41:41,004 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:41:41,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 16:41:41,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763237846] [2022-07-21 16:41:41,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:41:41,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 16:41:41,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:41:41,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 16:41:41,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-21 16:41:41,007 INFO L87 Difference]: Start difference. First operand 288 states and 329 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:41:41,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:41:41,181 INFO L93 Difference]: Finished difference Result 287 states and 328 transitions. [2022-07-21 16:41:41,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 16:41:41,182 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-21 16:41:41,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:41:41,183 INFO L225 Difference]: With dead ends: 287 [2022-07-21 16:41:41,183 INFO L226 Difference]: Without dead ends: 287 [2022-07-21 16:41:41,184 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-21 16:41:41,184 INFO L413 NwaCegarLoop]: 276 mSDtfsCounter, 55 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 914 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 16:41:41,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 914 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 16:41:41,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2022-07-21 16:41:41,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2022-07-21 16:41:41,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 162 states have (on average 1.7222222222222223) internal successors, (279), 266 states have internal predecessors, (279), 30 states have call successors, (30), 10 states have call predecessors, (30), 7 states have return successors, (19), 13 states have call predecessors, (19), 16 states have call successors, (19) [2022-07-21 16:41:41,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 328 transitions. [2022-07-21 16:41:41,192 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 328 transitions. Word has length 18 [2022-07-21 16:41:41,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:41:41,192 INFO L495 AbstractCegarLoop]: Abstraction has 287 states and 328 transitions. [2022-07-21 16:41:41,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:41:41,192 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 328 transitions. [2022-07-21 16:41:41,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-21 16:41:41,193 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:41:41,193 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:41:41,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-21 16:41:41,194 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting dll_insert_masterErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-07-21 16:41:41,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:41:41,194 INFO L85 PathProgramCache]: Analyzing trace with hash -12061856, now seen corresponding path program 1 times [2022-07-21 16:41:41,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:41:41,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274688969] [2022-07-21 16:41:41,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:41:41,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:41:41,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:41:41,348 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-21 16:41:41,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:41:41,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274688969] [2022-07-21 16:41:41,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274688969] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:41:41,349 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:41:41,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-21 16:41:41,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528111060] [2022-07-21 16:41:41,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:41:41,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-21 16:41:41,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:41:41,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-21 16:41:41,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-21 16:41:41,351 INFO L87 Difference]: Start difference. First operand 287 states and 328 transitions. Second operand has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:41:41,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:41:41,751 INFO L93 Difference]: Finished difference Result 326 states and 372 transitions. [2022-07-21 16:41:41,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 16:41:41,752 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-21 16:41:41,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:41:41,754 INFO L225 Difference]: With dead ends: 326 [2022-07-21 16:41:41,754 INFO L226 Difference]: Without dead ends: 326 [2022-07-21 16:41:41,754 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-07-21 16:41:41,754 INFO L413 NwaCegarLoop]: 272 mSDtfsCounter, 45 mSDsluCounter, 1508 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 1780 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 16:41:41,755 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 1780 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-21 16:41:41,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2022-07-21 16:41:41,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 307. [2022-07-21 16:41:41,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 179 states have (on average 1.681564245810056) internal successors, (301), 283 states have internal predecessors, (301), 32 states have call successors, (32), 12 states have call predecessors, (32), 8 states have return successors, (23), 14 states have call predecessors, (23), 18 states have call successors, (23) [2022-07-21 16:41:41,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 356 transitions. [2022-07-21 16:41:41,762 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 356 transitions. Word has length 20 [2022-07-21 16:41:41,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:41:41,762 INFO L495 AbstractCegarLoop]: Abstraction has 307 states and 356 transitions. [2022-07-21 16:41:41,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:41:41,763 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 356 transitions. [2022-07-21 16:41:41,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-21 16:41:41,763 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:41:41,763 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:41:41,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-21 16:41:41,764 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ##fun~$Pointer$~TO~VOIDErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-07-21 16:41:41,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:41:41,764 INFO L85 PathProgramCache]: Analyzing trace with hash 551710607, now seen corresponding path program 1 times [2022-07-21 16:41:41,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:41:41,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832352099] [2022-07-21 16:41:41,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:41:41,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:41:41,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:41:41,814 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-21 16:41:41,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:41:41,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832352099] [2022-07-21 16:41:41,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832352099] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:41:41,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:41:41,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 16:41:41,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270883309] [2022-07-21 16:41:41,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:41:41,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 16:41:41,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:41:41,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 16:41:41,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 16:41:41,817 INFO L87 Difference]: Start difference. First operand 307 states and 356 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:41:41,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:41:41,918 INFO L93 Difference]: Finished difference Result 305 states and 354 transitions. [2022-07-21 16:41:41,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 16:41:41,918 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-07-21 16:41:41,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:41:41,920 INFO L225 Difference]: With dead ends: 305 [2022-07-21 16:41:41,920 INFO L226 Difference]: Without dead ends: 305 [2022-07-21 16:41:41,920 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-21 16:41:41,921 INFO L413 NwaCegarLoop]: 274 mSDtfsCounter, 21 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 16:41:41,921 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 458 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 16:41:41,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2022-07-21 16:41:41,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2022-07-21 16:41:41,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 179 states have (on average 1.670391061452514) internal successors, (299), 281 states have internal predecessors, (299), 32 states have call successors, (32), 12 states have call predecessors, (32), 8 states have return successors, (23), 14 states have call predecessors, (23), 18 states have call successors, (23) [2022-07-21 16:41:41,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 354 transitions. [2022-07-21 16:41:41,929 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 354 transitions. Word has length 27 [2022-07-21 16:41:41,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:41:41,930 INFO L495 AbstractCegarLoop]: Abstraction has 305 states and 354 transitions. [2022-07-21 16:41:41,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:41:41,930 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 354 transitions. [2022-07-21 16:41:41,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-21 16:41:41,931 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:41:41,931 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:41:41,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-21 16:41:41,931 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ##fun~$Pointer$~TO~VOIDErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-07-21 16:41:41,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:41:41,932 INFO L85 PathProgramCache]: Analyzing trace with hash 67060467, now seen corresponding path program 1 times [2022-07-21 16:41:41,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:41:41,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542730907] [2022-07-21 16:41:41,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:41:41,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:41:41,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:41:42,015 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 16:41:42,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:41:42,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542730907] [2022-07-21 16:41:42,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542730907] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:41:42,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:41:42,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 16:41:42,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453735325] [2022-07-21 16:41:42,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:41:42,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 16:41:42,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:41:42,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 16:41:42,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 16:41:42,018 INFO L87 Difference]: Start difference. First operand 305 states and 354 transitions. Second operand has 6 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (6), 2 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:41:42,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:41:42,361 INFO L93 Difference]: Finished difference Result 304 states and 353 transitions. [2022-07-21 16:41:42,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 16:41:42,361 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (6), 2 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-07-21 16:41:42,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:41:42,363 INFO L225 Difference]: With dead ends: 304 [2022-07-21 16:41:42,363 INFO L226 Difference]: Without dead ends: 304 [2022-07-21 16:41:42,363 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-21 16:41:42,364 INFO L413 NwaCegarLoop]: 268 mSDtfsCounter, 62 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 873 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 16:41:42,364 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 873 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 499 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-21 16:41:42,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2022-07-21 16:41:42,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 303. [2022-07-21 16:41:42,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 179 states have (on average 1.6592178770949721) internal successors, (297), 279 states have internal predecessors, (297), 32 states have call successors, (32), 12 states have call predecessors, (32), 8 states have return successors, (23), 14 states have call predecessors, (23), 18 states have call successors, (23) [2022-07-21 16:41:42,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 352 transitions. [2022-07-21 16:41:42,372 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 352 transitions. Word has length 31 [2022-07-21 16:41:42,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:41:42,372 INFO L495 AbstractCegarLoop]: Abstraction has 303 states and 352 transitions. [2022-07-21 16:41:42,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (6), 2 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:41:42,372 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 352 transitions. [2022-07-21 16:41:42,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-21 16:41:42,373 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:41:42,373 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:41:42,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-21 16:41:42,374 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ##fun~$Pointer$~TO~VOIDErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-07-21 16:41:42,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:41:42,374 INFO L85 PathProgramCache]: Analyzing trace with hash 67060466, now seen corresponding path program 1 times [2022-07-21 16:41:42,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:41:42,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055744073] [2022-07-21 16:41:42,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:41:42,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:41:42,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:41:42,466 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 16:41:42,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:41:42,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055744073] [2022-07-21 16:41:42,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055744073] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:41:42,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:41:42,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 16:41:42,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270904410] [2022-07-21 16:41:42,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:41:42,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 16:41:42,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:41:42,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 16:41:42,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-21 16:41:42,468 INFO L87 Difference]: Start difference. First operand 303 states and 352 transitions. Second operand has 7 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (6), 2 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:41:42,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:41:42,719 INFO L93 Difference]: Finished difference Result 301 states and 350 transitions. [2022-07-21 16:41:42,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 16:41:42,720 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (6), 2 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-07-21 16:41:42,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:41:42,721 INFO L225 Difference]: With dead ends: 301 [2022-07-21 16:41:42,721 INFO L226 Difference]: Without dead ends: 301 [2022-07-21 16:41:42,722 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-07-21 16:41:42,722 INFO L413 NwaCegarLoop]: 270 mSDtfsCounter, 74 mSDsluCounter, 705 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 975 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 16:41:42,722 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 975 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 16:41:42,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2022-07-21 16:41:42,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 301. [2022-07-21 16:41:42,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 179 states have (on average 1.6480446927374302) internal successors, (295), 277 states have internal predecessors, (295), 32 states have call successors, (32), 12 states have call predecessors, (32), 8 states have return successors, (23), 14 states have call predecessors, (23), 18 states have call successors, (23) [2022-07-21 16:41:42,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 350 transitions. [2022-07-21 16:41:42,729 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 350 transitions. Word has length 31 [2022-07-21 16:41:42,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:41:42,729 INFO L495 AbstractCegarLoop]: Abstraction has 301 states and 350 transitions. [2022-07-21 16:41:42,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (6), 2 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:41:42,729 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 350 transitions. [2022-07-21 16:41:42,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-21 16:41:42,730 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:41:42,730 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:41:42,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-21 16:41:42,730 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ##fun~$Pointer$~TO~VOIDErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-07-21 16:41:42,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:41:42,731 INFO L85 PathProgramCache]: Analyzing trace with hash 20600531, now seen corresponding path program 1 times [2022-07-21 16:41:42,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:41:42,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790507998] [2022-07-21 16:41:42,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:41:42,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:41:42,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:41:42,801 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-21 16:41:42,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:41:42,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790507998] [2022-07-21 16:41:42,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790507998] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:41:42,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:41:42,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 16:41:42,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678294455] [2022-07-21 16:41:42,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:41:42,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 16:41:42,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:41:42,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 16:41:42,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 16:41:42,805 INFO L87 Difference]: Start difference. First operand 301 states and 350 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:41:42,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:41:42,981 INFO L93 Difference]: Finished difference Result 300 states and 349 transitions. [2022-07-21 16:41:42,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 16:41:42,982 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-07-21 16:41:42,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:41:42,983 INFO L225 Difference]: With dead ends: 300 [2022-07-21 16:41:42,984 INFO L226 Difference]: Without dead ends: 300 [2022-07-21 16:41:42,984 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-21 16:41:42,984 INFO L413 NwaCegarLoop]: 270 mSDtfsCounter, 38 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 801 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 16:41:42,985 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 801 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 16:41:42,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2022-07-21 16:41:42,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2022-07-21 16:41:42,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 179 states have (on average 1.6424581005586592) internal successors, (294), 276 states have internal predecessors, (294), 32 states have call successors, (32), 12 states have call predecessors, (32), 8 states have return successors, (23), 14 states have call predecessors, (23), 18 states have call successors, (23) [2022-07-21 16:41:42,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 349 transitions. [2022-07-21 16:41:42,994 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 349 transitions. Word has length 33 [2022-07-21 16:41:42,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:41:42,994 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 349 transitions. [2022-07-21 16:41:42,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:41:42,995 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 349 transitions. [2022-07-21 16:41:42,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-21 16:41:42,997 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:41:42,998 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:41:42,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-21 16:41:42,999 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ##fun~$Pointer$~TO~VOIDErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-07-21 16:41:43,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:41:43,000 INFO L85 PathProgramCache]: Analyzing trace with hash 20600532, now seen corresponding path program 1 times [2022-07-21 16:41:43,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:41:43,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141806533] [2022-07-21 16:41:43,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:41:43,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:41:43,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:41:43,081 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-21 16:41:43,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:41:43,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141806533] [2022-07-21 16:41:43,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141806533] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:41:43,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:41:43,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 16:41:43,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613374517] [2022-07-21 16:41:43,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:41:43,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 16:41:43,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:41:43,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 16:41:43,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-21 16:41:43,083 INFO L87 Difference]: Start difference. First operand 300 states and 349 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:41:43,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:41:43,269 INFO L93 Difference]: Finished difference Result 299 states and 348 transitions. [2022-07-21 16:41:43,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 16:41:43,269 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-07-21 16:41:43,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:41:43,271 INFO L225 Difference]: With dead ends: 299 [2022-07-21 16:41:43,272 INFO L226 Difference]: Without dead ends: 299 [2022-07-21 16:41:43,273 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-21 16:41:43,274 INFO L413 NwaCegarLoop]: 270 mSDtfsCounter, 37 mSDsluCounter, 816 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 1086 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 16:41:43,274 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 1086 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 16:41:43,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2022-07-21 16:41:43,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2022-07-21 16:41:43,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 179 states have (on average 1.6368715083798884) internal successors, (293), 275 states have internal predecessors, (293), 32 states have call successors, (32), 12 states have call predecessors, (32), 8 states have return successors, (23), 14 states have call predecessors, (23), 18 states have call successors, (23) [2022-07-21 16:41:43,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 348 transitions. [2022-07-21 16:41:43,283 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 348 transitions. Word has length 33 [2022-07-21 16:41:43,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:41:43,284 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 348 transitions. [2022-07-21 16:41:43,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:41:43,284 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 348 transitions. [2022-07-21 16:41:43,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-21 16:41:43,286 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:41:43,286 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:41:43,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-21 16:41:43,286 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ##fun~$Pointer$~TO~VOIDErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-07-21 16:41:43,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:41:43,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1677723852, now seen corresponding path program 1 times [2022-07-21 16:41:43,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:41:43,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083756613] [2022-07-21 16:41:43,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:41:43,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:41:43,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:41:43,457 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 16:41:43,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:41:43,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083756613] [2022-07-21 16:41:43,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083756613] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:41:43,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:41:43,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-21 16:41:43,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118495421] [2022-07-21 16:41:43,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:41:43,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 16:41:43,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:41:43,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 16:41:43,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-21 16:41:43,458 INFO L87 Difference]: Start difference. First operand 299 states and 348 transitions. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 2 states have call successors, (6), 2 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:41:43,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:41:43,773 INFO L93 Difference]: Finished difference Result 313 states and 363 transitions. [2022-07-21 16:41:43,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 16:41:43,773 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 2 states have call successors, (6), 2 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-07-21 16:41:43,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:41:43,775 INFO L225 Difference]: With dead ends: 313 [2022-07-21 16:41:43,775 INFO L226 Difference]: Without dead ends: 313 [2022-07-21 16:41:43,775 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2022-07-21 16:41:43,775 INFO L413 NwaCegarLoop]: 271 mSDtfsCounter, 24 mSDsluCounter, 1316 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 1587 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 16:41:43,776 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 1587 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 16:41:43,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2022-07-21 16:41:43,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 312. [2022-07-21 16:41:43,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 191 states have (on average 1.5968586387434556) internal successors, (305), 288 states have internal predecessors, (305), 32 states have call successors, (32), 12 states have call predecessors, (32), 9 states have return successors, (25), 14 states have call predecessors, (25), 18 states have call successors, (25) [2022-07-21 16:41:43,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 362 transitions. [2022-07-21 16:41:43,781 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 362 transitions. Word has length 35 [2022-07-21 16:41:43,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:41:43,782 INFO L495 AbstractCegarLoop]: Abstraction has 312 states and 362 transitions. [2022-07-21 16:41:43,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 2 states have call successors, (6), 2 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:41:43,782 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 362 transitions. [2022-07-21 16:41:43,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-21 16:41:43,783 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:41:43,783 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:41:43,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-21 16:41:43,783 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ##fun~$Pointer$~TO~VOIDErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-07-21 16:41:43,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:41:43,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1451018694, now seen corresponding path program 1 times [2022-07-21 16:41:43,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:41:43,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114779166] [2022-07-21 16:41:43,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:41:43,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:41:43,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:41:44,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 16:41:44,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:41:44,187 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-21 16:41:44,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:41:44,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114779166] [2022-07-21 16:41:44,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114779166] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:41:44,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [693892708] [2022-07-21 16:41:44,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:41:44,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:41:44,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:41:44,190 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-21 16:41:44,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-21 16:41:44,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:41:44,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 65 conjunts are in the unsatisfiable core [2022-07-21 16:41:44,372 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:41:44,441 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-21 16:41:44,525 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 16:41:44,669 INFO L356 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-07-21 16:41:44,669 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 16 treesize of output 26 [2022-07-21 16:41:44,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 16:41:44,754 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2022-07-21 16:41:44,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 16:41:44,767 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2022-07-21 16:41:44,874 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-21 16:41:44,910 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-21 16:41:44,910 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:41:45,136 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_578 (Array Int Int)) (|v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_12| Int)) (or (= (select (store |c_#valid| |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_12| 1) (select (select (store |c_#memory_$Pointer$.base| |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_12| v_ArrVal_578) |c_##fun~$Pointer$~TO~VOID_#~10#1.base|) |c_##fun~$Pointer$~TO~VOID_#~10#1.offset|)) 1) (not (< |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_12| |c_#StackHeapBarrier|)))) is different from false [2022-07-21 16:41:45,152 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_578 (Array Int Int)) (|v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_12| Int)) (or (not (< |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_12| |c_#StackHeapBarrier|)) (= (select (store |c_#valid| |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_12| 1) (select (select (store |c_#memory_$Pointer$.base| |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_12| v_ArrVal_578) |c_##fun~$Pointer$~TO~VOID_#in~10#1.base|) |c_##fun~$Pointer$~TO~VOID_#in~10#1.offset|)) 1))) is different from false [2022-07-21 16:41:45,168 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_578 (Array Int Int)) (|v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_12| Int)) (or (not (< |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_12| |c_#StackHeapBarrier|)) (= (select (store |c_#valid| |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_12| 1) (select (select (store |c_#memory_$Pointer$.base| |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_12| v_ArrVal_578) |c_dll_create_generic_~#dll~0.base|) |c_dll_create_generic_~#dll~0.offset|)) 1))) is different from false [2022-07-21 16:41:45,262 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:41:45,263 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-07-21 16:41:45,274 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 46 treesize of output 34 [2022-07-21 16:41:45,283 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 42 treesize of output 38 [2022-07-21 16:41:45,287 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-21 16:41:45,387 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:41:45,387 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-07-21 16:41:45,390 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 16:41:45,395 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:41:45,396 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 21 treesize of output 24 [2022-07-21 16:41:49,935 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2022-07-21 16:41:49,985 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 1 not checked. [2022-07-21 16:41:49,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [693892708] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:41:49,985 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:41:49,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 17] total 41 [2022-07-21 16:41:49,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373656184] [2022-07-21 16:41:49,986 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:41:49,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-07-21 16:41:49,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:41:49,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-07-21 16:41:49,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1373, Unknown=4, NotChecked=228, Total=1722 [2022-07-21 16:41:49,989 INFO L87 Difference]: Start difference. First operand 312 states and 362 transitions. Second operand has 42 states, 36 states have (on average 2.4166666666666665) internal successors, (87), 36 states have internal predecessors, (87), 6 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 16:41:52,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:41:52,347 INFO L93 Difference]: Finished difference Result 339 states and 395 transitions. [2022-07-21 16:41:52,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-21 16:41:52,348 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 36 states have (on average 2.4166666666666665) internal successors, (87), 36 states have internal predecessors, (87), 6 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 51 [2022-07-21 16:41:52,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:41:52,349 INFO L225 Difference]: With dead ends: 339 [2022-07-21 16:41:52,349 INFO L226 Difference]: Without dead ends: 339 [2022-07-21 16:41:52,350 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 82 SyntacticMatches, 2 SemanticMatches, 58 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 518 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=480, Invalid=2661, Unknown=63, NotChecked=336, Total=3540 [2022-07-21 16:41:52,351 INFO L413 NwaCegarLoop]: 235 mSDtfsCounter, 310 mSDsluCounter, 3323 mSDsCounter, 0 mSdLazyCounter, 2557 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 3558 SdHoareTripleChecker+Invalid, 4064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 2557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1382 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-21 16:41:52,351 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 3558 Invalid, 4064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 2557 Invalid, 0 Unknown, 1382 Unchecked, 1.4s Time] [2022-07-21 16:41:52,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2022-07-21 16:41:52,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 328. [2022-07-21 16:41:52,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 206 states have (on average 1.5679611650485437) internal successors, (323), 303 states have internal predecessors, (323), 32 states have call successors, (32), 13 states have call predecessors, (32), 10 states have return successors, (24), 14 states have call predecessors, (24), 18 states have call successors, (24) [2022-07-21 16:41:52,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 379 transitions. [2022-07-21 16:41:52,359 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 379 transitions. Word has length 51 [2022-07-21 16:41:52,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:41:52,359 INFO L495 AbstractCegarLoop]: Abstraction has 328 states and 379 transitions. [2022-07-21 16:41:52,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 36 states have (on average 2.4166666666666665) internal successors, (87), 36 states have internal predecessors, (87), 6 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 16:41:52,359 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 379 transitions. [2022-07-21 16:41:52,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-21 16:41:52,360 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:41:52,361 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:41:52,391 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-21 16:41:52,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-21 16:41:52,562 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ##fun~$Pointer$~TO~VOIDErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-07-21 16:41:52,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:41:52,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1451018695, now seen corresponding path program 1 times [2022-07-21 16:41:52,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:41:52,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588019219] [2022-07-21 16:41:52,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:41:52,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:41:52,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:41:52,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 16:41:52,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:41:52,926 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-21 16:41:52,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:41:52,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588019219] [2022-07-21 16:41:52,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588019219] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:41:52,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370014295] [2022-07-21 16:41:52,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:41:52,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:41:52,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:41:52,928 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-21 16:41:52,930 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-21 16:41:53,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:41:53,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 87 conjunts are in the unsatisfiable core [2022-07-21 16:41:53,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:41:53,142 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 16:41:53,147 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-21 16:41:53,340 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 16:41:53,344 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 16:41:53,537 INFO L356 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2022-07-21 16:41:53,538 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-07-21 16:41:53,548 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:41:53,603 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-21 16:41:53,611 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2022-07-21 16:41:53,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 14 treesize of output 16 [2022-07-21 16:41:53,634 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2022-07-21 16:41:53,733 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-21 16:41:53,737 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-21 16:41:53,810 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-21 16:41:53,810 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:41:53,950 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_769 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_769) |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~dll#1.base|) |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~dll#1.offset|) 4))) (forall ((v_ArrVal_769 (Array Int Int)) (v_ArrVal_770 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_769) |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~dll#1.base|) |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~dll#1.offset|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_770) |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~dll#1.base|) |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~dll#1.offset|))))) is different from false [2022-07-21 16:41:56,386 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-21 16:41:56,387 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 1 [2022-07-21 16:41:56,392 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-21 16:41:56,393 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 1 [2022-07-21 16:41:56,455 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:41:56,456 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2022-07-21 16:41:56,464 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:41:56,464 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 34 treesize of output 37 [2022-07-21 16:41:56,468 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 11 treesize of output 9 [2022-07-21 16:41:56,500 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:41:56,501 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 41 [2022-07-21 16:41:56,508 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:41:56,508 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2022-07-21 16:41:56,511 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 16:41:56,515 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2022-07-21 16:41:56,517 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 16:41:56,519 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2022-07-21 16:41:56,871 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:41:56,871 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2022-07-21 16:41:56,878 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:41:56,878 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 34 treesize of output 37 [2022-07-21 16:41:56,882 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 11 treesize of output 9 [2022-07-21 16:41:56,925 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:41:56,926 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 41 [2022-07-21 16:41:56,936 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:41:56,937 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2022-07-21 16:41:56,940 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 16:41:56,942 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2022-07-21 16:41:56,946 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 16:41:56,948 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2022-07-21 16:41:56,983 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:41:56,984 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2022-07-21 16:41:56,993 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:41:56,993 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 34 treesize of output 37 [2022-07-21 16:41:56,999 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 11 treesize of output 9 [2022-07-21 16:41:57,028 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:41:57,029 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 41 [2022-07-21 16:41:57,035 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:41:57,036 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2022-07-21 16:41:57,038 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 16:41:57,041 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2022-07-21 16:41:57,051 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 16:41:57,053 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2022-07-21 16:41:57,085 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:41:57,085 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2022-07-21 16:41:57,094 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:41:57,094 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 34 treesize of output 37 [2022-07-21 16:41:57,098 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 11 treesize of output 9 [2022-07-21 16:41:57,122 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:41:57,122 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 41 [2022-07-21 16:41:57,129 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:41:57,130 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2022-07-21 16:41:57,132 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 16:41:57,135 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2022-07-21 16:41:57,138 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 16:41:57,140 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2022-07-21 16:41:57,176 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:41:57,176 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2022-07-21 16:41:57,184 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:41:57,184 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 34 treesize of output 37 [2022-07-21 16:41:57,189 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 11 treesize of output 9 [2022-07-21 16:41:57,214 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:41:57,215 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 41 [2022-07-21 16:41:57,222 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:41:57,225 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2022-07-21 16:41:57,228 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 16:41:57,231 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2022-07-21 16:41:57,234 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 16:41:57,236 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2022-07-21 16:41:57,362 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:41:57,362 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 41 [2022-07-21 16:41:57,370 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:41:57,370 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2022-07-21 16:41:57,381 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:41:57,381 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 61 [2022-07-21 16:41:57,396 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:41:57,396 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 94 treesize of output 93 [2022-07-21 16:41:57,402 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 78 treesize of output 74 [2022-07-21 16:41:57,410 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2022-07-21 16:41:57,581 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:41:57,582 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2022-07-21 16:41:57,590 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:41:57,590 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 34 treesize of output 37 [2022-07-21 16:41:57,602 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 11 treesize of output 9 [2022-07-21 16:41:57,641 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:41:57,641 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2022-07-21 16:41:57,651 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:41:57,652 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 34 treesize of output 37 [2022-07-21 16:41:57,657 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 11 treesize of output 9 [2022-07-21 16:41:57,704 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:41:57,705 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 41 [2022-07-21 16:41:57,713 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:41:57,713 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2022-07-21 16:41:57,716 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 16:41:57,718 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2022-07-21 16:41:57,722 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 16:41:57,725 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2022-07-21 16:41:57,976 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 16:41:57,992 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-21 16:41:57,992 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 25 treesize of output 24 [2022-07-21 16:41:58,000 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 3 not checked. [2022-07-21 16:41:58,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [370014295] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:41:58,001 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:41:58,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 13] total 39 [2022-07-21 16:41:58,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256832729] [2022-07-21 16:41:58,001 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:41:58,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-07-21 16:41:58,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:41:58,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-07-21 16:41:58,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1367, Unknown=14, NotChecked=74, Total=1560 [2022-07-21 16:41:58,003 INFO L87 Difference]: Start difference. First operand 328 states and 379 transitions. Second operand has 40 states, 35 states have (on average 2.6857142857142855) internal successors, (94), 35 states have internal predecessors, (94), 5 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-21 16:42:05,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:42:05,978 INFO L93 Difference]: Finished difference Result 363 states and 418 transitions. [2022-07-21 16:42:05,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-07-21 16:42:05,979 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 35 states have (on average 2.6857142857142855) internal successors, (94), 35 states have internal predecessors, (94), 5 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 51 [2022-07-21 16:42:05,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:42:05,983 INFO L225 Difference]: With dead ends: 363 [2022-07-21 16:42:05,984 INFO L226 Difference]: Without dead ends: 363 [2022-07-21 16:42:05,985 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 79 SyntacticMatches, 3 SemanticMatches, 65 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 567 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=673, Invalid=3607, Unknown=14, NotChecked=128, Total=4422 [2022-07-21 16:42:05,987 INFO L413 NwaCegarLoop]: 237 mSDtfsCounter, 342 mSDsluCounter, 3138 mSDsCounter, 0 mSdLazyCounter, 2945 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 3375 SdHoareTripleChecker+Invalid, 4473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 2945 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1368 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-21 16:42:05,987 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 3375 Invalid, 4473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 2945 Invalid, 0 Unknown, 1368 Unchecked, 1.5s Time] [2022-07-21 16:42:05,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2022-07-21 16:42:05,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 327. [2022-07-21 16:42:05,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 206 states have (on average 1.558252427184466) internal successors, (321), 302 states have internal predecessors, (321), 32 states have call successors, (32), 13 states have call predecessors, (32), 10 states have return successors, (23), 14 states have call predecessors, (23), 18 states have call successors, (23) [2022-07-21 16:42:05,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 376 transitions. [2022-07-21 16:42:05,998 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 376 transitions. Word has length 51 [2022-07-21 16:42:05,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:42:05,998 INFO L495 AbstractCegarLoop]: Abstraction has 327 states and 376 transitions. [2022-07-21 16:42:05,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 35 states have (on average 2.6857142857142855) internal successors, (94), 35 states have internal predecessors, (94), 5 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-21 16:42:05,999 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 376 transitions. [2022-07-21 16:42:06,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-21 16:42:06,000 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:42:06,000 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:42:06,027 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-21 16:42:06,225 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,SelfDestructingSolverStorable17 [2022-07-21 16:42:06,225 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting dll_insert_masterErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-07-21 16:42:06,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:42:06,226 INFO L85 PathProgramCache]: Analyzing trace with hash -470108245, now seen corresponding path program 1 times [2022-07-21 16:42:06,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:42:06,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980447270] [2022-07-21 16:42:06,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:42:06,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:42:06,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:42:06,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 16:42:06,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:42:06,354 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 16:42:06,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:42:06,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980447270] [2022-07-21 16:42:06,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980447270] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:42:06,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1103790266] [2022-07-21 16:42:06,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:42:06,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:42:06,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:42:06,356 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-21 16:42:06,357 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-21 16:42:06,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:42:06,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-21 16:42:06,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:42:06,555 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-21 16:42:06,555 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 16:42:06,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1103790266] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:42:06,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 16:42:06,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 6 [2022-07-21 16:42:06,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529081525] [2022-07-21 16:42:06,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:42:06,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 16:42:06,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:42:06,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 16:42:06,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 16:42:06,557 INFO L87 Difference]: Start difference. First operand 327 states and 376 transitions. Second operand has 5 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 16:42:06,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:42:06,617 INFO L93 Difference]: Finished difference Result 313 states and 349 transitions. [2022-07-21 16:42:06,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 16:42:06,618 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 54 [2022-07-21 16:42:06,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:42:06,620 INFO L225 Difference]: With dead ends: 313 [2022-07-21 16:42:06,620 INFO L226 Difference]: Without dead ends: 313 [2022-07-21 16:42:06,621 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 57 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-21 16:42:06,622 INFO L413 NwaCegarLoop]: 278 mSDtfsCounter, 29 mSDsluCounter, 803 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 1081 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 16:42:06,622 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 1081 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 16:42:06,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2022-07-21 16:42:06,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 313. [2022-07-21 16:42:06,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 195 states have (on average 1.558974358974359) internal successors, (304), 291 states have internal predecessors, (304), 29 states have call successors, (29), 12 states have call predecessors, (29), 10 states have return successors, (16), 12 states have call predecessors, (16), 15 states have call successors, (16) [2022-07-21 16:42:06,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 349 transitions. [2022-07-21 16:42:06,635 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 349 transitions. Word has length 54 [2022-07-21 16:42:06,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:42:06,635 INFO L495 AbstractCegarLoop]: Abstraction has 313 states and 349 transitions. [2022-07-21 16:42:06,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 16:42:06,635 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 349 transitions. [2022-07-21 16:42:06,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-21 16:42:06,636 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:42:06,636 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:42:06,663 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-21 16:42:06,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:42:06,851 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting dll_insert_masterErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-07-21 16:42:06,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:42:06,852 INFO L85 PathProgramCache]: Analyzing trace with hash -996489836, now seen corresponding path program 1 times [2022-07-21 16:42:06,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:42:06,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746560301] [2022-07-21 16:42:06,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:42:06,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:42:06,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:42:06,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-21 16:42:06,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:42:06,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 16:42:06,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:42:07,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 16:42:07,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:42:07,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 16:42:07,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:42:07,371 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-21 16:42:07,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:42:07,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746560301] [2022-07-21 16:42:07,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746560301] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:42:07,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [529375938] [2022-07-21 16:42:07,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:42:07,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:42:07,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:42:07,373 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-21 16:42:07,375 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-21 16:42:07,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:42:07,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 550 conjuncts, 58 conjunts are in the unsatisfiable core [2022-07-21 16:42:07,577 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:42:07,662 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 16:42:07,719 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 8 treesize of output 4 [2022-07-21 16:42:08,084 WARN L855 $PredicateComparison]: unable to prove that (exists ((|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int) (v_ArrVal_1299 (Array Int Int))) (and (< |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| |c_#StackHeapBarrier|) (= |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~next~0#1.base| (select (select (store |c_old(#memory_$Pointer$.base)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_1299) |c_##fun~$Pointer$~TO~VOID_#in~10#1.base|) |c_##fun~$Pointer$~TO~VOID_#in~10#1.offset|)))) is different from true [2022-07-21 16:42:08,092 WARN L855 $PredicateComparison]: unable to prove that (exists ((|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int) (v_ArrVal_1299 (Array Int Int))) (and (= (select (select (store |c_old(#memory_$Pointer$.base)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_1299) |c_##fun~$Pointer$~TO~VOID_#in~10#1.base|) |c_##fun~$Pointer$~TO~VOID_#in~10#1.offset|) 0) (< |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| |c_#StackHeapBarrier|))) is different from true [2022-07-21 16:42:08,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 16:42:08,114 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 5 not checked. [2022-07-21 16:42:08,114 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:42:08,576 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1322 (Array Int Int)) (|v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_40| Int)) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_40| v_ArrVal_1322) |c_dll_create_generic_~#dll~0.base|) |c_dll_create_generic_~#dll~0.offset|) 0)) (not (< |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_40| |c_#StackHeapBarrier|)))) is different from false [2022-07-21 16:42:08,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [529375938] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:42:08,578 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 16:42:08,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 32 [2022-07-21 16:42:08,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443743755] [2022-07-21 16:42:08,578 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 16:42:08,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-07-21 16:42:08,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:42:08,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-07-21 16:42:08,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=792, Unknown=9, NotChecked=174, Total=1056 [2022-07-21 16:42:08,580 INFO L87 Difference]: Start difference. First operand 313 states and 349 transitions. Second operand has 32 states, 29 states have (on average 2.6206896551724137) internal successors, (76), 28 states have internal predecessors, (76), 5 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2022-07-21 16:42:10,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:42:10,256 INFO L93 Difference]: Finished difference Result 333 states and 373 transitions. [2022-07-21 16:42:10,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-21 16:42:10,257 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 29 states have (on average 2.6206896551724137) internal successors, (76), 28 states have internal predecessors, (76), 5 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) Word has length 64 [2022-07-21 16:42:10,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:42:10,258 INFO L225 Difference]: With dead ends: 333 [2022-07-21 16:42:10,258 INFO L226 Difference]: Without dead ends: 329 [2022-07-21 16:42:10,259 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=197, Invalid=1863, Unknown=22, NotChecked=270, Total=2352 [2022-07-21 16:42:10,260 INFO L413 NwaCegarLoop]: 231 mSDtfsCounter, 70 mSDsluCounter, 3836 mSDsCounter, 0 mSdLazyCounter, 2197 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 4067 SdHoareTripleChecker+Invalid, 3466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 2197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1231 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-21 16:42:10,260 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 4067 Invalid, 3466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 2197 Invalid, 0 Unknown, 1231 Unchecked, 1.1s Time] [2022-07-21 16:42:10,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2022-07-21 16:42:10,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 313. [2022-07-21 16:42:10,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 195 states have (on average 1.5538461538461539) internal successors, (303), 291 states have internal predecessors, (303), 29 states have call successors, (29), 12 states have call predecessors, (29), 10 states have return successors, (16), 12 states have call predecessors, (16), 15 states have call successors, (16) [2022-07-21 16:42:10,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 348 transitions. [2022-07-21 16:42:10,271 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 348 transitions. Word has length 64 [2022-07-21 16:42:10,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:42:10,272 INFO L495 AbstractCegarLoop]: Abstraction has 313 states and 348 transitions. [2022-07-21 16:42:10,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 29 states have (on average 2.6206896551724137) internal successors, (76), 28 states have internal predecessors, (76), 5 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2022-07-21 16:42:10,272 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 348 transitions. [2022-07-21 16:42:10,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-21 16:42:10,272 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:42:10,273 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:42:10,298 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-21 16:42:10,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:42:10,495 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting dll_insert_masterErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-07-21 16:42:10,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:42:10,496 INFO L85 PathProgramCache]: Analyzing trace with hash 2033150353, now seen corresponding path program 1 times [2022-07-21 16:42:10,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:42:10,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790209121] [2022-07-21 16:42:10,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:42:10,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:42:10,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:42:10,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-21 16:42:10,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:42:10,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 16:42:11,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:42:14,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 16:42:14,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:42:14,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 16:42:14,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:42:17,013 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 16:42:17,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:42:17,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790209121] [2022-07-21 16:42:17,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790209121] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:42:17,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [614868021] [2022-07-21 16:42:17,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:42:17,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:42:17,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:42:17,015 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-21 16:42:17,017 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-21 16:42:17,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:42:17,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 79 conjunts are in the unsatisfiable core [2022-07-21 16:42:17,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:42:17,306 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-21 16:42:17,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 16:42:17,650 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-21 16:42:17,650 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 23 treesize of output 15 [2022-07-21 16:42:17,662 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 8 treesize of output 4 [2022-07-21 16:42:20,175 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 29 treesize of output 21 [2022-07-21 16:42:20,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 16:42:20,543 INFO L356 Elim1Store]: treesize reduction 91, result has 20.2 percent of original size [2022-07-21 16:42:20,543 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 46 [2022-07-21 16:42:20,557 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:42:20,558 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:42:21,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [614868021] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:42:21,013 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 16:42:21,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 21] total 44 [2022-07-21 16:42:21,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627326126] [2022-07-21 16:42:21,013 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 16:42:21,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-07-21 16:42:21,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:42:21,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-07-21 16:42:21,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1892, Unknown=26, NotChecked=0, Total=2070 [2022-07-21 16:42:21,015 INFO L87 Difference]: Start difference. First operand 313 states and 348 transitions. Second operand has 45 states, 40 states have (on average 2.525) internal successors, (101), 40 states have internal predecessors, (101), 8 states have call successors, (11), 4 states have call predecessors, (11), 7 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-07-21 16:42:25,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:42:25,484 INFO L93 Difference]: Finished difference Result 347 states and 386 transitions. [2022-07-21 16:42:25,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-21 16:42:25,484 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 40 states have (on average 2.525) internal successors, (101), 40 states have internal predecessors, (101), 8 states have call successors, (11), 4 states have call predecessors, (11), 7 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 65 [2022-07-21 16:42:25,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:42:25,486 INFO L225 Difference]: With dead ends: 347 [2022-07-21 16:42:25,486 INFO L226 Difference]: Without dead ends: 347 [2022-07-21 16:42:25,487 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 65 SyntacticMatches, 3 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 844 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=302, Invalid=3554, Unknown=50, NotChecked=0, Total=3906 [2022-07-21 16:42:25,488 INFO L413 NwaCegarLoop]: 218 mSDtfsCounter, 254 mSDsluCounter, 2436 mSDsCounter, 0 mSdLazyCounter, 3049 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 2654 SdHoareTripleChecker+Invalid, 4716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 3049 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1576 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-07-21 16:42:25,488 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 2654 Invalid, 4716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 3049 Invalid, 0 Unknown, 1576 Unchecked, 2.6s Time] [2022-07-21 16:42:25,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2022-07-21 16:42:25,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 324. [2022-07-21 16:42:25,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 204 states have (on average 1.5441176470588236) internal successors, (315), 298 states have internal predecessors, (315), 29 states have call successors, (29), 12 states have call predecessors, (29), 12 states have return successors, (19), 16 states have call predecessors, (19), 15 states have call successors, (19) [2022-07-21 16:42:25,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 363 transitions. [2022-07-21 16:42:25,496 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 363 transitions. Word has length 65 [2022-07-21 16:42:25,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:42:25,496 INFO L495 AbstractCegarLoop]: Abstraction has 324 states and 363 transitions. [2022-07-21 16:42:25,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 40 states have (on average 2.525) internal successors, (101), 40 states have internal predecessors, (101), 8 states have call successors, (11), 4 states have call predecessors, (11), 7 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-07-21 16:42:25,497 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 363 transitions. [2022-07-21 16:42:25,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-21 16:42:25,497 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:42:25,498 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:42:25,526 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-21 16:42:25,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:42:25,712 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting dll_insert_masterErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-07-21 16:42:25,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:42:25,712 INFO L85 PathProgramCache]: Analyzing trace with hash 2033150354, now seen corresponding path program 1 times [2022-07-21 16:42:25,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:42:25,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239333918] [2022-07-21 16:42:25,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:42:25,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:42:25,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:42:25,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-21 16:42:25,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:42:26,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 16:42:26,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat