./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/sll2c_prepend_unequal.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/sll2c_prepend_unequal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --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 f2f6ef7968fa573a7da88ae0a516f1d800f437d82b0fa75227e8d7d318952eb1 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 00:47:41,534 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 00:47:41,596 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-17 00:47:41,603 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 00:47:41,605 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 00:47:41,629 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 00:47:41,630 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 00:47:41,630 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 00:47:41,631 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 00:47:41,631 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 00:47:41,631 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 00:47:41,631 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 00:47:41,633 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 00:47:41,634 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 00:47:41,634 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 00:47:41,635 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 00:47:41,635 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 00:47:41,635 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 00:47:41,635 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 00:47:41,636 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 00:47:41,636 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-17 00:47:41,640 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-17 00:47:41,640 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-17 00:47:41,641 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 00:47:41,641 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 00:47:41,641 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 00:47:41,641 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 00:47:41,641 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 00:47:41,641 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 00:47:41,642 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 00:47:41,642 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 00:47:41,642 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 00:47:41,642 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 00:47:41,642 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 00:47:41,643 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 00:47:41,643 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 00:47:41,643 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 00:47:41,643 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-17 00:47:41,643 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 00:47:41,643 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 00:47:41,644 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 00:47:41,646 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 00:47:41,646 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 -> f2f6ef7968fa573a7da88ae0a516f1d800f437d82b0fa75227e8d7d318952eb1 [2024-11-17 00:47:41,880 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 00:47:41,901 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 00:47:41,903 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 00:47:41,904 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 00:47:41,905 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 00:47:41,906 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i [2024-11-17 00:47:43,392 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 00:47:43,628 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 00:47:43,632 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i [2024-11-17 00:47:43,645 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b2da5a25/8ff755d06fba45bfad51347130af2004/FLAG6f0318aac [2024-11-17 00:47:43,972 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b2da5a25/8ff755d06fba45bfad51347130af2004 [2024-11-17 00:47:43,974 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 00:47:43,975 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 00:47:43,976 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 00:47:43,976 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 00:47:43,986 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 00:47:43,987 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:47:43" (1/1) ... [2024-11-17 00:47:43,988 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26b17a21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:47:43, skipping insertion in model container [2024-11-17 00:47:43,988 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:47:43" (1/1) ... [2024-11-17 00:47:44,013 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 00:47:44,255 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:47:44,263 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 00:47:44,293 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:47:44,339 INFO L204 MainTranslator]: Completed translation [2024-11-17 00:47:44,342 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:47:44 WrapperNode [2024-11-17 00:47:44,342 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 00:47:44,343 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 00:47:44,343 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 00:47:44,343 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 00:47:44,349 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:47:44" (1/1) ... [2024-11-17 00:47:44,364 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:47:44" (1/1) ... [2024-11-17 00:47:44,400 INFO L138 Inliner]: procedures = 127, calls = 46, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 153 [2024-11-17 00:47:44,400 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 00:47:44,401 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 00:47:44,401 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 00:47:44,401 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 00:47:44,409 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:47:44" (1/1) ... [2024-11-17 00:47:44,409 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:47:44" (1/1) ... [2024-11-17 00:47:44,412 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:47:44" (1/1) ... [2024-11-17 00:47:44,430 INFO L175 MemorySlicer]: Split 27 memory accesses to 3 slices as follows [2, 10, 15]. 56 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 9 writes are split as follows [0, 2, 7]. [2024-11-17 00:47:44,431 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:47:44" (1/1) ... [2024-11-17 00:47:44,431 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:47:44" (1/1) ... [2024-11-17 00:47:44,438 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:47:44" (1/1) ... [2024-11-17 00:47:44,439 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:47:44" (1/1) ... [2024-11-17 00:47:44,440 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:47:44" (1/1) ... [2024-11-17 00:47:44,441 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:47:44" (1/1) ... [2024-11-17 00:47:44,444 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 00:47:44,445 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 00:47:44,445 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 00:47:44,445 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 00:47:44,446 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:47:44" (1/1) ... [2024-11-17 00:47:44,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 00:47:44,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:47:44,483 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:47:44,489 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:47:44,523 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-17 00:47:44,524 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-17 00:47:44,524 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-17 00:47:44,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-17 00:47:44,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-17 00:47:44,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-17 00:47:44,524 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-17 00:47:44,524 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-17 00:47:44,524 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-17 00:47:44,524 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 00:47:44,524 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-17 00:47:44,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-17 00:47:44,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-17 00:47:44,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-17 00:47:44,525 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-17 00:47:44,525 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-17 00:47:44,525 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-17 00:47:44,525 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-17 00:47:44,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-17 00:47:44,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-17 00:47:44,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-17 00:47:44,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-17 00:47:44,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-17 00:47:44,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-17 00:47:44,526 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 00:47:44,526 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 00:47:44,632 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 00:47:44,634 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 00:47:45,056 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L624: 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:47:45,097 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:47:45,134 INFO L? ?]: Removed 142 outVars from TransFormulas that were not future-live. [2024-11-17 00:47:45,134 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 00:47:45,148 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 00:47:45,149 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 00:47:45,149 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:47:45 BoogieIcfgContainer [2024-11-17 00:47:45,149 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 00:47:45,151 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 00:47:45,151 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 00:47:45,154 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 00:47:45,154 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 12:47:43" (1/3) ... [2024-11-17 00:47:45,155 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ca6e611 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:47:45, skipping insertion in model container [2024-11-17 00:47:45,155 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:47:44" (2/3) ... [2024-11-17 00:47:45,155 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ca6e611 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:47:45, skipping insertion in model container [2024-11-17 00:47:45,155 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:47:45" (3/3) ... [2024-11-17 00:47:45,156 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_prepend_unequal.i [2024-11-17 00:47:45,170 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 00:47:45,171 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 56 error locations. [2024-11-17 00:47:45,207 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 00:47:45,213 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;@bccc519, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 00:47:45,213 INFO L334 AbstractCegarLoop]: Starting to check reachability of 56 error locations. [2024-11-17 00:47:45,217 INFO L276 IsEmpty]: Start isEmpty. Operand has 139 states, 78 states have (on average 1.9102564102564104) internal successors, (149), 134 states have internal predecessors, (149), 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:47:45,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-17 00:47:45,222 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:47:45,223 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-17 00:47:45,223 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2024-11-17 00:47:45,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:47:45,228 INFO L85 PathProgramCache]: Analyzing trace with hash 881823668, now seen corresponding path program 1 times [2024-11-17 00:47:45,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:47:45,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861650179] [2024-11-17 00:47:45,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:47:45,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:47:45,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:45,423 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:47:45,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:47:45,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861650179] [2024-11-17 00:47:45,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861650179] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:47:45,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:47:45,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 00:47:45,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142920409] [2024-11-17 00:47:45,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:47:45,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:47:45,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:47:45,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:47:45,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:47:45,510 INFO L87 Difference]: Start difference. First operand has 139 states, 78 states have (on average 1.9102564102564104) internal successors, (149), 134 states have internal predecessors, (149), 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) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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:47:45,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:47:45,617 INFO L93 Difference]: Finished difference Result 136 states and 146 transitions. [2024-11-17 00:47:45,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:47:45,620 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 6 [2024-11-17 00:47:45,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:47:45,626 INFO L225 Difference]: With dead ends: 136 [2024-11-17 00:47:45,626 INFO L226 Difference]: Without dead ends: 132 [2024-11-17 00:47:45,627 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:47:45,630 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 2 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:47:45,630 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 221 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:47:45,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-11-17 00:47:45,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2024-11-17 00:47:45,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 74 states have (on average 1.8243243243243243) internal successors, (135), 127 states have internal predecessors, (135), 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:47:45,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 141 transitions. [2024-11-17 00:47:45,662 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 141 transitions. Word has length 6 [2024-11-17 00:47:45,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:47:45,662 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 141 transitions. [2024-11-17 00:47:45,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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:47:45,662 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 141 transitions. [2024-11-17 00:47:45,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-17 00:47:45,663 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:47:45,663 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-17 00:47:45,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-17 00:47:45,663 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2024-11-17 00:47:45,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:47:45,664 INFO L85 PathProgramCache]: Analyzing trace with hash 881823669, now seen corresponding path program 1 times [2024-11-17 00:47:45,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:47:45,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513068116] [2024-11-17 00:47:45,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:47:45,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:47:45,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:45,751 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:47:45,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:47:45,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513068116] [2024-11-17 00:47:45,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513068116] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:47:45,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:47:45,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 00:47:45,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721900827] [2024-11-17 00:47:45,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:47:45,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:47:45,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:47:45,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:47:45,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:47:45,754 INFO L87 Difference]: Start difference. First operand 132 states and 141 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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:47:45,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:47:45,830 INFO L93 Difference]: Finished difference Result 130 states and 139 transitions. [2024-11-17 00:47:45,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:47:45,830 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 6 [2024-11-17 00:47:45,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:47:45,831 INFO L225 Difference]: With dead ends: 130 [2024-11-17 00:47:45,831 INFO L226 Difference]: Without dead ends: 130 [2024-11-17 00:47:45,832 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:47:45,833 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 2 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:47:45,833 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 223 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:47:45,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-17 00:47:45,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2024-11-17 00:47:45,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 74 states have (on average 1.7972972972972974) internal successors, (133), 125 states have internal predecessors, (133), 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:47:45,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 139 transitions. [2024-11-17 00:47:45,840 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 139 transitions. Word has length 6 [2024-11-17 00:47:45,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:47:45,840 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 139 transitions. [2024-11-17 00:47:45,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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:47:45,840 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 139 transitions. [2024-11-17 00:47:45,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-17 00:47:45,841 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:47:45,841 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:47:45,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-17 00:47:45,841 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2024-11-17 00:47:45,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:47:45,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1539739538, now seen corresponding path program 1 times [2024-11-17 00:47:45,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:47:45,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362086102] [2024-11-17 00:47:45,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:47:45,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:47:45,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:45,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:47:45,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:45,942 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:47:45,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:47:45,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362086102] [2024-11-17 00:47:45,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362086102] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:47:45,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:47:45,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:47:45,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820184298] [2024-11-17 00:47:45,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:47:45,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:47:45,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:47:45,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:47:45,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:47:45,946 INFO L87 Difference]: Start difference. First operand 130 states and 139 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 00:47:46,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:47:46,039 INFO L93 Difference]: Finished difference Result 138 states and 148 transitions. [2024-11-17 00:47:46,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 00:47:46,040 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-11-17 00:47:46,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:47:46,041 INFO L225 Difference]: With dead ends: 138 [2024-11-17 00:47:46,041 INFO L226 Difference]: Without dead ends: 138 [2024-11-17 00:47:46,041 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:47:46,042 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 5 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:47:46,042 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 322 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:47:46,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-17 00:47:46,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 132. [2024-11-17 00:47:46,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 76 states have (on average 1.7763157894736843) internal successors, (135), 127 states have internal predecessors, (135), 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:47:46,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 141 transitions. [2024-11-17 00:47:46,049 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 141 transitions. Word has length 14 [2024-11-17 00:47:46,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:47:46,049 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 141 transitions. [2024-11-17 00:47:46,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 00:47:46,050 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 141 transitions. [2024-11-17 00:47:46,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-17 00:47:46,050 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:47:46,050 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:47:46,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-17 00:47:46,051 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2024-11-17 00:47:46,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:47:46,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1551435605, now seen corresponding path program 1 times [2024-11-17 00:47:46,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:47:46,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481662134] [2024-11-17 00:47:46,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:47:46,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:47:46,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:46,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:47:46,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:46,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-17 00:47:46,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:46,175 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-17 00:47:46,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:47:46,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481662134] [2024-11-17 00:47:46,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481662134] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:47:46,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:47:46,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 00:47:46,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455305347] [2024-11-17 00:47:46,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:47:46,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 00:47:46,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:47:46,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 00:47:46,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-17 00:47:46,177 INFO L87 Difference]: Start difference. First operand 132 states and 141 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 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:47:46,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:47:46,369 INFO L93 Difference]: Finished difference Result 131 states and 140 transitions. [2024-11-17 00:47:46,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 00:47:46,370 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 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 23 [2024-11-17 00:47:46,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:47:46,371 INFO L225 Difference]: With dead ends: 131 [2024-11-17 00:47:46,371 INFO L226 Difference]: Without dead ends: 131 [2024-11-17 00:47:46,371 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 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:47:46,372 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 2 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:47:46,372 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 472 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:47:46,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-17 00:47:46,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2024-11-17 00:47:46,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 76 states have (on average 1.763157894736842) internal successors, (134), 126 states have internal predecessors, (134), 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:47:46,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 140 transitions. [2024-11-17 00:47:46,378 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 140 transitions. Word has length 23 [2024-11-17 00:47:46,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:47:46,378 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 140 transitions. [2024-11-17 00:47:46,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 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:47:46,378 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 140 transitions. [2024-11-17 00:47:46,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-17 00:47:46,379 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:47:46,379 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:47:46,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-17 00:47:46,379 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2024-11-17 00:47:46,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:47:46,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1551435604, now seen corresponding path program 1 times [2024-11-17 00:47:46,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:47:46,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282433740] [2024-11-17 00:47:46,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:47:46,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:47:46,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:46,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:47:46,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:46,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-17 00:47:46,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:46,604 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-17 00:47:46,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:47:46,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282433740] [2024-11-17 00:47:46,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282433740] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:47:46,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:47:46,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 00:47:46,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506073517] [2024-11-17 00:47:46,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:47:46,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 00:47:46,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:47:46,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 00:47:46,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-17 00:47:46,608 INFO L87 Difference]: Start difference. First operand 131 states and 140 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 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:47:46,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:47:46,820 INFO L93 Difference]: Finished difference Result 130 states and 139 transitions. [2024-11-17 00:47:46,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 00:47:46,821 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 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 23 [2024-11-17 00:47:46,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:47:46,823 INFO L225 Difference]: With dead ends: 130 [2024-11-17 00:47:46,823 INFO L226 Difference]: Without dead ends: 130 [2024-11-17 00:47:46,823 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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:47:46,824 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 1 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:47:46,826 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 504 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:47:46,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-17 00:47:46,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2024-11-17 00:47:46,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 76 states have (on average 1.75) internal successors, (133), 125 states have internal predecessors, (133), 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:47:46,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 139 transitions. [2024-11-17 00:47:46,837 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 139 transitions. Word has length 23 [2024-11-17 00:47:46,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:47:46,837 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 139 transitions. [2024-11-17 00:47:46,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 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:47:46,838 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 139 transitions. [2024-11-17 00:47:46,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-17 00:47:46,838 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:47:46,838 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:47:46,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-17 00:47:46,838 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2024-11-17 00:47:46,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:47:46,839 INFO L85 PathProgramCache]: Analyzing trace with hash 551859050, now seen corresponding path program 1 times [2024-11-17 00:47:46,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:47:46,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239047734] [2024-11-17 00:47:46,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:47:46,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:47:46,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:47,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:47:47,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:47,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-17 00:47:47,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:47,195 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-17 00:47:47,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:47:47,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239047734] [2024-11-17 00:47:47,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239047734] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:47:47,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1646870163] [2024-11-17 00:47:47,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:47:47,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:47:47,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:47:47,198 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:47:47,207 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:47:47,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:47,366 INFO L255 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-17 00:47:47,371 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:47:47,423 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:47,477 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:47:47,539 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-17 00:47:47,540 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 19 treesize of output 16 [2024-11-17 00:47:47,556 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 6 not checked. [2024-11-17 00:47:47,556 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:47:47,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1646870163] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:47:47,612 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:47:47,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2024-11-17 00:47:47,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632789773] [2024-11-17 00:47:47,613 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:47:47,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-17 00:47:47,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:47:47,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-17 00:47:47,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=87, Unknown=1, NotChecked=18, Total=132 [2024-11-17 00:47:47,615 INFO L87 Difference]: Start difference. First operand 130 states and 139 transitions. Second operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 8 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-17 00:47:47,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:47:47,860 INFO L93 Difference]: Finished difference Result 129 states and 138 transitions. [2024-11-17 00:47:47,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 00:47:47,861 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 8 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2024-11-17 00:47:47,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:47:47,861 INFO L225 Difference]: With dead ends: 129 [2024-11-17 00:47:47,862 INFO L226 Difference]: Without dead ends: 129 [2024-11-17 00:47:47,862 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=124, Unknown=1, NotChecked=22, Total=182 [2024-11-17 00:47:47,862 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 0 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 130 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:47:47,863 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 622 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 435 Invalid, 0 Unknown, 130 Unchecked, 0.2s Time] [2024-11-17 00:47:47,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-11-17 00:47:47,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2024-11-17 00:47:47,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 76 states have (on average 1.736842105263158) internal successors, (132), 124 states have internal predecessors, (132), 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:47:47,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 138 transitions. [2024-11-17 00:47:47,867 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 138 transitions. Word has length 27 [2024-11-17 00:47:47,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:47:47,867 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 138 transitions. [2024-11-17 00:47:47,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 8 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-17 00:47:47,867 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 138 transitions. [2024-11-17 00:47:47,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-17 00:47:47,868 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:47:47,868 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:47:47,885 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-17 00:47:48,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-17 00:47:48,069 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2024-11-17 00:47:48,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:47:48,070 INFO L85 PathProgramCache]: Analyzing trace with hash 551859051, now seen corresponding path program 1 times [2024-11-17 00:47:48,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:47:48,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822522764] [2024-11-17 00:47:48,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:47:48,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:47:48,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:48,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:47:48,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:48,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-17 00:47:48,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:48,384 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-17 00:47:48,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:47:48,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822522764] [2024-11-17 00:47:48,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822522764] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:47:48,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [267535327] [2024-11-17 00:47:48,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:47:48,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:47:48,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:47:48,387 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:47:48,390 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:47:48,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:48,477 INFO L255 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-17 00:47:48,479 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:47:48,487 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:48,654 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-17 00:47:48,655 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 14 treesize of output 13 [2024-11-17 00:47:48,698 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-17 00:47:48,702 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:47:48,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [267535327] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:47:48,845 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:47:48,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2024-11-17 00:47:48,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350361385] [2024-11-17 00:47:48,845 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:47:48,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-17 00:47:48,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:47:48,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-17 00:47:48,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2024-11-17 00:47:48,847 INFO L87 Difference]: Start difference. First operand 129 states and 138 transitions. Second operand has 18 states, 17 states have (on average 2.176470588235294) internal successors, (37), 14 states have internal predecessors, (37), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-17 00:47:49,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:47:49,264 INFO L93 Difference]: Finished difference Result 130 states and 140 transitions. [2024-11-17 00:47:49,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-17 00:47:49,264 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.176470588235294) internal successors, (37), 14 states have internal predecessors, (37), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 27 [2024-11-17 00:47:49,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:47:49,266 INFO L225 Difference]: With dead ends: 130 [2024-11-17 00:47:49,266 INFO L226 Difference]: Without dead ends: 130 [2024-11-17 00:47:49,266 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2024-11-17 00:47:49,268 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 6 mSDsluCounter, 828 mSDsCounter, 0 mSdLazyCounter, 649 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 954 SdHoareTripleChecker+Invalid, 657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-17 00:47:49,268 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 954 Invalid, 657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 649 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-17 00:47:49,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-17 00:47:49,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 128. [2024-11-17 00:47:49,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 76 states have (on average 1.7236842105263157) internal successors, (131), 123 states have internal predecessors, (131), 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:47:49,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 137 transitions. [2024-11-17 00:47:49,276 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 137 transitions. Word has length 27 [2024-11-17 00:47:49,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:47:49,276 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 137 transitions. [2024-11-17 00:47:49,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.176470588235294) internal successors, (37), 14 states have internal predecessors, (37), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-17 00:47:49,276 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 137 transitions. [2024-11-17 00:47:49,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-17 00:47:49,278 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:47:49,278 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:47:49,292 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:47:49,479 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,SelfDestructingSolverStorable6 [2024-11-17 00:47:49,479 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2024-11-17 00:47:49,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:47:49,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1946670723, now seen corresponding path program 1 times [2024-11-17 00:47:49,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:47:49,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649049354] [2024-11-17 00:47:49,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:47:49,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:47:49,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:49,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:47:49,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:49,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-17 00:47:49,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:49,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-17 00:47:49,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:49,794 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-17 00:47:49,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:47:49,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649049354] [2024-11-17 00:47:49,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649049354] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:47:49,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [708842737] [2024-11-17 00:47:49,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:47:49,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:47:49,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:47:49,796 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:47:49,797 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:47:49,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:49,900 INFO L255 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-17 00:47:49,902 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:47:49,904 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:49,948 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-17 00:47:49,948 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 14 treesize of output 13 [2024-11-17 00:47:49,999 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-17 00:47:50,000 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 18 treesize of output 17 [2024-11-17 00:47:50,114 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:47:50,129 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-17 00:47:50,129 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:47:50,136 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 12 not checked. [2024-11-17 00:47:50,137 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:47:50,557 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-17 00:47:50,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [708842737] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:47:50,558 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:47:50,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 13] total 26 [2024-11-17 00:47:50,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285623936] [2024-11-17 00:47:50,558 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:47:50,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-17 00:47:50,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:47:50,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-17 00:47:50,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=525, Unknown=1, NotChecked=48, Total=702 [2024-11-17 00:47:50,559 INFO L87 Difference]: Start difference. First operand 128 states and 137 transitions. Second operand has 27 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 22 states have internal predecessors, (73), 4 states have call successors, (9), 3 states have call predecessors, (9), 7 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) [2024-11-17 00:47:50,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:47:50,931 INFO L93 Difference]: Finished difference Result 140 states and 150 transitions. [2024-11-17 00:47:50,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 00:47:50,931 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 22 states have internal predecessors, (73), 4 states have call successors, (9), 3 states have call predecessors, (9), 7 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) Word has length 39 [2024-11-17 00:47:50,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:47:50,933 INFO L225 Difference]: With dead ends: 140 [2024-11-17 00:47:50,933 INFO L226 Difference]: Without dead ends: 140 [2024-11-17 00:47:50,934 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 58 SyntacticMatches, 8 SemanticMatches, 28 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=163, Invalid=652, Unknown=1, NotChecked=54, Total=870 [2024-11-17 00:47:50,935 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 312 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 142 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-17 00:47:50,935 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 512 Invalid, 736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 582 Invalid, 0 Unknown, 142 Unchecked, 0.3s Time] [2024-11-17 00:47:50,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-17 00:47:50,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 119. [2024-11-17 00:47:50,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 76 states have (on average 1.605263157894737) internal successors, (122), 114 states have internal predecessors, (122), 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:47:50,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 128 transitions. [2024-11-17 00:47:50,939 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 128 transitions. Word has length 39 [2024-11-17 00:47:50,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:47:50,939 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 128 transitions. [2024-11-17 00:47:50,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 22 states have internal predecessors, (73), 4 states have call successors, (9), 3 states have call predecessors, (9), 7 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) [2024-11-17 00:47:50,939 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 128 transitions. [2024-11-17 00:47:50,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-17 00:47:50,940 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:47:50,940 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:47:50,962 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:47:51,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:47:51,145 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2024-11-17 00:47:51,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:47:51,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1946670722, now seen corresponding path program 1 times [2024-11-17 00:47:51,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:47:51,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914844989] [2024-11-17 00:47:51,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:47:51,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:47:51,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:51,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:47:51,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:51,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-17 00:47:51,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:51,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-17 00:47:51,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:51,626 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-17 00:47:51,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:47:51,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914844989] [2024-11-17 00:47:51,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914844989] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:47:51,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1594485367] [2024-11-17 00:47:51,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:47:51,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:47:51,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:47:51,629 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:47:51,630 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:47:51,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:51,743 INFO L255 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-17 00:47:51,745 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:47:51,753 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:51,760 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:47:51,774 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:47:51,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:47:51,803 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:47:51,824 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:47:51,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:47:51,853 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:47:51,908 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:47:51,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:47:51,933 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:47:51,937 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-17 00:47:51,937 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:47:51,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1594485367] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:47:51,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-17 00:47:51,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [12] total 15 [2024-11-17 00:47:51,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54462662] [2024-11-17 00:47:51,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:47:51,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 00:47:51,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:47:51,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 00:47:51,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=167, Unknown=1, NotChecked=26, Total=240 [2024-11-17 00:47:51,939 INFO L87 Difference]: Start difference. First operand 119 states and 128 transitions. Second operand has 7 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-17 00:47:52,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:47:52,054 INFO L93 Difference]: Finished difference Result 113 states and 122 transitions. [2024-11-17 00:47:52,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 00:47:52,054 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 39 [2024-11-17 00:47:52,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:47:52,055 INFO L225 Difference]: With dead ends: 113 [2024-11-17 00:47:52,055 INFO L226 Difference]: Without dead ends: 113 [2024-11-17 00:47:52,056 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=191, Unknown=1, NotChecked=28, Total=272 [2024-11-17 00:47:52,056 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 22 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 148 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:47:52,056 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 345 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 180 Invalid, 0 Unknown, 148 Unchecked, 0.1s Time] [2024-11-17 00:47:52,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-17 00:47:52,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2024-11-17 00:47:52,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 76 states have (on average 1.5263157894736843) internal successors, (116), 108 states have internal predecessors, (116), 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:47:52,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 122 transitions. [2024-11-17 00:47:52,060 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 122 transitions. Word has length 39 [2024-11-17 00:47:52,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:47:52,060 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 122 transitions. [2024-11-17 00:47:52,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-17 00:47:52,060 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 122 transitions. [2024-11-17 00:47:52,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-17 00:47:52,061 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:47:52,061 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 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:52,074 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-17 00:47:52,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:47:52,262 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2024-11-17 00:47:52,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:47:52,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1675945497, now seen corresponding path program 1 times [2024-11-17 00:47:52,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:47:52,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384797296] [2024-11-17 00:47:52,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:47:52,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:47:52,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:52,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:47:52,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:52,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-17 00:47:52,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:52,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-17 00:47:52,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:52,354 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-17 00:47:52,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:47:52,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384797296] [2024-11-17 00:47:52,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384797296] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:47:52,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:47:52,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 00:47:52,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827117031] [2024-11-17 00:47:52,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:47:52,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 00:47:52,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:47:52,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 00:47:52,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-17 00:47:52,356 INFO L87 Difference]: Start difference. First operand 113 states and 122 transitions. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-17 00:47:52,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:47:52,505 INFO L93 Difference]: Finished difference Result 111 states and 120 transitions. [2024-11-17 00:47:52,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 00:47:52,505 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 42 [2024-11-17 00:47:52,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:47:52,506 INFO L225 Difference]: With dead ends: 111 [2024-11-17 00:47:52,506 INFO L226 Difference]: Without dead ends: 111 [2024-11-17 00:47:52,507 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:47:52,507 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 21 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:47:52,507 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 395 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:47:52,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-17 00:47:52,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-11-17 00:47:52,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 76 states have (on average 1.5) internal successors, (114), 106 states have internal predecessors, (114), 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:47:52,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 120 transitions. [2024-11-17 00:47:52,510 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 120 transitions. Word has length 42 [2024-11-17 00:47:52,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:47:52,510 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 120 transitions. [2024-11-17 00:47:52,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-17 00:47:52,511 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 120 transitions. [2024-11-17 00:47:52,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-17 00:47:52,511 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:47:52,511 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 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:52,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-17 00:47:52,512 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2024-11-17 00:47:52,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:47:52,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1675945498, now seen corresponding path program 1 times [2024-11-17 00:47:52,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:47:52,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182584834] [2024-11-17 00:47:52,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:47:52,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:47:52,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:52,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:47:52,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:52,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-17 00:47:52,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:52,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-17 00:47:52,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:52,762 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-17 00:47:52,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:47:52,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182584834] [2024-11-17 00:47:52,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182584834] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:47:52,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2133019710] [2024-11-17 00:47:52,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:47:52,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:47:52,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:47:52,768 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:47:52,769 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:47:52,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:52,898 INFO L255 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-17 00:47:52,900 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:47:52,913 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:53,038 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-17 00:47:53,038 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:47:53,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2133019710] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:47:53,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-17 00:47:53,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 15 [2024-11-17 00:47:53,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284189601] [2024-11-17 00:47:53,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:47:53,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 00:47:53,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:47:53,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 00:47:53,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2024-11-17 00:47:53,039 INFO L87 Difference]: Start difference. First operand 111 states and 120 transitions. Second operand has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-17 00:47:53,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:47:53,187 INFO L93 Difference]: Finished difference Result 109 states and 118 transitions. [2024-11-17 00:47:53,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 00:47:53,190 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 42 [2024-11-17 00:47:53,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:47:53,191 INFO L225 Difference]: With dead ends: 109 [2024-11-17 00:47:53,191 INFO L226 Difference]: Without dead ends: 109 [2024-11-17 00:47:53,191 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2024-11-17 00:47:53,192 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 20 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:47:53,192 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 365 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:47:53,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-17 00:47:53,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-11-17 00:47:53,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 76 states have (on average 1.4736842105263157) internal successors, (112), 104 states have internal predecessors, (112), 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:47:53,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 118 transitions. [2024-11-17 00:47:53,194 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 118 transitions. Word has length 42 [2024-11-17 00:47:53,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:47:53,194 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 118 transitions. [2024-11-17 00:47:53,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-17 00:47:53,194 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 118 transitions. [2024-11-17 00:47:53,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-17 00:47:53,195 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:47:53,195 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2024-11-17 00:47:53,209 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-17 00:47:53,398 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:47:53,399 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2024-11-17 00:47:53,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:47:53,399 INFO L85 PathProgramCache]: Analyzing trace with hash -29111785, now seen corresponding path program 1 times [2024-11-17 00:47:53,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:47:53,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030039949] [2024-11-17 00:47:53,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:47:53,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:47:53,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:53,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:47:53,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:53,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-17 00:47:53,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:53,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-17 00:47:53,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:53,696 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-17 00:47:53,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:47:53,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030039949] [2024-11-17 00:47:53,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030039949] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:47:53,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2053285190] [2024-11-17 00:47:53,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:47:53,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:47:53,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:47:53,698 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:47:53,705 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:47:53,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:53,850 INFO L255 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-17 00:47:53,853 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:47:53,865 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:53,869 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:53,937 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:47:53,944 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:47:54,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:47:54,087 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:47:54,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:47:54,106 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 12 treesize of output 14 [2024-11-17 00:47:54,278 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:47:54,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:47:54,283 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 11 treesize of output 7 [2024-11-17 00:47:54,385 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-17 00:47:54,385 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 14 treesize of output 13 [2024-11-17 00:47:54,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:47:54,418 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-17 00:47:54,419 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 16 treesize of output 18 [2024-11-17 00:47:54,552 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:47:54,586 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:47:54,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:47:54,632 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:47:54,687 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 12 not checked. [2024-11-17 00:47:54,687 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:47:54,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2053285190] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:47:54,797 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:47:54,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 24 [2024-11-17 00:47:54,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480467232] [2024-11-17 00:47:54,798 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:47:54,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-17 00:47:54,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:47:54,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-17 00:47:54,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=527, Unknown=1, NotChecked=46, Total=650 [2024-11-17 00:47:54,799 INFO L87 Difference]: Start difference. First operand 109 states and 118 transitions. Second operand has 24 states, 23 states have (on average 3.0) internal successors, (69), 18 states have internal predecessors, (69), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-17 00:47:55,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:47:55,451 INFO L93 Difference]: Finished difference Result 107 states and 116 transitions. [2024-11-17 00:47:55,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-17 00:47:55,452 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.0) internal successors, (69), 18 states have internal predecessors, (69), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 44 [2024-11-17 00:47:55,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:47:55,452 INFO L225 Difference]: With dead ends: 107 [2024-11-17 00:47:55,452 INFO L226 Difference]: Without dead ends: 107 [2024-11-17 00:47:55,453 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=168, Invalid=1025, Unknown=1, NotChecked=66, Total=1260 [2024-11-17 00:47:55,453 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 196 mSDsluCounter, 877 mSDsCounter, 0 mSdLazyCounter, 852 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 944 SdHoareTripleChecker+Invalid, 970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 110 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-17 00:47:55,454 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 944 Invalid, 970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 852 Invalid, 0 Unknown, 110 Unchecked, 0.4s Time] [2024-11-17 00:47:55,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-17 00:47:55,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 104. [2024-11-17 00:47:55,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 74 states have (on average 1.4324324324324325) internal successors, (106), 99 states have internal predecessors, (106), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 00:47:55,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 112 transitions. [2024-11-17 00:47:55,456 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 112 transitions. Word has length 44 [2024-11-17 00:47:55,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:47:55,456 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 112 transitions. [2024-11-17 00:47:55,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.0) internal successors, (69), 18 states have internal predecessors, (69), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-17 00:47:55,456 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 112 transitions. [2024-11-17 00:47:55,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-17 00:47:55,457 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:47:55,457 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2024-11-17 00:47:55,485 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:47:55,657 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:47:55,657 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2024-11-17 00:47:55,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:47:55,658 INFO L85 PathProgramCache]: Analyzing trace with hash 2382233, now seen corresponding path program 1 times [2024-11-17 00:47:55,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:47:55,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225836653] [2024-11-17 00:47:55,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:47:55,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:47:55,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:55,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:47:55,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:55,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-17 00:47:55,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:55,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-17 00:47:55,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:56,035 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-17 00:47:56,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:47:56,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225836653] [2024-11-17 00:47:56,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225836653] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:47:56,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1567182697] [2024-11-17 00:47:56,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:47:56,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:47:56,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:47:56,037 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:47:56,050 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:47:56,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:56,238 INFO L255 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-17 00:47:56,241 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:47:56,398 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:56,426 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:47:56,469 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2024-11-17 00:47:56,470 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:47:56,490 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:56,501 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-17 00:47:56,501 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:47:56,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1567182697] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:47:56,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-17 00:47:56,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [13] total 20 [2024-11-17 00:47:56,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612287524] [2024-11-17 00:47:56,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:47:56,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-17 00:47:56,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:47:56,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-17 00:47:56,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=333, Unknown=1, NotChecked=36, Total=420 [2024-11-17 00:47:56,503 INFO L87 Difference]: Start difference. First operand 104 states and 112 transitions. Second operand has 11 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-17 00:47:56,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:47:56,699 INFO L93 Difference]: Finished difference Result 105 states and 115 transitions. [2024-11-17 00:47:56,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-17 00:47:56,700 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 44 [2024-11-17 00:47:56,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:47:56,700 INFO L225 Difference]: With dead ends: 105 [2024-11-17 00:47:56,700 INFO L226 Difference]: Without dead ends: 105 [2024-11-17 00:47:56,701 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=444, Unknown=1, NotChecked=42, Total=552 [2024-11-17 00:47:56,701 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 28 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 181 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:47:56,701 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 432 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 267 Invalid, 0 Unknown, 181 Unchecked, 0.1s Time] [2024-11-17 00:47:56,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-17 00:47:56,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2024-11-17 00:47:56,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 76 states have (on average 1.4078947368421053) internal successors, (107), 99 states have internal predecessors, (107), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 00:47:56,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 113 transitions. [2024-11-17 00:47:56,705 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 113 transitions. Word has length 44 [2024-11-17 00:47:56,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:47:56,705 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 113 transitions. [2024-11-17 00:47:56,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-17 00:47:56,705 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 113 transitions. [2024-11-17 00:47:56,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-17 00:47:56,706 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:47:56,706 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2024-11-17 00:47:56,725 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:47:56,910 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:47:56,911 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2024-11-17 00:47:56,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:47:56,911 INFO L85 PathProgramCache]: Analyzing trace with hash 2382234, now seen corresponding path program 1 times [2024-11-17 00:47:56,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:47:56,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984412164] [2024-11-17 00:47:56,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:47:56,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:47:56,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:57,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:47:57,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:57,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-17 00:47:57,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:57,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-17 00:47:57,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:57,362 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-17 00:47:57,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:47:57,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984412164] [2024-11-17 00:47:57,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984412164] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:47:57,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1277863] [2024-11-17 00:47:57,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:47:57,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:47:57,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:47:57,365 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:47:57,366 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:47:57,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:57,533 INFO L255 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 62 conjuncts are in the unsatisfiable core [2024-11-17 00:47:57,535 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:47:57,567 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:57,843 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:57,849 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:57,902 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5| Int)) (= 0 (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) 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:47:57,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:47:57,969 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:57,979 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-17 00:47:57,979 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:58,075 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:58,153 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2024-11-17 00:47:58,153 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:47:58,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1277863] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:47:58,348 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:47:58,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 27 [2024-11-17 00:47:58,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787769170] [2024-11-17 00:47:58,348 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:47:58,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-17 00:47:58,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:47:58,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-17 00:47:58,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=850, Unknown=1, NotChecked=58, Total=992 [2024-11-17 00:47:58,349 INFO L87 Difference]: Start difference. First operand 104 states and 113 transitions. Second operand has 28 states, 26 states have (on average 2.6923076923076925) internal successors, (70), 24 states have internal predecessors, (70), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-17 00:47:59,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:47:59,205 INFO L93 Difference]: Finished difference Result 122 states and 131 transitions. [2024-11-17 00:47:59,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-17 00:47:59,205 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 2.6923076923076925) internal successors, (70), 24 states have internal predecessors, (70), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 44 [2024-11-17 00:47:59,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:47:59,206 INFO L225 Difference]: With dead ends: 122 [2024-11-17 00:47:59,206 INFO L226 Difference]: Without dead ends: 122 [2024-11-17 00:47:59,207 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=195, Invalid=2064, Unknown=1, NotChecked=92, Total=2352 [2024-11-17 00:47:59,207 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 123 mSDsluCounter, 1294 mSDsCounter, 0 mSdLazyCounter, 1175 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 1379 SdHoareTripleChecker+Invalid, 1304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 125 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-17 00:47:59,207 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 1379 Invalid, 1304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1175 Invalid, 0 Unknown, 125 Unchecked, 0.5s Time] [2024-11-17 00:47:59,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-17 00:47:59,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 119. [2024-11-17 00:47:59,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 90 states have (on average 1.3444444444444446) internal successors, (121), 113 states have internal predecessors, (121), 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:59,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 127 transitions. [2024-11-17 00:47:59,210 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 127 transitions. Word has length 44 [2024-11-17 00:47:59,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:47:59,210 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 127 transitions. [2024-11-17 00:47:59,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 2.6923076923076925) internal successors, (70), 24 states have internal predecessors, (70), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-17 00:47:59,210 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 127 transitions. [2024-11-17 00:47:59,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-17 00:47:59,210 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:47:59,210 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2024-11-17 00:47:59,230 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-17 00:47:59,411 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:47:59,411 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2024-11-17 00:47:59,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:47:59,411 INFO L85 PathProgramCache]: Analyzing trace with hash -2033165068, now seen corresponding path program 1 times [2024-11-17 00:47:59,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:47:59,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702157330] [2024-11-17 00:47:59,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:47:59,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:47:59,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:59,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:47:59,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:59,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-17 00:47:59,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:00,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-17 00:48:00,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:00,251 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-17 00:48:00,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:48:00,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702157330] [2024-11-17 00:48:00,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702157330] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:48:00,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [525189872] [2024-11-17 00:48:00,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:48:00,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:48:00,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:48:00,254 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:48:00,256 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:48:00,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:00,399 INFO L255 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 78 conjuncts are in the unsatisfiable core [2024-11-17 00:48:00,401 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:48:00,423 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:48:00,529 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-17 00:48:00,529 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:48:00,589 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:48:00,671 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-17 00:48:00,671 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:48:00,784 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 38 treesize of output 14 [2024-11-17 00:48:00,788 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:48:00,883 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#memory_$Pointer$#2.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.base|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1)))) is different from true [2024-11-17 00:48:00,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:48:00,901 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 46 treesize of output 35 [2024-11-17 00:48:00,925 INFO L349 Elim1Store]: treesize reduction 84, result has 37.8 percent of original size [2024-11-17 00:48:00,925 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 38 treesize of output 65 [2024-11-17 00:48:01,024 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 61 treesize of output 45 [2024-11-17 00:48:01,180 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:48:01,244 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:48:01,381 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-11-17 00:48:01,381 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:48:01,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [525189872] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:48:01,476 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:48:01,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 26] total 46 [2024-11-17 00:48:01,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342843252] [2024-11-17 00:48:01,476 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:48:01,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-11-17 00:48:01,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:48:01,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-11-17 00:48:01,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=2013, Unknown=1, NotChecked=90, Total=2256 [2024-11-17 00:48:01,478 INFO L87 Difference]: Start difference. First operand 119 states and 127 transitions. Second operand has 47 states, 43 states have (on average 1.930232558139535) internal successors, (83), 40 states have internal predecessors, (83), 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:48:02,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:48:02,583 INFO L93 Difference]: Finished difference Result 164 states and 180 transitions. [2024-11-17 00:48:02,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-17 00:48:02,583 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 43 states have (on average 1.930232558139535) internal successors, (83), 40 states have internal predecessors, (83), 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 50 [2024-11-17 00:48:02,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:48:02,585 INFO L225 Difference]: With dead ends: 164 [2024-11-17 00:48:02,585 INFO L226 Difference]: Without dead ends: 164 [2024-11-17 00:48:02,586 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 657 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=254, Invalid=3055, Unknown=1, NotChecked=112, Total=3422 [2024-11-17 00:48:02,586 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 226 mSDsluCounter, 1597 mSDsCounter, 0 mSdLazyCounter, 1635 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 1677 SdHoareTripleChecker+Invalid, 1806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 157 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-17 00:48:02,586 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 1677 Invalid, 1806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1635 Invalid, 0 Unknown, 157 Unchecked, 0.7s Time] [2024-11-17 00:48:02,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-11-17 00:48:02,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 142. [2024-11-17 00:48:02,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 111 states have (on average 1.3063063063063063) internal successors, (145), 134 states have internal predecessors, (145), 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:48:02,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 155 transitions. [2024-11-17 00:48:02,589 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 155 transitions. Word has length 50 [2024-11-17 00:48:02,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:48:02,590 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 155 transitions. [2024-11-17 00:48:02,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 43 states have (on average 1.930232558139535) internal successors, (83), 40 states have internal predecessors, (83), 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:48:02,590 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 155 transitions. [2024-11-17 00:48:02,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-17 00:48:02,590 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:48:02,591 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2024-11-17 00:48:02,603 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-17 00:48:02,794 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:48:02,795 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2024-11-17 00:48:02,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:48:02,795 INFO L85 PathProgramCache]: Analyzing trace with hash -2033165067, now seen corresponding path program 1 times [2024-11-17 00:48:02,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:48:02,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209328958] [2024-11-17 00:48:02,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:48:02,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:48:02,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:03,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:48:03,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:03,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-17 00:48:03,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:03,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-17 00:48:03,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:03,941 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-17 00:48:03,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:48:03,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209328958] [2024-11-17 00:48:03,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209328958] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:48:03,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1780299744] [2024-11-17 00:48:03,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:48:03,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:48:03,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:48:03,944 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:48:03,950 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:48:04,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:04,172 INFO L255 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 119 conjuncts are in the unsatisfiable core [2024-11-17 00:48:04,175 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:48:04,224 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:48:04,229 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:48:04,606 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-17 00:48:04,606 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 14 treesize of output 13 [2024-11-17 00:48:04,616 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-17 00:48:04,616 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:48:04,705 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:48:04,714 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:48:04,844 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-17 00:48: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 59 treesize of output 52 [2024-11-17 00:48:04,849 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:48:05,040 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:48:05,044 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:48:05,047 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:48:05,052 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:48:05,230 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_7| Int)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_7|) 0) 0)) (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#memory_$Pointer$#2.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.base|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= (store |c_old(#memory_$Pointer$#2.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.offset| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.offset|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|))))) is different from true [2024-11-17 00:48:05,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:48:05,262 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:48:05,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:48:05,269 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:48:05,281 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-17 00:48:05,281 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:48:05,284 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:48:05,563 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:48:05,619 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:48:05,622 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:48:05,699 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-11-17 00:48:05,699 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:48:06,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1780299744] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:48:06,149 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:48:06,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 50 [2024-11-17 00:48:06,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267874666] [2024-11-17 00:48:06,149 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:48:06,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2024-11-17 00:48:06,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:48:06,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2024-11-17 00:48:06,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=3029, Unknown=1, NotChecked=110, Total=3306 [2024-11-17 00:48:06,151 INFO L87 Difference]: Start difference. First operand 142 states and 155 transitions. Second operand has 51 states, 47 states have (on average 1.851063829787234) internal successors, (87), 44 states have internal predecessors, (87), 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:48:08,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:48:08,645 INFO L93 Difference]: Finished difference Result 171 states and 185 transitions. [2024-11-17 00:48:08,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-17 00:48:08,645 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 47 states have (on average 1.851063829787234) internal successors, (87), 44 states have internal predecessors, (87), 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 50 [2024-11-17 00:48:08,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:48:08,646 INFO L225 Difference]: With dead ends: 171 [2024-11-17 00:48:08,646 INFO L226 Difference]: Without dead ends: 171 [2024-11-17 00:48:08,647 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1192 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=371, Invalid=6112, Unknown=1, NotChecked=158, Total=6642 [2024-11-17 00:48:08,648 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 201 mSDsluCounter, 2156 mSDsCounter, 0 mSdLazyCounter, 2586 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 2243 SdHoareTripleChecker+Invalid, 2768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 2586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 165 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-17 00:48:08,648 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 2243 Invalid, 2768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 2586 Invalid, 0 Unknown, 165 Unchecked, 1.4s Time] [2024-11-17 00:48:08,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-17 00:48:08,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 147. [2024-11-17 00:48:08,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 115 states have (on average 1.2869565217391303) internal successors, (148), 138 states have internal predecessors, (148), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-17 00:48:08,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 158 transitions. [2024-11-17 00:48:08,651 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 158 transitions. Word has length 50 [2024-11-17 00:48:08,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:48:08,651 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 158 transitions. [2024-11-17 00:48:08,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 47 states have (on average 1.851063829787234) internal successors, (87), 44 states have internal predecessors, (87), 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:48:08,651 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 158 transitions. [2024-11-17 00:48:08,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-17 00:48:08,652 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:48:08,652 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:48:08,665 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-17 00:48:08,852 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,SelfDestructingSolverStorable15 [2024-11-17 00:48:08,852 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2024-11-17 00:48:08,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:48:08,853 INFO L85 PathProgramCache]: Analyzing trace with hash 957397738, now seen corresponding path program 1 times [2024-11-17 00:48:08,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:48:08,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483111413] [2024-11-17 00:48:08,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:48:08,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:48:08,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:09,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:48:09,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:09,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-17 00:48:09,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:09,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-17 00:48:09,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:09,056 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-17 00:48:09,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:48:09,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483111413] [2024-11-17 00:48:09,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483111413] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:48:09,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:48:09,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-17 00:48:09,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194665193] [2024-11-17 00:48:09,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:48:09,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-17 00:48:09,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:48:09,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-17 00:48:09,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-17 00:48:09,058 INFO L87 Difference]: Start difference. First operand 147 states and 158 transitions. Second operand has 11 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-17 00:48:09,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:48:09,230 INFO L93 Difference]: Finished difference Result 148 states and 158 transitions. [2024-11-17 00:48:09,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-17 00:48:09,230 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 56 [2024-11-17 00:48:09,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:48:09,231 INFO L225 Difference]: With dead ends: 148 [2024-11-17 00:48:09,231 INFO L226 Difference]: Without dead ends: 148 [2024-11-17 00:48:09,231 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-11-17 00:48:09,231 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 45 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:48:09,232 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 506 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:48:09,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-11-17 00:48:09,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 144. [2024-11-17 00:48:09,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 115 states have (on average 1.2608695652173914) internal successors, (145), 135 states have internal predecessors, (145), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-17 00:48:09,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 155 transitions. [2024-11-17 00:48:09,234 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 155 transitions. Word has length 56 [2024-11-17 00:48:09,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:48:09,235 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 155 transitions. [2024-11-17 00:48:09,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-17 00:48:09,235 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 155 transitions. [2024-11-17 00:48:09,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-17 00:48:09,235 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:48:09,235 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:48:09,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-17 00:48:09,235 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2024-11-17 00:48:09,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:48:09,236 INFO L85 PathProgramCache]: Analyzing trace with hash 957397739, now seen corresponding path program 1 times [2024-11-17 00:48:09,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:48:09,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114816514] [2024-11-17 00:48:09,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:48:09,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:48:09,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:09,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:48:09,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:09,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-17 00:48:09,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:09,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-17 00:48:09,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:09,517 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-17 00:48:09,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:48:09,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114816514] [2024-11-17 00:48:09,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114816514] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:48:09,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:48:09,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-17 00:48:09,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141916836] [2024-11-17 00:48:09,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:48:09,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-17 00:48:09,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:48:09,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-17 00:48:09,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-17 00:48:09,519 INFO L87 Difference]: Start difference. First operand 144 states and 155 transitions. Second operand has 11 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-17 00:48:09,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:48:09,749 INFO L93 Difference]: Finished difference Result 146 states and 156 transitions. [2024-11-17 00:48:09,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-17 00:48:09,749 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 56 [2024-11-17 00:48:09,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:48:09,750 INFO L225 Difference]: With dead ends: 146 [2024-11-17 00:48:09,750 INFO L226 Difference]: Without dead ends: 146 [2024-11-17 00:48:09,750 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-11-17 00:48:09,751 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 46 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:48:09,751 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 540 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:48:09,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-17 00:48:09,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 142. [2024-11-17 00:48:09,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 115 states have (on average 1.2434782608695651) internal successors, (143), 133 states have internal predecessors, (143), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-17 00:48:09,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 153 transitions. [2024-11-17 00:48:09,757 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 153 transitions. Word has length 56 [2024-11-17 00:48:09,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:48:09,757 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 153 transitions. [2024-11-17 00:48:09,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-17 00:48:09,758 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 153 transitions. [2024-11-17 00:48:09,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-17 00:48:09,758 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:48:09,758 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:48:09,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-17 00:48:09,758 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2024-11-17 00:48:09,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:48:09,758 INFO L85 PathProgramCache]: Analyzing trace with hash -586862577, now seen corresponding path program 2 times [2024-11-17 00:48:09,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:48:09,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409754594] [2024-11-17 00:48:09,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:48:09,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:48:09,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:10,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:48:10,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:10,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-17 00:48:10,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:10,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-17 00:48:10,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:10,760 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 16 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-17 00:48:10,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:48:10,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409754594] [2024-11-17 00:48:10,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409754594] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:48:10,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1272846233] [2024-11-17 00:48:10,761 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 00:48:10,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:48:10,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:48:10,763 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:48:10,765 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:48:10,954 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-17 00:48:10,954 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 00:48:10,957 INFO L255 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 119 conjuncts are in the unsatisfiable core [2024-11-17 00:48:10,960 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:48:10,986 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:48:11,227 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-17 00:48:11,227 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:48:11,312 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 15 treesize of output 1 [2024-11-17 00:48:11,314 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:48:11,440 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-17 00:48:11,440 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 56 treesize of output 38 [2024-11-17 00:48:11,445 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 27 treesize of output 22 [2024-11-17 00:48:11,618 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-17 00:48:11,618 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 31 [2024-11-17 00:48:11,626 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 19 treesize of output 7 [2024-11-17 00:48:11,630 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:48:11,773 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_8| Int)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_8|) 0) 0)) (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#memory_$Pointer$#2.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.base|) (= (store |c_old(#memory_$Pointer$#2.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.offset| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.offset|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|))))) is different from true [2024-11-17 00:48:11,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:48:11,817 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-11-17 00:48:11,818 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 72 treesize of output 55 [2024-11-17 00:48:11,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:48:11,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:48:11,829 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 35 treesize of output 33 [2024-11-17 00:48:11,845 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-17 00:48:11,845 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:48:12,382 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-17 00:48:12,382 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 29 [2024-11-17 00:48:12,386 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 19 treesize of output 7 [2024-11-17 00:48:12,434 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 15 treesize of output 7 [2024-11-17 00:48:12,471 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 9 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-11-17 00:48:12,471 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:48:13,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1272846233] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:48:13,073 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:48:13,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 29] total 54 [2024-11-17 00:48:13,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400606214] [2024-11-17 00:48:13,074 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:48:13,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2024-11-17 00:48:13,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:48:13,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2024-11-17 00:48:13,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=3351, Unknown=1, NotChecked=116, Total=3660 [2024-11-17 00:48:13,075 INFO L87 Difference]: Start difference. First operand 142 states and 153 transitions. Second operand has 54 states, 51 states have (on average 1.8627450980392157) internal successors, (95), 47 states have internal predecessors, (95), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-17 00:48:15,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:48:15,205 INFO L93 Difference]: Finished difference Result 151 states and 163 transitions. [2024-11-17 00:48:15,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-17 00:48:15,206 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 51 states have (on average 1.8627450980392157) internal successors, (95), 47 states have internal predecessors, (95), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 56 [2024-11-17 00:48:15,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:48:15,210 INFO L225 Difference]: With dead ends: 151 [2024-11-17 00:48:15,210 INFO L226 Difference]: Without dead ends: 151 [2024-11-17 00:48:15,211 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1290 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=390, Invalid=6093, Unknown=1, NotChecked=158, Total=6642 [2024-11-17 00:48:15,211 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 113 mSDsluCounter, 2600 mSDsCounter, 0 mSdLazyCounter, 2156 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 2682 SdHoareTripleChecker+Invalid, 2311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 2156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 143 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:48:15,212 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 2682 Invalid, 2311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 2156 Invalid, 0 Unknown, 143 Unchecked, 1.1s Time] [2024-11-17 00:48:15,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-11-17 00:48:15,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 146. [2024-11-17 00:48:15,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 119 states have (on average 1.2352941176470589) internal successors, (147), 137 states have internal predecessors, (147), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-17 00:48:15,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 157 transitions. [2024-11-17 00:48:15,224 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 157 transitions. Word has length 56 [2024-11-17 00:48:15,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:48:15,224 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 157 transitions. [2024-11-17 00:48:15,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 51 states have (on average 1.8627450980392157) internal successors, (95), 47 states have internal predecessors, (95), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-17 00:48:15,224 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 157 transitions. [2024-11-17 00:48:15,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-17 00:48:15,225 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:48:15,225 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:48:15,254 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:48:15,425 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:48:15,426 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2024-11-17 00:48:15,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:48:15,427 INFO L85 PathProgramCache]: Analyzing trace with hash 2065141579, now seen corresponding path program 1 times [2024-11-17 00:48:15,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:48:15,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186918697] [2024-11-17 00:48:15,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:48:15,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:48:15,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:16,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:48:16,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:16,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-17 00:48:16,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:16,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-17 00:48:16,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:16,263 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-17 00:48:16,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:48:16,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186918697] [2024-11-17 00:48:16,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186918697] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:48:16,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1463343029] [2024-11-17 00:48:16,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:48:16,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:48:16,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:48:16,266 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:48:16,267 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:48:16,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:16,473 INFO L255 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 80 conjuncts are in the unsatisfiable core [2024-11-17 00:48:16,476 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:48:16,494 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:48:16,631 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-17 00:48:16,631 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:48:16,702 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:48:16,836 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-17 00:48:16,836 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 25 treesize of output 26 [2024-11-17 00:48:16,949 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:48:16,952 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:48:17,088 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#memory_$Pointer$#2.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.base|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) (exists ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_9| Int) (|ULTIMATE.start_main_~#s~0#1.offset| Int)) (and (<= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_9|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (<= |ULTIMATE.start_main_~#s~0#1.offset| 0)))) is different from true [2024-11-17 00:48:17,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:48:17,105 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 25 treesize of output 20 [2024-11-17 00:48:17,112 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-17 00:48:17,112 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:48:17,251 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:48:17,257 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:48:17,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 22 [2024-11-17 00:48:17,388 INFO L349 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2024-11-17 00:48:17,388 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 28 treesize of output 15 [2024-11-17 00:48:17,491 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-11-17 00:48:17,492 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:48:17,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1463343029] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:48:17,795 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:48:17,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 27] total 48 [2024-11-17 00:48:17,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763905198] [2024-11-17 00:48:17,795 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:48:17,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2024-11-17 00:48:17,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:48:17,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-11-17 00:48:17,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=2700, Unknown=1, NotChecked=104, Total=2970 [2024-11-17 00:48:17,798 INFO L87 Difference]: Start difference. First operand 146 states and 157 transitions. Second operand has 48 states, 45 states have (on average 2.0) internal successors, (90), 41 states have internal predecessors, (90), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-17 00:48:19,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:48:19,478 INFO L93 Difference]: Finished difference Result 149 states and 160 transitions. [2024-11-17 00:48:19,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-17 00:48:19,478 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 45 states have (on average 2.0) internal successors, (90), 41 states have internal predecessors, (90), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 60 [2024-11-17 00:48:19,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:48:19,479 INFO L225 Difference]: With dead ends: 149 [2024-11-17 00:48:19,479 INFO L226 Difference]: Without dead ends: 149 [2024-11-17 00:48:19,480 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1079 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=390, Invalid=5163, Unknown=1, NotChecked=146, Total=5700 [2024-11-17 00:48:19,480 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 118 mSDsluCounter, 1964 mSDsCounter, 0 mSdLazyCounter, 1573 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 2046 SdHoareTripleChecker+Invalid, 1725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 140 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-17 00:48:19,480 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 2046 Invalid, 1725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1573 Invalid, 0 Unknown, 140 Unchecked, 0.7s Time] [2024-11-17 00:48:19,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-11-17 00:48:19,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 146. [2024-11-17 00:48:19,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 119 states have (on average 1.226890756302521) internal successors, (146), 137 states have internal predecessors, (146), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-17 00:48:19,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 156 transitions. [2024-11-17 00:48:19,489 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 156 transitions. Word has length 60 [2024-11-17 00:48:19,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:48:19,489 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 156 transitions. [2024-11-17 00:48:19,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 45 states have (on average 2.0) internal successors, (90), 41 states have internal predecessors, (90), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-17 00:48:19,489 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 156 transitions. [2024-11-17 00:48:19,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-17 00:48:19,490 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:48:19,490 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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] [2024-11-17 00:48:19,503 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:48:19,690 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:48:19,690 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2024-11-17 00:48:19,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:48:19,691 INFO L85 PathProgramCache]: Analyzing trace with hash -407449104, now seen corresponding path program 3 times [2024-11-17 00:48:19,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:48:19,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382590593] [2024-11-17 00:48:19,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:48:19,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:48:19,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:19,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:48:19,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:19,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-17 00:48:19,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:19,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-17 00:48:19,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:19,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-17 00:48:19,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:19,773 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-17 00:48:19,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:48:19,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382590593] [2024-11-17 00:48:19,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382590593] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:48:19,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [714195983] [2024-11-17 00:48:19,774 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-17 00:48:19,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:48:19,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:48:19,775 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:48:19,776 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:48:20,022 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-17 00:48:20,022 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 00:48:20,024 INFO L255 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-17 00:48:20,025 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:48:20,042 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-17 00:48:20,042 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:48:20,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [714195983] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:48:20,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-17 00:48:20,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2024-11-17 00:48:20,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882446743] [2024-11-17 00:48:20,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:48:20,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:48:20,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:48:20,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:48:20,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:48:20,044 INFO L87 Difference]: Start difference. First operand 146 states and 156 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-17 00:48:20,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:48:20,053 INFO L93 Difference]: Finished difference Result 104 states and 109 transitions. [2024-11-17 00:48:20,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 00:48:20,053 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 63 [2024-11-17 00:48:20,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:48:20,054 INFO L225 Difference]: With dead ends: 104 [2024-11-17 00:48:20,054 INFO L226 Difference]: Without dead ends: 104 [2024-11-17 00:48:20,054 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:48:20,054 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 0 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:48:20,055 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 277 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:48:20,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-17 00:48:20,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-11-17 00:48:20,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 84 states have (on average 1.2261904761904763) internal successors, (103), 98 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:48:20,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 109 transitions. [2024-11-17 00:48:20,057 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 109 transitions. Word has length 63 [2024-11-17 00:48:20,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:48:20,057 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 109 transitions. [2024-11-17 00:48:20,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-17 00:48:20,061 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 109 transitions. [2024-11-17 00:48:20,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-17 00:48:20,062 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:48:20,062 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:20,076 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-17 00:48:20,262 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,SelfDestructingSolverStorable20 [2024-11-17 00:48:20,262 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2024-11-17 00:48:20,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:48:20,263 INFO L85 PathProgramCache]: Analyzing trace with hash -742425434, now seen corresponding path program 1 times [2024-11-17 00:48:20,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:48:20,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807037825] [2024-11-17 00:48:20,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:48:20,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:48:20,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:21,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:48:21,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:21,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-17 00:48:21,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:21,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-17 00:48:21,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:21,590 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 10 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-17 00:48:21,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:48:21,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807037825] [2024-11-17 00:48:21,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807037825] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:48:21,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [311640508] [2024-11-17 00:48:21,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:48:21,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:48:21,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:48:21,593 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:48:21,595 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:48:21,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:21,795 INFO L255 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 110 conjuncts are in the unsatisfiable core [2024-11-17 00:48:21,798 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:48:21,823 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:48:21,953 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-17 00:48:21,953 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:48:22,018 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:48:22,114 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-17 00:48:22,114 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:48:22,262 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 38 treesize of output 14 [2024-11-17 00:48:22,265 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:48:22,387 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 13 treesize of output 9 [2024-11-17 00:48:22,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:48:22,490 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 46 treesize of output 35 [2024-11-17 00:48:22,504 INFO L349 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2024-11-17 00:48:22,504 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 32 treesize of output 34 [2024-11-17 00:48:23,001 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:48:23,005 INFO L349 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2024-11-17 00:48:23,005 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 1 case distinctions, treesize of input 52 treesize of output 19 [2024-11-17 00:48:23,205 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 25 treesize of output 13 [2024-11-17 00:48:23,236 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:48:23,236 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:48:23,237 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 36 treesize of output 13 [2024-11-17 00:48:23,240 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 15 treesize of output 1 [2024-11-17 00:48:23,315 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 26 treesize of output 21 [2024-11-17 00:48:23,400 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:48:23,400 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2024-11-17 00:48:23,403 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:48:23,405 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:48:23,405 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 21 treesize of output 16 [2024-11-17 00:48:23,478 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 19 treesize of output 7 [2024-11-17 00:48:23,479 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 9 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:48:23,479 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:48:23,527 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2813 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2813) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) is different from false [2024-11-17 00:48:23,532 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2813 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2813) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) is different from false [2024-11-17 00:48:23,550 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2810 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_2810) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2813) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (not (= (store (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select v_ArrVal_2810 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) v_ArrVal_2810)))) is different from false [2024-11-17 00:48:23,588 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2810 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_2810) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2813) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (not (= (store (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select v_ArrVal_2810 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) v_ArrVal_2810)))) is different from false [2024-11-17 00:48:23,597 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2810 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_2810) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) v_ArrVal_2813) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (not (= (store (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select v_ArrVal_2810 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) v_ArrVal_2810)))) is different from false [2024-11-17 00:48:23,630 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2810 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_2810) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_#t~mem11#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~mem11#1.offset|) v_ArrVal_2813) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) |c_ULTIMATE.start_main_~uneq~0#1|) (not (= (store (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select v_ArrVal_2810 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) v_ArrVal_2810)))) is different from false [2024-11-17 00:48:23,639 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2810 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (let ((.cse1 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (select (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_2810) (select (select |c_#memory_$Pointer$#2.base| (select .cse0 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select .cse1 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2813) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse1 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) (not (= (store (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select v_ArrVal_2810 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) v_ArrVal_2810)))) is different from false [2024-11-17 00:48:23,858 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:48:23,858 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 268 treesize of output 272 [2024-11-17 00:48:23,863 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 238 treesize of output 206 [2024-11-17 00:48:23,876 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 19 treesize of output 3 [2024-11-17 00:48:23,905 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 138 treesize of output 122 [2024-11-17 00:48:24,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [311640508] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:48:24,050 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:48:24,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 34] total 60 [2024-11-17 00:48:24,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521651589] [2024-11-17 00:48:24,050 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:48:24,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2024-11-17 00:48:24,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:48:24,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2024-11-17 00:48:24,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=3846, Unknown=8, NotChecked=910, Total=4970 [2024-11-17 00:48:24,052 INFO L87 Difference]: Start difference. First operand 104 states and 109 transitions. Second operand has 60 states, 57 states have (on average 1.9473684210526316) internal successors, (111), 51 states have internal predecessors, (111), 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:48:25,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:48:25,610 INFO L93 Difference]: Finished difference Result 104 states and 108 transitions. [2024-11-17 00:48:25,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-17 00:48:25,610 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 57 states have (on average 1.9473684210526316) internal successors, (111), 51 states have internal predecessors, (111), 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 66 [2024-11-17 00:48:25,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:48:25,611 INFO L225 Difference]: With dead ends: 104 [2024-11-17 00:48:25,611 INFO L226 Difference]: Without dead ends: 104 [2024-11-17 00:48:25,612 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 1231 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=362, Invalid=6464, Unknown=8, NotChecked=1176, Total=8010 [2024-11-17 00:48:25,612 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 60 mSDsluCounter, 2163 mSDsCounter, 0 mSdLazyCounter, 1802 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 2230 SdHoareTripleChecker+Invalid, 1807 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-17 00:48:25,613 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 2230 Invalid, 1807 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1802 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-17 00:48:25,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-17 00:48:25,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-11-17 00:48:25,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 84 states have (on average 1.2142857142857142) internal successors, (102), 98 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:48:25,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 108 transitions. [2024-11-17 00:48:25,615 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 108 transitions. Word has length 66 [2024-11-17 00:48:25,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:48:25,615 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 108 transitions. [2024-11-17 00:48:25,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 57 states have (on average 1.9473684210526316) internal successors, (111), 51 states have internal predecessors, (111), 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:48:25,615 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 108 transitions. [2024-11-17 00:48:25,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-17 00:48:25,616 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:48:25,616 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:25,629 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:48:25,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:48:25,821 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2024-11-17 00:48:25,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:48:25,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1537704543, now seen corresponding path program 1 times [2024-11-17 00:48:25,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:48:25,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983141284] [2024-11-17 00:48:25,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:48:25,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:48:25,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:26,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:48:26,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:26,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-17 00:48:26,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:26,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-17 00:48:26,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:27,064 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 10 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-17 00:48:27,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:48:27,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983141284] [2024-11-17 00:48:27,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983141284] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:48:27,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [496174669] [2024-11-17 00:48:27,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:48:27,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:48:27,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:48:27,069 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:48:27,070 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:48:27,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:27,275 INFO L255 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 102 conjuncts are in the unsatisfiable core [2024-11-17 00:48:27,277 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:48:27,678 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:48:27,738 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 23 treesize of output 11 [2024-11-17 00:48:28,536 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 11 treesize of output 3 [2024-11-17 00:48:29,254 INFO L349 Elim1Store]: treesize reduction 47, result has 37.3 percent of original size [2024-11-17 00:48:29,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 49 [2024-11-17 00:48:29,459 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:48:29,488 INFO L349 Elim1Store]: treesize reduction 20, result has 58.3 percent of original size [2024-11-17 00:48:29,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 63 [2024-11-17 00:48:29,496 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:48:29,497 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:48:29,514 INFO L349 Elim1Store]: treesize reduction 33, result has 31.3 percent of original size [2024-11-17 00:48:29,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 22 [2024-11-17 00:48:30,066 INFO L349 Elim1Store]: treesize reduction 476, result has 35.2 percent of original size [2024-11-17 00:48:30,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 27 case distinctions, treesize of input 303 treesize of output 394