./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/sll2c_insert_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_insert_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 b7b415e0519ab150e9247d3d9d0133f92cfd07c34f9918f9ebd19cf8109bf4e7 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 00:47:36,135 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 00:47:36,209 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:36,223 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 00:47:36,224 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 00:47:36,266 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 00:47:36,267 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 00:47:36,268 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 00:47:36,269 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 00:47:36,269 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 00:47:36,270 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 00:47:36,270 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 00:47:36,271 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 00:47:36,271 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 00:47:36,271 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 00:47:36,272 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 00:47:36,272 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 00:47:36,272 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 00:47:36,273 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 00:47:36,273 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 00:47:36,276 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-17 00:47:36,280 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-17 00:47:36,280 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-17 00:47:36,280 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 00:47:36,280 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 00:47:36,280 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 00:47:36,281 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 00:47:36,281 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 00:47:36,281 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 00:47:36,281 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 00:47:36,281 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 00:47:36,282 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 00:47:36,282 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 00:47:36,282 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 00:47:36,282 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 00:47:36,283 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 00:47:36,283 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 00:47:36,283 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-17 00:47:36,283 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 00:47:36,284 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 00:47:36,284 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 00:47:36,286 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 00:47:36,286 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 -> b7b415e0519ab150e9247d3d9d0133f92cfd07c34f9918f9ebd19cf8109bf4e7 [2024-11-17 00:47:36,567 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 00:47:36,596 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 00:47:36,601 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 00:47:36,602 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 00:47:36,602 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 00:47:36,604 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2c_insert_unequal.i [2024-11-17 00:47:38,101 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 00:47:38,392 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 00:47:38,392 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_insert_unequal.i [2024-11-17 00:47:38,408 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4868f596e/b4a29eb5992c437ca0972c2555f96b71/FLAG4921c7e5a [2024-11-17 00:47:38,676 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4868f596e/b4a29eb5992c437ca0972c2555f96b71 [2024-11-17 00:47:38,678 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 00:47:38,679 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 00:47:38,681 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 00:47:38,681 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 00:47:38,687 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 00:47:38,688 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:47:38" (1/1) ... [2024-11-17 00:47:38,689 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c627da3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:47:38, skipping insertion in model container [2024-11-17 00:47:38,689 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:47:38" (1/1) ... [2024-11-17 00:47:38,737 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 00:47:39,088 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:47:39,104 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 00:47:39,147 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:47:39,175 INFO L204 MainTranslator]: Completed translation [2024-11-17 00:47:39,176 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:47:39 WrapperNode [2024-11-17 00:47:39,176 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 00:47:39,177 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 00:47:39,178 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 00:47:39,180 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 00:47:39,186 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:39" (1/1) ... [2024-11-17 00:47:39,201 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:39" (1/1) ... [2024-11-17 00:47:39,232 INFO L138 Inliner]: procedures = 127, calls = 49, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 177 [2024-11-17 00:47:39,232 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 00:47:39,233 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 00:47:39,233 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 00:47:39,234 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 00:47:39,244 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:39" (1/1) ... [2024-11-17 00:47:39,244 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:39" (1/1) ... [2024-11-17 00:47:39,250 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:39" (1/1) ... [2024-11-17 00:47:39,291 INFO L175 MemorySlicer]: Split 30 memory accesses to 3 slices as follows [2, 10, 18]. 60 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 10 writes are split as follows [0, 1, 9]. [2024-11-17 00:47:39,291 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:39" (1/1) ... [2024-11-17 00:47:39,291 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:39" (1/1) ... [2024-11-17 00:47:39,312 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:39" (1/1) ... [2024-11-17 00:47:39,316 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:39" (1/1) ... [2024-11-17 00:47:39,318 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:39" (1/1) ... [2024-11-17 00:47:39,324 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:39" (1/1) ... [2024-11-17 00:47:39,328 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 00:47:39,329 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 00:47:39,329 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 00:47:39,329 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 00:47:39,330 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:47:39" (1/1) ... [2024-11-17 00:47:39,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 00:47:39,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:47:39,369 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:39,376 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:39,423 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-17 00:47:39,423 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-17 00:47:39,423 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-17 00:47:39,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-17 00:47:39,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-17 00:47:39,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-17 00:47:39,423 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-17 00:47:39,424 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-17 00:47:39,424 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-17 00:47:39,424 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 00:47:39,424 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-17 00:47:39,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-17 00:47:39,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-17 00:47:39,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-17 00:47:39,425 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-17 00:47:39,426 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-17 00:47:39,426 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-17 00:47:39,426 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-17 00:47:39,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-17 00:47:39,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-17 00:47:39,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-17 00:47:39,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-17 00:47:39,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-17 00:47:39,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-17 00:47:39,428 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 00:47:39,428 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 00:47:39,598 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 00:47:39,601 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 00:47:39,962 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L631: 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:39,995 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:40,018 INFO L? ?]: Removed 161 outVars from TransFormulas that were not future-live. [2024-11-17 00:47:40,019 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 00:47:40,040 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 00:47:40,041 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 00:47:40,041 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:47:40 BoogieIcfgContainer [2024-11-17 00:47:40,042 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 00:47:40,044 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 00:47:40,044 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 00:47:40,047 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 00:47:40,047 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 12:47:38" (1/3) ... [2024-11-17 00:47:40,048 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@570c7b1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:47:40, skipping insertion in model container [2024-11-17 00:47:40,048 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:47:39" (2/3) ... [2024-11-17 00:47:40,050 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@570c7b1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:47:40, skipping insertion in model container [2024-11-17 00:47:40,050 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:47:40" (3/3) ... [2024-11-17 00:47:40,051 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_insert_unequal.i [2024-11-17 00:47:40,066 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 00:47:40,068 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 62 error locations. [2024-11-17 00:47:40,120 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 00:47:40,128 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;@4d72662, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 00:47:40,128 INFO L334 AbstractCegarLoop]: Starting to check reachability of 62 error locations. [2024-11-17 00:47:40,132 INFO L276 IsEmpty]: Start isEmpty. Operand has 153 states, 86 states have (on average 1.941860465116279) internal successors, (167), 148 states have internal predecessors, (167), 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:40,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-17 00:47:40,138 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:47:40,138 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-17 00:47:40,139 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2024-11-17 00:47:40,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:47:40,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1503076244, now seen corresponding path program 1 times [2024-11-17 00:47:40,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:47:40,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587457899] [2024-11-17 00:47:40,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:47:40,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:47:40,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:40,500 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:40,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:47:40,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587457899] [2024-11-17 00:47:40,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587457899] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:47:40,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:47:40,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 00:47:40,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529162159] [2024-11-17 00:47:40,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:47:40,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:47:40,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:47:40,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:47:40,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:47:40,543 INFO L87 Difference]: Start difference. First operand has 153 states, 86 states have (on average 1.941860465116279) internal successors, (167), 148 states have internal predecessors, (167), 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:40,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:47:40,696 INFO L93 Difference]: Finished difference Result 150 states and 163 transitions. [2024-11-17 00:47:40,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:47:40,698 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:40,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:47:40,708 INFO L225 Difference]: With dead ends: 150 [2024-11-17 00:47:40,708 INFO L226 Difference]: Without dead ends: 146 [2024-11-17 00:47:40,709 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:40,713 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 2 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:47:40,714 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 249 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:47:40,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-17 00:47:40,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2024-11-17 00:47:40,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 82 states have (on average 1.853658536585366) internal successors, (152), 141 states have internal predecessors, (152), 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:40,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 158 transitions. [2024-11-17 00:47:40,748 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 158 transitions. Word has length 6 [2024-11-17 00:47:40,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:47:40,748 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 158 transitions. [2024-11-17 00:47:40,748 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:40,748 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 158 transitions. [2024-11-17 00:47:40,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-17 00:47:40,749 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:47:40,749 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-17 00:47:40,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-17 00:47:40,749 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2024-11-17 00:47:40,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:47:40,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1503076245, now seen corresponding path program 1 times [2024-11-17 00:47:40,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:47:40,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464349521] [2024-11-17 00:47:40,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:47:40,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:47:40,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:40,868 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:40,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:47:40,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464349521] [2024-11-17 00:47:40,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464349521] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:47:40,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:47:40,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 00:47:40,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743218377] [2024-11-17 00:47:40,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:47:40,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:47:40,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:47:40,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:47:40,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:47:40,873 INFO L87 Difference]: Start difference. First operand 146 states and 158 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:40,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:47:40,967 INFO L93 Difference]: Finished difference Result 144 states and 156 transitions. [2024-11-17 00:47:40,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:47:40,967 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:40,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:47:40,969 INFO L225 Difference]: With dead ends: 144 [2024-11-17 00:47:40,969 INFO L226 Difference]: Without dead ends: 144 [2024-11-17 00:47:40,969 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:40,970 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 2 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:47:40,971 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 251 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:47:40,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-17 00:47:40,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2024-11-17 00:47:40,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 82 states have (on average 1.829268292682927) internal successors, (150), 139 states have internal predecessors, (150), 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:40,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 156 transitions. [2024-11-17 00:47:40,990 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 156 transitions. Word has length 6 [2024-11-17 00:47:40,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:47:40,991 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 156 transitions. [2024-11-17 00:47:40,991 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:40,991 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 156 transitions. [2024-11-17 00:47:40,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-17 00:47:40,992 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:47:40,992 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:47:40,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-17 00:47:40,992 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2024-11-17 00:47:40,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:47:40,993 INFO L85 PathProgramCache]: Analyzing trace with hash -913950002, now seen corresponding path program 1 times [2024-11-17 00:47:40,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:47:40,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011261459] [2024-11-17 00:47:40,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:47:40,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:47:41,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:41,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:47:41,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:41,194 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:41,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:47:41,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011261459] [2024-11-17 00:47:41,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011261459] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:47:41,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:47:41,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:47:41,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369305553] [2024-11-17 00:47:41,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:47:41,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:47:41,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:47:41,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:47:41,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:47:41,197 INFO L87 Difference]: Start difference. First operand 144 states and 156 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:41,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:47:41,353 INFO L93 Difference]: Finished difference Result 152 states and 165 transitions. [2024-11-17 00:47:41,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 00:47:41,353 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:41,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:47:41,355 INFO L225 Difference]: With dead ends: 152 [2024-11-17 00:47:41,355 INFO L226 Difference]: Without dead ends: 152 [2024-11-17 00:47:41,355 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:41,356 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 5 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:47:41,357 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 364 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:47:41,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-11-17 00:47:41,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 146. [2024-11-17 00:47:41,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 84 states have (on average 1.8095238095238095) internal successors, (152), 141 states have internal predecessors, (152), 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:41,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 158 transitions. [2024-11-17 00:47:41,372 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 158 transitions. Word has length 14 [2024-11-17 00:47:41,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:47:41,373 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 158 transitions. [2024-11-17 00:47:41,374 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:41,374 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 158 transitions. [2024-11-17 00:47:41,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-17 00:47:41,375 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:47:41,375 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:41,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-17 00:47:41,376 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2024-11-17 00:47:41,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:47:41,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1837633504, now seen corresponding path program 1 times [2024-11-17 00:47:41,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:47:41,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917857963] [2024-11-17 00:47:41,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:47:41,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:47:41,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:41,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:47:41,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:41,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-17 00:47:41,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:41,644 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:41,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:47:41,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917857963] [2024-11-17 00:47:41,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917857963] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:47:41,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:47:41,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 00:47:41,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469976464] [2024-11-17 00:47:41,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:47:41,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 00:47:41,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:47:41,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 00:47:41,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-17 00:47:41,649 INFO L87 Difference]: Start difference. First operand 146 states and 158 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:41,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:47:41,948 INFO L93 Difference]: Finished difference Result 145 states and 157 transitions. [2024-11-17 00:47:41,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 00:47:41,948 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:41,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:47:41,950 INFO L225 Difference]: With dead ends: 145 [2024-11-17 00:47:41,950 INFO L226 Difference]: Without dead ends: 145 [2024-11-17 00:47:41,951 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:41,954 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 2 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-17 00:47:41,954 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 541 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-17 00:47:41,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-17 00:47:41,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2024-11-17 00:47:41,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 84 states have (on average 1.7976190476190477) internal successors, (151), 140 states have internal predecessors, (151), 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:41,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 157 transitions. [2024-11-17 00:47:41,969 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 157 transitions. Word has length 23 [2024-11-17 00:47:41,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:47:41,973 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 157 transitions. [2024-11-17 00:47:41,974 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:41,974 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 157 transitions. [2024-11-17 00:47:41,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-17 00:47:41,974 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:47:41,974 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:41,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-17 00:47:41,975 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2024-11-17 00:47:41,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:47:41,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1837633505, now seen corresponding path program 1 times [2024-11-17 00:47:41,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:47:41,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710178505] [2024-11-17 00:47:41,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:47:41,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:47:42,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:42,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:47:42,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:42,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-17 00:47:42,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:42,295 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:42,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:47:42,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710178505] [2024-11-17 00:47:42,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710178505] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:47:42,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:47:42,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 00:47:42,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750484505] [2024-11-17 00:47:42,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:47:42,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 00:47:42,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:47:42,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 00:47:42,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-17 00:47:42,300 INFO L87 Difference]: Start difference. First operand 145 states and 157 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:42,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:47:42,561 INFO L93 Difference]: Finished difference Result 144 states and 156 transitions. [2024-11-17 00:47:42,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 00:47:42,562 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:42,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:47:42,563 INFO L225 Difference]: With dead ends: 144 [2024-11-17 00:47:42,563 INFO L226 Difference]: Without dead ends: 144 [2024-11-17 00:47:42,564 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:42,565 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 1 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:47:42,568 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 573 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:47:42,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-17 00:47:42,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2024-11-17 00:47:42,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 84 states have (on average 1.7857142857142858) internal successors, (150), 139 states have internal predecessors, (150), 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:42,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 156 transitions. [2024-11-17 00:47:42,577 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 156 transitions. Word has length 23 [2024-11-17 00:47:42,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:47:42,577 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 156 transitions. [2024-11-17 00:47:42,577 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:42,577 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 156 transitions. [2024-11-17 00:47:42,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-17 00:47:42,578 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:47:42,578 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:42,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-17 00:47:42,579 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2024-11-17 00:47:42,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:47:42,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1232536927, now seen corresponding path program 1 times [2024-11-17 00:47:42,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:47:42,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070886232] [2024-11-17 00:47:42,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:47:42,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:47:42,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:42,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:47:42,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:42,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-17 00:47:42,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:42,887 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:42,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:47:42,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070886232] [2024-11-17 00:47:42,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070886232] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:47:42,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1723967560] [2024-11-17 00:47:42,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:47:42,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:47:42,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:47:42,890 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:42,892 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:43,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:43,006 INFO L255 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-17 00:47:43,011 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:47:43,059 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:43,133 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:43,199 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-17 00:47:43,199 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:43,218 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:43,218 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:47:43,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1723967560] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:47:43,288 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:47:43,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2024-11-17 00:47:43,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967779135] [2024-11-17 00:47:43,288 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:47:43,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-17 00:47:43,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:47:43,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-17 00:47:43,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=87, Unknown=1, NotChecked=18, Total=132 [2024-11-17 00:47:43,290 INFO L87 Difference]: Start difference. First operand 144 states and 156 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:43,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:47:43,606 INFO L93 Difference]: Finished difference Result 143 states and 155 transitions. [2024-11-17 00:47:43,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 00:47:43,607 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:43,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:47:43,608 INFO L225 Difference]: With dead ends: 143 [2024-11-17 00:47:43,608 INFO L226 Difference]: Without dead ends: 143 [2024-11-17 00:47:43,608 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=124, Unknown=1, NotChecked=22, Total=182 [2024-11-17 00:47:43,609 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 0 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 147 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:47:43,609 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 555 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 356 Invalid, 0 Unknown, 147 Unchecked, 0.2s Time] [2024-11-17 00:47:43,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-17 00:47:43,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2024-11-17 00:47:43,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 84 states have (on average 1.7738095238095237) internal successors, (149), 138 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:43,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 155 transitions. [2024-11-17 00:47:43,614 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 155 transitions. Word has length 27 [2024-11-17 00:47:43,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:47:43,615 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 155 transitions. [2024-11-17 00:47:43,615 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:43,615 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 155 transitions. [2024-11-17 00:47:43,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-17 00:47:43,616 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:47:43,616 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:43,634 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:43,816 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:43,817 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2024-11-17 00:47:43,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:47:43,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1232536928, now seen corresponding path program 1 times [2024-11-17 00:47:43,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:47:43,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961397863] [2024-11-17 00:47:43,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:47:43,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:47:43,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:44,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:47:44,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:44,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-17 00:47:44,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:44,249 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:44,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:47:44,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961397863] [2024-11-17 00:47:44,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961397863] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:47:44,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2055768326] [2024-11-17 00:47:44,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:47:44,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:47:44,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:47:44,252 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:44,254 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:44,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:44,358 INFO L255 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-17 00:47:44,360 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:47:44,373 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:44,376 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:44,542 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2024-11-17 00:47:44,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:47:44,588 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:44,596 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-17 00:47:44,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-17 00:47:44,640 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-11-17 00:47:44,640 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:47:44,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2055768326] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:47:44,763 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:47:44,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 17 [2024-11-17 00:47:44,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307329669] [2024-11-17 00:47:44,764 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:47:44,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-17 00:47:44,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:47:44,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-17 00:47:44,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=289, Unknown=1, NotChecked=34, Total=380 [2024-11-17 00:47:44,766 INFO L87 Difference]: Start difference. First operand 143 states and 155 transitions. Second operand has 18 states, 17 states have (on average 2.588235294117647) internal successors, (44), 14 states have internal predecessors, (44), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-17 00:47:45,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:47:45,399 INFO L93 Difference]: Finished difference Result 151 states and 166 transitions. [2024-11-17 00:47:45,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-17 00:47:45,400 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.588235294117647) internal successors, (44), 14 states have internal predecessors, (44), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 27 [2024-11-17 00:47:45,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:47:45,402 INFO L225 Difference]: With dead ends: 151 [2024-11-17 00:47:45,402 INFO L226 Difference]: Without dead ends: 151 [2024-11-17 00:47:45,402 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=355, Unknown=1, NotChecked=38, Total=462 [2024-11-17 00:47:45,403 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 2 mSDsluCounter, 872 mSDsCounter, 0 mSdLazyCounter, 938 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1016 SdHoareTripleChecker+Invalid, 1102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 938 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 160 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-17 00:47:45,403 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1016 Invalid, 1102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 938 Invalid, 0 Unknown, 160 Unchecked, 0.5s Time] [2024-11-17 00:47:45,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-11-17 00:47:45,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 150. [2024-11-17 00:47:45,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 90 states have (on average 1.7333333333333334) internal successors, (156), 144 states have internal predecessors, (156), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-17 00:47:45,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 164 transitions. [2024-11-17 00:47:45,408 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 164 transitions. Word has length 27 [2024-11-17 00:47:45,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:47:45,409 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 164 transitions. [2024-11-17 00:47:45,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.588235294117647) internal successors, (44), 14 states have internal predecessors, (44), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-17 00:47:45,409 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 164 transitions. [2024-11-17 00:47:45,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-17 00:47:45,410 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:47:45,410 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:45,427 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:45,611 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:45,611 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2024-11-17 00:47:45,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:47:45,612 INFO L85 PathProgramCache]: Analyzing trace with hash 794422195, now seen corresponding path program 1 times [2024-11-17 00:47:45,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:47:45,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240121805] [2024-11-17 00:47:45,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:47:45,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:47:45,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:46,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:47:46,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:46,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-17 00:47:46,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:46,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-17 00:47:46,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:46,162 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:46,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:47:46,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240121805] [2024-11-17 00:47:46,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240121805] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:47:46,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:47:46,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-17 00:47:46,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432195673] [2024-11-17 00:47:46,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:47:46,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-17 00:47:46,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:47:46,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-17 00:47:46,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-17 00:47:46,165 INFO L87 Difference]: Start difference. First operand 150 states and 164 transitions. Second operand has 9 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 8 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 00:47:46,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:47:46,455 INFO L93 Difference]: Finished difference Result 139 states and 153 transitions. [2024-11-17 00:47:46,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-17 00:47:46,455 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 8 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 39 [2024-11-17 00:47:46,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:47:46,457 INFO L225 Difference]: With dead ends: 139 [2024-11-17 00:47:46,457 INFO L226 Difference]: Without dead ends: 139 [2024-11-17 00:47:46,457 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-17 00:47:46,458 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 152 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-17 00:47:46,458 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 339 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-17 00:47:46,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-11-17 00:47:46,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 138. [2024-11-17 00:47:46,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 90 states have (on average 1.6) internal successors, (144), 132 states have internal predecessors, (144), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-17 00:47:46,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 152 transitions. [2024-11-17 00:47:46,462 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 152 transitions. Word has length 39 [2024-11-17 00:47:46,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:47:46,462 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 152 transitions. [2024-11-17 00:47:46,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 8 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 00:47:46,463 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 152 transitions. [2024-11-17 00:47:46,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-17 00:47:46,464 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:47:46,464 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:46,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-17 00:47:46,464 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2024-11-17 00:47:46,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:47:46,465 INFO L85 PathProgramCache]: Analyzing trace with hash 794422194, now seen corresponding path program 1 times [2024-11-17 00:47:46,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:47:46,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748730882] [2024-11-17 00:47:46,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:47:46,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:47:46,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:46,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:47:46,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:46,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-17 00:47:46,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:46,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-17 00:47:46,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:46,862 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:46,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:47:46,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748730882] [2024-11-17 00:47:46,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748730882] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:47:46,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [540465690] [2024-11-17 00:47:46,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:47:46,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:47:46,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:47:46,865 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:46,867 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:47,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:47,057 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-17 00:47:47,061 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:47:47,068 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,081 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:47,138 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-17 00:47:47,138 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:47,209 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 7 [2024-11-17 00:47:47,242 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-17 00:47:47,243 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:47,455 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:47,467 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))))) is different from true [2024-11-17 00:47:47,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:47:47,513 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:47,517 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:47,517 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:47:47,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [540465690] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:47:47,588 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:47:47,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13] total 19 [2024-11-17 00:47:47,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852408219] [2024-11-17 00:47:47,589 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:47:47,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-17 00:47:47,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:47:47,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-17 00:47:47,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=317, Unknown=1, NotChecked=36, Total=420 [2024-11-17 00:47:47,592 INFO L87 Difference]: Start difference. First operand 138 states and 152 transitions. Second operand has 20 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 16 states have internal predecessors, (50), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-17 00:47:48,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:47:48,132 INFO L93 Difference]: Finished difference Result 154 states and 169 transitions. [2024-11-17 00:47:48,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 00:47:48,133 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 16 states have internal predecessors, (50), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 39 [2024-11-17 00:47:48,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:47:48,134 INFO L225 Difference]: With dead ends: 154 [2024-11-17 00:47:48,134 INFO L226 Difference]: Without dead ends: 154 [2024-11-17 00:47:48,134 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=92, Invalid=417, Unknown=1, NotChecked=42, Total=552 [2024-11-17 00:47:48,135 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 258 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 640 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 152 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-17 00:47:48,135 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 639 Invalid, 802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 640 Invalid, 0 Unknown, 152 Unchecked, 0.4s Time] [2024-11-17 00:47:48,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-11-17 00:47:48,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 132. [2024-11-17 00:47:48,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 90 states have (on average 1.5333333333333334) internal successors, (138), 126 states have internal predecessors, (138), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-17 00:47:48,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 146 transitions. [2024-11-17 00:47:48,138 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 146 transitions. Word has length 39 [2024-11-17 00:47:48,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:47:48,139 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 146 transitions. [2024-11-17 00:47:48,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 16 states have internal predecessors, (50), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-17 00:47:48,139 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 146 transitions. [2024-11-17 00:47:48,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-17 00:47:48,140 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:47:48,140 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] [2024-11-17 00:47:48,163 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:48,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:47:48,341 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2024-11-17 00:47:48,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:47:48,341 INFO L85 PathProgramCache]: Analyzing trace with hash 524136047, now seen corresponding path program 2 times [2024-11-17 00:47:48,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:47:48,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825626529] [2024-11-17 00:47:48,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:47:48,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:47:48,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:48,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:47:48,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:48,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-17 00:47:48,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:48,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-17 00:47:48,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:48,441 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-17 00:47:48,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:47:48,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825626529] [2024-11-17 00:47:48,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825626529] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:47:48,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1981703377] [2024-11-17 00:47:48,441 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 00:47:48,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:47:48,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:47:48,443 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:48,444 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:48,587 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-17 00:47:48,588 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 00:47:48,589 INFO L255 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-17 00:47:48,591 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:47:48,618 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-17 00:47:48,618 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:47:48,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1981703377] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:47:48,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-17 00:47:48,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2024-11-17 00:47:48,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106416247] [2024-11-17 00:47:48,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:47:48,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:47:48,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:47:48,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:47:48,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:47:48,620 INFO L87 Difference]: Start difference. First operand 132 states and 146 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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:48,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:47:48,633 INFO L93 Difference]: Finished difference Result 124 states and 135 transitions. [2024-11-17 00:47:48,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 00:47:48,635 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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 40 [2024-11-17 00:47:48,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:47:48,636 INFO L225 Difference]: With dead ends: 124 [2024-11-17 00:47:48,636 INFO L226 Difference]: Without dead ends: 124 [2024-11-17 00:47:48,636 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 45 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:47:48,637 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 0 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:47:48,637 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 259 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:47:48,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-17 00:47:48,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2024-11-17 00:47:48,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 84 states have (on average 1.5357142857142858) internal successors, (129), 119 states have internal predecessors, (129), 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:48,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 135 transitions. [2024-11-17 00:47:48,641 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 135 transitions. Word has length 40 [2024-11-17 00:47:48,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:47:48,643 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 135 transitions. [2024-11-17 00:47:48,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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:48,643 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 135 transitions. [2024-11-17 00:47:48,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-17 00:47:48,644 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:47:48,644 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] [2024-11-17 00:47:48,663 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-17 00:47:48,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:47:48,845 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2024-11-17 00:47:48,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:47:48,845 INFO L85 PathProgramCache]: Analyzing trace with hash -731062646, now seen corresponding path program 1 times [2024-11-17 00:47:48,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:47:48,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701876742] [2024-11-17 00:47:48,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:47:48,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:47:48,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:49,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:47:49,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:49,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-17 00:47:49,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:49,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-17 00:47:49,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:49,194 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:49,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:47:49,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701876742] [2024-11-17 00:47:49,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701876742] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:47:49,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [614725929] [2024-11-17 00:47:49,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:47:49,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:47:49,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:47:49,196 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:49,198 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:49,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:49,507 INFO L255 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-17 00:47:49,510 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:47:49,634 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:49,656 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:49,685 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2024-11-17 00:47:49,685 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 16 treesize of output 18 [2024-11-17 00:47:49,718 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:49,724 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:49,724 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:47:49,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [614725929] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:47:49,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-17 00:47:49,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [13] total 20 [2024-11-17 00:47:49,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117491669] [2024-11-17 00:47:49,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:47:49,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-17 00:47:49,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:47:49,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-17 00:47:49,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=333, Unknown=1, NotChecked=36, Total=420 [2024-11-17 00:47:49,726 INFO L87 Difference]: Start difference. First operand 124 states and 135 transitions. Second operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 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:50,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:47:50,006 INFO L93 Difference]: Finished difference Result 152 states and 167 transitions. [2024-11-17 00:47:50,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-17 00:47:50,006 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 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 43 [2024-11-17 00:47:50,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:47:50,007 INFO L225 Difference]: With dead ends: 152 [2024-11-17 00:47:50,007 INFO L226 Difference]: Without dead ends: 152 [2024-11-17 00:47:50,008 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=444, Unknown=1, NotChecked=42, Total=552 [2024-11-17 00:47:50,008 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 88 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 225 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:47:50,008 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 667 Invalid, 659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 432 Invalid, 0 Unknown, 225 Unchecked, 0.2s Time] [2024-11-17 00:47:50,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-11-17 00:47:50,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 127. [2024-11-17 00:47:50,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 87 states have (on average 1.5402298850574712) internal successors, (134), 122 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:50,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 140 transitions. [2024-11-17 00:47:50,012 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 140 transitions. Word has length 43 [2024-11-17 00:47:50,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:47:50,012 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 140 transitions. [2024-11-17 00:47:50,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 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:50,012 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 140 transitions. [2024-11-17 00:47:50,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-17 00:47:50,013 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:47:50,013 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] [2024-11-17 00:47:50,034 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:50,213 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:50,214 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2024-11-17 00:47:50,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:47:50,214 INFO L85 PathProgramCache]: Analyzing trace with hash -731062645, now seen corresponding path program 1 times [2024-11-17 00:47:50,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:47:50,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105872619] [2024-11-17 00:47:50,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:47:50,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:47:50,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:50,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:47:50,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:50,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-17 00:47:50,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:50,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-17 00:47:50,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:50,819 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:50,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:47:50,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105872619] [2024-11-17 00:47:50,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105872619] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:47:50,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [755133512] [2024-11-17 00:47:50,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:47:50,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:47:50,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:47:50,821 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:50,823 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:51,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:51,071 INFO L255 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-17 00:47:51,074 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:47:51,106 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,416 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:51,421 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:51,459 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) (exists ((|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_3| Int)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_3|) 0) 0))) is different from true [2024-11-17 00:47:51,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:47:51,524 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:51,541 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-17 00:47:51,542 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:51,593 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:51,606 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:51,606 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:47:51,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [755133512] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:47:51,781 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:47:51,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 27 [2024-11-17 00:47:51,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691636352] [2024-11-17 00:47:51,781 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:47:51,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-17 00:47:51,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:47:51,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-17 00:47:51,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=843, Unknown=1, NotChecked=58, Total=992 [2024-11-17 00:47:51,783 INFO L87 Difference]: Start difference. First operand 127 states and 140 transitions. Second operand has 28 states, 25 states have (on average 2.56) internal successors, (64), 24 states have internal predecessors, (64), 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:52,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:47:52,932 INFO L93 Difference]: Finished difference Result 159 states and 172 transitions. [2024-11-17 00:47:52,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-17 00:47:52,933 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 25 states have (on average 2.56) internal successors, (64), 24 states have internal predecessors, (64), 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 43 [2024-11-17 00:47:52,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:47:52,934 INFO L225 Difference]: With dead ends: 159 [2024-11-17 00:47:52,934 INFO L226 Difference]: Without dead ends: 159 [2024-11-17 00:47:52,934 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=166, Invalid=1559, Unknown=1, NotChecked=80, Total=1806 [2024-11-17 00:47:52,935 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 197 mSDsluCounter, 1510 mSDsCounter, 0 mSdLazyCounter, 1558 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 1612 SdHoareTripleChecker+Invalid, 1727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 166 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-17 00:47:52,935 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 1612 Invalid, 1727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1558 Invalid, 0 Unknown, 166 Unchecked, 0.9s Time] [2024-11-17 00:47:52,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-11-17 00:47:52,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 134. [2024-11-17 00:47:52,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 93 states have (on average 1.4946236559139785) internal successors, (139), 128 states have internal predecessors, (139), 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:52,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 145 transitions. [2024-11-17 00:47:52,939 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 145 transitions. Word has length 43 [2024-11-17 00:47:52,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:47:52,940 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 145 transitions. [2024-11-17 00:47:52,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 25 states have (on average 2.56) internal successors, (64), 24 states have internal predecessors, (64), 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:52,940 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 145 transitions. [2024-11-17 00:47:52,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-17 00:47:52,941 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:47:52,941 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:52,961 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:53,141 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:53,142 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2024-11-17 00:47:53,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:47:53,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1188107490, now seen corresponding path program 1 times [2024-11-17 00:47:53,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:47:53,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618952133] [2024-11-17 00:47:53,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:47:53,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:47:53,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:53,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:47:53,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:53,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-17 00:47:53,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:53,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-17 00:47:53,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:53,224 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:53,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:47:53,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618952133] [2024-11-17 00:47:53,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618952133] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:47:53,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:47:53,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:47:53,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92207] [2024-11-17 00:47:53,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:47:53,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:47:53,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:47:53,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:47:53,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:47:53,227 INFO L87 Difference]: Start difference. First operand 134 states and 145 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-17 00:47:53,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:47:53,313 INFO L93 Difference]: Finished difference Result 135 states and 146 transitions. [2024-11-17 00:47:53,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 00:47:53,313 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2024-11-17 00:47:53,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:47:53,314 INFO L225 Difference]: With dead ends: 135 [2024-11-17 00:47:53,314 INFO L226 Difference]: Without dead ends: 135 [2024-11-17 00:47:53,314 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 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:53,315 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 0 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:47:53,315 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 318 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:47:53,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-17 00:47:53,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2024-11-17 00:47:53,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 94 states have (on average 1.4893617021276595) internal successors, (140), 129 states have internal predecessors, (140), 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:53,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 146 transitions. [2024-11-17 00:47:53,321 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 146 transitions. Word has length 44 [2024-11-17 00:47:53,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:47:53,322 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 146 transitions. [2024-11-17 00:47:53,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-17 00:47:53,322 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 146 transitions. [2024-11-17 00:47:53,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-17 00:47:53,323 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:47:53,323 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] [2024-11-17 00:47:53,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-17 00:47:53,323 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2024-11-17 00:47:53,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:47:53,323 INFO L85 PathProgramCache]: Analyzing trace with hash 690059699, now seen corresponding path program 1 times [2024-11-17 00:47:53,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:47:53,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802882328] [2024-11-17 00:47:53,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:47:53,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:47:53,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:53,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:47:53,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:53,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-17 00:47:53,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:53,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-17 00:47:53,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:53,457 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:53,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:47:53,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802882328] [2024-11-17 00:47:53,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802882328] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:47:53,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:47:53,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 00:47:53,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587547266] [2024-11-17 00:47:53,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:47:53,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 00:47:53,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:47:53,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 00:47:53,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-17 00:47:53,459 INFO L87 Difference]: Start difference. First operand 135 states and 146 transitions. Second operand has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 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,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:47:53,648 INFO L93 Difference]: Finished difference Result 132 states and 143 transitions. [2024-11-17 00:47:53,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 00:47:53,649 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 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 46 [2024-11-17 00:47:53,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:47:53,649 INFO L225 Difference]: With dead ends: 132 [2024-11-17 00:47:53,649 INFO L226 Difference]: Without dead ends: 132 [2024-11-17 00:47:53,650 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:53,650 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 20 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:47:53,650 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 440 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:47:53,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-11-17 00:47:53,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2024-11-17 00:47:53,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 94 states have (on average 1.4574468085106382) internal successors, (137), 126 states have internal predecessors, (137), 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:53,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 143 transitions. [2024-11-17 00:47:53,654 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 143 transitions. Word has length 46 [2024-11-17 00:47:53,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:47:53,655 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 143 transitions. [2024-11-17 00:47:53,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 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,655 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 143 transitions. [2024-11-17 00:47:53,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-17 00:47:53,658 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:47:53,658 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] [2024-11-17 00:47:53,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-17 00:47:53,658 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2024-11-17 00:47:53,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:47:53,659 INFO L85 PathProgramCache]: Analyzing trace with hash 690059700, now seen corresponding path program 1 times [2024-11-17 00:47:53,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:47:53,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105591257] [2024-11-17 00:47:53,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:47:53,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:47:53,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:53,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:47:53,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:53,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-17 00:47:53,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:53,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-17 00:47:53,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:53,792 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:53,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:47:53,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105591257] [2024-11-17 00:47:53,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105591257] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:47:53,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:47:53,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 00:47:53,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881351796] [2024-11-17 00:47:53,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:47:53,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 00:47:53,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:47:53,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 00:47:53,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:47:53,794 INFO L87 Difference]: Start difference. First operand 132 states and 143 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 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:53,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:47:53,902 INFO L93 Difference]: Finished difference Result 135 states and 144 transitions. [2024-11-17 00:47:53,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:47:53,903 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 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 46 [2024-11-17 00:47:53,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:47:53,903 INFO L225 Difference]: With dead ends: 135 [2024-11-17 00:47:53,903 INFO L226 Difference]: Without dead ends: 135 [2024-11-17 00:47:53,904 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 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:47:53,904 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 80 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:47:53,904 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 345 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:47:53,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-17 00:47:53,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 131. [2024-11-17 00:47:53,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 93 states have (on average 1.4516129032258065) internal successors, (135), 125 states have internal predecessors, (135), 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:53,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 141 transitions. [2024-11-17 00:47:53,909 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 141 transitions. Word has length 46 [2024-11-17 00:47:53,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:47:53,909 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 141 transitions. [2024-11-17 00:47:53,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 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:53,909 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 141 transitions. [2024-11-17 00:47:53,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-17 00:47:53,911 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:47:53,911 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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:47:53,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-17 00:47:53,911 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2024-11-17 00:47:53,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:47:53,911 INFO L85 PathProgramCache]: Analyzing trace with hash -23717460, now seen corresponding path program 1 times [2024-11-17 00:47:53,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:47:53,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278646838] [2024-11-17 00:47:53,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:47:53,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:47:53,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:54,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:47:54,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:54,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-17 00:47:54,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:54,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-17 00:47:54,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:54,047 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-17 00:47:54,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:47:54,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278646838] [2024-11-17 00:47:54,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278646838] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:47:54,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:47:54,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 00:47:54,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374920029] [2024-11-17 00:47:54,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:47:54,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 00:47:54,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:47:54,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 00:47:54,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:47:54,048 INFO L87 Difference]: Start difference. First operand 131 states and 141 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 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:54,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:47:54,142 INFO L93 Difference]: Finished difference Result 132 states and 140 transitions. [2024-11-17 00:47:54,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 00:47:54,143 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 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 47 [2024-11-17 00:47:54,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:47:54,144 INFO L225 Difference]: With dead ends: 132 [2024-11-17 00:47:54,144 INFO L226 Difference]: Without dead ends: 132 [2024-11-17 00:47:54,144 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-17 00:47:54,145 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 72 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:47:54,145 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 347 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:47:54,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-11-17 00:47:54,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 128. [2024-11-17 00:47:54,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 92 states have (on average 1.423913043478261) internal successors, (131), 122 states have internal predecessors, (131), 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:54,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 137 transitions. [2024-11-17 00:47:54,148 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 137 transitions. Word has length 47 [2024-11-17 00:47:54,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:47:54,148 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 137 transitions. [2024-11-17 00:47:54,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 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:54,149 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 137 transitions. [2024-11-17 00:47:54,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-17 00:47:54,149 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:47:54,149 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] [2024-11-17 00:47:54,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-17 00:47:54,149 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2024-11-17 00:47:54,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:47:54,150 INFO L85 PathProgramCache]: Analyzing trace with hash -735243204, now seen corresponding path program 1 times [2024-11-17 00:47:54,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:47:54,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067157684] [2024-11-17 00:47:54,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:47:54,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:47:54,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:54,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:47:54,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:54,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-17 00:47:54,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:54,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-17 00:47:54,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:54,235 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-17 00:47:54,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:47:54,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067157684] [2024-11-17 00:47:54,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067157684] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:47:54,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:47:54,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:47:54,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737038399] [2024-11-17 00:47:54,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:47:54,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 00:47:54,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:47:54,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 00:47:54,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:47:54,237 INFO L87 Difference]: Start difference. First operand 128 states and 137 transitions. Second operand has 5 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-17 00:47:54,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:47:54,370 INFO L93 Difference]: Finished difference Result 127 states and 136 transitions. [2024-11-17 00:47:54,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:47:54,370 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 48 [2024-11-17 00:47:54,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:47:54,371 INFO L225 Difference]: With dead ends: 127 [2024-11-17 00:47:54,371 INFO L226 Difference]: Without dead ends: 127 [2024-11-17 00:47:54,372 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:47:54,372 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 0 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:47:54,372 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 332 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:47:54,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-17 00:47:54,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2024-11-17 00:47:54,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 92 states have (on average 1.4130434782608696) internal successors, (130), 121 states have internal predecessors, (130), 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:54,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 136 transitions. [2024-11-17 00:47:54,376 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 136 transitions. Word has length 48 [2024-11-17 00:47:54,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:47:54,376 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 136 transitions. [2024-11-17 00:47:54,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-17 00:47:54,376 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 136 transitions. [2024-11-17 00:47:54,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-17 00:47:54,377 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:47:54,377 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] [2024-11-17 00:47:54,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-17 00:47:54,377 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2024-11-17 00:47:54,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:47:54,378 INFO L85 PathProgramCache]: Analyzing trace with hash -735243203, now seen corresponding path program 1 times [2024-11-17 00:47:54,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:47:54,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285030517] [2024-11-17 00:47:54,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:47:54,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:47:54,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:54,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:47:54,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:54,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-17 00:47:54,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:54,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-17 00:47:54,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:54,493 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-17 00:47:54,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:47:54,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285030517] [2024-11-17 00:47:54,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285030517] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:47:54,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:47:54,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:47:54,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361006973] [2024-11-17 00:47:54,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:47:54,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 00:47:54,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:47:54,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 00:47:54,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:47:54,495 INFO L87 Difference]: Start difference. First operand 127 states and 136 transitions. Second operand has 5 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-17 00:47:54,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:47:54,636 INFO L93 Difference]: Finished difference Result 126 states and 135 transitions. [2024-11-17 00:47:54,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:47:54,637 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 48 [2024-11-17 00:47:54,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:47:54,638 INFO L225 Difference]: With dead ends: 126 [2024-11-17 00:47:54,638 INFO L226 Difference]: Without dead ends: 126 [2024-11-17 00:47:54,638 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:47:54,638 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 0 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:47:54,639 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 342 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:47:54,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-17 00:47:54,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2024-11-17 00:47:54,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 92 states have (on average 1.4021739130434783) internal successors, (129), 120 states have internal predecessors, (129), 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:54,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 135 transitions. [2024-11-17 00:47:54,642 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 135 transitions. Word has length 48 [2024-11-17 00:47:54,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:47:54,642 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 135 transitions. [2024-11-17 00:47:54,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-17 00:47:54,642 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 135 transitions. [2024-11-17 00:47:54,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-17 00:47:54,643 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:47:54,643 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] [2024-11-17 00:47:54,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-17 00:47:54,643 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2024-11-17 00:47:54,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:47:54,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1317702775, now seen corresponding path program 1 times [2024-11-17 00:47:54,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:47:54,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926072848] [2024-11-17 00:47:54,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:47:54,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:47:54,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:54,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:47:54,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:54,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-17 00:47:54,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:54,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-17 00:47:54,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:54,843 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-17 00:47:54,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:47:54,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926072848] [2024-11-17 00:47:54,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926072848] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:47:54,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:47:54,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 00:47:54,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138739449] [2024-11-17 00:47:54,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:47:54,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 00:47:54,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:47:54,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 00:47:54,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-17 00:47:54,847 INFO L87 Difference]: Start difference. First operand 126 states and 135 transitions. Second operand has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 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:55,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:47:55,005 INFO L93 Difference]: Finished difference Result 123 states and 132 transitions. [2024-11-17 00:47:55,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 00:47:55,006 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 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 49 [2024-11-17 00:47:55,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:47:55,006 INFO L225 Difference]: With dead ends: 123 [2024-11-17 00:47:55,007 INFO L226 Difference]: Without dead ends: 123 [2024-11-17 00:47:55,007 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-17 00:47:55,007 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 13 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:47:55,007 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 464 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:47:55,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-17 00:47:55,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2024-11-17 00:47:55,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 92 states have (on average 1.3695652173913044) internal successors, (126), 117 states have internal predecessors, (126), 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:55,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 132 transitions. [2024-11-17 00:47:55,014 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 132 transitions. Word has length 49 [2024-11-17 00:47:55,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:47:55,014 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 132 transitions. [2024-11-17 00:47:55,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 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:55,014 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 132 transitions. [2024-11-17 00:47:55,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-17 00:47:55,015 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:47:55,015 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, 1, 1, 1, 1] [2024-11-17 00:47:55,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-17 00:47:55,015 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2024-11-17 00:47:55,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:47:55,016 INFO L85 PathProgramCache]: Analyzing trace with hash 417051671, now seen corresponding path program 1 times [2024-11-17 00:47:55,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:47:55,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58213346] [2024-11-17 00:47:55,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:47:55,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:47:55,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:55,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:47:55,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:55,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-17 00:47:55,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:55,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-17 00:47:55,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:55,234 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-17 00:47:55,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:47:55,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58213346] [2024-11-17 00:47:55,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58213346] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:47:55,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1015746215] [2024-11-17 00:47:55,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:47:55,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:47:55,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:47:55,237 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:55,239 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:55,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:55,458 INFO L255 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-17 00:47:55,463 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:47:55,469 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:55,559 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:55,625 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-17 00:47:55,625 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 21 [2024-11-17 00:47:55,708 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:55,712 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-17 00:47:55,713 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:47:55,994 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 18 treesize of output 10 [2024-11-17 00:47:56,024 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-17 00:47:56,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1015746215] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:47:56,025 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:47:56,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 15, 15] total 24 [2024-11-17 00:47:56,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233792203] [2024-11-17 00:47:56,025 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:47:56,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-17 00:47:56,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:47:56,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-17 00:47:56,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=532, Unknown=0, NotChecked=0, Total=600 [2024-11-17 00:47:56,026 INFO L87 Difference]: Start difference. First operand 123 states and 132 transitions. Second operand has 25 states, 24 states have (on average 3.5) internal successors, (84), 19 states have internal predecessors, (84), 3 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-17 00:47:56,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:47:56,622 INFO L93 Difference]: Finished difference Result 166 states and 179 transitions. [2024-11-17 00:47:56,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-17 00:47:56,623 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.5) internal successors, (84), 19 states have internal predecessors, (84), 3 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 54 [2024-11-17 00:47:56,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:47:56,624 INFO L225 Difference]: With dead ends: 166 [2024-11-17 00:47:56,624 INFO L226 Difference]: Without dead ends: 166 [2024-11-17 00:47:56,624 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=126, Invalid=866, Unknown=0, NotChecked=0, Total=992 [2024-11-17 00:47:56,625 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 296 mSDsluCounter, 1071 mSDsCounter, 0 mSdLazyCounter, 1031 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 1150 SdHoareTripleChecker+Invalid, 1047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1031 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-17 00:47:56,626 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 1150 Invalid, 1047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1031 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-17 00:47:56,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-11-17 00:47:56,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 125. [2024-11-17 00:47:56,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 97 states have (on average 1.3298969072164948) internal successors, (129), 119 states have internal predecessors, (129), 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:56,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 135 transitions. [2024-11-17 00:47:56,631 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 135 transitions. Word has length 54 [2024-11-17 00:47:56,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:47:56,631 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 135 transitions. [2024-11-17 00:47:56,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.5) internal successors, (84), 19 states have internal predecessors, (84), 3 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-17 00:47:56,632 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 135 transitions. [2024-11-17 00:47:56,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-17 00:47:56,632 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:47:56,632 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, 1, 1, 1, 1] [2024-11-17 00:47:56,649 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,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:47:56,837 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2024-11-17 00:47:56,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:47:56,837 INFO L85 PathProgramCache]: Analyzing trace with hash 417051672, now seen corresponding path program 1 times [2024-11-17 00:47:56,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:47:56,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984993357] [2024-11-17 00:47:56,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:47:56,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:47:56,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:57,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:47:57,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:57,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-17 00:47:57,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:57,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-17 00:47:57,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:57,736 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-17 00:47:57,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:47:57,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984993357] [2024-11-17 00:47:57,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984993357] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:47:57,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1369929697] [2024-11-17 00:47:57,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:47:57,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:47:57,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:47:57,739 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,740 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,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:47:57,963 INFO L255 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-17 00:47:57,966 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:47:57,981 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,983 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:58,195 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:58,199 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:58,362 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-17 00:47:58,362 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 21 [2024-11-17 00:47:58,376 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-17 00:47:58,377 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,501 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,511 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-17 00:47:58,511 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:47:58,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1369929697] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:47:58,763 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:47:58,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 16] total 30 [2024-11-17 00:47:58,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962778803] [2024-11-17 00:47:58,763 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:47:58,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-17 00:47:58,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:47:58,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-17 00:47:58,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=1086, Unknown=0, NotChecked=0, Total=1190 [2024-11-17 00:47:58,765 INFO L87 Difference]: Start difference. First operand 125 states and 135 transitions. Second operand has 31 states, 28 states have (on average 2.642857142857143) internal successors, (74), 26 states have internal predecessors, (74), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-17 00:47:59,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:47:59,867 INFO L93 Difference]: Finished difference Result 164 states and 178 transitions. [2024-11-17 00:47:59,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-17 00:47:59,868 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 28 states have (on average 2.642857142857143) internal successors, (74), 26 states have internal predecessors, (74), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 54 [2024-11-17 00:47:59,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:47:59,868 INFO L225 Difference]: With dead ends: 164 [2024-11-17 00:47:59,869 INFO L226 Difference]: Without dead ends: 164 [2024-11-17 00:47:59,869 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=191, Invalid=1971, Unknown=0, NotChecked=0, Total=2162 [2024-11-17 00:47:59,870 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 80 mSDsluCounter, 1256 mSDsCounter, 0 mSdLazyCounter, 1532 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 1333 SdHoareTripleChecker+Invalid, 1535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-17 00:47:59,872 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 1333 Invalid, 1535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1532 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-17 00:47:59,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-11-17 00:47:59,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 127. [2024-11-17 00:47:59,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 99 states have (on average 1.3232323232323233) internal successors, (131), 121 states have internal predecessors, (131), 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,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 137 transitions. [2024-11-17 00:47:59,876 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 137 transitions. Word has length 54 [2024-11-17 00:47:59,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:47:59,876 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 137 transitions. [2024-11-17 00:47:59,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 28 states have (on average 2.642857142857143) internal successors, (74), 26 states have internal predecessors, (74), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-17 00:47:59,876 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 137 transitions. [2024-11-17 00:47:59,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-17 00:47:59,877 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:47:59,877 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, 1, 1, 1, 1] [2024-11-17 00:47:59,895 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:48:00,078 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,SelfDestructingSolverStorable20 [2024-11-17 00:48:00,079 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2024-11-17 00:48:00,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:48:00,079 INFO L85 PathProgramCache]: Analyzing trace with hash -743838899, now seen corresponding path program 1 times [2024-11-17 00:48:00,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:48:00,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982312797] [2024-11-17 00:48:00,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:48:00,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:48:00,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:00,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:48:00,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:00,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-17 00:48:00,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:00,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-17 00:48:00,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:00,243 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-17 00:48:00,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:48:00,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982312797] [2024-11-17 00:48:00,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982312797] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:48:00,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [78349920] [2024-11-17 00:48:00,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:48:00,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:48:00,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:48:00,246 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,248 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,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:00,471 INFO L255 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-17 00:48:00,473 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:48:00,486 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:48:00,499 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|))) (not (= |node_create_~temp~0#1.base| 0)))) is different from true [2024-11-17 00:48:00,516 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:48:00,550 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:48:00,603 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:48:00,661 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-17 00:48:00,661 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:00,680 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-17 00:48:00,680 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:48:00,996 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-17 00:48:00,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [78349920] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:48:00,997 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:48:00,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 21 [2024-11-17 00:48:00,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456346463] [2024-11-17 00:48:00,997 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:48:00,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-17 00:48:00,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:48:00,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-17 00:48:00,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=314, Unknown=1, NotChecked=36, Total=420 [2024-11-17 00:48:00,998 INFO L87 Difference]: Start difference. First operand 127 states and 137 transitions. Second operand has 21 states, 21 states have (on average 4.428571428571429) internal successors, (93), 19 states have internal predecessors, (93), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-17 00:48:01,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:48:01,318 INFO L93 Difference]: Finished difference Result 112 states and 120 transitions. [2024-11-17 00:48:01,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-17 00:48:01,320 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.428571428571429) internal successors, (93), 19 states have internal predecessors, (93), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 54 [2024-11-17 00:48:01,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:48:01,321 INFO L225 Difference]: With dead ends: 112 [2024-11-17 00:48:01,321 INFO L226 Difference]: Without dead ends: 112 [2024-11-17 00:48:01,322 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 93 SyntacticMatches, 7 SemanticMatches, 25 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=517, Unknown=9, NotChecked=48, Total=702 [2024-11-17 00:48:01,322 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 251 mSDsluCounter, 618 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 685 SdHoareTripleChecker+Invalid, 600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 102 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:48:01,322 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 685 Invalid, 600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 480 Invalid, 0 Unknown, 102 Unchecked, 0.2s Time] [2024-11-17 00:48:01,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-17 00:48:01,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-11-17 00:48:01,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 86 states have (on average 1.3255813953488371) internal successors, (114), 106 states have internal predecessors, (114), 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:01,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 120 transitions. [2024-11-17 00:48:01,329 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 120 transitions. Word has length 54 [2024-11-17 00:48:01,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:48:01,330 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 120 transitions. [2024-11-17 00:48:01,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.428571428571429) internal successors, (93), 19 states have internal predecessors, (93), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-17 00:48:01,330 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 120 transitions. [2024-11-17 00:48:01,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-17 00:48:01,330 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:48:01,330 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:48:01,349 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-17 00:48:01,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:48:01,531 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2024-11-17 00:48:01,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:48:01,532 INFO L85 PathProgramCache]: Analyzing trace with hash 490666889, now seen corresponding path program 1 times [2024-11-17 00:48:01,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:48:01,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611991773] [2024-11-17 00:48:01,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:48:01,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:48:01,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:02,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:48:02,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:02,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-17 00:48:02,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:03,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-17 00:48:03,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:03,333 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-17 00:48:03,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:48:03,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611991773] [2024-11-17 00:48:03,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611991773] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:48:03,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1760270297] [2024-11-17 00:48:03,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:48:03,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:48:03,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:48:03,336 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,338 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:03,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:03,808 INFO L255 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 111 conjuncts are in the unsatisfiable core [2024-11-17 00:48:03,816 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:48:03,892 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,135 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:04,261 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-17 00:48:04,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-17 00:48:04,420 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 23 treesize of output 11 [2024-11-17 00:48:04,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-17 00:48:04,737 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:04,739 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:04,999 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2024-11-17 00:48:04,999 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 20 treesize of output 22 [2024-11-17 00:48:05,008 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 20 treesize of output 15 [2024-11-17 00:48:05,575 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 39 treesize of output 15 [2024-11-17 00:48:05,664 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 20 treesize of output 15 [2024-11-17 00:48:05,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-17 00:48:05,895 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:48:05,895 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:48:06,078 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2519 (Array Int Int)) (v_ArrVal_2518 (Array Int Int))) (or (not (= v_ArrVal_2518 (store (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| (select v_ArrVal_2518 |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_2518) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2519) (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:06,122 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2519 (Array Int Int)) (v_ArrVal_2518 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_2518) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2519) (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))) (not (= (store (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| (select v_ArrVal_2518 |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset|)) v_ArrVal_2518)))) is different from false [2024-11-17 00:48:06,140 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2519 (Array Int Int)) (v_ArrVal_2518 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base| v_ArrVal_2518) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2519) (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))) (not (= (store (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.offset| (select v_ArrVal_2518 |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.offset|)) v_ArrVal_2518)))) is different from false [2024-11-17 00:48:06,152 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2519 (Array Int Int)) (v_ArrVal_2518 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (not (= v_ArrVal_2518 (let ((.cse1 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store (select |c_#memory_int#2| .cse0) .cse1 (select v_ArrVal_2518 .cse1))))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| .cse0 v_ArrVal_2518) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2519) (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:06,164 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2519 (Array Int Int)) (v_ArrVal_2518 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (not (= v_ArrVal_2518 (let ((.cse1 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store (select |c_#memory_int#2| .cse0) .cse1 (select v_ArrVal_2518 .cse1))))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| .cse0 v_ArrVal_2518) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_2519) (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:06,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1760270297] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:48:06,295 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:48:06,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31] total 61 [2024-11-17 00:48:06,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950224517] [2024-11-17 00:48:06,295 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:48:06,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2024-11-17 00:48:06,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:48:06,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2024-11-17 00:48:06,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=264, Invalid=4031, Unknown=15, NotChecked=660, Total=4970 [2024-11-17 00:48:06,298 INFO L87 Difference]: Start difference. First operand 112 states and 120 transitions. Second operand has 61 states, 57 states have (on average 1.7543859649122806) internal successors, (100), 52 states have internal predecessors, (100), 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:07,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:48:07,997 INFO L93 Difference]: Finished difference Result 116 states and 122 transitions. [2024-11-17 00:48:07,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-17 00:48:07,997 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 57 states have (on average 1.7543859649122806) internal successors, (100), 52 states have internal predecessors, (100), 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 58 [2024-11-17 00:48:07,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:48:07,998 INFO L225 Difference]: With dead ends: 116 [2024-11-17 00:48:07,998 INFO L226 Difference]: Without dead ends: 116 [2024-11-17 00:48:08,000 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 2071 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=512, Invalid=7503, Unknown=15, NotChecked=900, Total=8930 [2024-11-17 00:48:08,000 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 89 mSDsluCounter, 2204 mSDsCounter, 0 mSdLazyCounter, 1884 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 2278 SdHoareTripleChecker+Invalid, 1894 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-17 00:48:08,000 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 2278 Invalid, 1894 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1884 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-17 00:48:08,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-17 00:48:08,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 112. [2024-11-17 00:48:08,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 86 states have (on average 1.313953488372093) internal successors, (113), 106 states have internal predecessors, (113), 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:08,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 119 transitions. [2024-11-17 00:48:08,003 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 119 transitions. Word has length 58 [2024-11-17 00:48:08,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:48:08,004 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 119 transitions. [2024-11-17 00:48:08,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 57 states have (on average 1.7543859649122806) internal successors, (100), 52 states have internal predecessors, (100), 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,004 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 119 transitions. [2024-11-17 00:48:08,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-17 00:48:08,006 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:48:08,006 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:48:08,023 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,206 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,SelfDestructingSolverStorable22 [2024-11-17 00:48:08,207 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2024-11-17 00:48:08,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:48:08,207 INFO L85 PathProgramCache]: Analyzing trace with hash -819138228, now seen corresponding path program 1 times [2024-11-17 00:48:08,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:48:08,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361333963] [2024-11-17 00:48:08,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:48:08,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:48:08,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:08,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:48:08,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:08,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-17 00:48:08,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:09,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-17 00:48:09,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:09,103 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-17 00:48:09,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:48:09,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361333963] [2024-11-17 00:48:09,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361333963] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:48:09,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1000945924] [2024-11-17 00:48:09,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:48:09,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:48:09,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:48:09,106 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:09,108 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:09,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:09,381 INFO L255 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 78 conjuncts are in the unsatisfiable core [2024-11-17 00:48:09,384 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:48:09,387 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:09,551 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-17 00:48:09,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-17 00:48:09,615 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:09,711 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-17 00:48:09,711 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:09,808 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:09,811 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:09,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:48:09,950 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:09,973 INFO L349 Elim1Store]: treesize reduction 88, result has 36.7 percent of original size [2024-11-17 00:48:09,973 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 40 treesize of output 60 [2024-11-17 00:48:10,178 INFO L349 Elim1Store]: treesize reduction 33, result has 48.4 percent of original size [2024-11-17 00:48:10,178 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 1 case distinctions, treesize of input 65 treesize of output 56 [2024-11-17 00:48:10,316 INFO L349 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2024-11-17 00:48:10,316 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 104 treesize of output 88 [2024-11-17 00:48:10,352 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:48:10,508 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 152 treesize of output 104 [2024-11-17 00:48:10,512 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 103 treesize of output 75 [2024-11-17 00:48:10,812 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 79 treesize of output 51 [2024-11-17 00:48:11,061 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-17 00:48:11,061 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:48:11,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1000945924] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:48:11,377 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:48:11,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 27] total 47 [2024-11-17 00:48:11,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538849730] [2024-11-17 00:48:11,377 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:48:11,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2024-11-17 00:48:11,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:48:11,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-11-17 00:48:11,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=2497, Unknown=1, NotChecked=0, Total=2652 [2024-11-17 00:48:11,379 INFO L87 Difference]: Start difference. First operand 112 states and 119 transitions. Second operand has 48 states, 45 states have (on average 2.2222222222222223) internal successors, (100), 40 states have internal predecessors, (100), 4 states have call successors, (6), 4 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:48:13,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:48:13,009 INFO L93 Difference]: Finished difference Result 122 states and 131 transitions. [2024-11-17 00:48:13,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-17 00:48:13,009 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 45 states have (on average 2.2222222222222223) internal successors, (100), 40 states have internal predecessors, (100), 4 states have call successors, (6), 4 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 60 [2024-11-17 00:48:13,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:48:13,010 INFO L225 Difference]: With dead ends: 122 [2024-11-17 00:48:13,010 INFO L226 Difference]: Without dead ends: 122 [2024-11-17 00:48:13,011 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 878 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=332, Invalid=4223, Unknown=1, NotChecked=0, Total=4556 [2024-11-17 00:48:13,012 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 101 mSDsluCounter, 1510 mSDsCounter, 0 mSdLazyCounter, 1968 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 1575 SdHoareTripleChecker+Invalid, 1975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1968 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-17 00:48:13,012 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 1575 Invalid, 1975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1968 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-17 00:48:13,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-17 00:48:13,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 118. [2024-11-17 00:48:13,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 92 states have (on average 1.326086956521739) internal successors, (122), 112 states have internal predecessors, (122), 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:13,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 128 transitions. [2024-11-17 00:48:13,015 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 128 transitions. Word has length 60 [2024-11-17 00:48:13,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:48:13,015 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 128 transitions. [2024-11-17 00:48:13,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 45 states have (on average 2.2222222222222223) internal successors, (100), 40 states have internal predecessors, (100), 4 states have call successors, (6), 4 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:48:13,016 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 128 transitions. [2024-11-17 00:48:13,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-17 00:48:13,016 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:48:13,016 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:48:13,034 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:13,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-17 00:48:13,217 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2024-11-17 00:48:13,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:48:13,217 INFO L85 PathProgramCache]: Analyzing trace with hash -819138227, now seen corresponding path program 1 times [2024-11-17 00:48:13,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:48:13,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079420800] [2024-11-17 00:48:13,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:48:13,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:48:13,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:14,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:48:14,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:14,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-17 00:48:14,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:14,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-17 00:48:14,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:14,214 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-17 00:48:14,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:48:14,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079420800] [2024-11-17 00:48:14,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079420800] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:48:14,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1380804933] [2024-11-17 00:48:14,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:48:14,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:48:14,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:48:14,216 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:14,217 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:14,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:14,454 INFO L255 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 114 conjuncts are in the unsatisfiable core [2024-11-17 00:48:14,457 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:48:14,463 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:14,465 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:14,723 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-17 00:48:14,723 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:14,746 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-17 00:48:14,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-17 00:48:14,828 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:14,835 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:14,940 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-17 00:48:14,940 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:14,947 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:15,094 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 55 treesize of output 19 [2024-11-17 00:48:15,101 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 15 treesize of output 3 [2024-11-17 00:48:15,106 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:15,110 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:15,361 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-17 00:48:15,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 27 [2024-11-17 00:48:15,366 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:15,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:48:15,377 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 63 treesize of output 46 [2024-11-17 00:48:15,396 INFO L349 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2024-11-17 00:48:15,396 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:15,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2024-11-17 00:48:15,733 INFO L349 Elim1Store]: treesize reduction 33, result has 48.4 percent of original size [2024-11-17 00:48:15,733 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 1 case distinctions, treesize of input 65 treesize of output 56 [2024-11-17 00:48:15,759 INFO L349 Elim1Store]: treesize reduction 49, result has 23.4 percent of original size [2024-11-17 00:48:15,760 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 1 case distinctions, treesize of input 27 treesize of output 26 [2024-11-17 00:48:15,900 INFO L349 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2024-11-17 00:48:15,900 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 111 treesize of output 95 [2024-11-17 00:48:15,920 INFO L349 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2024-11-17 00:48:15,921 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 124 treesize of output 126 [2024-11-17 00:48:15,980 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:48:16,010 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:48:16,320 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 283 treesize of output 207 [2024-11-17 00:48:16,325 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 211 treesize of output 163 [2024-11-17 00:48:16,884 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:48:16,884 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 160 treesize of output 136 [2024-11-17 00:48:16,899 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:48:16,900 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 104 treesize of output 108 [2024-11-17 00:48:17,709 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-17 00:48:17,709 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:48:17,961 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (forall ((v_ArrVal_2917 (Array Int Int))) (<= 0 (+ 4 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2917) .cse0) .cse1)))) (forall ((v_ArrVal_2917 (Array Int Int)) (v_ArrVal_2916 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2917) .cse0) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2916) .cse0) .cse1)))))) is different from false [2024-11-17 00:48:26,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1380804933] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:48:26,845 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:48:26,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 27] total 48 [2024-11-17 00:48:26,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728957274] [2024-11-17 00:48:26,845 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:48:26,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-11-17 00:48:26,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:48:26,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-11-17 00:48:26,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=3002, Unknown=39, NotChecked=110, Total=3306 [2024-11-17 00:48:26,847 INFO L87 Difference]: Start difference. First operand 118 states and 128 transitions. Second operand has 49 states, 46 states have (on average 2.239130434782609) internal successors, (103), 41 states have internal predecessors, (103), 4 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-17 00:48:29,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:48:29,390 INFO L93 Difference]: Finished difference Result 126 states and 135 transitions. [2024-11-17 00:48:29,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-17 00:48:29,390 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 46 states have (on average 2.239130434782609) internal successors, (103), 41 states have internal predecessors, (103), 4 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 60 [2024-11-17 00:48:29,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:48:29,391 INFO L225 Difference]: With dead ends: 126 [2024-11-17 00:48:29,391 INFO L226 Difference]: Without dead ends: 126 [2024-11-17 00:48:29,393 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 785 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=323, Invalid=5044, Unknown=39, NotChecked=144, Total=5550 [2024-11-17 00:48:29,393 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 173 mSDsluCounter, 1959 mSDsCounter, 0 mSdLazyCounter, 2170 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 2028 SdHoareTripleChecker+Invalid, 2175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 2170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-17 00:48:29,393 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 2028 Invalid, 2175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 2170 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-17 00:48:29,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-17 00:48:29,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 122. [2024-11-17 00:48:29,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 96 states have (on average 1.3125) internal successors, (126), 116 states have internal predecessors, (126), 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:29,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 132 transitions. [2024-11-17 00:48:29,397 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 132 transitions. Word has length 60 [2024-11-17 00:48:29,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:48:29,397 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 132 transitions. [2024-11-17 00:48:29,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 46 states have (on average 2.239130434782609) internal successors, (103), 41 states have internal predecessors, (103), 4 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-17 00:48:29,397 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 132 transitions. [2024-11-17 00:48:29,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-17 00:48:29,398 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:48:29,398 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:48:29,415 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:29,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-11-17 00:48:29,599 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2024-11-17 00:48:29,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:48:29,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1584544595, now seen corresponding path program 1 times [2024-11-17 00:48:29,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:48:29,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422481004] [2024-11-17 00:48:29,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:48:29,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:48:29,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:30,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:48:30,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:30,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-17 00:48:30,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:30,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-17 00:48:30,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:30,765 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-17 00:48:30,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:48:30,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422481004] [2024-11-17 00:48:30,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422481004] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:48:30,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [229374905] [2024-11-17 00:48:30,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:48:30,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:48:30,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:48:30,768 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:30,769 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:31,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:31,043 INFO L255 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 117 conjuncts are in the unsatisfiable core [2024-11-17 00:48:31,046 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:48:31,309 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:31,396 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:31,502 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-17 00:48:31,503 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:31,898 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:31,903 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 19 treesize of output 11 [2024-11-17 00:48:31,910 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 19 treesize of output 11 [2024-11-17 00:48:31,996 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-11-17 00:48:31,996 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 119 treesize of output 76 [2024-11-17 00:48:31,999 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 55 treesize of output 19 [2024-11-17 00:48:32,004 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 15 [2024-11-17 00:48:32,071 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 50 treesize of output 30 [2024-11-17 00:48:32,238 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 27 treesize of output 15 [2024-11-17 00:48:32,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 7 treesize of output 3 [2024-11-17 00:48:32,357 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:32,359 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 22 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-17 00:48:32,359 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:48:32,650 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:48:32,650 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 70 [2024-11-17 00:48:32,663 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:48:32,664 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 136 treesize of output 139 [2024-11-17 00:48:32,671 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:48:32,671 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 116 treesize of output 108 [2024-11-17 00:48:32,685 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:48:32,685 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 202 treesize of output 193 [2024-11-17 00:48:32,690 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 43 treesize of output 37 [2024-11-17 00:48:32,694 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 37 treesize of output 31 [2024-11-17 00:48:38,599 INFO L349 Elim1Store]: treesize reduction 204, result has 82.7 percent of original size [2024-11-17 00:48:38,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 13 new quantified variables, introduced 79 case distinctions, treesize of input 2319 treesize of output 2840 [2024-11-17 00:48:40,639 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:48:40,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 17 select indices, 17 select index equivalence classes, 0 disjoint index pairs (out of 136 index pairs), introduced 17 new quantified variables, introduced 136 case distinctions, treesize of input 2268 treesize of output 3262 [2024-11-17 00:48:41,274 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:48:41,274 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 2007 treesize of output 1992 [2024-11-17 00:48:41,758 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 1997 treesize of output 1993 [2024-11-17 00:48:42,207 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 2021 treesize of output 2009 [2024-11-17 00:48:42,694 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:48:42,695 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 2051 treesize of output 2044 [2024-11-17 00:48:43,204 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:48:43,205 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 2091 treesize of output 2076 [2024-11-17 00:48:43,652 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 2095 treesize of output 2083 [2024-11-17 00:48:44,177 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:48:44,178 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 2111 treesize of output 2106 [2024-11-17 00:48:44,678 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:48:44,679 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 2125 treesize of output 2120 [2024-11-17 00:48:45,205 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 2111 treesize of output 2109 [2024-11-17 00:48:45,698 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 2137 treesize of output 2125 [2024-11-17 00:48:46,146 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 2139 treesize of output 2135 [2024-11-17 00:48:46,648 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:48:46,648 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 2177 treesize of output 2170 [2024-11-17 00:48:47,100 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 2161 treesize of output 2159 [2024-11-17 00:48:47,598 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 2159 treesize of output 2157 [2024-11-17 00:48:48,087 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:48:48,088 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 2185 treesize of output 2180