./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/dll2n_append_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-simple/dll2n_append_equal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3a59620f668b7c0725f940bc66e10441fbb56ee9b9fb687de4bd19a3f12eaeda --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 00:46:05,434 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 00:46:05,505 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-17 00:46:05,511 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 00:46:05,512 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 00:46:05,543 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 00:46:05,544 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 00:46:05,544 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 00:46:05,545 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 00:46:05,546 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 00:46:05,547 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 00:46:05,547 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 00:46:05,548 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 00:46:05,548 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 00:46:05,550 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 00:46:05,550 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 00:46:05,550 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 00:46:05,551 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 00:46:05,551 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 00:46:05,554 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 00:46:05,555 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-17 00:46:05,555 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-17 00:46:05,556 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-17 00:46:05,556 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 00:46:05,556 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 00:46:05,556 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 00:46:05,557 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 00:46:05,557 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 00:46:05,557 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 00:46:05,557 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 00:46:05,558 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 00:46:05,558 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 00:46:05,558 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 00:46:05,558 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 00:46:05,559 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 00:46:05,559 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 00:46:05,559 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 00:46:05,559 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-17 00:46:05,559 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 00:46:05,560 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 00:46:05,560 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 00:46:05,561 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 00:46:05,561 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3a59620f668b7c0725f940bc66e10441fbb56ee9b9fb687de4bd19a3f12eaeda [2024-11-17 00:46:05,806 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 00:46:05,830 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 00:46:05,833 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 00:46:05,835 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 00:46:05,835 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 00:46:05,836 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2n_append_equal.i [2024-11-17 00:46:07,349 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 00:46:07,631 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 00:46:07,632 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_append_equal.i [2024-11-17 00:46:07,681 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f34977e4c/ad6de1b8afe44910b9751b2df19c49c4/FLAG21a19e471 [2024-11-17 00:46:07,709 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f34977e4c/ad6de1b8afe44910b9751b2df19c49c4 [2024-11-17 00:46:07,711 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 00:46:07,713 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 00:46:07,716 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 00:46:07,716 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 00:46:07,721 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 00:46:07,721 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:46:07" (1/1) ... [2024-11-17 00:46:07,724 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26c82dc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:46:07, skipping insertion in model container [2024-11-17 00:46:07,724 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:46:07" (1/1) ... [2024-11-17 00:46:07,765 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 00:46:08,110 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:46:08,120 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 00:46:08,174 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:46:08,209 INFO L204 MainTranslator]: Completed translation [2024-11-17 00:46:08,210 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:46:08 WrapperNode [2024-11-17 00:46:08,210 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 00:46:08,211 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 00:46:08,211 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 00:46:08,212 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 00:46:08,218 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:46:08" (1/1) ... [2024-11-17 00:46:08,233 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:46:08" (1/1) ... [2024-11-17 00:46:08,258 INFO L138 Inliner]: procedures = 127, calls = 38, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 125 [2024-11-17 00:46:08,259 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 00:46:08,259 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 00:46:08,259 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 00:46:08,259 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 00:46:08,269 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:46:08" (1/1) ... [2024-11-17 00:46:08,270 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:46:08" (1/1) ... [2024-11-17 00:46:08,274 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:46:08" (1/1) ... [2024-11-17 00:46:08,293 INFO L175 MemorySlicer]: Split 21 memory accesses to 3 slices as follows [2, 13, 6]. 62 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 9 writes are split as follows [0, 8, 1]. [2024-11-17 00:46:08,293 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:46:08" (1/1) ... [2024-11-17 00:46:08,293 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:46:08" (1/1) ... [2024-11-17 00:46:08,299 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:46:08" (1/1) ... [2024-11-17 00:46:08,300 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:46:08" (1/1) ... [2024-11-17 00:46:08,302 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:46:08" (1/1) ... [2024-11-17 00:46:08,303 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:46:08" (1/1) ... [2024-11-17 00:46:08,306 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 00:46:08,307 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 00:46:08,307 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 00:46:08,307 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 00:46:08,311 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:46:08" (1/1) ... [2024-11-17 00:46:08,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 00:46:08,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:46:08,348 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-17 00:46:08,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-17 00:46:08,395 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-17 00:46:08,396 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-17 00:46:08,396 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-17 00:46:08,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-17 00:46:08,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-17 00:46:08,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-17 00:46:08,397 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-17 00:46:08,397 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-17 00:46:08,397 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-17 00:46:08,397 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 00:46:08,397 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-17 00:46:08,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-17 00:46:08,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-17 00:46:08,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-17 00:46:08,397 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-17 00:46:08,397 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-17 00:46:08,397 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-17 00:46:08,398 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-17 00:46:08,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-17 00:46:08,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-17 00:46:08,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-17 00:46:08,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-17 00:46:08,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-17 00:46:08,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-17 00:46:08,398 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 00:46:08,398 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 00:46:08,522 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 00:46:08,523 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 00:46:08,796 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L622: call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; [2024-11-17 00:46:08,835 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint myexit_returnLabel#1: assume true;havoc myexit_~s#1;havoc myexit_#in~s#1;assume { :end_inline_myexit } true; [2024-11-17 00:46:08,867 INFO L? ?]: Removed 111 outVars from TransFormulas that were not future-live. [2024-11-17 00:46:08,867 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 00:46:08,881 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 00:46:08,881 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 00:46:08,881 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:46:08 BoogieIcfgContainer [2024-11-17 00:46:08,881 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 00:46:08,883 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 00:46:08,883 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 00:46:08,885 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 00:46:08,886 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 12:46:07" (1/3) ... [2024-11-17 00:46:08,886 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46b74d92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:46:08, skipping insertion in model container [2024-11-17 00:46:08,886 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:46:08" (2/3) ... [2024-11-17 00:46:08,886 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46b74d92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:46:08, skipping insertion in model container [2024-11-17 00:46:08,887 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:46:08" (3/3) ... [2024-11-17 00:46:08,887 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_append_equal.i [2024-11-17 00:46:08,899 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 00:46:08,899 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 41 error locations. [2024-11-17 00:46:08,944 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 00:46:08,951 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3e4b34d4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 00:46:08,951 INFO L334 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2024-11-17 00:46:08,955 INFO L276 IsEmpty]: Start isEmpty. Operand has 108 states, 63 states have (on average 1.873015873015873) internal successors, (118), 104 states have internal predecessors, (118), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:46:08,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-17 00:46:08,960 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:46:08,961 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:46:08,961 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 38 more)] === [2024-11-17 00:46:08,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:46:08,968 INFO L85 PathProgramCache]: Analyzing trace with hash -617881611, now seen corresponding path program 1 times [2024-11-17 00:46:08,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:46:08,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882863240] [2024-11-17 00:46:08,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:46:08,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:46:09,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:09,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:46:09,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:46:09,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882863240] [2024-11-17 00:46:09,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882863240] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:46:09,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:46:09,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 00:46:09,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564474106] [2024-11-17 00:46:09,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:46:09,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:46:09,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:46:09,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:46:09,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:46:09,305 INFO L87 Difference]: Start difference. First operand has 108 states, 63 states have (on average 1.873015873015873) internal successors, (118), 104 states have internal predecessors, (118), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:46:09,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:46:09,425 INFO L93 Difference]: Finished difference Result 104 states and 112 transitions. [2024-11-17 00:46:09,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:46:09,428 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, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-17 00:46:09,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:46:09,453 INFO L225 Difference]: With dead ends: 104 [2024-11-17 00:46:09,454 INFO L226 Difference]: Without dead ends: 100 [2024-11-17 00:46:09,456 INFO L431 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 [2024-11-17 00:46:09,460 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 3 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:46:09,461 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 166 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:46:09,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-17 00:46:09,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-11-17 00:46:09,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 59 states have (on average 1.7457627118644068) internal successors, (103), 96 states have internal predecessors, (103), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:46:09,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 107 transitions. [2024-11-17 00:46:09,496 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 107 transitions. Word has length 8 [2024-11-17 00:46:09,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:46:09,496 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 107 transitions. [2024-11-17 00:46:09,496 INFO L472 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, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:46:09,496 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 107 transitions. [2024-11-17 00:46:09,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-17 00:46:09,497 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:46:09,497 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:46:09,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-17 00:46:09,497 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 38 more)] === [2024-11-17 00:46:09,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:46:09,498 INFO L85 PathProgramCache]: Analyzing trace with hash -617881610, now seen corresponding path program 1 times [2024-11-17 00:46:09,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:46:09,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885310780] [2024-11-17 00:46:09,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:46:09,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:46:09,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:09,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:46:09,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:46:09,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885310780] [2024-11-17 00:46:09,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885310780] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:46:09,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:46:09,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 00:46:09,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176544286] [2024-11-17 00:46:09,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:46:09,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:46:09,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:46:09,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:46:09,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:46:09,653 INFO L87 Difference]: Start difference. First operand 100 states and 107 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, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:46:09,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:46:09,747 INFO L93 Difference]: Finished difference Result 97 states and 104 transitions. [2024-11-17 00:46:09,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:46:09,751 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, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-17 00:46:09,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:46:09,752 INFO L225 Difference]: With dead ends: 97 [2024-11-17 00:46:09,752 INFO L226 Difference]: Without dead ends: 97 [2024-11-17 00:46:09,752 INFO L431 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 [2024-11-17 00:46:09,753 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 3 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:46:09,754 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 165 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:46:09,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-17 00:46:09,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-11-17 00:46:09,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 59 states have (on average 1.694915254237288) internal successors, (100), 93 states have internal predecessors, (100), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:46:09,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 104 transitions. [2024-11-17 00:46:09,770 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 104 transitions. Word has length 8 [2024-11-17 00:46:09,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:46:09,771 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 104 transitions. [2024-11-17 00:46:09,771 INFO L472 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, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:46:09,771 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 104 transitions. [2024-11-17 00:46:09,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-17 00:46:09,774 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:46:09,774 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:46:09,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-17 00:46:09,775 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 38 more)] === [2024-11-17 00:46:09,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:46:09,776 INFO L85 PathProgramCache]: Analyzing trace with hash 871904, now seen corresponding path program 1 times [2024-11-17 00:46:09,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:46:09,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799957775] [2024-11-17 00:46:09,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:46:09,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:46:09,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:09,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-17 00:46:09,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:10,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:46:10,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:46:10,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799957775] [2024-11-17 00:46:10,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799957775] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:46:10,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:46:10,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 00:46:10,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650985926] [2024-11-17 00:46:10,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:46:10,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 00:46:10,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:46:10,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 00:46:10,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-17 00:46:10,023 INFO L87 Difference]: Start difference. First operand 97 states and 104 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 00:46:10,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:46:10,240 INFO L93 Difference]: Finished difference Result 95 states and 102 transitions. [2024-11-17 00:46:10,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 00:46:10,240 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-11-17 00:46:10,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:46:10,241 INFO L225 Difference]: With dead ends: 95 [2024-11-17 00:46:10,242 INFO L226 Difference]: Without dead ends: 95 [2024-11-17 00:46:10,242 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-17 00:46:10,243 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 8 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:46:10,243 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 342 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:46:10,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-17 00:46:10,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-11-17 00:46:10,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 59 states have (on average 1.6610169491525424) internal successors, (98), 91 states have internal predecessors, (98), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:46:10,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 102 transitions. [2024-11-17 00:46:10,258 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 102 transitions. Word has length 15 [2024-11-17 00:46:10,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:46:10,259 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 102 transitions. [2024-11-17 00:46:10,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 00:46:10,260 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 102 transitions. [2024-11-17 00:46:10,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-17 00:46:10,260 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:46:10,260 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:46:10,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-17 00:46:10,261 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 38 more)] === [2024-11-17 00:46:10,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:46:10,261 INFO L85 PathProgramCache]: Analyzing trace with hash 871905, now seen corresponding path program 1 times [2024-11-17 00:46:10,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:46:10,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674163475] [2024-11-17 00:46:10,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:46:10,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:46:10,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:10,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-17 00:46:10,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:10,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:46:10,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:46:10,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674163475] [2024-11-17 00:46:10,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674163475] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:46:10,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:46:10,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 00:46:10,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247041918] [2024-11-17 00:46:10,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:46:10,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 00:46:10,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:46:10,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 00:46:10,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-17 00:46:10,581 INFO L87 Difference]: Start difference. First operand 95 states and 102 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 00:46:10,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:46:10,758 INFO L93 Difference]: Finished difference Result 93 states and 100 transitions. [2024-11-17 00:46:10,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 00:46:10,759 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-11-17 00:46:10,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:46:10,760 INFO L225 Difference]: With dead ends: 93 [2024-11-17 00:46:10,760 INFO L226 Difference]: Without dead ends: 93 [2024-11-17 00:46:10,760 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-17 00:46:10,761 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 7 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:46:10,761 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 362 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:46:10,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-17 00:46:10,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-11-17 00:46:10,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 59 states have (on average 1.6271186440677967) internal successors, (96), 89 states have internal predecessors, (96), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:46:10,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 100 transitions. [2024-11-17 00:46:10,769 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 100 transitions. Word has length 15 [2024-11-17 00:46:10,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:46:10,770 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 100 transitions. [2024-11-17 00:46:10,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 00:46:10,770 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 100 transitions. [2024-11-17 00:46:10,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-17 00:46:10,772 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:46:10,772 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:46:10,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-17 00:46:10,772 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 38 more)] === [2024-11-17 00:46:10,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:46:10,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1155960575, now seen corresponding path program 1 times [2024-11-17 00:46:10,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:46:10,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022014957] [2024-11-17 00:46:10,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:46:10,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:46:10,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:10,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-17 00:46:10,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:10,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:46:10,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:46:10,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022014957] [2024-11-17 00:46:10,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022014957] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:46:10,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:46:10,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:46:10,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096399293] [2024-11-17 00:46:10,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:46:10,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:46:10,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:46:10,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:46:10,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:46:10,877 INFO L87 Difference]: Start difference. First operand 93 states and 100 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 00:46:10,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:46:10,956 INFO L93 Difference]: Finished difference Result 104 states and 113 transitions. [2024-11-17 00:46:10,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 00:46:10,957 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-11-17 00:46:10,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:46:10,958 INFO L225 Difference]: With dead ends: 104 [2024-11-17 00:46:10,958 INFO L226 Difference]: Without dead ends: 104 [2024-11-17 00:46:10,958 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:46:10,959 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 9 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:46:10,960 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 235 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:46:10,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-17 00:46:10,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 95. [2024-11-17 00:46:10,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 61 states have (on average 1.6065573770491803) internal successors, (98), 91 states have internal predecessors, (98), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:46:10,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 102 transitions. [2024-11-17 00:46:10,966 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 102 transitions. Word has length 17 [2024-11-17 00:46:10,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:46:10,966 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 102 transitions. [2024-11-17 00:46:10,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 00:46:10,966 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 102 transitions. [2024-11-17 00:46:10,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-17 00:46:10,967 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:46:10,967 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:46:10,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-17 00:46:10,967 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 38 more)] === [2024-11-17 00:46:10,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:46:10,968 INFO L85 PathProgramCache]: Analyzing trace with hash 205153759, now seen corresponding path program 1 times [2024-11-17 00:46:10,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:46:10,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697736454] [2024-11-17 00:46:10,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:46:10,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:46:11,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:11,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-17 00:46:11,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:11,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:46:11,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:46:11,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697736454] [2024-11-17 00:46:11,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697736454] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:46:11,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:46:11,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:46:11,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087863102] [2024-11-17 00:46:11,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:46:11,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:46:11,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:46:11,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:46:11,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:46:11,085 INFO L87 Difference]: Start difference. First operand 95 states and 102 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 00:46:11,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:46:11,172 INFO L93 Difference]: Finished difference Result 100 states and 108 transitions. [2024-11-17 00:46:11,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 00:46:11,174 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-11-17 00:46:11,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:46:11,175 INFO L225 Difference]: With dead ends: 100 [2024-11-17 00:46:11,175 INFO L226 Difference]: Without dead ends: 100 [2024-11-17 00:46:11,175 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:46:11,176 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 0 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:46:11,178 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 231 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:46:11,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-17 00:46:11,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-11-17 00:46:11,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 65 states have (on average 1.5692307692307692) internal successors, (102), 95 states have internal predecessors, (102), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 00:46:11,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2024-11-17 00:46:11,190 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 18 [2024-11-17 00:46:11,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:46:11,190 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2024-11-17 00:46:11,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 00:46:11,191 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2024-11-17 00:46:11,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-17 00:46:11,192 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:46:11,192 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:46:11,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-17 00:46:11,193 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 38 more)] === [2024-11-17 00:46:11,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:46:11,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1327296227, now seen corresponding path program 1 times [2024-11-17 00:46:11,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:46:11,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292806072] [2024-11-17 00:46:11,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:46:11,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:46:11,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:11,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-17 00:46:11,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:11,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-17 00:46:11,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:11,373 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-17 00:46:11,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:46:11,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292806072] [2024-11-17 00:46:11,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292806072] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:46:11,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1689291674] [2024-11-17 00:46:11,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:46:11,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:46:11,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:46:11,377 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) [2024-11-17 00:46:11,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-17 00:46:11,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:11,527 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-17 00:46:11,533 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:46:11,596 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:46:11,598 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:46:11,656 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-17 00:46:11,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1689291674] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:46:11,661 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:46:11,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2024-11-17 00:46:11,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714928018] [2024-11-17 00:46:11,662 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:46:11,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 00:46:11,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:46:11,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 00:46:11,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:46:11,663 INFO L87 Difference]: Start difference. First operand 100 states and 108 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-17 00:46:11,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:46:11,760 INFO L93 Difference]: Finished difference Result 103 states and 111 transitions. [2024-11-17 00:46:11,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:46:11,760 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 33 [2024-11-17 00:46:11,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:46:11,761 INFO L225 Difference]: With dead ends: 103 [2024-11-17 00:46:11,761 INFO L226 Difference]: Without dead ends: 103 [2024-11-17 00:46:11,761 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 66 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:46:11,762 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 9 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:46:11,762 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 244 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:46:11,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-17 00:46:11,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-11-17 00:46:11,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 68 states have (on average 1.5441176470588236) internal successors, (105), 98 states have internal predecessors, (105), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 00:46:11,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 111 transitions. [2024-11-17 00:46:11,775 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 111 transitions. Word has length 33 [2024-11-17 00:46:11,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:46:11,779 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 111 transitions. [2024-11-17 00:46:11,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-17 00:46:11,779 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2024-11-17 00:46:11,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-17 00:46:11,780 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:46:11,780 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-17 00:46:11,799 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-17 00:46:11,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:46:11,982 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 38 more)] === [2024-11-17 00:46:11,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:46:11,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1221591675, now seen corresponding path program 1 times [2024-11-17 00:46:11,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:46:11,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943591713] [2024-11-17 00:46:11,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:46:11,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:46:12,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:12,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-17 00:46:12,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:12,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-17 00:46:12,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:12,336 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-17 00:46:12,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:46:12,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943591713] [2024-11-17 00:46:12,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943591713] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:46:12,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [696017811] [2024-11-17 00:46:12,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:46:12,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:46:12,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:46:12,343 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) [2024-11-17 00:46:12,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-17 00:46:12,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:12,512 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-17 00:46:12,514 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:46:12,567 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2024-11-17 00:46:12,631 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-17 00:46:12,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-17 00:46:12,651 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:46:12,651 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:46:12,809 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:46:12,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [696017811] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:46:12,809 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:46:12,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 4] total 12 [2024-11-17 00:46:12,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377850014] [2024-11-17 00:46:12,810 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:46:12,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-17 00:46:12,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:46:12,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-17 00:46:12,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=104, Unknown=1, NotChecked=20, Total=156 [2024-11-17 00:46:12,812 INFO L87 Difference]: Start difference. First operand 103 states and 111 transitions. Second operand has 13 states, 12 states have (on average 4.333333333333333) internal successors, (52), 10 states have internal predecessors, (52), 2 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-17 00:46:13,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:46:13,143 INFO L93 Difference]: Finished difference Result 102 states and 110 transitions. [2024-11-17 00:46:13,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-17 00:46:13,144 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.333333333333333) internal successors, (52), 10 states have internal predecessors, (52), 2 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2024-11-17 00:46:13,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:46:13,145 INFO L225 Difference]: With dead ends: 102 [2024-11-17 00:46:13,145 INFO L226 Difference]: Without dead ends: 102 [2024-11-17 00:46:13,146 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 65 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=193, Unknown=1, NotChecked=28, Total=272 [2024-11-17 00:46:13,147 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 5 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 100 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-17 00:46:13,147 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 453 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 366 Invalid, 0 Unknown, 100 Unchecked, 0.3s Time] [2024-11-17 00:46:13,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-17 00:46:13,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2024-11-17 00:46:13,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 68 states have (on average 1.5294117647058822) internal successors, (104), 97 states have internal predecessors, (104), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 00:46:13,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 110 transitions. [2024-11-17 00:46:13,157 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 110 transitions. Word has length 34 [2024-11-17 00:46:13,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:46:13,160 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 110 transitions. [2024-11-17 00:46:13,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.333333333333333) internal successors, (52), 10 states have internal predecessors, (52), 2 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-17 00:46:13,160 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 110 transitions. [2024-11-17 00:46:13,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-17 00:46:13,161 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:46:13,161 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-17 00:46:13,180 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-17 00:46:13,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-11-17 00:46:13,362 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 38 more)] === [2024-11-17 00:46:13,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:46:13,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1221591676, now seen corresponding path program 1 times [2024-11-17 00:46:13,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:46:13,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841295798] [2024-11-17 00:46:13,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:46:13,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:46:13,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:13,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-17 00:46:13,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:13,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-17 00:46:13,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:13,958 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-17 00:46:13,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:46:13,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841295798] [2024-11-17 00:46:13,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841295798] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:46:13,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1455355235] [2024-11-17 00:46:13,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:46:13,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:46:13,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:46:13,963 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) [2024-11-17 00:46:13,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-17 00:46:14,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:14,105 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-17 00:46:14,107 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:46:14,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-17 00:46:14,280 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2024-11-17 00:46:14,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:46:14,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-17 00:46:14,336 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-17 00:46:14,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-17 00:46:14,354 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2024-11-17 00:46:14,354 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:46:14,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1455355235] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:46:14,483 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:46:14,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 17 [2024-11-17 00:46:14,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711567039] [2024-11-17 00:46:14,484 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:46:14,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-17 00:46:14,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:46:14,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-17 00:46:14,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=294, Unknown=1, NotChecked=34, Total=380 [2024-11-17 00:46:14,485 INFO L87 Difference]: Start difference. First operand 102 states and 110 transitions. Second operand has 18 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 14 states have internal predecessors, (46), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-17 00:46:15,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:46:15,028 INFO L93 Difference]: Finished difference Result 101 states and 109 transitions. [2024-11-17 00:46:15,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-17 00:46:15,029 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 14 states have internal predecessors, (46), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2024-11-17 00:46:15,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:46:15,031 INFO L225 Difference]: With dead ends: 101 [2024-11-17 00:46:15,031 INFO L226 Difference]: Without dead ends: 101 [2024-11-17 00:46:15,031 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=75, Invalid=434, Unknown=1, NotChecked=42, Total=552 [2024-11-17 00:46:15,032 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 4 mSDsluCounter, 619 mSDsCounter, 0 mSdLazyCounter, 609 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 707 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 99 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-17 00:46:15,032 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 707 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 609 Invalid, 0 Unknown, 99 Unchecked, 0.4s Time] [2024-11-17 00:46:15,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-17 00:46:15,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-11-17 00:46:15,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 68 states have (on average 1.5147058823529411) internal successors, (103), 96 states have internal predecessors, (103), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 00:46:15,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 109 transitions. [2024-11-17 00:46:15,042 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 109 transitions. Word has length 34 [2024-11-17 00:46:15,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:46:15,042 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 109 transitions. [2024-11-17 00:46:15,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 14 states have internal predecessors, (46), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-17 00:46:15,042 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 109 transitions. [2024-11-17 00:46:15,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-17 00:46:15,043 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:46:15,044 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:46:15,063 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-17 00:46:15,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:46:15,245 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 38 more)] === [2024-11-17 00:46:15,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:46:15,245 INFO L85 PathProgramCache]: Analyzing trace with hash 234817223, now seen corresponding path program 2 times [2024-11-17 00:46:15,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:46:15,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919943178] [2024-11-17 00:46:15,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:46:15,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:46:15,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:15,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-17 00:46:15,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:15,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-17 00:46:15,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:15,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-17 00:46:15,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:15,449 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 18 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-17 00:46:15,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:46:15,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919943178] [2024-11-17 00:46:15,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919943178] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:46:15,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [897237002] [2024-11-17 00:46:15,450 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 00:46:15,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:46:15,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:46:15,452 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) [2024-11-17 00:46:15,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-17 00:46:15,627 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-17 00:46:15,627 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 00:46:15,630 INFO L255 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-17 00:46:15,632 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:46:15,664 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 24 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-17 00:46:15,664 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:46:15,704 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 18 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-17 00:46:15,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [897237002] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:46:15,705 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:46:15,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 8 [2024-11-17 00:46:15,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573163742] [2024-11-17 00:46:15,706 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:46:15,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-17 00:46:15,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:46:15,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-17 00:46:15,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-17 00:46:15,707 INFO L87 Difference]: Start difference. First operand 101 states and 109 transitions. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 6 states have internal predecessors, (45), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-17 00:46:15,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:46:15,852 INFO L93 Difference]: Finished difference Result 101 states and 108 transitions. [2024-11-17 00:46:15,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-17 00:46:15,852 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 6 states have internal predecessors, (45), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 49 [2024-11-17 00:46:15,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:46:15,853 INFO L225 Difference]: With dead ends: 101 [2024-11-17 00:46:15,853 INFO L226 Difference]: Without dead ends: 101 [2024-11-17 00:46:15,853 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-17 00:46:15,853 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 4 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:46:15,854 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 562 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:46:15,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-17 00:46:15,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-11-17 00:46:15,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 68 states have (on average 1.5) internal successors, (102), 96 states have internal predecessors, (102), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 00:46:15,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 108 transitions. [2024-11-17 00:46:15,865 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 108 transitions. Word has length 49 [2024-11-17 00:46:15,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:46:15,865 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 108 transitions. [2024-11-17 00:46:15,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 6 states have internal predecessors, (45), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-17 00:46:15,865 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 108 transitions. [2024-11-17 00:46:15,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-17 00:46:15,866 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:46:15,866 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:46:15,886 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-17 00:46:16,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:46:16,069 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 38 more)] === [2024-11-17 00:46:16,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:46:16,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1187030209, now seen corresponding path program 1 times [2024-11-17 00:46:16,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:46:16,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452452539] [2024-11-17 00:46:16,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:46:16,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:46:16,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:16,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-17 00:46:16,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:16,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-17 00:46:16,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:16,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-17 00:46:16,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:16,584 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-17 00:46:16,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:46:16,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452452539] [2024-11-17 00:46:16,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452452539] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:46:16,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1351959372] [2024-11-17 00:46:16,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:46:16,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:46:16,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:46:16,587 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) [2024-11-17 00:46:16,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-17 00:46:16,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:16,772 INFO L255 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-17 00:46:16,779 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:46:16,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-17 00:46:16,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-17 00:46:16,825 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))))) is different from true [2024-11-17 00:46:16,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:46:16,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-17 00:46:16,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-17 00:46:16,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:46:16,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-17 00:46:16,973 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2024-11-17 00:46:16,993 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-17 00:46:16,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-17 00:46:17,004 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 14 not checked. [2024-11-17 00:46:17,004 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:46:17,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1351959372] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:46:17,164 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:46:17,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 12 [2024-11-17 00:46:17,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120262088] [2024-11-17 00:46:17,165 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:46:17,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-17 00:46:17,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:46:17,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-17 00:46:17,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=121, Unknown=2, NotChecked=46, Total=210 [2024-11-17 00:46:17,166 INFO L87 Difference]: Start difference. First operand 101 states and 108 transitions. Second operand has 13 states, 12 states have (on average 4.083333333333333) internal successors, (49), 11 states have internal predecessors, (49), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-17 00:46:17,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:46:17,407 INFO L93 Difference]: Finished difference Result 110 states and 118 transitions. [2024-11-17 00:46:17,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 00:46:17,408 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.083333333333333) internal successors, (49), 11 states have internal predecessors, (49), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 50 [2024-11-17 00:46:17,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:46:17,409 INFO L225 Difference]: With dead ends: 110 [2024-11-17 00:46:17,409 INFO L226 Difference]: Without dead ends: 110 [2024-11-17 00:46:17,409 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 70 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=186, Unknown=2, NotChecked=58, Total=306 [2024-11-17 00:46:17,409 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 133 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 202 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:46:17,410 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 198 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 201 Invalid, 0 Unknown, 202 Unchecked, 0.2s Time] [2024-11-17 00:46:17,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-17 00:46:17,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 96. [2024-11-17 00:46:17,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 68 states have (on average 1.4264705882352942) internal successors, (97), 91 states have internal predecessors, (97), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 00:46:17,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 103 transitions. [2024-11-17 00:46:17,415 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 103 transitions. Word has length 50 [2024-11-17 00:46:17,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:46:17,416 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 103 transitions. [2024-11-17 00:46:17,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.083333333333333) internal successors, (49), 11 states have internal predecessors, (49), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-17 00:46:17,416 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 103 transitions. [2024-11-17 00:46:17,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-17 00:46:17,418 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:46:17,419 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:46:17,439 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-17 00:46:17,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-17 00:46:17,620 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 38 more)] === [2024-11-17 00:46:17,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:46:17,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1187030208, now seen corresponding path program 1 times [2024-11-17 00:46:17,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:46:17,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585902744] [2024-11-17 00:46:17,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:46:17,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:46:17,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:18,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-17 00:46:18,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:18,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-17 00:46:18,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:18,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-17 00:46:18,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:18,173 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-17 00:46:18,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:46:18,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585902744] [2024-11-17 00:46:18,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585902744] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:46:18,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [40088648] [2024-11-17 00:46:18,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:46:18,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:46:18,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:46:18,175 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 00:46:18,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-17 00:46:18,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:18,384 INFO L255 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-17 00:46:18,390 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:46:18,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-17 00:46:18,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-17 00:46:18,455 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|))) is different from true [2024-11-17 00:46:18,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:46:18,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-17 00:46:18,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-17 00:46:18,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:46:18,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-17 00:46:18,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-17 00:46:18,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:46:18,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-17 00:46:18,722 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-17 00:46:18,722 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:46:18,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [40088648] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:46:18,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-17 00:46:18,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 13 [2024-11-17 00:46:18,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802265074] [2024-11-17 00:46:18,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:46:18,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 00:46:18,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:46:18,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 00:46:18,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=122, Unknown=1, NotChecked=22, Total=182 [2024-11-17 00:46:18,724 INFO L87 Difference]: Start difference. First operand 96 states and 103 transitions. Second operand has 7 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:46:18,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:46:18,815 INFO L93 Difference]: Finished difference Result 93 states and 100 transitions. [2024-11-17 00:46:18,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 00:46:18,815 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 50 [2024-11-17 00:46:18,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:46:18,817 INFO L225 Difference]: With dead ends: 93 [2024-11-17 00:46:18,817 INFO L226 Difference]: Without dead ends: 93 [2024-11-17 00:46:18,817 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=143, Unknown=1, NotChecked=24, Total=210 [2024-11-17 00:46:18,818 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 4 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 118 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:46:18,818 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 221 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 94 Invalid, 0 Unknown, 118 Unchecked, 0.1s Time] [2024-11-17 00:46:18,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-17 00:46:18,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-11-17 00:46:18,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 68 states have (on average 1.3823529411764706) internal successors, (94), 88 states have internal predecessors, (94), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 00:46:18,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 100 transitions. [2024-11-17 00:46:18,823 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 100 transitions. Word has length 50 [2024-11-17 00:46:18,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:46:18,823 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 100 transitions. [2024-11-17 00:46:18,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:46:18,823 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 100 transitions. [2024-11-17 00:46:18,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-17 00:46:18,825 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:46:18,825 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:46:18,843 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-17 00:46:19,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:46:19,030 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 38 more)] === [2024-11-17 00:46:19,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:46:19,030 INFO L85 PathProgramCache]: Analyzing trace with hash 127844090, now seen corresponding path program 1 times [2024-11-17 00:46:19,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:46:19,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000003389] [2024-11-17 00:46:19,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:46:19,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:46:19,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:19,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-17 00:46:19,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:19,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-17 00:46:19,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:19,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-17 00:46:19,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:19,333 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 16 proven. 7 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-17 00:46:19,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:46:19,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000003389] [2024-11-17 00:46:19,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000003389] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:46:19,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2025364552] [2024-11-17 00:46:19,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:46:19,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:46:19,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:46:19,336 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 00:46:19,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-17 00:46:19,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:19,558 INFO L255 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-17 00:46:19,561 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:46:19,665 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-17 00:46:19,665 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:46:19,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2025364552] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:46:19,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-17 00:46:19,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [11] total 14 [2024-11-17 00:46:19,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613407286] [2024-11-17 00:46:19,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:46:19,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 00:46:19,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:46:19,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 00:46:19,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2024-11-17 00:46:19,667 INFO L87 Difference]: Start difference. First operand 93 states and 100 transitions. Second operand has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:46:19,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:46:19,727 INFO L93 Difference]: Finished difference Result 91 states and 98 transitions. [2024-11-17 00:46:19,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 00:46:19,727 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 54 [2024-11-17 00:46:19,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:46:19,728 INFO L225 Difference]: With dead ends: 91 [2024-11-17 00:46:19,728 INFO L226 Difference]: Without dead ends: 91 [2024-11-17 00:46:19,728 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2024-11-17 00:46:19,729 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 83 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:46:19,729 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 141 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:46:19,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-17 00:46:19,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-17 00:46:19,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 68 states have (on average 1.3529411764705883) internal successors, (92), 86 states have internal predecessors, (92), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 00:46:19,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 98 transitions. [2024-11-17 00:46:19,732 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 98 transitions. Word has length 54 [2024-11-17 00:46:19,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:46:19,732 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 98 transitions. [2024-11-17 00:46:19,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:46:19,732 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 98 transitions. [2024-11-17 00:46:19,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-17 00:46:19,733 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:46:19,733 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:46:19,751 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-17 00:46:19,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:46:19,934 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 38 more)] === [2024-11-17 00:46:19,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:46:19,934 INFO L85 PathProgramCache]: Analyzing trace with hash -309851472, now seen corresponding path program 1 times [2024-11-17 00:46:19,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:46:19,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734033752] [2024-11-17 00:46:19,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:46:19,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:46:19,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:20,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-17 00:46:20,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:20,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-17 00:46:20,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:20,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-17 00:46:20,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:20,401 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 23 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-17 00:46:20,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:46:20,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734033752] [2024-11-17 00:46:20,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734033752] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:46:20,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1493735127] [2024-11-17 00:46:20,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:46:20,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:46:20,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:46:20,404 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 00:46:20,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-17 00:46:20,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:20,699 INFO L255 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-17 00:46:20,702 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:46:20,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-17 00:46:20,859 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2024-11-17 00:46:20,898 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2024-11-17 00:46:20,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 24 [2024-11-17 00:46:20,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-17 00:46:20,922 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-17 00:46:20,922 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:46:20,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1493735127] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:46:20,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-17 00:46:20,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [13] total 20 [2024-11-17 00:46:20,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843727567] [2024-11-17 00:46:20,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:46:20,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-17 00:46:20,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:46:20,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-17 00:46:20,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=333, Unknown=1, NotChecked=36, Total=420 [2024-11-17 00:46:20,924 INFO L87 Difference]: Start difference. First operand 91 states and 98 transitions. Second operand has 11 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:46:21,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:46:21,090 INFO L93 Difference]: Finished difference Result 91 states and 99 transitions. [2024-11-17 00:46:21,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-17 00:46:21,091 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 55 [2024-11-17 00:46:21,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:46:21,092 INFO L225 Difference]: With dead ends: 91 [2024-11-17 00:46:21,092 INFO L226 Difference]: Without dead ends: 91 [2024-11-17 00:46:21,092 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=368, Unknown=1, NotChecked=38, Total=462 [2024-11-17 00:46:21,093 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 10 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 160 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:46:21,093 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 369 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 257 Invalid, 0 Unknown, 160 Unchecked, 0.1s Time] [2024-11-17 00:46:21,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-17 00:46:21,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-17 00:46:21,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 70 states have (on average 1.3285714285714285) internal successors, (93), 86 states have internal predecessors, (93), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 00:46:21,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 99 transitions. [2024-11-17 00:46:21,096 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 99 transitions. Word has length 55 [2024-11-17 00:46:21,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:46:21,096 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 99 transitions. [2024-11-17 00:46:21,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:46:21,096 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 99 transitions. [2024-11-17 00:46:21,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-17 00:46:21,097 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:46:21,097 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:46:21,115 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-17 00:46:21,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-17 00:46:21,297 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 38 more)] === [2024-11-17 00:46:21,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:46:21,298 INFO L85 PathProgramCache]: Analyzing trace with hash -309851471, now seen corresponding path program 1 times [2024-11-17 00:46:21,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:46:21,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689501753] [2024-11-17 00:46:21,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:46:21,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:46:21,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:21,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-17 00:46:21,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:21,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-17 00:46:21,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:21,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-17 00:46:21,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:22,023 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-17 00:46:22,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:46:22,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689501753] [2024-11-17 00:46:22,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689501753] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:46:22,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1253197917] [2024-11-17 00:46:22,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:46:22,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:46:22,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:46:22,027 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 00:46:22,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-17 00:46:22,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:22,246 INFO L255 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-11-17 00:46:22,249 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:46:22,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-17 00:46:22,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-17 00:46:22,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-17 00:46:22,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-17 00:46:22,661 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0)) (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|))))) is different from true [2024-11-17 00:46:22,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:46:22,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-17 00:46:22,723 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-17 00:46:22,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-17 00:46:22,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-17 00:46:22,829 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 7 not checked. [2024-11-17 00:46:22,829 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:46:23,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1253197917] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:46:23,035 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:46:23,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 28 [2024-11-17 00:46:23,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263089881] [2024-11-17 00:46:23,036 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:46:23,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-17 00:46:23,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:46:23,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-17 00:46:23,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=908, Unknown=1, NotChecked=60, Total=1056 [2024-11-17 00:46:23,038 INFO L87 Difference]: Start difference. First operand 91 states and 99 transitions. Second operand has 29 states, 26 states have (on average 3.3461538461538463) internal successors, (87), 25 states have internal predecessors, (87), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-17 00:46:23,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:46:23,956 INFO L93 Difference]: Finished difference Result 105 states and 112 transitions. [2024-11-17 00:46:23,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-17 00:46:23,956 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 26 states have (on average 3.3461538461538463) internal successors, (87), 25 states have internal predecessors, (87), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 55 [2024-11-17 00:46:23,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:46:23,957 INFO L225 Difference]: With dead ends: 105 [2024-11-17 00:46:23,957 INFO L226 Difference]: Without dead ends: 105 [2024-11-17 00:46:23,958 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=166, Invalid=1817, Unknown=1, NotChecked=86, Total=2070 [2024-11-17 00:46:23,958 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 71 mSDsluCounter, 908 mSDsCounter, 0 mSdLazyCounter, 1060 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 973 SdHoareTripleChecker+Invalid, 1163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1060 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 99 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-17 00:46:23,959 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 973 Invalid, 1163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1060 Invalid, 0 Unknown, 99 Unchecked, 0.6s Time] [2024-11-17 00:46:23,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-17 00:46:23,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 102. [2024-11-17 00:46:23,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 80 states have (on average 1.2875) internal successors, (103), 96 states have internal predecessors, (103), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 00:46:23,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 109 transitions. [2024-11-17 00:46:23,965 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 109 transitions. Word has length 55 [2024-11-17 00:46:23,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:46:23,965 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 109 transitions. [2024-11-17 00:46:23,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 26 states have (on average 3.3461538461538463) internal successors, (87), 25 states have internal predecessors, (87), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-17 00:46:23,966 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 109 transitions. [2024-11-17 00:46:23,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-17 00:46:23,967 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:46:23,967 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:46:23,985 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-17 00:46:24,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-17 00:46:24,169 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 38 more)] === [2024-11-17 00:46:24,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:46:24,169 INFO L85 PathProgramCache]: Analyzing trace with hash -900443755, now seen corresponding path program 1 times [2024-11-17 00:46:24,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:46:24,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217184609] [2024-11-17 00:46:24,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:46:24,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:46:24,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:24,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-17 00:46:24,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:24,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-17 00:46:24,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:24,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-17 00:46:24,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:24,366 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-17 00:46:24,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:46:24,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217184609] [2024-11-17 00:46:24,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217184609] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:46:24,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:46:24,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 00:46:24,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137680945] [2024-11-17 00:46:24,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:46:24,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 00:46:24,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:46:24,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 00:46:24,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-17 00:46:24,369 INFO L87 Difference]: Start difference. First operand 102 states and 109 transitions. Second operand has 7 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 00:46:24,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:46:24,501 INFO L93 Difference]: Finished difference Result 101 states and 108 transitions. [2024-11-17 00:46:24,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 00:46:24,501 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 58 [2024-11-17 00:46:24,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:46:24,502 INFO L225 Difference]: With dead ends: 101 [2024-11-17 00:46:24,502 INFO L226 Difference]: Without dead ends: 101 [2024-11-17 00:46:24,503 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-17 00:46:24,503 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 9 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:46:24,503 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 291 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:46:24,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-17 00:46:24,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-11-17 00:46:24,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 80 states have (on average 1.275) internal successors, (102), 95 states have internal predecessors, (102), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 00:46:24,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 108 transitions. [2024-11-17 00:46:24,508 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 108 transitions. Word has length 58 [2024-11-17 00:46:24,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:46:24,508 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 108 transitions. [2024-11-17 00:46:24,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 00:46:24,508 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 108 transitions. [2024-11-17 00:46:24,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-17 00:46:24,509 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:46:24,510 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:46:24,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-17 00:46:24,510 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 38 more)] === [2024-11-17 00:46:24,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:46:24,511 INFO L85 PathProgramCache]: Analyzing trace with hash -900443754, now seen corresponding path program 1 times [2024-11-17 00:46:24,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:46:24,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565977863] [2024-11-17 00:46:24,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:46:24,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:46:24,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:24,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-17 00:46:24,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:24,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-17 00:46:24,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:24,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-17 00:46:24,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:24,772 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-17 00:46:24,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:46:24,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565977863] [2024-11-17 00:46:24,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565977863] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:46:24,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:46:24,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 00:46:24,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943175475] [2024-11-17 00:46:24,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:46:24,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 00:46:24,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:46:24,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 00:46:24,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-17 00:46:24,775 INFO L87 Difference]: Start difference. First operand 101 states and 108 transitions. Second operand has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 00:46:24,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:46:24,889 INFO L93 Difference]: Finished difference Result 100 states and 107 transitions. [2024-11-17 00:46:24,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 00:46:24,890 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 58 [2024-11-17 00:46:24,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:46:24,891 INFO L225 Difference]: With dead ends: 100 [2024-11-17 00:46:24,891 INFO L226 Difference]: Without dead ends: 100 [2024-11-17 00:46:24,891 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-17 00:46:24,892 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 8 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:46:24,892 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 303 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:46:24,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-17 00:46:24,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-11-17 00:46:24,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 80 states have (on average 1.2625) internal successors, (101), 94 states have internal predecessors, (101), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 00:46:24,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 107 transitions. [2024-11-17 00:46:24,895 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 107 transitions. Word has length 58 [2024-11-17 00:46:24,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:46:24,895 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 107 transitions. [2024-11-17 00:46:24,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 00:46:24,895 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 107 transitions. [2024-11-17 00:46:24,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-17 00:46:24,896 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:46:24,896 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:46:24,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-17 00:46:24,896 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 38 more)] === [2024-11-17 00:46:24,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:46:24,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1949436013, now seen corresponding path program 1 times [2024-11-17 00:46:24,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:46:24,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840995371] [2024-11-17 00:46:24,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:46:24,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:46:24,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:25,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-17 00:46:25,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:25,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-17 00:46:25,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:25,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-17 00:46:25,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:25,197 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 16 proven. 7 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-17 00:46:25,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:46:25,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840995371] [2024-11-17 00:46:25,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840995371] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:46:25,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1094879950] [2024-11-17 00:46:25,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:46:25,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:46:25,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:46:25,200 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 00:46:25,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-17 00:46:25,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:46:25,457 INFO L255 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-17 00:46:25,460 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:46:25,687 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:46:25,689 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:46:25,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 11 [2024-11-17 00:46:25,710 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 25 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-17 00:46:25,711 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:46:25,754 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:46:25,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2024-11-17 00:46:25,949 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 16 proven. 7 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-17 00:46:25,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1094879950] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:46:25,949 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:46:25,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 11] total 24 [2024-11-17 00:46:25,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233200657] [2024-11-17 00:46:25,949 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:46:25,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-17 00:46:25,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:46:25,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-17 00:46:25,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=487, Unknown=0, NotChecked=0, Total=552 [2024-11-17 00:46:25,951 INFO L87 Difference]: Start difference. First operand 100 states and 107 transitions. Second operand has 24 states, 24 states have (on average 3.5416666666666665) internal successors, (85), 20 states have internal predecessors, (85), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) [2024-11-17 00:46:29,974 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-17 00:46:33,989 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-17 00:46:38,003 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-17 00:46:42,017 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-17 00:46:46,047 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-17 00:46:50,057 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-17 00:46:54,104 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-17 00:46:58,113 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-17 00:47:02,129 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-17 00:47:02,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:47:02,388 INFO L93 Difference]: Finished difference Result 99 states and 105 transitions. [2024-11-17 00:47:02,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-17 00:47:02,389 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.5416666666666665) internal successors, (85), 20 states have internal predecessors, (85), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) Word has length 58 [2024-11-17 00:47:02,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:47:02,389 INFO L225 Difference]: With dead ends: 99 [2024-11-17 00:47:02,389 INFO L226 Difference]: Without dead ends: 99 [2024-11-17 00:47:02,390 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 107 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=118, Invalid=874, Unknown=0, NotChecked=0, Total=992 [2024-11-17 00:47:02,391 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 116 mSDsluCounter, 958 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 3 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 36.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 1025 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 36.3s IncrementalHoareTripleChecker+Time [2024-11-17 00:47:02,391 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 1025 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 480 Invalid, 9 Unknown, 0 Unchecked, 36.3s Time] [2024-11-17 00:47:02,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-17 00:47:02,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-11-17 00:47:02,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 79 states have (on average 1.2531645569620253) internal successors, (99), 93 states have internal predecessors, (99), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 00:47:02,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 105 transitions. [2024-11-17 00:47:02,417 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 105 transitions. Word has length 58 [2024-11-17 00:47:02,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:47:02,417 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 105 transitions. [2024-11-17 00:47:02,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.5416666666666665) internal successors, (85), 20 states have internal predecessors, (85), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) [2024-11-17 00:47:02,418 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 105 transitions. [2024-11-17 00:47:02,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-17 00:47:02,419 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:47:02,419 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:47:02,441 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-17 00:47:02,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-17 00:47:02,620 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 38 more)] === [2024-11-17 00:47:02,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:47:02,621 INFO L85 PathProgramCache]: Analyzing trace with hash -2036972171, now seen corresponding path program 1 times [2024-11-17 00:47:02,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:47:02,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996260231] [2024-11-17 00:47:02,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:47:02,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:47:02,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:03,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-17 00:47:03,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:03,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-17 00:47:03,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:03,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-17 00:47:03,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:04,058 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 21 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-17 00:47:04,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:47:04,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996260231] [2024-11-17 00:47:04,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996260231] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:47:04,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [511973441] [2024-11-17 00:47:04,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:47:04,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:47:04,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:47:04,061 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 00:47:04,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-17 00:47:04,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:04,348 INFO L255 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 92 conjuncts are in the unsatisfiable core [2024-11-17 00:47:04,352 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:47:04,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-17 00:47:04,639 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-17 00:47:04,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-17 00:47:04,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-17 00:47:04,845 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-17 00:47:04,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-11-17 00:47:05,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2024-11-17 00:47:05,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-17 00:47:05,295 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|node_create_~temp~0#1.base| Int)) (and (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.base| |node_create_~temp~0#1.base|))) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1)))) (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9|) 0) 0))) is different from true [2024-11-17 00:47:05,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:47:05,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 27 [2024-11-17 00:47:05,358 INFO L349 Elim1Store]: treesize reduction 72, result has 37.4 percent of original size [2024-11-17 00:47:05,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 34 treesize of output 57 [2024-11-17 00:47:05,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 38 [2024-11-17 00:47:05,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-11-17 00:47:05,905 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 26 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-11-17 00:47:05,905 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:47:06,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [511973441] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:47:06,112 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:47:06,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 48 [2024-11-17 00:47:06,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438066550] [2024-11-17 00:47:06,113 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:47:06,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-11-17 00:47:06,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:47:06,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-11-17 00:47:06,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=2462, Unknown=1, NotChecked=100, Total=2756 [2024-11-17 00:47:06,115 INFO L87 Difference]: Start difference. First operand 99 states and 105 transitions. Second operand has 49 states, 46 states have (on average 2.239130434782609) internal successors, (103), 42 states have internal predecessors, (103), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-17 00:47:07,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:47:07,428 INFO L93 Difference]: Finished difference Result 112 states and 123 transitions. [2024-11-17 00:47:07,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-17 00:47:07,429 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 46 states have (on average 2.239130434782609) internal successors, (103), 42 states have internal predecessors, (103), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 60 [2024-11-17 00:47:07,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:47:07,429 INFO L225 Difference]: With dead ends: 112 [2024-11-17 00:47:07,429 INFO L226 Difference]: Without dead ends: 112 [2024-11-17 00:47:07,431 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1241 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=341, Invalid=4354, Unknown=1, NotChecked=134, Total=4830 [2024-11-17 00:47:07,431 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 78 mSDsluCounter, 915 mSDsCounter, 0 mSdLazyCounter, 1321 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 976 SdHoareTripleChecker+Invalid, 1452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 120 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-17 00:47:07,431 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 976 Invalid, 1452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1321 Invalid, 0 Unknown, 120 Unchecked, 0.8s Time] [2024-11-17 00:47:07,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-17 00:47:07,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 102. [2024-11-17 00:47:07,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 82 states have (on average 1.2560975609756098) internal successors, (103), 96 states have internal predecessors, (103), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 00:47:07,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 109 transitions. [2024-11-17 00:47:07,435 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 109 transitions. Word has length 60 [2024-11-17 00:47:07,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:47:07,436 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 109 transitions. [2024-11-17 00:47:07,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 46 states have (on average 2.239130434782609) internal successors, (103), 42 states have internal predecessors, (103), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-17 00:47:07,436 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 109 transitions. [2024-11-17 00:47:07,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-17 00:47:07,437 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:47:07,437 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:47:07,456 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-17 00:47:07,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:47:07,637 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 38 more)] === [2024-11-17 00:47:07,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:47:07,638 INFO L85 PathProgramCache]: Analyzing trace with hash -2036972170, now seen corresponding path program 1 times [2024-11-17 00:47:07,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:47:07,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445497527] [2024-11-17 00:47:07,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:47:07,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:47:07,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:08,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-17 00:47:08,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:08,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-17 00:47:08,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:08,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-17 00:47:08,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:09,396 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 19 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-17 00:47:09,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:47:09,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445497527] [2024-11-17 00:47:09,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445497527] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:47:09,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2036115282] [2024-11-17 00:47:09,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:47:09,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:47:09,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:47:09,399 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 00:47:09,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-17 00:47:09,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:09,879 INFO L255 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 118 conjuncts are in the unsatisfiable core [2024-11-17 00:47:09,882 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:47:09,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-17 00:47:09,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-17 00:47:10,271 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-17 00:47:10,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-17 00:47:10,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-17 00:47:10,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-17 00:47:10,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-17 00:47:10,473 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-17 00:47:10,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 52 [2024-11-17 00:47:10,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-17 00:47:10,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 19 [2024-11-17 00:47:10,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-11-17 00:47:10,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-17 00:47:10,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-17 00:47:10,943 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.offset| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.base| |node_create_~temp~0#1.base|))))) (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) 0) 0))) is different from true [2024-11-17 00:47:10,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:47:10,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 34 [2024-11-17 00:47:10,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:47:10,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2024-11-17 00:47:10,986 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-17 00:47:10,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2024-11-17 00:47:10,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-17 00:47:11,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 28 [2024-11-17 00:47:11,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-17 00:47:11,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-17 00:47:11,241 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-11-17 00:47:11,241 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:47:11,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2036115282] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:47:11,680 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:47:11,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26] total 50 [2024-11-17 00:47:11,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448389624] [2024-11-17 00:47:11,680 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:47:11,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2024-11-17 00:47:11,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:47:11,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2024-11-17 00:47:11,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=2889, Unknown=1, NotChecked=108, Total=3192 [2024-11-17 00:47:11,682 INFO L87 Difference]: Start difference. First operand 102 states and 109 transitions. Second operand has 51 states, 48 states have (on average 2.1666666666666665) internal successors, (104), 44 states have internal predecessors, (104), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-17 00:47:13,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:47:13,592 INFO L93 Difference]: Finished difference Result 112 states and 120 transitions. [2024-11-17 00:47:13,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-17 00:47:13,593 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 48 states have (on average 2.1666666666666665) internal successors, (104), 44 states have internal predecessors, (104), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 60 [2024-11-17 00:47:13,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:47:13,594 INFO L225 Difference]: With dead ends: 112 [2024-11-17 00:47:13,594 INFO L226 Difference]: Without dead ends: 112 [2024-11-17 00:47:13,595 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1612 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=397, Invalid=5458, Unknown=1, NotChecked=150, Total=6006 [2024-11-17 00:47:13,596 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 74 mSDsluCounter, 1288 mSDsCounter, 0 mSdLazyCounter, 1795 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 1354 SdHoareTripleChecker+Invalid, 1923 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 117 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:47:13,596 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 1354 Invalid, 1923 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1795 Invalid, 0 Unknown, 117 Unchecked, 1.0s Time] [2024-11-17 00:47:13,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-17 00:47:13,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 104. [2024-11-17 00:47:13,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 84 states have (on average 1.25) internal successors, (105), 98 states have internal predecessors, (105), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 00:47:13,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 111 transitions. [2024-11-17 00:47:13,599 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 111 transitions. Word has length 60 [2024-11-17 00:47:13,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:47:13,599 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 111 transitions. [2024-11-17 00:47:13,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 48 states have (on average 2.1666666666666665) internal successors, (104), 44 states have internal predecessors, (104), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-17 00:47:13,600 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 111 transitions. [2024-11-17 00:47:13,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-17 00:47:13,600 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:47:13,600 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:47:13,620 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-17 00:47:13,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:47:13,801 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 38 more)] === [2024-11-17 00:47:13,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:47:13,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1935147841, now seen corresponding path program 1 times [2024-11-17 00:47:13,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:47:13,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420466650] [2024-11-17 00:47:13,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:47:13,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:47:13,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:14,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-17 00:47:14,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:14,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-17 00:47:14,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:14,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-17 00:47:14,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:14,033 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-17 00:47:14,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:47:14,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420466650] [2024-11-17 00:47:14,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420466650] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:47:14,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:47:14,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-17 00:47:14,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338809488] [2024-11-17 00:47:14,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:47:14,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-17 00:47:14,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:47:14,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-17 00:47:14,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-17 00:47:14,036 INFO L87 Difference]: Start difference. First operand 104 states and 111 transitions. Second operand has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:47:14,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:47:14,205 INFO L93 Difference]: Finished difference Result 112 states and 120 transitions. [2024-11-17 00:47:14,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-17 00:47:14,205 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 65 [2024-11-17 00:47:14,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:47:14,206 INFO L225 Difference]: With dead ends: 112 [2024-11-17 00:47:14,206 INFO L226 Difference]: Without dead ends: 112 [2024-11-17 00:47:14,207 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-17 00:47:14,207 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 43 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:47:14,207 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 453 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:47:14,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-17 00:47:14,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 106. [2024-11-17 00:47:14,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 87 states have (on average 1.2528735632183907) internal successors, (109), 100 states have internal predecessors, (109), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 00:47:14,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 115 transitions. [2024-11-17 00:47:14,212 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 115 transitions. Word has length 65 [2024-11-17 00:47:14,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:47:14,212 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 115 transitions. [2024-11-17 00:47:14,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:47:14,212 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 115 transitions. [2024-11-17 00:47:14,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-17 00:47:14,213 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:47:14,213 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:47:14,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-17 00:47:14,213 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 38 more)] === [2024-11-17 00:47:14,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:47:14,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1935147840, now seen corresponding path program 1 times [2024-11-17 00:47:14,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:47:14,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142200771] [2024-11-17 00:47:14,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:47:14,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:47:14,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:14,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-17 00:47:14,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:14,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-17 00:47:14,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:14,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-17 00:47:14,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:14,659 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 16 proven. 7 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-17 00:47:14,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:47:14,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142200771] [2024-11-17 00:47:14,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142200771] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:47:14,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1596964538] [2024-11-17 00:47:14,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:47:14,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:47:14,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:47:14,662 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 00:47:14,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-17 00:47:14,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:14,969 INFO L255 TraceCheckSpWp]: Trace formula consists of 518 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-17 00:47:14,971 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:47:14,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-17 00:47:15,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-17 00:47:15,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-17 00:47:15,257 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_18| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_18|) 0))) is different from true [2024-11-17 00:47:15,299 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-17 00:47:15,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-17 00:47:15,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-17 00:47:15,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-17 00:47:15,433 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 7 not checked. [2024-11-17 00:47:15,433 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:47:15,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1596964538] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:47:15,635 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:47:15,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 28 [2024-11-17 00:47:15,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539573519] [2024-11-17 00:47:15,635 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:47:15,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-17 00:47:15,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:47:15,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-17 00:47:15,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=912, Unknown=1, NotChecked=60, Total=1056 [2024-11-17 00:47:15,636 INFO L87 Difference]: Start difference. First operand 106 states and 115 transitions. Second operand has 29 states, 27 states have (on average 3.4074074074074074) internal successors, (92), 25 states have internal predecessors, (92), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-17 00:47:16,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:47:16,356 INFO L93 Difference]: Finished difference Result 114 states and 122 transitions. [2024-11-17 00:47:16,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-17 00:47:16,357 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 27 states have (on average 3.4074074074074074) internal successors, (92), 25 states have internal predecessors, (92), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 65 [2024-11-17 00:47:16,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:47:16,358 INFO L225 Difference]: With dead ends: 114 [2024-11-17 00:47:16,358 INFO L226 Difference]: Without dead ends: 114 [2024-11-17 00:47:16,358 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=180, Invalid=1985, Unknown=1, NotChecked=90, Total=2256 [2024-11-17 00:47:16,359 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 94 mSDsluCounter, 990 mSDsCounter, 0 mSdLazyCounter, 1117 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 1043 SdHoareTripleChecker+Invalid, 1224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 102 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-17 00:47:16,359 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 1043 Invalid, 1224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1117 Invalid, 0 Unknown, 102 Unchecked, 0.5s Time] [2024-11-17 00:47:16,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-17 00:47:16,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 108. [2024-11-17 00:47:16,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 89 states have (on average 1.247191011235955) internal successors, (111), 102 states have internal predecessors, (111), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 00:47:16,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 117 transitions. [2024-11-17 00:47:16,366 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 117 transitions. Word has length 65 [2024-11-17 00:47:16,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:47:16,366 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 117 transitions. [2024-11-17 00:47:16,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 27 states have (on average 3.4074074074074074) internal successors, (92), 25 states have internal predecessors, (92), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-17 00:47:16,366 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 117 transitions. [2024-11-17 00:47:16,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-17 00:47:16,367 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:47:16,367 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:47:16,385 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-11-17 00:47:16,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-17 00:47:16,572 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 38 more)] === [2024-11-17 00:47:16,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:47:16,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1350107696, now seen corresponding path program 2 times [2024-11-17 00:47:16,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:47:16,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926277284] [2024-11-17 00:47:16,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:47:16,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:47:16,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:18,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-17 00:47:18,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:18,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-17 00:47:18,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:19,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-17 00:47:19,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:19,374 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 9 proven. 33 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-17 00:47:19,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:47:19,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926277284] [2024-11-17 00:47:19,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926277284] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:47:19,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [894400148] [2024-11-17 00:47:19,375 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 00:47:19,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:47:19,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:47:19,376 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 00:47:19,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-17 00:47:19,664 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-17 00:47:19,664 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 00:47:19,672 INFO L255 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 124 conjuncts are in the unsatisfiable core [2024-11-17 00:47:19,688 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:47:19,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-17 00:47:19,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-17 00:47:20,169 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-17 00:47:20,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-17 00:47:20,182 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-17 00:47:20,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-17 00:47:20,202 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-17 00:47:20,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-17 00:47:20,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-17 00:47:20,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-17 00:47:20,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-11-17 00:47:20,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-11-17 00:47:20,508 INFO L349 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2024-11-17 00:47:20,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 104 treesize of output 61 [2024-11-17 00:47:20,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 29 [2024-11-17 00:47:20,911 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-11-17 00:47:20,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 109 treesize of output 34 [2024-11-17 00:47:20,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2024-11-17 00:47:20,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-17 00:47:20,952 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.offset| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.base| |node_create_~temp~0#1.base|))))) is different from true [2024-11-17 00:47:20,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:47:20,978 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-11-17 00:47:20,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 117 treesize of output 84 [2024-11-17 00:47:20,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:47:20,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:47:20,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 45 [2024-11-17 00:47:20,998 INFO L349 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2024-11-17 00:47:20,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 36 [2024-11-17 00:47:21,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 82 [2024-11-17 00:47:21,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 62 [2024-11-17 00:47:21,605 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 8 proven. 26 refuted. 0 times theorem prover too weak. 5 trivial. 6 not checked. [2024-11-17 00:47:21,605 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:47:22,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [894400148] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:47:22,085 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:47:22,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 29] total 57 [2024-11-17 00:47:22,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494132614] [2024-11-17 00:47:22,085 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:47:22,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2024-11-17 00:47:22,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:47:22,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2024-11-17 00:47:22,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=3600, Unknown=1, NotChecked=120, Total=3906 [2024-11-17 00:47:22,087 INFO L87 Difference]: Start difference. First operand 108 states and 117 transitions. Second operand has 57 states, 55 states have (on average 1.9090909090909092) internal successors, (105), 51 states have internal predecessors, (105), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-17 00:47:23,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:47:23,962 INFO L93 Difference]: Finished difference Result 136 states and 150 transitions. [2024-11-17 00:47:23,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-17 00:47:23,963 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 55 states have (on average 1.9090909090909092) internal successors, (105), 51 states have internal predecessors, (105), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 65 [2024-11-17 00:47:23,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:47:23,964 INFO L225 Difference]: With dead ends: 136 [2024-11-17 00:47:23,964 INFO L226 Difference]: Without dead ends: 136 [2024-11-17 00:47:23,966 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1313 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=310, Invalid=6335, Unknown=1, NotChecked=160, Total=6806 [2024-11-17 00:47:23,966 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 12 mSDsluCounter, 1895 mSDsCounter, 0 mSdLazyCounter, 1889 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1958 SdHoareTripleChecker+Invalid, 2020 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 121 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:47:23,967 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1958 Invalid, 2020 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1889 Invalid, 0 Unknown, 121 Unchecked, 1.0s Time] [2024-11-17 00:47:23,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-17 00:47:23,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 133. [2024-11-17 00:47:23,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 112 states have (on average 1.2142857142857142) internal successors, (136), 125 states have internal predecessors, (136), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-17 00:47:23,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 146 transitions. [2024-11-17 00:47:23,972 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 146 transitions. Word has length 65 [2024-11-17 00:47:23,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:47:23,972 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 146 transitions. [2024-11-17 00:47:23,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 55 states have (on average 1.9090909090909092) internal successors, (105), 51 states have internal predecessors, (105), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-17 00:47:23,973 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 146 transitions. [2024-11-17 00:47:23,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-17 00:47:23,973 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:47:23,973 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:47:23,991 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-17 00:47:24,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:47:24,174 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 38 more)] === [2024-11-17 00:47:24,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:47:24,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1355472435, now seen corresponding path program 1 times [2024-11-17 00:47:24,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:47:24,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880027469] [2024-11-17 00:47:24,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:47:24,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:47:24,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:24,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-17 00:47:24,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:24,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-17 00:47:24,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:24,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-17 00:47:24,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:24,585 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 16 proven. 7 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-17 00:47:24,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:47:24,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880027469] [2024-11-17 00:47:24,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880027469] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:47:24,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1834925346] [2024-11-17 00:47:24,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:47:24,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:47:24,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:47:24,586 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 00:47:24,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-17 00:47:24,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:24,883 INFO L255 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-17 00:47:24,884 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:47:25,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-17 00:47:25,025 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 25 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-17 00:47:25,025 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:47:25,078 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 16 proven. 7 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-17 00:47:25,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1834925346] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:47:25,078 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:47:25,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 11] total 22 [2024-11-17 00:47:25,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135773475] [2024-11-17 00:47:25,078 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:47:25,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-17 00:47:25,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:47:25,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-17 00:47:25,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=418, Unknown=0, NotChecked=0, Total=462 [2024-11-17 00:47:25,080 INFO L87 Difference]: Start difference. First operand 133 states and 146 transitions. Second operand has 22 states, 22 states have (on average 3.727272727272727) internal successors, (82), 19 states have internal predecessors, (82), 3 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-17 00:47:29,102 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]