./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 023d838f 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-023d838-m [2024-11-10 15:28:48,625 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 15:28:48,676 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-10 15:28:48,682 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 15:28:48,683 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 15:28:48,706 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 15:28:48,707 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 15:28:48,707 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 15:28:48,708 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 15:28:48,709 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 15:28:48,709 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 15:28:48,709 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 15:28:48,710 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 15:28:48,710 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 15:28:48,711 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 15:28:48,711 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 15:28:48,712 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 15:28:48,712 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 15:28:48,712 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 15:28:48,712 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 15:28:48,715 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 15:28:48,715 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 15:28:48,716 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-10 15:28:48,716 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 15:28:48,716 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 15:28:48,716 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 15:28:48,716 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 15:28:48,716 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 15:28:48,717 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 15:28:48,717 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 15:28:48,717 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 15:28:48,717 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 15:28:48,717 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 15:28:48,717 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 15:28:48,718 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 15:28:48,718 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 15:28:48,718 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 15:28:48,718 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 15:28:48,718 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 15:28:48,718 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 15:28:48,719 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 15:28:48,719 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 15:28:48,719 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-10 15:28:48,953 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 15:28:48,981 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 15:28:48,984 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 15:28:48,984 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 15:28:48,985 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 15:28:48,986 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-10 15:28:50,200 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 15:28:50,398 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 15:28:50,398 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_insert_unequal.i [2024-11-10 15:28:50,413 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8e8105dd/2ac8e1dce3214b1ea2052df080952a05/FLAGa3b7363d4 [2024-11-10 15:28:50,760 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8e8105dd/2ac8e1dce3214b1ea2052df080952a05 [2024-11-10 15:28:50,762 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 15:28:50,762 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 15:28:50,763 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 15:28:50,763 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 15:28:50,768 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 15:28:50,768 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:28:50" (1/1) ... [2024-11-10 15:28:50,769 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c7c9533 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:28:50, skipping insertion in model container [2024-11-10 15:28:50,769 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:28:50" (1/1) ... [2024-11-10 15:28:50,800 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 15:28:51,046 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 15:28:51,052 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 15:28:51,084 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 15:28:51,108 INFO L204 MainTranslator]: Completed translation [2024-11-10 15:28:51,109 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:28:51 WrapperNode [2024-11-10 15:28:51,109 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 15:28:51,110 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 15:28:51,110 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 15:28:51,113 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 15:28:51,118 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:28:51" (1/1) ... [2024-11-10 15:28:51,129 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:28:51" (1/1) ... [2024-11-10 15:28:51,153 INFO L138 Inliner]: procedures = 127, calls = 49, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 177 [2024-11-10 15:28:51,153 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 15:28:51,153 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 15:28:51,154 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 15:28:51,154 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 15:28:51,165 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:28:51" (1/1) ... [2024-11-10 15:28:51,165 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:28:51" (1/1) ... [2024-11-10 15:28:51,168 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:28:51" (1/1) ... [2024-11-10 15:28:51,185 INFO L175 MemorySlicer]: Split 30 memory accesses to 3 slices as follows [2, 18, 10]. 60 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 10 writes are split as follows [0, 9, 1]. [2024-11-10 15:28:51,185 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:28:51" (1/1) ... [2024-11-10 15:28:51,185 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:28:51" (1/1) ... [2024-11-10 15:28:51,192 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:28:51" (1/1) ... [2024-11-10 15:28:51,193 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:28:51" (1/1) ... [2024-11-10 15:28:51,194 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:28:51" (1/1) ... [2024-11-10 15:28:51,195 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:28:51" (1/1) ... [2024-11-10 15:28:51,198 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 15:28:51,199 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 15:28:51,199 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 15:28:51,199 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 15:28:51,200 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:28:51" (1/1) ... [2024-11-10 15:28:51,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 15:28:51,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:28:51,228 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-10 15:28:51,230 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-10 15:28:51,260 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-10 15:28:51,261 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-10 15:28:51,261 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-10 15:28:51,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-10 15:28:51,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-10 15:28:51,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-10 15:28:51,261 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-10 15:28:51,261 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-10 15:28:51,261 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-10 15:28:51,262 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 15:28:51,262 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-10 15:28:51,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-10 15:28:51,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-10 15:28:51,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-10 15:28:51,263 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-10 15:28:51,263 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-10 15:28:51,263 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-10 15:28:51,263 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 15:28:51,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-10 15:28:51,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-10 15:28:51,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-10 15:28:51,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 15:28:51,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-10 15:28:51,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-10 15:28:51,263 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 15:28:51,263 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 15:28:51,368 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 15:28:51,370 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 15:28:51,702 INFO L1247 $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-10 15:28:51,721 INFO L1247 $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-10 15:28:51,743 INFO L? ?]: Removed 161 outVars from TransFormulas that were not future-live. [2024-11-10 15:28:51,743 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 15:28:51,757 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 15:28:51,757 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 15:28:51,758 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:28:51 BoogieIcfgContainer [2024-11-10 15:28:51,758 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 15:28:51,760 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 15:28:51,760 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 15:28:51,762 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 15:28:51,762 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:28:50" (1/3) ... [2024-11-10 15:28:51,763 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71b469a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:28:51, skipping insertion in model container [2024-11-10 15:28:51,763 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:28:51" (2/3) ... [2024-11-10 15:28:51,763 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71b469a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:28:51, skipping insertion in model container [2024-11-10 15:28:51,764 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:28:51" (3/3) ... [2024-11-10 15:28:51,765 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_insert_unequal.i [2024-11-10 15:28:51,776 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 15:28:51,776 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 62 error locations. [2024-11-10 15:28:51,810 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 15:28:51,814 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;@5af0efab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 15:28:51,814 INFO L334 AbstractCegarLoop]: Starting to check reachability of 62 error locations. [2024-11-10 15:28:51,817 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-10 15:28:51,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-10 15:28:51,821 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:28:51,822 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-10 15:28:51,822 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-10 15:28:51,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:28:51,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1503076244, now seen corresponding path program 1 times [2024-11-10 15:28:51,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:28:51,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933537324] [2024-11-10 15:28:51,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:51,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:28:51,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:52,067 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-10 15:28:52,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:28:52,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933537324] [2024-11-10 15:28:52,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933537324] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:28:52,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:28:52,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 15:28:52,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589878804] [2024-11-10 15:28:52,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:28:52,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:28:52,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:28:52,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:28:52,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:28:52,098 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-10 15:28:52,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:28:52,224 INFO L93 Difference]: Finished difference Result 150 states and 163 transitions. [2024-11-10 15:28:52,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:28:52,226 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-10 15:28:52,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:28:52,232 INFO L225 Difference]: With dead ends: 150 [2024-11-10 15:28:52,232 INFO L226 Difference]: Without dead ends: 146 [2024-11-10 15:28:52,233 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-10 15:28:52,235 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-10 15:28:52,236 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-10 15:28:52,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-10 15:28:52,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2024-11-10 15:28:52,261 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-10 15:28:52,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 158 transitions. [2024-11-10 15:28:52,264 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 158 transitions. Word has length 6 [2024-11-10 15:28:52,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:28:52,264 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 158 transitions. [2024-11-10 15:28:52,264 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-10 15:28:52,264 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 158 transitions. [2024-11-10 15:28:52,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-10 15:28:52,264 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:28:52,265 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-10 15:28:52,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 15:28:52,265 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-10 15:28:52,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:28:52,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1503076245, now seen corresponding path program 1 times [2024-11-10 15:28:52,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:28:52,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833822296] [2024-11-10 15:28:52,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:52,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:28:52,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:52,361 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-10 15:28:52,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:28:52,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833822296] [2024-11-10 15:28:52,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833822296] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:28:52,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:28:52,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 15:28:52,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395368344] [2024-11-10 15:28:52,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:28:52,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:28:52,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:28:52,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:28:52,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:28:52,364 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-10 15:28:52,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:28:52,464 INFO L93 Difference]: Finished difference Result 144 states and 156 transitions. [2024-11-10 15:28:52,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:28:52,465 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-10 15:28:52,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:28:52,466 INFO L225 Difference]: With dead ends: 144 [2024-11-10 15:28:52,466 INFO L226 Difference]: Without dead ends: 144 [2024-11-10 15:28:52,466 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-10 15:28:52,467 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-10 15:28:52,467 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-10 15:28:52,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-10 15:28:52,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2024-11-10 15:28:52,474 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-10 15:28:52,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 156 transitions. [2024-11-10 15:28:52,478 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 156 transitions. Word has length 6 [2024-11-10 15:28:52,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:28:52,478 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 156 transitions. [2024-11-10 15:28:52,478 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-10 15:28:52,479 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 156 transitions. [2024-11-10 15:28:52,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-10 15:28:52,479 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:28:52,479 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:28:52,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 15:28:52,479 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-10 15:28:52,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:28:52,480 INFO L85 PathProgramCache]: Analyzing trace with hash -913950002, now seen corresponding path program 1 times [2024-11-10 15:28:52,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:28:52,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492160252] [2024-11-10 15:28:52,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:52,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:28:52,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:52,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:28:52,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:52,606 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-10 15:28:52,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:28:52,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492160252] [2024-11-10 15:28:52,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492160252] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:28:52,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:28:52,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 15:28:52,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106238756] [2024-11-10 15:28:52,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:28:52,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 15:28:52,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:28:52,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 15:28:52,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:28:52,608 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-10 15:28:52,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:28:52,736 INFO L93 Difference]: Finished difference Result 152 states and 165 transitions. [2024-11-10 15:28:52,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 15:28:52,736 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-10 15:28:52,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:28:52,738 INFO L225 Difference]: With dead ends: 152 [2024-11-10 15:28:52,738 INFO L226 Difference]: Without dead ends: 152 [2024-11-10 15:28:52,739 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-10 15:28:52,740 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-10 15:28:52,741 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-10 15:28:52,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-11-10 15:28:52,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 146. [2024-11-10 15:28:52,750 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-10 15:28:52,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 158 transitions. [2024-11-10 15:28:52,751 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 158 transitions. Word has length 14 [2024-11-10 15:28:52,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:28:52,751 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 158 transitions. [2024-11-10 15:28:52,751 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-10 15:28:52,751 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 158 transitions. [2024-11-10 15:28:52,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-10 15:28:52,752 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:28:52,752 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:28:52,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 15:28:52,752 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-10 15:28:52,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:28:52,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1837633504, now seen corresponding path program 1 times [2024-11-10 15:28:52,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:28:52,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668083086] [2024-11-10 15:28:52,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:52,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:28:52,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:52,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:28:52,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:52,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 15:28:52,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:52,967 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-10 15:28:52,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:28:52,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668083086] [2024-11-10 15:28:52,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668083086] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:28:52,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:28:52,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 15:28:52,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178678315] [2024-11-10 15:28:52,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:28:52,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 15:28:52,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:28:52,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 15:28:52,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 15:28:52,969 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-10 15:28:53,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:28:53,189 INFO L93 Difference]: Finished difference Result 145 states and 157 transitions. [2024-11-10 15:28:53,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 15:28:53,190 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-10 15:28:53,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:28:53,190 INFO L225 Difference]: With dead ends: 145 [2024-11-10 15:28:53,190 INFO L226 Difference]: Without dead ends: 145 [2024-11-10 15:28:53,191 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-10 15:28:53,191 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.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:28:53,192 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.2s Time] [2024-11-10 15:28:53,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-10 15:28:53,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2024-11-10 15:28:53,202 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-10 15:28:53,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 157 transitions. [2024-11-10 15:28:53,203 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 157 transitions. Word has length 23 [2024-11-10 15:28:53,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:28:53,203 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 157 transitions. [2024-11-10 15:28:53,204 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-10 15:28:53,204 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 157 transitions. [2024-11-10 15:28:53,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-10 15:28:53,204 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:28:53,204 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:28:53,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 15:28:53,205 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-10 15:28:53,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:28:53,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1837633505, now seen corresponding path program 1 times [2024-11-10 15:28:53,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:28:53,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334287140] [2024-11-10 15:28:53,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:53,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:28:53,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:53,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:28:53,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:53,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 15:28:53,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:53,472 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-10 15:28:53,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:28:53,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334287140] [2024-11-10 15:28:53,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334287140] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:28:53,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:28:53,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 15:28:53,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040982447] [2024-11-10 15:28:53,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:28:53,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 15:28:53,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:28:53,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 15:28:53,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 15:28:53,476 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-10 15:28:53,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:28:53,681 INFO L93 Difference]: Finished difference Result 144 states and 156 transitions. [2024-11-10 15:28:53,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 15:28:53,682 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-10 15:28:53,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:28:53,683 INFO L225 Difference]: With dead ends: 144 [2024-11-10 15:28:53,683 INFO L226 Difference]: Without dead ends: 144 [2024-11-10 15:28:53,684 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-10 15:28:53,684 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-10 15:28:53,686 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-10 15:28:53,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-10 15:28:53,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2024-11-10 15:28:53,693 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-10 15:28:53,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 156 transitions. [2024-11-10 15:28:53,694 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 156 transitions. Word has length 23 [2024-11-10 15:28:53,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:28:53,695 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 156 transitions. [2024-11-10 15:28:53,695 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-10 15:28:53,695 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 156 transitions. [2024-11-10 15:28:53,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-10 15:28:53,697 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:28:53,697 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-10 15:28:53,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 15:28:53,697 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-10 15:28:53,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:28:53,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1232536927, now seen corresponding path program 1 times [2024-11-10 15:28:53,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:28:53,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489908652] [2024-11-10 15:28:53,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:53,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:28:53,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:53,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:28:53,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:53,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 15:28:53,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:53,951 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-10 15:28:53,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:28:53,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489908652] [2024-11-10 15:28:53,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489908652] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:28:53,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [841410539] [2024-11-10 15:28:53,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:53,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:28:53,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:28:53,954 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-10 15:28:53,956 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-10 15:28:54,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:54,055 INFO L255 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-10 15:28:54,059 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:28:54,093 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-10 15:28:54,132 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-10 15:28:54,168 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-10 15:28:54,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-10 15:28:54,181 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-10 15:28:54,181 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:28:54,331 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:28:54,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [841410539] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:28:54,334 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:28:54,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 11 [2024-11-10 15:28:54,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094735067] [2024-11-10 15:28:54,334 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:28:54,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 15:28:54,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:28:54,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 15:28:54,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=84, Unknown=1, NotChecked=18, Total=132 [2024-11-10 15:28:54,335 INFO L87 Difference]: Start difference. First operand 144 states and 156 transitions. Second operand has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 15:28:54,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:28:54,637 INFO L93 Difference]: Finished difference Result 143 states and 155 transitions. [2024-11-10 15:28:54,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 15:28:54,638 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2024-11-10 15:28:54,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:28:54,638 INFO L225 Difference]: With dead ends: 143 [2024-11-10 15:28:54,639 INFO L226 Difference]: Without dead ends: 143 [2024-11-10 15:28:54,639 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=119, Unknown=1, NotChecked=22, Total=182 [2024-11-10 15:28:54,639 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 0 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 147 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 15:28:54,640 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 636 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 419 Invalid, 0 Unknown, 147 Unchecked, 0.3s Time] [2024-11-10 15:28:54,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-10 15:28:54,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2024-11-10 15:28:54,644 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-10 15:28:54,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 155 transitions. [2024-11-10 15:28:54,645 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 155 transitions. Word has length 27 [2024-11-10 15:28:54,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:28:54,645 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 155 transitions. [2024-11-10 15:28:54,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 15:28:54,645 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 155 transitions. [2024-11-10 15:28:54,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-10 15:28:54,646 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:28:54,646 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-10 15:28:54,659 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-10 15:28:54,846 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-10 15:28:54,847 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-10 15:28:54,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:28:54,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1232536928, now seen corresponding path program 1 times [2024-11-10 15:28:54,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:28:54,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689595616] [2024-11-10 15:28:54,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:54,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:28:54,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:55,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:28:55,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:55,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 15:28:55,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:55,176 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-10 15:28:55,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:28:55,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689595616] [2024-11-10 15:28:55,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689595616] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:28:55,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1407111594] [2024-11-10 15:28:55,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:55,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:28:55,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:28:55,178 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-10 15:28:55,179 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-10 15:28:55,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:55,264 INFO L255 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-10 15:28:55,265 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:28:55,275 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-10 15:28:55,280 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-10 15:28:55,410 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-10 15:28:55,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:28:55,442 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-10 15:28:55,451 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 15:28:55,452 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-10 15:28:55,479 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-10 15:28:55,480 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:28:55,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1407111594] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:28:55,593 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:28:55,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 17 [2024-11-10 15:28:55,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686793998] [2024-11-10 15:28:55,593 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:28:55,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-10 15:28:55,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:28:55,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-10 15:28:55,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=289, Unknown=1, NotChecked=34, Total=380 [2024-11-10 15:28:55,594 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-10 15:28:56,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:28:56,092 INFO L93 Difference]: Finished difference Result 151 states and 166 transitions. [2024-11-10 15:28:56,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 15:28:56,092 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-10 15:28:56,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:28:56,094 INFO L225 Difference]: With dead ends: 151 [2024-11-10 15:28:56,094 INFO L226 Difference]: Without dead ends: 151 [2024-11-10 15:28:56,094 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=355, Unknown=1, NotChecked=38, Total=462 [2024-11-10 15:28:56,095 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 2 mSDsluCounter, 823 mSDsCounter, 0 mSdLazyCounter, 851 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 967 SdHoareTripleChecker+Invalid, 1018 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 851 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 160 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 15:28:56,095 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 967 Invalid, 1018 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 851 Invalid, 0 Unknown, 160 Unchecked, 0.4s Time] [2024-11-10 15:28:56,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-11-10 15:28:56,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 150. [2024-11-10 15:28:56,106 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-10 15:28:56,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 164 transitions. [2024-11-10 15:28:56,107 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 164 transitions. Word has length 27 [2024-11-10 15:28:56,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:28:56,107 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 164 transitions. [2024-11-10 15:28:56,108 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-10 15:28:56,108 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 164 transitions. [2024-11-10 15:28:56,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-10 15:28:56,108 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:28:56,108 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-10 15:28:56,122 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-10 15:28:56,309 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-10 15:28:56,309 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-10 15:28:56,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:28:56,310 INFO L85 PathProgramCache]: Analyzing trace with hash 794422195, now seen corresponding path program 1 times [2024-11-10 15:28:56,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:28:56,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715965301] [2024-11-10 15:28:56,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:56,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:28:56,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:56,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:28:56,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:56,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 15:28:56,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:56,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 15:28:56,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:56,727 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-10 15:28:56,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:28:56,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715965301] [2024-11-10 15:28:56,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715965301] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:28:56,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:28:56,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 15:28:56,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964576389] [2024-11-10 15:28:56,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:28:56,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 15:28:56,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:28:56,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 15:28:56,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-10 15:28:56,729 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-10 15:28:56,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:28:56,982 INFO L93 Difference]: Finished difference Result 139 states and 153 transitions. [2024-11-10 15:28:56,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 15:28:56,982 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-10 15:28:56,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:28:56,983 INFO L225 Difference]: With dead ends: 139 [2024-11-10 15:28:56,983 INFO L226 Difference]: Without dead ends: 139 [2024-11-10 15:28:56,983 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-10 15:28:56,984 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 152 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:28:56,984 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 397 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:28:56,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-11-10 15:28:56,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 138. [2024-11-10 15:28:56,990 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-10 15:28:56,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 152 transitions. [2024-11-10 15:28:56,991 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 152 transitions. Word has length 39 [2024-11-10 15:28:56,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:28:56,991 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 152 transitions. [2024-11-10 15:28:56,991 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-10 15:28:56,991 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 152 transitions. [2024-11-10 15:28:56,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-10 15:28:56,993 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:28:56,993 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-10 15:28:56,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 15:28:56,994 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-10 15:28:56,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:28:56,994 INFO L85 PathProgramCache]: Analyzing trace with hash 794422194, now seen corresponding path program 1 times [2024-11-10 15:28:56,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:28:56,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643111411] [2024-11-10 15:28:56,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:56,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:28:57,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:57,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:28:57,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:57,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 15:28:57,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:57,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 15:28:57,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:57,328 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-10 15:28:57,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:28:57,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643111411] [2024-11-10 15:28:57,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643111411] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:28:57,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1450870041] [2024-11-10 15:28:57,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:57,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:28:57,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:28:57,330 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-10 15:28:57,332 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-10 15:28:57,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:57,439 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-10 15:28:57,442 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:28:57,447 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-10 15:28:57,454 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-10 15:28:57,496 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-10 15:28:57,496 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-10 15:28:57,546 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-10 15:28:57,563 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-10 15:28:57,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:28:57,594 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-10 15:28:57,636 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-10 15:28:57,653 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-10 15:28:57,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-10 15:28:57,661 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 18 not checked. [2024-11-10 15:28:57,661 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:28:57,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1450870041] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:28:57,822 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:28:57,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12] total 17 [2024-11-10 15:28:57,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024443910] [2024-11-10 15:28:57,823 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:28:57,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-10 15:28:57,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:28:57,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-10 15:28:57,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=279, Unknown=2, NotChecked=70, Total=420 [2024-11-10 15:28:57,824 INFO L87 Difference]: Start difference. First operand 138 states and 152 transitions. Second operand has 18 states, 17 states have (on average 3.176470588235294) internal successors, (54), 15 states have internal predecessors, (54), 3 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-10 15:28:58,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:28:58,229 INFO L93 Difference]: Finished difference Result 154 states and 169 transitions. [2024-11-10 15:28:58,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 15:28:58,229 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.176470588235294) internal successors, (54), 15 states have internal predecessors, (54), 3 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 39 [2024-11-10 15:28:58,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:28:58,230 INFO L225 Difference]: With dead ends: 154 [2024-11-10 15:28:58,231 INFO L226 Difference]: Without dead ends: 154 [2024-11-10 15:28:58,231 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=375, Unknown=2, NotChecked=82, Total=552 [2024-11-10 15:28:58,232 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 591 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 591 SdHoareTripleChecker+Valid, 626 SdHoareTripleChecker+Invalid, 899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 304 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 15:28:58,232 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [591 Valid, 626 Invalid, 899 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 582 Invalid, 0 Unknown, 304 Unchecked, 0.3s Time] [2024-11-10 15:28:58,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-11-10 15:28:58,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 132. [2024-11-10 15:28:58,236 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-10 15:28:58,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 146 transitions. [2024-11-10 15:28:58,237 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 146 transitions. Word has length 39 [2024-11-10 15:28:58,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:28:58,238 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 146 transitions. [2024-11-10 15:28:58,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.176470588235294) internal successors, (54), 15 states have internal predecessors, (54), 3 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-10 15:28:58,238 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 146 transitions. [2024-11-10 15:28:58,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-10 15:28:58,242 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:28:58,242 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-10 15:28:58,256 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-10 15:28:58,442 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-10 15:28:58,443 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-10 15:28:58,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:28:58,443 INFO L85 PathProgramCache]: Analyzing trace with hash 524136047, now seen corresponding path program 2 times [2024-11-10 15:28:58,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:28:58,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232316452] [2024-11-10 15:28:58,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:58,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:28:58,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:58,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:28:58,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:58,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 15:28:58,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:58,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-10 15:28:58,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:58,521 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-10 15:28:58,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:28:58,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232316452] [2024-11-10 15:28:58,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232316452] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:28:58,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [664793938] [2024-11-10 15:28:58,522 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 15:28:58,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:28:58,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:28:58,523 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-10 15:28:58,524 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-10 15:28:58,631 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 15:28:58,631 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 15:28:58,632 INFO L255 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 15:28:58,633 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:28:58,657 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-10 15:28:58,658 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:28:58,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [664793938] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:28:58,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 15:28:58,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2024-11-10 15:28:58,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316188852] [2024-11-10 15:28:58,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:28:58,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 15:28:58,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:28:58,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 15:28:58,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 15:28:58,660 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-10 15:28:58,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:28:58,671 INFO L93 Difference]: Finished difference Result 124 states and 135 transitions. [2024-11-10 15:28:58,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 15:28:58,672 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-10 15:28:58,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:28:58,672 INFO L225 Difference]: With dead ends: 124 [2024-11-10 15:28:58,673 INFO L226 Difference]: Without dead ends: 124 [2024-11-10 15:28:58,673 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-10 15:28:58,673 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 0 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:28:58,673 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 382 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:28:58,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-10 15:28:58,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2024-11-10 15:28:58,676 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-10 15:28:58,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 135 transitions. [2024-11-10 15:28:58,677 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 135 transitions. Word has length 40 [2024-11-10 15:28:58,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:28:58,677 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 135 transitions. [2024-11-10 15:28:58,677 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-10 15:28:58,678 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 135 transitions. [2024-11-10 15:28:58,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-10 15:28:58,679 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:28:58,679 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-10 15:28:58,693 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-10 15:28:58,879 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-10 15:28:58,880 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-10 15:28:58,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:28:58,881 INFO L85 PathProgramCache]: Analyzing trace with hash -731062646, now seen corresponding path program 1 times [2024-11-10 15:28:58,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:28:58,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117136777] [2024-11-10 15:28:58,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:58,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:28:58,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:59,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:28:59,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:59,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 15:28:59,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:59,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 15:28:59,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:59,232 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-10 15:28:59,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:28:59,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117136777] [2024-11-10 15:28:59,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117136777] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:28:59,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2124901161] [2024-11-10 15:28:59,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:59,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:28:59,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:28:59,235 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-10 15:28:59,236 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-10 15:28:59,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:59,431 INFO L255 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-10 15:28:59,433 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:28:59,533 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-10 15:28:59,557 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-10 15:28:59,575 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2024-11-10 15:28:59,575 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-10 15:28:59,599 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-10 15:28:59,602 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-10 15:28:59,602 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:28:59,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2124901161] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:28:59,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 15:28:59,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [13] total 20 [2024-11-10 15:28:59,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175739906] [2024-11-10 15:28:59,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:28:59,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 15:28:59,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:28:59,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 15:28:59,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=333, Unknown=1, NotChecked=36, Total=420 [2024-11-10 15:28:59,604 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-10 15:28:59,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:28:59,785 INFO L93 Difference]: Finished difference Result 152 states and 167 transitions. [2024-11-10 15:28:59,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 15:28:59,786 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-10 15:28:59,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:28:59,789 INFO L225 Difference]: With dead ends: 152 [2024-11-10 15:28:59,789 INFO L226 Difference]: Without dead ends: 152 [2024-11-10 15:28:59,789 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-10 15:28:59,789 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 88 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 225 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:28:59,790 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 472 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 279 Invalid, 0 Unknown, 225 Unchecked, 0.1s Time] [2024-11-10 15:28:59,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-11-10 15:28:59,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 127. [2024-11-10 15:28:59,792 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-10 15:28:59,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 140 transitions. [2024-11-10 15:28:59,792 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 140 transitions. Word has length 43 [2024-11-10 15:28:59,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:28:59,792 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 140 transitions. [2024-11-10 15:28:59,793 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-10 15:28:59,793 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 140 transitions. [2024-11-10 15:28:59,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-10 15:28:59,793 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:28:59,793 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-10 15:28:59,807 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-10 15:28:59,997 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-10 15:28:59,998 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-10 15:28:59,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:28:59,998 INFO L85 PathProgramCache]: Analyzing trace with hash -731062645, now seen corresponding path program 1 times [2024-11-10 15:28:59,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:28:59,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846904296] [2024-11-10 15:28:59,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:59,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:29:00,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:29:00,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:29:00,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:29:00,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 15:29:00,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:29:00,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 15:29:00,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:29:00,423 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-10 15:29:00,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:29:00,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846904296] [2024-11-10 15:29:00,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846904296] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:29:00,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1500580727] [2024-11-10 15:29:00,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:29:00,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:29:00,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:29:00,426 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-10 15:29:00,427 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-10 15:29:00,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:29:00,594 INFO L255 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-10 15:29:00,597 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:29:00,620 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-10 15:29:00,875 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-10 15:29:00,878 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-10 15:29:00,925 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (= 0 (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|))))) is different from true [2024-11-10 15:29:00,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:29:00,968 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-10 15:29:00,975 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-10 15:29:00,976 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-10 15:29:01,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-10 15:29:01,035 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-10 15:29:01,036 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:29:01,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1500580727] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:29:01,187 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:29:01,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 27 [2024-11-10 15:29:01,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891538472] [2024-11-10 15:29:01,187 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:29:01,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-10 15:29:01,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:29:01,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-10 15:29:01,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=843, Unknown=1, NotChecked=58, Total=992 [2024-11-10 15:29:01,188 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-10 15:29:01,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:29:01,956 INFO L93 Difference]: Finished difference Result 159 states and 172 transitions. [2024-11-10 15:29:01,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-10 15:29:01,957 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-10 15:29:01,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:29:01,958 INFO L225 Difference]: With dead ends: 159 [2024-11-10 15:29:01,958 INFO L226 Difference]: Without dead ends: 159 [2024-11-10 15:29:01,959 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=166, Invalid=1559, Unknown=1, NotChecked=80, Total=1806 [2024-11-10 15:29:01,959 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 258 mSDsluCounter, 1128 mSDsCounter, 0 mSdLazyCounter, 1169 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 1230 SdHoareTripleChecker+Invalid, 1338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 166 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 15:29:01,960 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 1230 Invalid, 1338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1169 Invalid, 0 Unknown, 166 Unchecked, 0.5s Time] [2024-11-10 15:29:01,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-11-10 15:29:01,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 134. [2024-11-10 15:29:01,963 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-10 15:29:01,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 145 transitions. [2024-11-10 15:29:01,963 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 145 transitions. Word has length 43 [2024-11-10 15:29:01,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:29:01,967 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 145 transitions. [2024-11-10 15:29:01,967 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-10 15:29:01,967 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 145 transitions. [2024-11-10 15:29:01,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-10 15:29:01,969 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:29:01,969 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-10 15:29:01,983 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-10 15:29:02,170 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-10 15:29:02,171 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-10 15:29:02,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:29:02,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1188107490, now seen corresponding path program 1 times [2024-11-10 15:29:02,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:29:02,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792849001] [2024-11-10 15:29:02,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:29:02,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:29:02,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:29:02,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:29:02,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:29:02,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 15:29:02,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:29:02,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 15:29:02,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:29:02,246 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-10 15:29:02,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:29:02,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792849001] [2024-11-10 15:29:02,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792849001] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:29:02,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:29:02,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 15:29:02,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672899317] [2024-11-10 15:29:02,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:29:02,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 15:29:02,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:29:02,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 15:29:02,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:29:02,248 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-10 15:29:02,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:29:02,311 INFO L93 Difference]: Finished difference Result 135 states and 146 transitions. [2024-11-10 15:29:02,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 15:29:02,312 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-10 15:29:02,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:29:02,312 INFO L225 Difference]: With dead ends: 135 [2024-11-10 15:29:02,313 INFO L226 Difference]: Without dead ends: 135 [2024-11-10 15:29:02,313 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-10 15:29:02,314 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 0 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-10 15:29:02,314 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-10 15:29:02,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-10 15:29:02,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2024-11-10 15:29:02,316 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-10 15:29:02,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 146 transitions. [2024-11-10 15:29:02,317 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 146 transitions. Word has length 44 [2024-11-10 15:29:02,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:29:02,317 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 146 transitions. [2024-11-10 15:29:02,317 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-10 15:29:02,317 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 146 transitions. [2024-11-10 15:29:02,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-10 15:29:02,318 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:29:02,318 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-10 15:29:02,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 15:29:02,319 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-10 15:29:02,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:29:02,319 INFO L85 PathProgramCache]: Analyzing trace with hash 690059699, now seen corresponding path program 1 times [2024-11-10 15:29:02,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:29:02,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041561786] [2024-11-10 15:29:02,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:29:02,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:29:02,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:29:02,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:29:02,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:29:02,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 15:29:02,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:29:02,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 15:29:02,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:29:02,420 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-10 15:29:02,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:29:02,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041561786] [2024-11-10 15:29:02,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041561786] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:29:02,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:29:02,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 15:29:02,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786074742] [2024-11-10 15:29:02,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:29:02,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 15:29:02,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:29:02,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 15:29:02,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 15:29:02,422 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-10 15:29:02,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:29:02,564 INFO L93 Difference]: Finished difference Result 132 states and 143 transitions. [2024-11-10 15:29:02,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 15:29:02,564 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-10 15:29:02,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:29:02,565 INFO L225 Difference]: With dead ends: 132 [2024-11-10 15:29:02,565 INFO L226 Difference]: Without dead ends: 132 [2024-11-10 15:29:02,565 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-10 15:29:02,565 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 20 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:29:02,565 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.1s Time] [2024-11-10 15:29:02,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-11-10 15:29:02,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2024-11-10 15:29:02,567 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-10 15:29:02,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 143 transitions. [2024-11-10 15:29:02,568 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 143 transitions. Word has length 46 [2024-11-10 15:29:02,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:29:02,568 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 143 transitions. [2024-11-10 15:29:02,568 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-10 15:29:02,568 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 143 transitions. [2024-11-10 15:29:02,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-10 15:29:02,569 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:29:02,569 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-10 15:29:02,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 15:29:02,569 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-10 15:29:02,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:29:02,570 INFO L85 PathProgramCache]: Analyzing trace with hash 690059700, now seen corresponding path program 1 times [2024-11-10 15:29:02,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:29:02,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003799779] [2024-11-10 15:29:02,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:29:02,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:29:02,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:29:02,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:29:02,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:29:02,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 15:29:02,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:29:02,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 15:29:02,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:29:02,672 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-10 15:29:02,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:29:02,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003799779] [2024-11-10 15:29:02,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003799779] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:29:02,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:29:02,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 15:29:02,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252102714] [2024-11-10 15:29:02,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:29:02,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 15:29:02,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:29:02,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 15:29:02,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:29:02,674 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-10 15:29:02,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:29:02,749 INFO L93 Difference]: Finished difference Result 135 states and 144 transitions. [2024-11-10 15:29:02,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 15:29:02,750 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-10 15:29:02,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:29:02,751 INFO L225 Difference]: With dead ends: 135 [2024-11-10 15:29:02,751 INFO L226 Difference]: Without dead ends: 135 [2024-11-10 15:29:02,752 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-10 15:29:02,752 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-10 15:29:02,753 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-10 15:29:02,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-10 15:29:02,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 131. [2024-11-10 15:29:02,755 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-10 15:29:02,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 141 transitions. [2024-11-10 15:29:02,755 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 141 transitions. Word has length 46 [2024-11-10 15:29:02,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:29:02,755 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 141 transitions. [2024-11-10 15:29:02,756 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-10 15:29:02,756 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 141 transitions. [2024-11-10 15:29:02,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-10 15:29:02,756 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:29:02,756 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-10 15:29:02,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 15:29:02,756 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-10 15:29:02,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:29:02,757 INFO L85 PathProgramCache]: Analyzing trace with hash -23717460, now seen corresponding path program 1 times [2024-11-10 15:29:02,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:29:02,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780279762] [2024-11-10 15:29:02,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:29:02,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:29:02,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:29:02,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:29:02,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:29:02,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 15:29:02,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:29:02,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 15:29:02,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:29:02,860 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-10 15:29:02,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:29:02,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780279762] [2024-11-10 15:29:02,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780279762] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:29:02,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:29:02,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 15:29:02,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133019939] [2024-11-10 15:29:02,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:29:02,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 15:29:02,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:29:02,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 15:29:02,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 15:29:02,862 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-10 15:29:02,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:29:02,940 INFO L93 Difference]: Finished difference Result 132 states and 140 transitions. [2024-11-10 15:29:02,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 15:29:02,940 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-10 15:29:02,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:29:02,941 INFO L225 Difference]: With dead ends: 132 [2024-11-10 15:29:02,941 INFO L226 Difference]: Without dead ends: 132 [2024-11-10 15:29:02,941 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-10 15:29:02,941 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-10 15:29:02,942 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-10 15:29:02,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-11-10 15:29:02,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 128. [2024-11-10 15:29:02,944 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-10 15:29:02,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 137 transitions. [2024-11-10 15:29:02,944 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 137 transitions. Word has length 47 [2024-11-10 15:29:02,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:29:02,944 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 137 transitions. [2024-11-10 15:29:02,944 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-10 15:29:02,945 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 137 transitions. [2024-11-10 15:29:02,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-10 15:29:02,945 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:29:02,945 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-10 15:29:02,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 15:29:02,945 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-10 15:29:02,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:29:02,946 INFO L85 PathProgramCache]: Analyzing trace with hash -735243204, now seen corresponding path program 1 times [2024-11-10 15:29:02,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:29:02,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597098604] [2024-11-10 15:29:02,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:29:02,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:29:02,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:29:02,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:29:02,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:29:03,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 15:29:03,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:29:03,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 15:29:03,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:29:03,009 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-10 15:29:03,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:29:03,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597098604] [2024-11-10 15:29:03,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597098604] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:29:03,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:29:03,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 15:29:03,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320729752] [2024-11-10 15:29:03,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:29:03,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 15:29:03,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:29:03,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 15:29:03,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:29:03,011 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-10 15:29:03,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:29:03,125 INFO L93 Difference]: Finished difference Result 127 states and 136 transitions. [2024-11-10 15:29:03,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 15:29:03,126 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-10 15:29:03,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:29:03,126 INFO L225 Difference]: With dead ends: 127 [2024-11-10 15:29:03,127 INFO L226 Difference]: Without dead ends: 127 [2024-11-10 15:29:03,127 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-10 15:29:03,127 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-10 15:29:03,127 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-10 15:29:03,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-10 15:29:03,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2024-11-10 15:29:03,129 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-10 15:29:03,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 136 transitions. [2024-11-10 15:29:03,130 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 136 transitions. Word has length 48 [2024-11-10 15:29:03,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:29:03,130 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 136 transitions. [2024-11-10 15:29:03,130 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-10 15:29:03,131 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 136 transitions. [2024-11-10 15:29:03,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-10 15:29:03,131 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:29:03,131 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-10 15:29:03,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 15:29:03,131 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-10 15:29:03,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:29:03,132 INFO L85 PathProgramCache]: Analyzing trace with hash -735243203, now seen corresponding path program 1 times [2024-11-10 15:29:03,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:29:03,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890469547] [2024-11-10 15:29:03,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:29:03,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:29:03,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:29:03,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:29:03,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:29:03,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 15:29:03,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:29:03,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 15:29:03,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:29:03,232 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-10 15:29:03,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:29:03,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890469547] [2024-11-10 15:29:03,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890469547] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:29:03,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:29:03,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 15:29:03,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739085549] [2024-11-10 15:29:03,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:29:03,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 15:29:03,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:29:03,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 15:29:03,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:29:03,234 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-10 15:29:03,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:29:03,337 INFO L93 Difference]: Finished difference Result 126 states and 135 transitions. [2024-11-10 15:29:03,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 15:29:03,337 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-10 15:29:03,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:29:03,338 INFO L225 Difference]: With dead ends: 126 [2024-11-10 15:29:03,338 INFO L226 Difference]: Without dead ends: 126 [2024-11-10 15:29:03,338 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-10 15:29:03,339 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-10 15:29:03,339 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-10 15:29:03,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-10 15:29:03,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2024-11-10 15:29:03,341 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-10 15:29:03,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 135 transitions. [2024-11-10 15:29:03,342 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 135 transitions. Word has length 48 [2024-11-10 15:29:03,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:29:03,342 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 135 transitions. [2024-11-10 15:29:03,342 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-10 15:29:03,342 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 135 transitions. [2024-11-10 15:29:03,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-10 15:29:03,343 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:29:03,343 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-10 15:29:03,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 15:29:03,343 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-10 15:29:03,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:29:03,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1317702775, now seen corresponding path program 1 times [2024-11-10 15:29:03,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:29:03,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641222424] [2024-11-10 15:29:03,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:29:03,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:29:03,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:29:03,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:29:03,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:29:03,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 15:29:03,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:29:03,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 15:29:03,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:29:03,506 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-10 15:29:03,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:29:03,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641222424] [2024-11-10 15:29:03,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641222424] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:29:03,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:29:03,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 15:29:03,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723679963] [2024-11-10 15:29:03,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:29:03,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 15:29:03,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:29:03,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 15:29:03,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 15:29:03,509 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-10 15:29:03,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:29:03,659 INFO L93 Difference]: Finished difference Result 123 states and 132 transitions. [2024-11-10 15:29:03,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 15:29:03,660 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-10 15:29:03,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:29:03,660 INFO L225 Difference]: With dead ends: 123 [2024-11-10 15:29:03,661 INFO L226 Difference]: Without dead ends: 123 [2024-11-10 15:29:03,661 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-10 15:29:03,662 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.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:29:03,662 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.1s Time] [2024-11-10 15:29:03,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-10 15:29:03,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2024-11-10 15:29:03,664 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-10 15:29:03,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 132 transitions. [2024-11-10 15:29:03,666 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 132 transitions. Word has length 49 [2024-11-10 15:29:03,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:29:03,667 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 132 transitions. [2024-11-10 15:29:03,667 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-10 15:29:03,667 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 132 transitions. [2024-11-10 15:29:03,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-10 15:29:03,667 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:29:03,668 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-10 15:29:03,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-10 15:29:03,668 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-10 15:29:03,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:29:03,668 INFO L85 PathProgramCache]: Analyzing trace with hash 417051671, now seen corresponding path program 1 times [2024-11-10 15:29:03,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:29:03,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252153482] [2024-11-10 15:29:03,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:29:03,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:29:03,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:29:03,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:29:03,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:29:03,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 15:29:03,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:29:03,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 15:29:03,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:29:03,851 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-10 15:29:03,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:29:03,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252153482] [2024-11-10 15:29:03,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252153482] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:29:03,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2037693413] [2024-11-10 15:29:03,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:29:03,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:29:03,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:29:03,853 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-10 15:29:03,854 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-10 15:29:04,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:29:04,029 INFO L255 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-10 15:29:04,035 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:29:04,040 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-10 15:29:04,114 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-10 15:29:04,164 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-10 15:29:04,168 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-10 15:29:04,243 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-10 15:29:04,249 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-10 15:29:04,249 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:29:04,483 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-10 15:29:04,508 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-10 15:29:04,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2037693413] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:29:04,509 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:29:04,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 15, 15] total 24 [2024-11-10 15:29:04,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574629028] [2024-11-10 15:29:04,509 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:29:04,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-10 15:29:04,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:29:04,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-10 15:29:04,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=532, Unknown=0, NotChecked=0, Total=600 [2024-11-10 15:29:04,510 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-10 15:29:05,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:29:05,011 INFO L93 Difference]: Finished difference Result 166 states and 179 transitions. [2024-11-10 15:29:05,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-10 15:29:05,011 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-10 15:29:05,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:29:05,012 INFO L225 Difference]: With dead ends: 166 [2024-11-10 15:29:05,012 INFO L226 Difference]: Without dead ends: 166 [2024-11-10 15:29:05,012 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-10 15:29:05,013 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 293 mSDsluCounter, 1070 mSDsCounter, 0 mSdLazyCounter, 1034 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 1149 SdHoareTripleChecker+Invalid, 1049 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1034 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 15:29:05,013 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 1149 Invalid, 1049 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1034 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 15:29:05,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-11-10 15:29:05,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 125. [2024-11-10 15:29:05,015 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-10 15:29:05,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 135 transitions. [2024-11-10 15:29:05,015 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 135 transitions. Word has length 54 [2024-11-10 15:29:05,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:29:05,016 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 135 transitions. [2024-11-10 15:29:05,016 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-10 15:29:05,016 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 135 transitions. [2024-11-10 15:29:05,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-10 15:29:05,016 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:29:05,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] [2024-11-10 15:29:05,029 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-10 15:29:05,216 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-10 15:29:05,217 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-10 15:29:05,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:29:05,217 INFO L85 PathProgramCache]: Analyzing trace with hash 417051672, now seen corresponding path program 1 times [2024-11-10 15:29:05,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:29:05,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444769160] [2024-11-10 15:29:05,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:29:05,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:29:05,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:29:05,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:29:05,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:29:05,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 15:29:05,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:29:05,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 15:29:05,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:29:05,861 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-10 15:29:05,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:29:05,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444769160] [2024-11-10 15:29:05,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444769160] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:29:05,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1164174134] [2024-11-10 15:29:05,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:29:05,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:29:05,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:29:05,864 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-10 15:29:05,865 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-10 15:29:06,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:29:06,024 INFO L255 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-10 15:29:06,025 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:29:06,032 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-10 15:29:06,166 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-10 15:29:06,268 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-10 15:29:06,269 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-10 15:29:06,353 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-10 15:29:06,359 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-10 15:29:06,359 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:29:06,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1164174134] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:29:06,557 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:29:06,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15] total 30 [2024-11-10 15:29:06,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994259623] [2024-11-10 15:29:06,557 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:29:06,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-10 15:29:06,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:29:06,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-10 15:29:06,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=1086, Unknown=0, NotChecked=0, Total=1190 [2024-11-10 15:29:06,559 INFO L87 Difference]: Start difference. First operand 125 states and 135 transitions. Second operand has 31 states, 29 states have (on average 2.7241379310344827) internal successors, (79), 26 states have internal predecessors, (79), 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-10 15:29:07,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:29:07,429 INFO L93 Difference]: Finished difference Result 164 states and 178 transitions. [2024-11-10 15:29:07,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-10 15:29:07,430 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 29 states have (on average 2.7241379310344827) internal successors, (79), 26 states have internal predecessors, (79), 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-10 15:29:07,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:29:07,430 INFO L225 Difference]: With dead ends: 164 [2024-11-10 15:29:07,430 INFO L226 Difference]: Without dead ends: 164 [2024-11-10 15:29:07,431 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=189, Invalid=1973, Unknown=0, NotChecked=0, Total=2162 [2024-11-10 15:29:07,431 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 78 mSDsluCounter, 1467 mSDsCounter, 0 mSdLazyCounter, 1494 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 1547 SdHoareTripleChecker+Invalid, 1497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 15:29:07,431 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 1547 Invalid, 1497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1494 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 15:29:07,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-11-10 15:29:07,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 127. [2024-11-10 15:29:07,434 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-10 15:29:07,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 137 transitions. [2024-11-10 15:29:07,434 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 137 transitions. Word has length 54 [2024-11-10 15:29:07,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:29:07,434 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 137 transitions. [2024-11-10 15:29:07,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 29 states have (on average 2.7241379310344827) internal successors, (79), 26 states have internal predecessors, (79), 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-10 15:29:07,435 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 137 transitions. [2024-11-10 15:29:07,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-10 15:29:07,435 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:29:07,435 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-10 15:29:07,448 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-10 15:29:07,639 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-10 15:29:07,640 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-10 15:29:07,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:29:07,640 INFO L85 PathProgramCache]: Analyzing trace with hash -743838899, now seen corresponding path program 1 times [2024-11-10 15:29:07,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:29:07,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562698327] [2024-11-10 15:29:07,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:29:07,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:29:07,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:29:07,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:29:07,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:29:07,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 15:29:07,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:29:07,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 15:29:07,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:29:07,761 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-10 15:29:07,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:29:07,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562698327] [2024-11-10 15:29:07,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562698327] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:29:07,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1204064875] [2024-11-10 15:29:07,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:29:07,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:29:07,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:29:07,763 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-10 15:29:07,764 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-10 15:29:07,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:29:07,937 INFO L255 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-10 15:29:07,941 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:29:07,954 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-10 15:29:07,970 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-10 15:29:07,988 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-10 15:29:08,017 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-10 15:29:08,043 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-10 15:29:08,091 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-10 15:29:08,091 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-10 15:29:08,110 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-10 15:29:08,110 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:29:08,398 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-10 15:29:08,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1204064875] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:29:08,399 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:29:08,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 21 [2024-11-10 15:29:08,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444670303] [2024-11-10 15:29:08,399 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:29:08,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-10 15:29:08,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:29:08,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-10 15:29:08,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=314, Unknown=1, NotChecked=36, Total=420 [2024-11-10 15:29:08,400 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-10 15:29:08,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:29:08,624 INFO L93 Difference]: Finished difference Result 112 states and 120 transitions. [2024-11-10 15:29:08,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 15:29:08,626 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-10 15:29:08,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:29:08,626 INFO L225 Difference]: With dead ends: 112 [2024-11-10 15:29:08,626 INFO L226 Difference]: Without dead ends: 112 [2024-11-10 15:29:08,627 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-10 15:29:08,628 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 170 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 102 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:29:08,628 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 681 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 482 Invalid, 0 Unknown, 102 Unchecked, 0.2s Time] [2024-11-10 15:29:08,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-10 15:29:08,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-11-10 15:29:08,629 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-10 15:29:08,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 120 transitions. [2024-11-10 15:29:08,630 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 120 transitions. Word has length 54 [2024-11-10 15:29:08,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:29:08,630 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 120 transitions. [2024-11-10 15:29:08,630 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-10 15:29:08,630 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 120 transitions. [2024-11-10 15:29:08,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-10 15:29:08,631 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:29:08,631 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-10 15:29:08,645 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-10 15:29:08,835 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-10 15:29:08,835 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-10 15:29:08,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:29:08,836 INFO L85 PathProgramCache]: Analyzing trace with hash 490666889, now seen corresponding path program 1 times [2024-11-10 15:29:08,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:29:08,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440813030] [2024-11-10 15:29:08,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:29:08,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:29:08,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:29:09,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:29:09,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:29:09,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 15:29:09,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:29:09,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 15:29:09,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:29:10,103 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-10 15:29:10,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:29:10,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440813030] [2024-11-10 15:29:10,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440813030] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:29:10,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1158688310] [2024-11-10 15:29:10,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:29:10,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:29:10,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:29:10,105 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-10 15:29:10,106 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-10 15:29:10,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:29:10,416 INFO L255 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 106 conjuncts are in the unsatisfiable core [2024-11-10 15:29:10,419 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:29:10,455 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-10 15:29:10,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-10 15:29:10,717 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-10 15:29:10,717 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-10 15:29:10,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-10 15:29:10,876 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 18 treesize of output 13 [2024-11-10 15:29:11,053 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 17 treesize of output 3 [2024-11-10 15:29:11,055 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-10 15:29:11,146 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2024-11-10 15:29:11,146 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-10 15:29:15,159 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= .cse0 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_insert_~head#1.offset| 0) (let ((.cse1 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 4))) (or (= (select (select |c_#memory_int#1| .cse0) .cse1) 1) (exists ((|v_old(#memory_int#1)_AFTER_CALL_28| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_old(#memory_int#1)_AFTER_CALL_28| |c_#memory_int#1|))) (and (= |c_#memory_int#1| (store |v_old(#memory_int#1)_AFTER_CALL_28| .cse2 (select |c_#memory_int#1| .cse2))) (= .cse2 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) (= (select (select |v_old(#memory_int#1)_AFTER_CALL_28| .cse0) .cse1) 1)))))))) is different from false [2024-11-10 15:29:15,161 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= .cse0 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_insert_~head#1.offset| 0) (let ((.cse1 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 4))) (or (= (select (select |c_#memory_int#1| .cse0) .cse1) 1) (exists ((|v_old(#memory_int#1)_AFTER_CALL_28| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_old(#memory_int#1)_AFTER_CALL_28| |c_#memory_int#1|))) (and (= |c_#memory_int#1| (store |v_old(#memory_int#1)_AFTER_CALL_28| .cse2 (select |c_#memory_int#1| .cse2))) (= .cse2 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) (= (select (select |v_old(#memory_int#1)_AFTER_CALL_28| .cse0) .cse1) 1)))))))) is different from true [2024-11-10 15:29:15,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:29:15,412 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 45 treesize of output 21 [2024-11-10 15:29:15,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2024-11-10 15:29:15,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2024-11-10 15:29:15,522 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 21 treesize of output 13 [2024-11-10 15:29:15,652 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-10 15:29:15,652 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:29:15,855 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2517 (Array Int Int)) (v_ArrVal_2518 (Array Int Int))) (or (not (= (store (select |c_#memory_int#1| |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_2517 |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset|)) v_ArrVal_2517)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_2517) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2518) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) is different from false [2024-11-10 15:29:15,891 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2517 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_25| Int) (v_ArrVal_2518 (Array Int Int))) (or (not (= v_ArrVal_2517 (store (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_25| (select v_ArrVal_2517 |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_25|)))) (< |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_25|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_2517) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2518) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) is different from false [2024-11-10 15:29:15,911 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2517 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_25| Int) (v_ArrVal_2518 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base| v_ArrVal_2517) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2518) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (< |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.offset| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_25|) (not (= (store (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_25| (select v_ArrVal_2517 |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_25|)) v_ArrVal_2517)))) is different from false [2024-11-10 15:29:15,937 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2517 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_25| Int) (v_ArrVal_2518 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (< (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_25|) (not (= v_ArrVal_2517 (store (select |c_#memory_int#1| .cse0) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_25| (select v_ArrVal_2517 |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_25|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| .cse0 v_ArrVal_2517) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2518) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))))) is different from false [2024-11-10 15:29:15,947 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2517 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_25| Int) (v_ArrVal_2518 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (< (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_25|) (not (= v_ArrVal_2517 (store (select |c_#memory_int#1| .cse0) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_25| (select v_ArrVal_2517 |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_25|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| .cse0 v_ArrVal_2517) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_2518) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))))) is different from false [2024-11-10 15:29:16,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1158688310] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:29:16,058 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:29:16,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31] total 58 [2024-11-10 15:29:16,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499600856] [2024-11-10 15:29:16,059 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:29:16,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2024-11-10 15:29:16,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:29:16,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2024-11-10 15:29:16,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=3568, Unknown=22, NotChecked=750, Total=4556 [2024-11-10 15:29:16,060 INFO L87 Difference]: Start difference. First operand 112 states and 120 transitions. Second operand has 58 states, 54 states have (on average 1.7592592592592593) internal successors, (95), 49 states have internal predecessors, (95), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 15:29:16,621 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse5 (+ (select .cse1 0) 4))) (let ((.cse0 (= (select (select |c_#memory_int#1| .cse3) .cse5) 1)) (.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (and .cse0 (= |c_ULTIMATE.start_sll_circular_insert_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select |c_#valid| .cse2) 1) (= (select |c_#valid| .cse3) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= .cse3 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)) (not (= .cse2 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)) (exists ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_14| Int)) (and (not (= .cse3 |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_14|)) (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_14|) 1))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_insert_~head#1.offset| 0) (or .cse0 (exists ((|v_old(#memory_int#1)_AFTER_CALL_28| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_old(#memory_int#1)_AFTER_CALL_28| |c_#memory_int#1|))) (and (= |c_#memory_int#1| (store |v_old(#memory_int#1)_AFTER_CALL_28| .cse4 (select |c_#memory_int#1| .cse4))) (= .cse4 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) (= (select (select |v_old(#memory_int#1)_AFTER_CALL_28| .cse3) .cse5) 1))))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| .cse2) 4)))))) is different from false [2024-11-10 15:29:16,623 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse5 (+ (select .cse1 0) 4))) (let ((.cse0 (= (select (select |c_#memory_int#1| .cse3) .cse5) 1)) (.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (and .cse0 (= |c_ULTIMATE.start_sll_circular_insert_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select |c_#valid| .cse2) 1) (= (select |c_#valid| .cse3) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= .cse3 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)) (not (= .cse2 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)) (exists ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_14| Int)) (and (not (= .cse3 |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_14|)) (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_14|) 1))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_insert_~head#1.offset| 0) (or .cse0 (exists ((|v_old(#memory_int#1)_AFTER_CALL_28| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_old(#memory_int#1)_AFTER_CALL_28| |c_#memory_int#1|))) (and (= |c_#memory_int#1| (store |v_old(#memory_int#1)_AFTER_CALL_28| .cse4 (select |c_#memory_int#1| .cse4))) (= .cse4 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) (= (select (select |v_old(#memory_int#1)_AFTER_CALL_28| .cse3) .cse5) 1))))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| .cse2) 4)))))) is different from true [2024-11-10 15:29:17,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:29:17,442 INFO L93 Difference]: Finished difference Result 116 states and 122 transitions. [2024-11-10 15:29:17,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-10 15:29:17,443 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 54 states have (on average 1.7592592592592593) internal successors, (95), 49 states have internal predecessors, (95), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 58 [2024-11-10 15:29:17,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:29:17,443 INFO L225 Difference]: With dead ends: 116 [2024-11-10 15:29:17,443 INFO L226 Difference]: Without dead ends: 116 [2024-11-10 15:29:17,445 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 88 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 1237 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=429, Invalid=6381, Unknown=24, NotChecked=1176, Total=8010 [2024-11-10 15:29:17,445 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 117 mSDsluCounter, 1951 mSDsCounter, 0 mSdLazyCounter, 1620 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 2024 SdHoareTripleChecker+Invalid, 1800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 169 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 15:29:17,446 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 2024 Invalid, 1800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1620 Invalid, 0 Unknown, 169 Unchecked, 0.6s Time] [2024-11-10 15:29:17,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-10 15:29:17,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 112. [2024-11-10 15:29:17,448 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-10 15:29:17,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 119 transitions. [2024-11-10 15:29:17,448 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 119 transitions. Word has length 58 [2024-11-10 15:29:17,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:29:17,448 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 119 transitions. [2024-11-10 15:29:17,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 54 states have (on average 1.7592592592592593) internal successors, (95), 49 states have internal predecessors, (95), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 15:29:17,448 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 119 transitions. [2024-11-10 15:29:17,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-10 15:29:17,449 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:29:17,449 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-10 15:29:17,465 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-10 15:29:17,649 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-10 15:29:17,649 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-10 15:29:17,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:29:17,650 INFO L85 PathProgramCache]: Analyzing trace with hash -819138228, now seen corresponding path program 1 times [2024-11-10 15:29:17,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:29:17,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153082527] [2024-11-10 15:29:17,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:29:17,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:29:17,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:29:18,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:29:18,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:29:18,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 15:29:18,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:29:18,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 15:29:18,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:29:18,264 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-10 15:29:18,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:29:18,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153082527] [2024-11-10 15:29:18,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153082527] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:29:18,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [858877383] [2024-11-10 15:29:18,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:29:18,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:29:18,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:29:18,266 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-10 15:29:18,268 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-10 15:29:18,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:29:18,463 INFO L255 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 74 conjuncts are in the unsatisfiable core [2024-11-10 15:29:18,465 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:29:18,468 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-10 15:29:18,577 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-10 15:29:18,577 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-10 15:29:18,625 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-10 15:29:18,699 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-10 15:29:18,699 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-10 15:29:18,794 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-10 15:29:18,797 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-10 15:29:18,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:29:18,925 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-10 15:29:18,941 INFO L349 Elim1Store]: treesize reduction 88, result has 36.7 percent of original size [2024-11-10 15:29:18,942 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-10 15:29:19,100 INFO L349 Elim1Store]: treesize reduction 33, result has 48.4 percent of original size [2024-11-10 15:29:19,100 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-10 15:29:19,184 INFO L349 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2024-11-10 15:29:19,184 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-10 15:29:19,201 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-10 15:29:19,303 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-10 15:29:19,306 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-10 15:29:19,523 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-10 15:29:19,721 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-10 15:29:19,721 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:29:19,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [858877383] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:29:19,976 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:29:19,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 27] total 47 [2024-11-10 15:29:19,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640571183] [2024-11-10 15:29:19,976 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:29:19,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2024-11-10 15:29:19,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:29:19,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-11-10 15:29:19,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=2497, Unknown=1, NotChecked=0, Total=2652 [2024-11-10 15:29:19,977 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-10 15:29:21,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:29:21,361 INFO L93 Difference]: Finished difference Result 122 states and 131 transitions. [2024-11-10 15:29:21,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-10 15:29:21,361 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-10 15:29:21,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:29:21,362 INFO L225 Difference]: With dead ends: 122 [2024-11-10 15:29:21,362 INFO L226 Difference]: Without dead ends: 122 [2024-11-10 15:29:21,363 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 878 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=332, Invalid=4223, Unknown=1, NotChecked=0, Total=4556 [2024-11-10 15:29:21,363 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 114 mSDsluCounter, 1600 mSDsCounter, 0 mSdLazyCounter, 2085 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 1665 SdHoareTripleChecker+Invalid, 2095 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 2085 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 15:29:21,363 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 1665 Invalid, 2095 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 2085 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 15:29:21,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-10 15:29:21,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 118. [2024-11-10 15:29:21,365 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-10 15:29:21,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 128 transitions. [2024-11-10 15:29:21,366 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 128 transitions. Word has length 60 [2024-11-10 15:29:21,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:29:21,366 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 128 transitions. [2024-11-10 15:29:21,366 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-10 15:29:21,366 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 128 transitions. [2024-11-10 15:29:21,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-10 15:29:21,366 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:29:21,367 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-10 15:29:21,380 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-10 15:29:21,567 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-10 15:29:21,567 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-10 15:29:21,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:29:21,568 INFO L85 PathProgramCache]: Analyzing trace with hash -819138227, now seen corresponding path program 1 times [2024-11-10 15:29:21,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:29:21,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603014949] [2024-11-10 15:29:21,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:29:21,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:29:21,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:29:22,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:29:22,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:29:22,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 15:29:22,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:29:22,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 15:29:22,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:29:22,287 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-10 15:29:22,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:29:22,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603014949] [2024-11-10 15:29:22,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603014949] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:29:22,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [799005490] [2024-11-10 15:29:22,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:29:22,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:29:22,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:29:22,289 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-10 15:29:22,290 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-10 15:29:22,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:29:22,473 INFO L255 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 124 conjuncts are in the unsatisfiable core [2024-11-10 15:29:22,476 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:29:22,481 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-10 15:29:22,482 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-10 15:29:22,708 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-10 15:29:22,708 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-10 15:29:22,718 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 15:29:22,718 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-10 15:29:22,791 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-10 15:29:22,800 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-10 15:29:22,891 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-10 15:29:22,891 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-10 15:29:22,894 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-10 15:29:23,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 19 [2024-11-10 15:29:23,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-11-10 15:29:23,018 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-10 15:29:23,021 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-10 15:29:23,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:29:23,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 34 [2024-11-10 15:29:23,301 INFO L349 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2024-11-10 15:29:23,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 29 [2024-11-10 15:29:23,313 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-10 15:29:23,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2024-11-10 15:29:23,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-10 15:29:23,583 INFO L349 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2024-11-10 15:29:23,583 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 53 treesize of output 48 [2024-11-10 15:29:23,593 INFO L349 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2024-11-10 15:29:23,593 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 23 treesize of output 22 [2024-11-10 15:29:23,737 INFO L349 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2024-11-10 15:29:23,738 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 98 treesize of output 82 [2024-11-10 15:29:23,754 INFO L349 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2024-11-10 15:29:23,754 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 107 treesize of output 109 [2024-11-10 15:29:23,806 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-10 15:29:23,831 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-10 15:29:23,845 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-10 15:29:24,036 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 195 treesize of output 127 [2024-11-10 15:29:24,416 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:29:24,417 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 124 treesize of output 128 [2024-11-10 15:29:24,420 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 120 treesize of output 80 [2024-11-10 15:29:24,738 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-10 15:29:24,738 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:29:31,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [799005490] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:29:31,276 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:29:31,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 28] total 49 [2024-11-10 15:29:31,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198604178] [2024-11-10 15:29:31,276 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:29:31,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-10 15:29:31,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:29:31,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-10 15:29:31,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=3187, Unknown=78, NotChecked=0, Total=3422 [2024-11-10 15:29:31,277 INFO L87 Difference]: Start difference. First operand 118 states and 128 transitions. Second operand has 50 states, 47 states have (on average 2.1914893617021276) internal successors, (103), 42 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-10 15:29:34,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:29:34,085 INFO L93 Difference]: Finished difference Result 126 states and 135 transitions. [2024-11-10 15:29:34,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-10 15:29:34,085 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 47 states have (on average 2.1914893617021276) internal successors, (103), 42 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-10 15:29:34,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:29:34,086 INFO L225 Difference]: With dead ends: 126 [2024-11-10 15:29:34,086 INFO L226 Difference]: Without dead ends: 126 [2024-11-10 15:29:34,087 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 905 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=350, Invalid=6211, Unknown=81, NotChecked=0, Total=6642 [2024-11-10 15:29:34,087 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 160 mSDsluCounter, 1993 mSDsCounter, 0 mSdLazyCounter, 2305 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 2063 SdHoareTripleChecker+Invalid, 2310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 2305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:29:34,087 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 2063 Invalid, 2310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 2305 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-10 15:29:34,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-10 15:29:34,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 122. [2024-11-10 15:29:34,090 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-10 15:29:34,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 132 transitions. [2024-11-10 15:29:34,091 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 132 transitions. Word has length 60 [2024-11-10 15:29:34,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:29:34,091 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 132 transitions. [2024-11-10 15:29:34,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 47 states have (on average 2.1914893617021276) internal successors, (103), 42 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-10 15:29:34,091 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 132 transitions. [2024-11-10 15:29:34,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-10 15:29:34,091 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:29:34,092 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-10 15:29:34,105 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-10 15:29:34,292 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-10 15:29:34,292 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-10 15:29:34,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:29:34,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1584544595, now seen corresponding path program 1 times [2024-11-10 15:29:34,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:29:34,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661524114] [2024-11-10 15:29:34,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:29:34,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:29:34,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:29:35,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:29:35,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:29:35,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 15:29:35,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:29:35,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 15:29:35,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:29:35,180 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-10 15:29:35,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:29:35,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661524114] [2024-11-10 15:29:35,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661524114] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:29:35,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [175752256] [2024-11-10 15:29:35,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:29:35,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:29:35,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:29:35,182 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-10 15:29:35,183 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-10 15:29:35,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:29:35,525 INFO L255 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 128 conjuncts are in the unsatisfiable core [2024-11-10 15:29:35,527 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:29:35,530 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-10 15:29:35,611 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-10 15:29:35,826 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-10 15:29:35,906 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-10 15:29:36,004 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-10 15:29:36,004 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-10 15:29:36,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-10 15:29:36,393 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-10 15:29:36,398 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-10 15:29:36,470 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-11-10 15:29:36,471 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-10 15:29:36,475 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-10 15:29:36,478 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-10 15:29:36,542 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-10 15:29:36,690 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-10 15:29:36,693 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-10 15:29:36,794 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-10 15:29:36,796 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 16 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 15:29:36,796 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:29:36,974 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3110 (Array Int Int)) (v_ArrVal_3111 (Array Int Int)) (v_ArrVal_3112 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3112) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3110) .cse0) .cse1)) (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3111) .cse0) .cse1) 4)))) (not (= v_ArrVal_3112 (store (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_3112 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))))) is different from false [2024-11-10 15:29:36,981 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:29:36,981 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 61 treesize of output 62 [2024-11-10 15:29:36,990 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:29:36,990 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 120 treesize of output 123 [2024-11-10 15:29:36,995 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:29:36,995 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 100 treesize of output 92 [2024-11-10 15:29:37,007 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:29:37,007 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 170 treesize of output 161 [2024-11-10 15:29:37,013 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 35 treesize of output 29 [2024-11-10 15:29:37,017 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 29 treesize of output 23 [2024-11-10 15:29:42,565 INFO L349 Elim1Store]: treesize reduction 1615, result has 18.7 percent of original size [2024-11-10 15:29:42,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 20 select indices, 20 select index equivalence classes, 0 disjoint index pairs (out of 190 index pairs), introduced 21 new quantified variables, introduced 211 case distinctions, treesize of input 2495 treesize of output 2688 [2024-11-10 15:29:42,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1745 treesize of output 1741 [2024-11-10 15:29:42,879 INFO L224 Elim1Store]: Index analysis took 140 ms [2024-11-10 15:29:44,813 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:29:44,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 20 select indices, 20 select index equivalence classes, 0 disjoint index pairs (out of 190 index pairs), introduced 20 new quantified variables, introduced 190 case distinctions, treesize of input 2255 treesize of output 3705 [2024-11-10 15:29:45,707 INFO L349 Elim1Store]: treesize reduction 32, result has 59.5 percent of original size [2024-11-10 15:29:45,708 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 2046 treesize of output 2080 [2024-11-10 15:29:46,156 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 2047 treesize of output 2043 [2024-11-10 15:29:46,663 INFO L349 Elim1Store]: treesize reduction 16, result has 60.0 percent of original size [2024-11-10 15:29:46,664 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 2043 treesize of output 2058 [2024-11-10 15:29:47,203 INFO L349 Elim1Store]: treesize reduction 16, result has 60.0 percent of original size [2024-11-10 15:29:47,204 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 2034 treesize of output 2049 [2024-11-10 15:29:47,730 INFO L349 Elim1Store]: treesize reduction 16, result has 60.0 percent of original size [2024-11-10 15:29:47,730 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 2025 treesize of output 2040 [2024-11-10 15:29:48,239 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 2016 treesize of output 2014 [2024-11-10 15:29:48,815 INFO L349 Elim1Store]: treesize reduction 32, result has 59.5 percent of original size [2024-11-10 15:29:48,816 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 2014 treesize of output 2048 [2024-11-10 15:29:49,346 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 2001 treesize of output 1997 [2024-11-10 15:29:49,901 INFO L349 Elim1Store]: treesize reduction 16, result has 60.0 percent of original size [2024-11-10 15:29:49,901 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 1997 treesize of output 2012 [2024-11-10 15:29:50,510 INFO L349 Elim1Store]: treesize reduction 16, result has 60.0 percent of original size [2024-11-10 15:29:50,511 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 1988 treesize of output 2003 [2024-11-10 15:29:51,118 INFO L349 Elim1Store]: treesize reduction 16, result has 60.0 percent of original size [2024-11-10 15:29:51,118 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 1979 treesize of output 1994 [2024-11-10 15:29:51,684 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 1984 treesize of output 1980 [2024-11-10 15:29:52,295 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 1980 treesize of output 1976 [2024-11-10 15:29:52,948 INFO L349 Elim1Store]: treesize reduction 24, result has 55.6 percent of original size [2024-11-10 15:29:52,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 1976 treesize of output 1995 [2024-11-10 15:29:54,071 INFO L349 Elim1Store]: treesize reduction 24, result has 55.6 percent of original size [2024-11-10 15:29:54,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 1967 treesize of output 1986 [2024-11-10 15:29:55,209 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:29:55,210 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 1958 treesize of output 1966 [2024-11-10 15:29:56,388 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:29:56,389 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 1953 treesize of output 1961