./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/recursive-with-pointer/system-with-recursion.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/recursive-with-pointer/system-with-recursion.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 74e63e86abbcab22438f70ee6d7d7ef12eaada509b0f0a56fb5cf815aaf53aab --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 22:48:43,881 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 22:48:43,937 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-09 22:48:43,944 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 22:48:43,947 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 22:48:43,967 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 22:48:43,968 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 22:48:43,968 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 22:48:43,969 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 22:48:43,969 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 22:48:43,970 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 22:48:43,970 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 22:48:43,970 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 22:48:43,970 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 22:48:43,971 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 22:48:43,971 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 22:48:43,971 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 22:48:43,971 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 22:48:43,971 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 22:48:43,971 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 22:48:43,971 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-09 22:48:43,971 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-09 22:48:43,971 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-09 22:48:43,971 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 22:48:43,971 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 22:48:43,971 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 22:48:43,971 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 22:48:43,971 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 22:48:43,971 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 22:48:43,972 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 22:48:43,972 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:48:43,972 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:48:43,972 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:48:43,972 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:48:43,972 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 22:48:43,972 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:48:43,973 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:48:43,973 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:48:43,973 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:48:43,973 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 22:48:43,973 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 22:48:43,973 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 22:48:43,973 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 22:48:43,973 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 22:48:43,973 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 22:48:43,973 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 22:48:43,973 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 22:48:43,973 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 -> 74e63e86abbcab22438f70ee6d7d7ef12eaada509b0f0a56fb5cf815aaf53aab [2025-01-09 22:48:44,219 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 22:48:44,226 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 22:48:44,228 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 22:48:44,230 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 22:48:44,230 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 22:48:44,232 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-with-pointer/system-with-recursion.i [2025-01-09 22:48:45,400 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/708b0c1c8/9d5ae97a2fff4e2d921b047b20cd691a/FLAGe8576197d [2025-01-09 22:48:45,663 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 22:48:45,664 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/recursive-with-pointer/system-with-recursion.i [2025-01-09 22:48:45,673 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/708b0c1c8/9d5ae97a2fff4e2d921b047b20cd691a/FLAGe8576197d [2025-01-09 22:48:45,682 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/708b0c1c8/9d5ae97a2fff4e2d921b047b20cd691a [2025-01-09 22:48:45,684 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 22:48:45,685 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 22:48:45,686 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 22:48:45,686 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 22:48:45,689 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 22:48:45,689 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:48:45" (1/1) ... [2025-01-09 22:48:45,690 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c8e232 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:48:45, skipping insertion in model container [2025-01-09 22:48:45,690 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:48:45" (1/1) ... [2025-01-09 22:48:45,718 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 22:48:46,030 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:48:46,041 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 22:48:46,107 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:48:46,133 INFO L204 MainTranslator]: Completed translation [2025-01-09 22:48:46,133 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:48:46 WrapperNode [2025-01-09 22:48:46,133 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 22:48:46,134 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 22:48:46,134 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 22:48:46,134 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 22:48:46,139 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:48:46" (1/1) ... [2025-01-09 22:48:46,149 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:48:46" (1/1) ... [2025-01-09 22:48:46,170 INFO L138 Inliner]: procedures = 184, calls = 145, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 236 [2025-01-09 22:48:46,170 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 22:48:46,170 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 22:48:46,171 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 22:48:46,171 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 22:48:46,182 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:48:46" (1/1) ... [2025-01-09 22:48:46,183 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:48:46" (1/1) ... [2025-01-09 22:48:46,187 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:48:46" (1/1) ... [2025-01-09 22:48:46,209 INFO L175 MemorySlicer]: Split 91 memory accesses to 3 slices as follows [2, 19, 70]. 77 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 9, 0]. The 44 writes are split as follows [0, 6, 38]. [2025-01-09 22:48:46,210 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:48:46" (1/1) ... [2025-01-09 22:48:46,210 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:48:46" (1/1) ... [2025-01-09 22:48:46,224 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:48:46" (1/1) ... [2025-01-09 22:48:46,225 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:48:46" (1/1) ... [2025-01-09 22:48:46,228 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:48:46" (1/1) ... [2025-01-09 22:48:46,230 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:48:46" (1/1) ... [2025-01-09 22:48:46,232 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:48:46" (1/1) ... [2025-01-09 22:48:46,235 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 22:48:46,235 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 22:48:46,235 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 22:48:46,235 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 22:48:46,236 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:48:46" (1/1) ... [2025-01-09 22:48:46,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:48:46,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:48:46,266 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 22:48:46,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 22:48:46,288 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 22:48:46,288 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 22:48:46,288 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 22:48:46,288 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2025-01-09 22:48:46,288 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2025-01-09 22:48:46,288 INFO L130 BoogieDeclarations]: Found specification of procedure event_precess [2025-01-09 22:48:46,288 INFO L138 BoogieDeclarations]: Found implementation of procedure event_precess [2025-01-09 22:48:46,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 22:48:46,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 22:48:46,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 22:48:46,288 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 22:48:46,288 INFO L130 BoogieDeclarations]: Found specification of procedure ASNull [2025-01-09 22:48:46,288 INFO L138 BoogieDeclarations]: Found implementation of procedure ASNull [2025-01-09 22:48:46,288 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 22:48:46,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 22:48:46,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 22:48:46,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 22:48:46,289 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 22:48:46,289 INFO L130 BoogieDeclarations]: Found specification of procedure ASStart [2025-01-09 22:48:46,289 INFO L138 BoogieDeclarations]: Found implementation of procedure ASStart [2025-01-09 22:48:46,289 INFO L130 BoogieDeclarations]: Found specification of procedure status_update [2025-01-09 22:48:46,289 INFO L138 BoogieDeclarations]: Found implementation of procedure status_update [2025-01-09 22:48:46,289 INFO L130 BoogieDeclarations]: Found specification of procedure message_send [2025-01-09 22:48:46,289 INFO L138 BoogieDeclarations]: Found implementation of procedure message_send [2025-01-09 22:48:46,289 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 22:48:46,290 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 22:48:46,290 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 22:48:46,290 INFO L130 BoogieDeclarations]: Found specification of procedure ASIdle [2025-01-09 22:48:46,290 INFO L138 BoogieDeclarations]: Found implementation of procedure ASIdle [2025-01-09 22:48:46,290 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 22:48:46,290 INFO L130 BoogieDeclarations]: Found specification of procedure system_initialize [2025-01-09 22:48:46,290 INFO L138 BoogieDeclarations]: Found implementation of procedure system_initialize [2025-01-09 22:48:46,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 22:48:46,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 22:48:46,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 22:48:46,290 INFO L130 BoogieDeclarations]: Found specification of procedure ASStop [2025-01-09 22:48:46,290 INFO L138 BoogieDeclarations]: Found implementation of procedure ASStop [2025-01-09 22:48:46,290 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 22:48:46,290 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 22:48:46,427 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 22:48:46,429 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 22:48:47,048 INFO L? ?]: Removed 322 outVars from TransFormulas that were not future-live. [2025-01-09 22:48:47,048 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 22:48:47,073 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 22:48:47,073 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 22:48:47,074 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:48:47 BoogieIcfgContainer [2025-01-09 22:48:47,076 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 22:48:47,077 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 22:48:47,078 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 22:48:47,082 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 22:48:47,082 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:48:45" (1/3) ... [2025-01-09 22:48:47,083 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56463deb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:48:47, skipping insertion in model container [2025-01-09 22:48:47,083 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:48:46" (2/3) ... [2025-01-09 22:48:47,084 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56463deb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:48:47, skipping insertion in model container [2025-01-09 22:48:47,084 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:48:47" (3/3) ... [2025-01-09 22:48:47,085 INFO L128 eAbstractionObserver]: Analyzing ICFG system-with-recursion.i [2025-01-09 22:48:47,096 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 22:48:47,098 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG system-with-recursion.i that has 10 procedures, 387 locations, 1 initial locations, 1 loop locations, and 158 error locations. [2025-01-09 22:48:47,141 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 22:48:47,149 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;@5cf031dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 22:48:47,149 INFO L334 AbstractCegarLoop]: Starting to check reachability of 158 error locations. [2025-01-09 22:48:47,152 INFO L276 IsEmpty]: Start isEmpty. Operand has 387 states, 190 states have (on average 1.9842105263157894) internal successors, (377), 348 states have internal predecessors, (377), 29 states have call successors, (29), 9 states have call predecessors, (29), 9 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-01-09 22:48:47,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-09 22:48:47,156 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:48:47,156 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:48:47,156 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2025-01-09 22:48:47,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:48:47,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1798451593, now seen corresponding path program 1 times [2025-01-09 22:48:47,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:48:47,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352326959] [2025-01-09 22:48:47,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:48:47,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:48:47,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-09 22:48:47,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-09 22:48:47,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:48:47,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:48:47,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:48:47,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:48:47,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352326959] [2025-01-09 22:48:47,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352326959] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:48:47,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:48:47,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:48:47,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267894659] [2025-01-09 22:48:47,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:48:47,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:48:47,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:48:47,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:48:47,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:48:47,395 INFO L87 Difference]: Start difference. First operand has 387 states, 190 states have (on average 1.9842105263157894) internal successors, (377), 348 states have internal predecessors, (377), 29 states have call successors, (29), 9 states have call predecessors, (29), 9 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) 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), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:48:47,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:48:47,698 INFO L93 Difference]: Finished difference Result 414 states and 479 transitions. [2025-01-09 22:48:47,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:48:47,700 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), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 7 [2025-01-09 22:48:47,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:48:47,707 INFO L225 Difference]: With dead ends: 414 [2025-01-09 22:48:47,707 INFO L226 Difference]: Without dead ends: 412 [2025-01-09 22:48:47,709 INFO L434 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 [2025-01-09 22:48:47,710 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 386 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:48:47,711 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 281 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 22:48:47,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2025-01-09 22:48:47,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 380. [2025-01-09 22:48:47,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 202 states have (on average 1.8415841584158417) internal successors, (372), 336 states have internal predecessors, (372), 32 states have call successors, (32), 11 states have call predecessors, (32), 11 states have return successors, (37), 32 states have call predecessors, (37), 32 states have call successors, (37) [2025-01-09 22:48:47,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 441 transitions. [2025-01-09 22:48:47,771 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 441 transitions. Word has length 7 [2025-01-09 22:48:47,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:48:47,772 INFO L471 AbstractCegarLoop]: Abstraction has 380 states and 441 transitions. [2025-01-09 22:48:47,772 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), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:48:47,772 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 441 transitions. [2025-01-09 22:48:47,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-09 22:48:47,773 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:48:47,773 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:48:47,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 22:48:47,774 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2025-01-09 22:48:47,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:48:47,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1798451592, now seen corresponding path program 1 times [2025-01-09 22:48:47,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:48:47,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614954240] [2025-01-09 22:48:47,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:48:47,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:48:47,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-09 22:48:47,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-09 22:48:47,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:48:47,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:48:47,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:48:47,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:48:47,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614954240] [2025-01-09 22:48:47,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614954240] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:48:47,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:48:47,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:48:47,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414709459] [2025-01-09 22:48:47,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:48:47,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:48:47,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:48:47,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:48:47,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:48:47,929 INFO L87 Difference]: Start difference. First operand 380 states and 441 transitions. Second operand has 4 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), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:48:48,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:48:48,218 INFO L93 Difference]: Finished difference Result 377 states and 437 transitions. [2025-01-09 22:48:48,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:48:48,218 INFO L78 Accepts]: Start accepts. Automaton has has 4 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), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 7 [2025-01-09 22:48:48,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:48:48,220 INFO L225 Difference]: With dead ends: 377 [2025-01-09 22:48:48,220 INFO L226 Difference]: Without dead ends: 377 [2025-01-09 22:48:48,220 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:48:48,220 INFO L435 NwaCegarLoop]: 385 mSDtfsCounter, 13 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 843 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:48:48,221 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 843 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 22:48:48,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2025-01-09 22:48:48,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2025-01-09 22:48:48,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 204 states have (on average 1.803921568627451) internal successors, (368), 332 states have internal predecessors, (368), 32 states have call successors, (32), 12 states have call predecessors, (32), 12 states have return successors, (37), 32 states have call predecessors, (37), 32 states have call successors, (37) [2025-01-09 22:48:48,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 437 transitions. [2025-01-09 22:48:48,238 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 437 transitions. Word has length 7 [2025-01-09 22:48:48,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:48:48,238 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 437 transitions. [2025-01-09 22:48:48,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 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), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:48:48,238 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 437 transitions. [2025-01-09 22:48:48,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-09 22:48:48,239 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:48:48,239 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:48:48,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 22:48:48,239 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2025-01-09 22:48:48,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:48:48,239 INFO L85 PathProgramCache]: Analyzing trace with hash -996852037, now seen corresponding path program 1 times [2025-01-09 22:48:48,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:48:48,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554113758] [2025-01-09 22:48:48,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:48:48,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:48:48,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-09 22:48:48,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-09 22:48:48,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:48:48,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:48:48,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:48:48,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:48:48,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554113758] [2025-01-09 22:48:48,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554113758] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:48:48,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:48:48,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 22:48:48,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618779506] [2025-01-09 22:48:48,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:48:48,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:48:48,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:48:48,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:48:48,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:48:48,427 INFO L87 Difference]: Start difference. First operand 377 states and 437 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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) [2025-01-09 22:48:48,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:48:48,755 INFO L93 Difference]: Finished difference Result 376 states and 436 transitions. [2025-01-09 22:48:48,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:48:48,755 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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 11 [2025-01-09 22:48:48,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:48:48,757 INFO L225 Difference]: With dead ends: 376 [2025-01-09 22:48:48,757 INFO L226 Difference]: Without dead ends: 376 [2025-01-09 22:48:48,757 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:48:48,758 INFO L435 NwaCegarLoop]: 389 mSDtfsCounter, 2 mSDsluCounter, 713 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1102 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:48:48,758 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1102 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 22:48:48,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2025-01-09 22:48:48,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 376. [2025-01-09 22:48:48,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 204 states have (on average 1.7990196078431373) internal successors, (367), 331 states have internal predecessors, (367), 32 states have call successors, (32), 12 states have call predecessors, (32), 12 states have return successors, (37), 32 states have call predecessors, (37), 32 states have call successors, (37) [2025-01-09 22:48:48,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 436 transitions. [2025-01-09 22:48:48,775 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 436 transitions. Word has length 11 [2025-01-09 22:48:48,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:48:48,776 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 436 transitions. [2025-01-09 22:48:48,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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) [2025-01-09 22:48:48,776 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 436 transitions. [2025-01-09 22:48:48,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-09 22:48:48,776 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:48:48,776 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:48:48,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 22:48:48,776 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2025-01-09 22:48:48,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:48:48,781 INFO L85 PathProgramCache]: Analyzing trace with hash -996852036, now seen corresponding path program 1 times [2025-01-09 22:48:48,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:48:48,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340146847] [2025-01-09 22:48:48,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:48:48,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:48:48,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-09 22:48:48,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-09 22:48:48,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:48:48,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:48:48,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:48:48,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:48:48,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340146847] [2025-01-09 22:48:48,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340146847] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:48:48,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:48:48,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 22:48:48,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513013540] [2025-01-09 22:48:48,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:48:48,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:48:48,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:48:48,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:48:48,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:48:48,955 INFO L87 Difference]: Start difference. First operand 376 states and 436 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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) [2025-01-09 22:48:49,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:48:49,265 INFO L93 Difference]: Finished difference Result 375 states and 435 transitions. [2025-01-09 22:48:49,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:48:49,265 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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 11 [2025-01-09 22:48:49,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:48:49,267 INFO L225 Difference]: With dead ends: 375 [2025-01-09 22:48:49,267 INFO L226 Difference]: Without dead ends: 375 [2025-01-09 22:48:49,267 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:48:49,268 INFO L435 NwaCegarLoop]: 389 mSDtfsCounter, 1 mSDsluCounter, 694 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1083 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:48:49,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1083 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 22:48:49,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2025-01-09 22:48:49,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 375. [2025-01-09 22:48:49,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 204 states have (on average 1.7941176470588236) internal successors, (366), 330 states have internal predecessors, (366), 32 states have call successors, (32), 12 states have call predecessors, (32), 12 states have return successors, (37), 32 states have call predecessors, (37), 32 states have call successors, (37) [2025-01-09 22:48:49,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 435 transitions. [2025-01-09 22:48:49,293 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 435 transitions. Word has length 11 [2025-01-09 22:48:49,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:48:49,293 INFO L471 AbstractCegarLoop]: Abstraction has 375 states and 435 transitions. [2025-01-09 22:48:49,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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) [2025-01-09 22:48:49,293 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 435 transitions. [2025-01-09 22:48:49,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-01-09 22:48:49,293 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:48:49,293 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:48:49,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 22:48:49,294 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2025-01-09 22:48:49,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:48:49,294 INFO L85 PathProgramCache]: Analyzing trace with hash -880937440, now seen corresponding path program 1 times [2025-01-09 22:48:49,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:48:49,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186270257] [2025-01-09 22:48:49,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:48:49,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:48:49,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-09 22:48:49,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 22:48:49,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:48:49,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:48:49,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:48:49,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:48:49,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186270257] [2025-01-09 22:48:49,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186270257] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:48:49,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:48:49,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:48:49,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648898842] [2025-01-09 22:48:49,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:48:49,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:48:49,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:48:49,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:48:49,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:48:49,354 INFO L87 Difference]: Start difference. First operand 375 states and 435 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:48:49,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:48:49,498 INFO L93 Difference]: Finished difference Result 374 states and 434 transitions. [2025-01-09 22:48:49,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:48:49,499 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2025-01-09 22:48:49,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:48:49,501 INFO L225 Difference]: With dead ends: 374 [2025-01-09 22:48:49,502 INFO L226 Difference]: Without dead ends: 374 [2025-01-09 22:48:49,503 INFO L434 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 [2025-01-09 22:48:49,503 INFO L435 NwaCegarLoop]: 390 mSDtfsCounter, 1 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:48:49,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 635 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:48:49,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2025-01-09 22:48:49,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 374. [2025-01-09 22:48:49,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 204 states have (on average 1.7892156862745099) internal successors, (365), 329 states have internal predecessors, (365), 32 states have call successors, (32), 12 states have call predecessors, (32), 12 states have return successors, (37), 32 states have call predecessors, (37), 32 states have call successors, (37) [2025-01-09 22:48:49,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 434 transitions. [2025-01-09 22:48:49,515 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 434 transitions. Word has length 17 [2025-01-09 22:48:49,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:48:49,515 INFO L471 AbstractCegarLoop]: Abstraction has 374 states and 434 transitions. [2025-01-09 22:48:49,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:48:49,515 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 434 transitions. [2025-01-09 22:48:49,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-01-09 22:48:49,516 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:48:49,516 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:48:49,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 22:48:49,516 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2025-01-09 22:48:49,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:48:49,516 INFO L85 PathProgramCache]: Analyzing trace with hash -880937439, now seen corresponding path program 1 times [2025-01-09 22:48:49,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:48:49,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895810002] [2025-01-09 22:48:49,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:48:49,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:48:49,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-09 22:48:49,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 22:48:49,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:48:49,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:48:49,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:48:49,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:48:49,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895810002] [2025-01-09 22:48:49,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895810002] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:48:49,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:48:49,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:48:49,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563784272] [2025-01-09 22:48:49,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:48:49,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:48:49,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:48:49,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:48:49,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:48:49,594 INFO L87 Difference]: Start difference. First operand 374 states and 434 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:48:49,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:48:49,744 INFO L93 Difference]: Finished difference Result 373 states and 433 transitions. [2025-01-09 22:48:49,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:48:49,744 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2025-01-09 22:48:49,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:48:49,746 INFO L225 Difference]: With dead ends: 373 [2025-01-09 22:48:49,746 INFO L226 Difference]: Without dead ends: 373 [2025-01-09 22:48:49,746 INFO L434 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 [2025-01-09 22:48:49,747 INFO L435 NwaCegarLoop]: 390 mSDtfsCounter, 1 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:48:49,747 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 622 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:48:49,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2025-01-09 22:48:49,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 373. [2025-01-09 22:48:49,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 204 states have (on average 1.7843137254901962) internal successors, (364), 328 states have internal predecessors, (364), 32 states have call successors, (32), 12 states have call predecessors, (32), 12 states have return successors, (37), 32 states have call predecessors, (37), 32 states have call successors, (37) [2025-01-09 22:48:49,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 433 transitions. [2025-01-09 22:48:49,755 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 433 transitions. Word has length 17 [2025-01-09 22:48:49,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:48:49,755 INFO L471 AbstractCegarLoop]: Abstraction has 373 states and 433 transitions. [2025-01-09 22:48:49,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:48:49,755 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 433 transitions. [2025-01-09 22:48:49,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-01-09 22:48:49,755 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:48:49,755 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:48:49,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 22:48:49,755 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2025-01-09 22:48:49,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:48:49,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1756576041, now seen corresponding path program 1 times [2025-01-09 22:48:49,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:48:49,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353549945] [2025-01-09 22:48:49,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:48:49,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:48:49,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 22:48:49,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 22:48:49,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:48:49,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:48:49,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:48:49,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:48:49,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353549945] [2025-01-09 22:48:49,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353549945] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:48:49,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:48:49,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 22:48:49,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666458904] [2025-01-09 22:48:49,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:48:49,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 22:48:49,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:48:49,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 22:48:49,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:48:49,907 INFO L87 Difference]: Start difference. First operand 373 states and 433 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:48:50,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:48:50,421 INFO L93 Difference]: Finished difference Result 386 states and 449 transitions. [2025-01-09 22:48:50,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 22:48:50,422 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2025-01-09 22:48:50,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:48:50,424 INFO L225 Difference]: With dead ends: 386 [2025-01-09 22:48:50,424 INFO L226 Difference]: Without dead ends: 386 [2025-01-09 22:48:50,424 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:48:50,424 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 1016 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1016 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 22:48:50,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1016 Valid, 331 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 22:48:50,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2025-01-09 22:48:50,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 354. [2025-01-09 22:48:50,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 204 states have (on average 1.6813725490196079) internal successors, (343), 309 states have internal predecessors, (343), 32 states have call successors, (32), 12 states have call predecessors, (32), 12 states have return successors, (37), 32 states have call predecessors, (37), 32 states have call successors, (37) [2025-01-09 22:48:50,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 412 transitions. [2025-01-09 22:48:50,434 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 412 transitions. Word has length 20 [2025-01-09 22:48:50,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:48:50,434 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 412 transitions. [2025-01-09 22:48:50,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:48:50,434 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 412 transitions. [2025-01-09 22:48:50,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-09 22:48:50,434 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:48:50,437 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:48:50,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 22:48:50,438 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ASNullErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2025-01-09 22:48:50,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:48:50,438 INFO L85 PathProgramCache]: Analyzing trace with hash 83868256, now seen corresponding path program 1 times [2025-01-09 22:48:50,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:48:50,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959321922] [2025-01-09 22:48:50,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:48:50,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:48:50,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 22:48:50,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 22:48:50,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:48:50,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:48:50,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:48:50,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:48:50,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959321922] [2025-01-09 22:48:50,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959321922] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:48:50,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:48:50,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 22:48:50,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491596347] [2025-01-09 22:48:50,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:48:50,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 22:48:50,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:48:50,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 22:48:50,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:48:50,588 INFO L87 Difference]: Start difference. First operand 354 states and 412 transitions. Second operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:48:50,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:48:50,969 INFO L93 Difference]: Finished difference Result 387 states and 458 transitions. [2025-01-09 22:48:50,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 22:48:50,969 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2025-01-09 22:48:50,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:48:50,971 INFO L225 Difference]: With dead ends: 387 [2025-01-09 22:48:50,971 INFO L226 Difference]: Without dead ends: 387 [2025-01-09 22:48:50,971 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:48:50,971 INFO L435 NwaCegarLoop]: 363 mSDtfsCounter, 43 mSDsluCounter, 1064 mSDsCounter, 0 mSdLazyCounter, 803 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 1427 SdHoareTripleChecker+Invalid, 805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 803 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 22:48:50,972 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 1427 Invalid, 805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 803 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 22:48:50,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2025-01-09 22:48:50,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 375. [2025-01-09 22:48:50,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 222 states have (on average 1.662162162162162) internal successors, (369), 327 states have internal predecessors, (369), 33 states have call successors, (33), 14 states have call predecessors, (33), 14 states have return successors, (40), 33 states have call predecessors, (40), 33 states have call successors, (40) [2025-01-09 22:48:50,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 442 transitions. [2025-01-09 22:48:50,983 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 442 transitions. Word has length 26 [2025-01-09 22:48:50,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:48:50,983 INFO L471 AbstractCegarLoop]: Abstraction has 375 states and 442 transitions. [2025-01-09 22:48:50,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:48:50,986 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 442 transitions. [2025-01-09 22:48:50,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-09 22:48:50,987 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:48:50,987 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:48:50,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 22:48:50,987 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ASNullErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2025-01-09 22:48:50,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:48:50,987 INFO L85 PathProgramCache]: Analyzing trace with hash 83868257, now seen corresponding path program 1 times [2025-01-09 22:48:50,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:48:50,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700225076] [2025-01-09 22:48:50,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:48:50,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:48:50,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 22:48:51,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 22:48:51,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:48:51,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:48:51,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:48:51,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:48:51,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700225076] [2025-01-09 22:48:51,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700225076] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:48:51,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:48:51,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 22:48:51,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543199359] [2025-01-09 22:48:51,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:48:51,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 22:48:51,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:48:51,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 22:48:51,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:48:51,171 INFO L87 Difference]: Start difference. First operand 375 states and 442 transitions. Second operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:48:51,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:48:51,546 INFO L93 Difference]: Finished difference Result 386 states and 457 transitions. [2025-01-09 22:48:51,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 22:48:51,547 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2025-01-09 22:48:51,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:48:51,548 INFO L225 Difference]: With dead ends: 386 [2025-01-09 22:48:51,548 INFO L226 Difference]: Without dead ends: 386 [2025-01-09 22:48:51,548 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:48:51,548 INFO L435 NwaCegarLoop]: 364 mSDtfsCounter, 42 mSDsluCounter, 1097 mSDsCounter, 0 mSdLazyCounter, 769 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 1461 SdHoareTripleChecker+Invalid, 771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:48:51,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 1461 Invalid, 771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 769 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 22:48:51,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2025-01-09 22:48:51,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 375. [2025-01-09 22:48:51,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 222 states have (on average 1.6576576576576576) internal successors, (368), 327 states have internal predecessors, (368), 33 states have call successors, (33), 14 states have call predecessors, (33), 14 states have return successors, (40), 33 states have call predecessors, (40), 33 states have call successors, (40) [2025-01-09 22:48:51,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 441 transitions. [2025-01-09 22:48:51,556 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 441 transitions. Word has length 26 [2025-01-09 22:48:51,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:48:51,556 INFO L471 AbstractCegarLoop]: Abstraction has 375 states and 441 transitions. [2025-01-09 22:48:51,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:48:51,557 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 441 transitions. [2025-01-09 22:48:51,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-01-09 22:48:51,557 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:48:51,557 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:48:51,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 22:48:51,557 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2025-01-09 22:48:51,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:48:51,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1697872296, now seen corresponding path program 1 times [2025-01-09 22:48:51,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:48:51,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220848732] [2025-01-09 22:48:51,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:48:51,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:48:51,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-09 22:48:51,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 22:48:51,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:48:51,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:48:51,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:48:51,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:48:51,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220848732] [2025-01-09 22:48:51,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220848732] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:48:51,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:48:51,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 22:48:51,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796664257] [2025-01-09 22:48:51,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:48:51,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:48:51,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:48:51,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:48:51,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:48:51,706 INFO L87 Difference]: Start difference. First operand 375 states and 441 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:48:51,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:48:51,857 INFO L93 Difference]: Finished difference Result 425 states and 492 transitions. [2025-01-09 22:48:51,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 22:48:51,857 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2025-01-09 22:48:51,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:48:51,858 INFO L225 Difference]: With dead ends: 425 [2025-01-09 22:48:51,858 INFO L226 Difference]: Without dead ends: 425 [2025-01-09 22:48:51,859 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:48:51,860 INFO L435 NwaCegarLoop]: 364 mSDtfsCounter, 58 mSDsluCounter, 1373 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 1737 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:48:51,860 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 1737 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:48:51,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2025-01-09 22:48:51,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 413. [2025-01-09 22:48:51,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 251 states have (on average 1.6015936254980079) internal successors, (402), 356 states have internal predecessors, (402), 37 states have call successors, (37), 18 states have call predecessors, (37), 19 states have return successors, (50), 38 states have call predecessors, (50), 37 states have call successors, (50) [2025-01-09 22:48:51,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 489 transitions. [2025-01-09 22:48:51,870 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 489 transitions. Word has length 27 [2025-01-09 22:48:51,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:48:51,870 INFO L471 AbstractCegarLoop]: Abstraction has 413 states and 489 transitions. [2025-01-09 22:48:51,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:48:51,870 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 489 transitions. [2025-01-09 22:48:51,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-01-09 22:48:51,871 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:48:51,871 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:48:51,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 22:48:51,871 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting system_initializeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2025-01-09 22:48:51,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:48:51,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1466731203, now seen corresponding path program 1 times [2025-01-09 22:48:51,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:48:51,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880946407] [2025-01-09 22:48:51,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:48:51,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:48:51,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-09 22:48:51,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-09 22:48:51,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:48:51,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:48:51,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:48:51,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:48:51,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880946407] [2025-01-09 22:48:51,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880946407] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:48:51,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:48:51,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 22:48:51,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445120833] [2025-01-09 22:48:51,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:48:51,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:48:51,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:48:51,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:48:51,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:48:51,942 INFO L87 Difference]: Start difference. First operand 413 states and 489 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:48:51,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:48:51,978 INFO L93 Difference]: Finished difference Result 423 states and 499 transitions. [2025-01-09 22:48:51,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:48:51,978 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 38 [2025-01-09 22:48:51,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:48:51,979 INFO L225 Difference]: With dead ends: 423 [2025-01-09 22:48:51,979 INFO L226 Difference]: Without dead ends: 421 [2025-01-09 22:48:51,979 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:48:51,980 INFO L435 NwaCegarLoop]: 365 mSDtfsCounter, 12 mSDsluCounter, 710 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1075 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:48:51,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1075 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:48:51,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2025-01-09 22:48:51,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 421. [2025-01-09 22:48:51,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 258 states have (on average 1.5891472868217054) internal successors, (410), 363 states have internal predecessors, (410), 37 states have call successors, (37), 19 states have call predecessors, (37), 20 states have return successors, (50), 38 states have call predecessors, (50), 37 states have call successors, (50) [2025-01-09 22:48:51,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 497 transitions. [2025-01-09 22:48:51,991 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 497 transitions. Word has length 38 [2025-01-09 22:48:51,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:48:51,991 INFO L471 AbstractCegarLoop]: Abstraction has 421 states and 497 transitions. [2025-01-09 22:48:51,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:48:51,991 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 497 transitions. [2025-01-09 22:48:51,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-01-09 22:48:51,992 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:48:51,992 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:48:51,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 22:48:51,993 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2025-01-09 22:48:51,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:48:51,993 INFO L85 PathProgramCache]: Analyzing trace with hash -850465204, now seen corresponding path program 1 times [2025-01-09 22:48:51,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:48:51,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842388744] [2025-01-09 22:48:51,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:48:51,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:48:52,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-09 22:48:52,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 22:48:52,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:48:52,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:48:52,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:48:52,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:48:52,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842388744] [2025-01-09 22:48:52,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842388744] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:48:52,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:48:52,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 22:48:52,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329774150] [2025-01-09 22:48:52,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:48:52,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 22:48:52,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:48:52,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 22:48:52,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-01-09 22:48:52,211 INFO L87 Difference]: Start difference. First operand 421 states and 497 transitions. Second operand has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:48:52,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:48:52,705 INFO L93 Difference]: Finished difference Result 465 states and 564 transitions. [2025-01-09 22:48:52,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 22:48:52,706 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 37 [2025-01-09 22:48:52,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:48:52,707 INFO L225 Difference]: With dead ends: 465 [2025-01-09 22:48:52,707 INFO L226 Difference]: Without dead ends: 458 [2025-01-09 22:48:52,707 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-01-09 22:48:52,708 INFO L435 NwaCegarLoop]: 322 mSDtfsCounter, 289 mSDsluCounter, 2048 mSDsCounter, 0 mSdLazyCounter, 707 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 2370 SdHoareTripleChecker+Invalid, 750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 22:48:52,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 2370 Invalid, 750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 707 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 22:48:52,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2025-01-09 22:48:52,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 423. [2025-01-09 22:48:52,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 259 states have (on average 1.583011583011583) internal successors, (410), 365 states have internal predecessors, (410), 37 states have call successors, (37), 19 states have call predecessors, (37), 21 states have return successors, (51), 38 states have call predecessors, (51), 37 states have call successors, (51) [2025-01-09 22:48:52,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 498 transitions. [2025-01-09 22:48:52,717 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 498 transitions. Word has length 37 [2025-01-09 22:48:52,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:48:52,718 INFO L471 AbstractCegarLoop]: Abstraction has 423 states and 498 transitions. [2025-01-09 22:48:52,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:48:52,718 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 498 transitions. [2025-01-09 22:48:52,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-01-09 22:48:52,718 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:48:52,718 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:48:52,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 22:48:52,718 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting system_initializeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2025-01-09 22:48:52,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:48:52,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1140093467, now seen corresponding path program 1 times [2025-01-09 22:48:52,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:48:52,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937413208] [2025-01-09 22:48:52,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:48:52,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:48:52,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-09 22:48:52,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 22:48:52,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:48:52,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:48:52,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:48:52,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:48:52,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937413208] [2025-01-09 22:48:52,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937413208] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:48:52,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:48:52,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 22:48:52,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615239056] [2025-01-09 22:48:52,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:48:52,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 22:48:52,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:48:52,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 22:48:52,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-01-09 22:48:52,872 INFO L87 Difference]: Start difference. First operand 423 states and 498 transitions. Second operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:48:53,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:48:53,555 INFO L93 Difference]: Finished difference Result 604 states and 805 transitions. [2025-01-09 22:48:53,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 22:48:53,556 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 40 [2025-01-09 22:48:53,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:48:53,558 INFO L225 Difference]: With dead ends: 604 [2025-01-09 22:48:53,558 INFO L226 Difference]: Without dead ends: 598 [2025-01-09 22:48:53,558 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2025-01-09 22:48:53,559 INFO L435 NwaCegarLoop]: 472 mSDtfsCounter, 447 mSDsluCounter, 1661 mSDsCounter, 0 mSdLazyCounter, 1010 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 447 SdHoareTripleChecker+Valid, 2133 SdHoareTripleChecker+Invalid, 1145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 1010 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 22:48:53,559 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [447 Valid, 2133 Invalid, 1145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 1010 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 22:48:53,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2025-01-09 22:48:53,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 527. [2025-01-09 22:48:53,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 339 states have (on average 1.519174041297935) internal successors, (515), 440 states have internal predecessors, (515), 49 states have call successors, (49), 24 states have call predecessors, (49), 33 states have return successors, (117), 62 states have call predecessors, (117), 49 states have call successors, (117) [2025-01-09 22:48:53,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 681 transitions. [2025-01-09 22:48:53,580 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 681 transitions. Word has length 40 [2025-01-09 22:48:53,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:48:53,580 INFO L471 AbstractCegarLoop]: Abstraction has 527 states and 681 transitions. [2025-01-09 22:48:53,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:48:53,580 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 681 transitions. [2025-01-09 22:48:53,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-01-09 22:48:53,581 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:48:53,581 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:48:53,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 22:48:53,581 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting system_initializeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2025-01-09 22:48:53,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:48:53,581 INFO L85 PathProgramCache]: Analyzing trace with hash 884069767, now seen corresponding path program 1 times [2025-01-09 22:48:53,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:48:53,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174754246] [2025-01-09 22:48:53,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:48:53,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:48:53,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-09 22:48:53,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 22:48:53,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:48:53,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:48:54,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:48:54,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:48:54,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174754246] [2025-01-09 22:48:54,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174754246] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:48:54,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:48:54,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 22:48:54,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267123169] [2025-01-09 22:48:54,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:48:54,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 22:48:54,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:48:54,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 22:48:54,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:48:54,009 INFO L87 Difference]: Start difference. First operand 527 states and 681 transitions. Second operand has 9 states, 8 states have (on average 4.375) internal successors, (35), 9 states have internal predecessors, (35), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:48:54,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:48:54,733 INFO L93 Difference]: Finished difference Result 808 states and 1143 transitions. [2025-01-09 22:48:54,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 22:48:54,734 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.375) internal successors, (35), 9 states have internal predecessors, (35), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 42 [2025-01-09 22:48:54,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:48:54,738 INFO L225 Difference]: With dead ends: 808 [2025-01-09 22:48:54,738 INFO L226 Difference]: Without dead ends: 806 [2025-01-09 22:48:54,738 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2025-01-09 22:48:54,739 INFO L435 NwaCegarLoop]: 303 mSDtfsCounter, 550 mSDsluCounter, 1015 mSDsCounter, 0 mSdLazyCounter, 1024 mSolverCounterSat, 214 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 553 SdHoareTripleChecker+Valid, 1318 SdHoareTripleChecker+Invalid, 1238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 214 IncrementalHoareTripleChecker+Valid, 1024 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 22:48:54,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [553 Valid, 1318 Invalid, 1238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [214 Valid, 1024 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 22:48:54,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2025-01-09 22:48:54,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 662. [2025-01-09 22:48:54,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 444 states have (on average 1.481981981981982) internal successors, (658), 546 states have internal predecessors, (658), 64 states have call successors, (64), 32 states have call predecessors, (64), 48 states have return successors, (180), 83 states have call predecessors, (180), 64 states have call successors, (180) [2025-01-09 22:48:54,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 902 transitions. [2025-01-09 22:48:54,762 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 902 transitions. Word has length 42 [2025-01-09 22:48:54,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:48:54,763 INFO L471 AbstractCegarLoop]: Abstraction has 662 states and 902 transitions. [2025-01-09 22:48:54,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.375) internal successors, (35), 9 states have internal predecessors, (35), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:48:54,764 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 902 transitions. [2025-01-09 22:48:54,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-01-09 22:48:54,764 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:48:54,764 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:48:54,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 22:48:54,764 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting system_initializeErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2025-01-09 22:48:54,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:48:54,765 INFO L85 PathProgramCache]: Analyzing trace with hash 884069768, now seen corresponding path program 1 times [2025-01-09 22:48:54,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:48:54,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163954165] [2025-01-09 22:48:54,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:48:54,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:48:54,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-09 22:48:54,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 22:48:54,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:48:54,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:48:55,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:48:55,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:48:55,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163954165] [2025-01-09 22:48:55,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163954165] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:48:55,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:48:55,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 22:48:55,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83836812] [2025-01-09 22:48:55,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:48:55,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 22:48:55,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:48:55,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 22:48:55,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-01-09 22:48:55,598 INFO L87 Difference]: Start difference. First operand 662 states and 902 transitions. Second operand has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 10 states have internal predecessors, (35), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:48:56,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:48:56,438 INFO L93 Difference]: Finished difference Result 857 states and 1170 transitions. [2025-01-09 22:48:56,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 22:48:56,439 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 10 states have internal predecessors, (35), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 42 [2025-01-09 22:48:56,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:48:56,442 INFO L225 Difference]: With dead ends: 857 [2025-01-09 22:48:56,442 INFO L226 Difference]: Without dead ends: 857 [2025-01-09 22:48:56,442 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2025-01-09 22:48:56,443 INFO L435 NwaCegarLoop]: 310 mSDtfsCounter, 432 mSDsluCounter, 1240 mSDsCounter, 0 mSdLazyCounter, 1158 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 1550 SdHoareTripleChecker+Invalid, 1313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 1158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 22:48:56,443 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 1550 Invalid, 1313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 1158 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 22:48:56,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 857 states. [2025-01-09 22:48:56,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 857 to 676. [2025-01-09 22:48:56,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 676 states, 457 states have (on average 1.4660831509846828) internal successors, (670), 551 states have internal predecessors, (670), 61 states have call successors, (61), 32 states have call predecessors, (61), 52 states have return successors, (198), 92 states have call predecessors, (198), 61 states have call successors, (198) [2025-01-09 22:48:56,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 929 transitions. [2025-01-09 22:48:56,459 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 929 transitions. Word has length 42 [2025-01-09 22:48:56,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:48:56,460 INFO L471 AbstractCegarLoop]: Abstraction has 676 states and 929 transitions. [2025-01-09 22:48:56,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 10 states have internal predecessors, (35), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:48:56,460 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 929 transitions. [2025-01-09 22:48:56,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-01-09 22:48:56,460 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:48:56,460 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:48:56,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 22:48:56,461 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting system_initializeErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2025-01-09 22:48:56,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:48:56,461 INFO L85 PathProgramCache]: Analyzing trace with hash -812476152, now seen corresponding path program 1 times [2025-01-09 22:48:56,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:48:56,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866648094] [2025-01-09 22:48:56,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:48:56,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:48:56,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-09 22:48:56,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-09 22:48:56,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:48:56,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:48:56,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:48:56,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:48:56,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866648094] [2025-01-09 22:48:56,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866648094] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:48:56,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:48:56,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:48:56,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744661556] [2025-01-09 22:48:56,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:48:56,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:48:56,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:48:56,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:48:56,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:48:56,522 INFO L87 Difference]: Start difference. First operand 676 states and 929 transitions. Second operand has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:48:56,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:48:56,646 INFO L93 Difference]: Finished difference Result 674 states and 925 transitions. [2025-01-09 22:48:56,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:48:56,646 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 44 [2025-01-09 22:48:56,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:48:56,649 INFO L225 Difference]: With dead ends: 674 [2025-01-09 22:48:56,649 INFO L226 Difference]: Without dead ends: 674 [2025-01-09 22:48:56,649 INFO L434 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 [2025-01-09 22:48:56,650 INFO L435 NwaCegarLoop]: 362 mSDtfsCounter, 5 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:48:56,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 582 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:48:56,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2025-01-09 22:48:56,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 674. [2025-01-09 22:48:56,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 674 states, 457 states have (on average 1.4573304157549234) internal successors, (666), 549 states have internal predecessors, (666), 61 states have call successors, (61), 32 states have call predecessors, (61), 52 states have return successors, (198), 92 states have call predecessors, (198), 61 states have call successors, (198) [2025-01-09 22:48:56,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 925 transitions. [2025-01-09 22:48:56,665 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 925 transitions. Word has length 44 [2025-01-09 22:48:56,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:48:56,666 INFO L471 AbstractCegarLoop]: Abstraction has 674 states and 925 transitions. [2025-01-09 22:48:56,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:48:56,666 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 925 transitions. [2025-01-09 22:48:56,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-01-09 22:48:56,666 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:48:56,666 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:48:56,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 22:48:56,666 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting system_initializeErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2025-01-09 22:48:56,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:48:56,666 INFO L85 PathProgramCache]: Analyzing trace with hash -812476151, now seen corresponding path program 1 times [2025-01-09 22:48:56,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:48:56,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533830342] [2025-01-09 22:48:56,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:48:56,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:48:56,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-09 22:48:56,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-09 22:48:56,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:48:56,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:48:56,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:48:56,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:48:56,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533830342] [2025-01-09 22:48:56,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533830342] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:48:56,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:48:56,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:48:56,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016476843] [2025-01-09 22:48:56,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:48:56,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:48:56,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:48:56,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:48:56,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:48:56,743 INFO L87 Difference]: Start difference. First operand 674 states and 925 transitions. Second operand has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:48:56,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:48:56,867 INFO L93 Difference]: Finished difference Result 672 states and 921 transitions. [2025-01-09 22:48:56,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:48:56,867 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 44 [2025-01-09 22:48:56,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:48:56,869 INFO L225 Difference]: With dead ends: 672 [2025-01-09 22:48:56,869 INFO L226 Difference]: Without dead ends: 672 [2025-01-09 22:48:56,869 INFO L434 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 [2025-01-09 22:48:56,870 INFO L435 NwaCegarLoop]: 362 mSDtfsCounter, 5 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:48:56,870 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 588 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:48:56,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2025-01-09 22:48:56,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 672. [2025-01-09 22:48:56,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 457 states have (on average 1.4485776805251642) internal successors, (662), 547 states have internal predecessors, (662), 61 states have call successors, (61), 32 states have call predecessors, (61), 52 states have return successors, (198), 92 states have call predecessors, (198), 61 states have call successors, (198) [2025-01-09 22:48:56,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 921 transitions. [2025-01-09 22:48:56,883 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 921 transitions. Word has length 44 [2025-01-09 22:48:56,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:48:56,883 INFO L471 AbstractCegarLoop]: Abstraction has 672 states and 921 transitions. [2025-01-09 22:48:56,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:48:56,883 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 921 transitions. [2025-01-09 22:48:56,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-01-09 22:48:56,883 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:48:56,883 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:48:56,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 22:48:56,884 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ASNullErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2025-01-09 22:48:56,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:48:56,884 INFO L85 PathProgramCache]: Analyzing trace with hash 148800592, now seen corresponding path program 1 times [2025-01-09 22:48:56,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:48:56,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190421428] [2025-01-09 22:48:56,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:48:56,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:48:56,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-01-09 22:48:56,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-01-09 22:48:56,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:48:56,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:48:57,122 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:48:57,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:48:57,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190421428] [2025-01-09 22:48:57,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190421428] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:48:57,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1957117620] [2025-01-09 22:48:57,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:48:57,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:48:57,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:48:57,125 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:48:57,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 22:48:57,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-01-09 22:48:57,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-01-09 22:48:57,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:48:57,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:48:57,268 INFO L256 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 22:48:57,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:48:57,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 22:48:57,374 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 [2025-01-09 22:48:57,405 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:48:57,406 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:48:57,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1957117620] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:48:57,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 22:48:57,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [14] total 19 [2025-01-09 22:48:57,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014871972] [2025-01-09 22:48:57,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:48:57,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 22:48:57,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:48:57,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 22:48:57,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2025-01-09 22:48:57,407 INFO L87 Difference]: Start difference. First operand 672 states and 921 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:48:57,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:48:57,780 INFO L93 Difference]: Finished difference Result 882 states and 1297 transitions. [2025-01-09 22:48:57,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 22:48:57,780 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 53 [2025-01-09 22:48:57,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:48:57,785 INFO L225 Difference]: With dead ends: 882 [2025-01-09 22:48:57,785 INFO L226 Difference]: Without dead ends: 878 [2025-01-09 22:48:57,786 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=519, Unknown=0, NotChecked=0, Total=600 [2025-01-09 22:48:57,786 INFO L435 NwaCegarLoop]: 393 mSDtfsCounter, 193 mSDsluCounter, 2100 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 2493 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:48:57,786 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 2493 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 22:48:57,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2025-01-09 22:48:57,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 833. [2025-01-09 22:48:57,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 833 states, 583 states have (on average 1.4168096054888508) internal successors, (826), 665 states have internal predecessors, (826), 77 states have call successors, (77), 40 states have call predecessors, (77), 71 states have return successors, (349), 127 states have call predecessors, (349), 77 states have call successors, (349) [2025-01-09 22:48:57,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 1252 transitions. [2025-01-09 22:48:57,811 INFO L78 Accepts]: Start accepts. Automaton has 833 states and 1252 transitions. Word has length 53 [2025-01-09 22:48:57,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:48:57,811 INFO L471 AbstractCegarLoop]: Abstraction has 833 states and 1252 transitions. [2025-01-09 22:48:57,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:48:57,811 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 1252 transitions. [2025-01-09 22:48:57,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-01-09 22:48:57,812 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:48:57,812 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:48:57,823 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 22:48:58,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-01-09 22:48:58,013 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2025-01-09 22:48:58,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:48:58,013 INFO L85 PathProgramCache]: Analyzing trace with hash 315030120, now seen corresponding path program 1 times [2025-01-09 22:48:58,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:48:58,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878632965] [2025-01-09 22:48:58,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:48:58,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:48:58,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-01-09 22:48:58,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-01-09 22:48:58,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:48:58,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:48:58,118 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:48:58,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:48:58,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878632965] [2025-01-09 22:48:58,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878632965] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:48:58,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:48:58,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 22:48:58,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418191596] [2025-01-09 22:48:58,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:48:58,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 22:48:58,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:48:58,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 22:48:58,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:48:58,120 INFO L87 Difference]: Start difference. First operand 833 states and 1252 transitions. Second operand has 7 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:48:58,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:48:58,563 INFO L93 Difference]: Finished difference Result 1028 states and 1639 transitions. [2025-01-09 22:48:58,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 22:48:58,563 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 54 [2025-01-09 22:48:58,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:48:58,568 INFO L225 Difference]: With dead ends: 1028 [2025-01-09 22:48:58,568 INFO L226 Difference]: Without dead ends: 1028 [2025-01-09 22:48:58,568 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:48:58,568 INFO L435 NwaCegarLoop]: 341 mSDtfsCounter, 182 mSDsluCounter, 1025 mSDsCounter, 0 mSdLazyCounter, 838 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 1366 SdHoareTripleChecker+Invalid, 858 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 838 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 22:48:58,568 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 1366 Invalid, 858 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 838 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 22:48:58,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1028 states. [2025-01-09 22:48:58,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1028 to 941. [2025-01-09 22:48:58,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 941 states, 671 states have (on average 1.4157973174366616) internal successors, (950), 759 states have internal predecessors, (950), 89 states have call successors, (89), 50 states have call predecessors, (89), 79 states have return successors, (430), 131 states have call predecessors, (430), 89 states have call successors, (430) [2025-01-09 22:48:58,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 1469 transitions. [2025-01-09 22:48:58,596 INFO L78 Accepts]: Start accepts. Automaton has 941 states and 1469 transitions. Word has length 54 [2025-01-09 22:48:58,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:48:58,596 INFO L471 AbstractCegarLoop]: Abstraction has 941 states and 1469 transitions. [2025-01-09 22:48:58,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:48:58,596 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 1469 transitions. [2025-01-09 22:48:58,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-01-09 22:48:58,597 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:48:58,597 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:48:58,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 22:48:58,597 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2025-01-09 22:48:58,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:48:58,597 INFO L85 PathProgramCache]: Analyzing trace with hash 315030121, now seen corresponding path program 1 times [2025-01-09 22:48:58,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:48:58,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816664527] [2025-01-09 22:48:58,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:48:58,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:48:58,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-01-09 22:48:58,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-01-09 22:48:58,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:48:58,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:48:58,749 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:48:58,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:48:58,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816664527] [2025-01-09 22:48:58,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816664527] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:48:58,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:48:58,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 22:48:58,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748130259] [2025-01-09 22:48:58,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:48:58,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 22:48:58,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:48:58,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 22:48:58,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:48:58,751 INFO L87 Difference]: Start difference. First operand 941 states and 1469 transitions. Second operand has 7 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:48:59,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:48:59,127 INFO L93 Difference]: Finished difference Result 1011 states and 1592 transitions. [2025-01-09 22:48:59,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 22:48:59,128 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 54 [2025-01-09 22:48:59,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:48:59,132 INFO L225 Difference]: With dead ends: 1011 [2025-01-09 22:48:59,133 INFO L226 Difference]: Without dead ends: 1011 [2025-01-09 22:48:59,133 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:48:59,133 INFO L435 NwaCegarLoop]: 360 mSDtfsCounter, 53 mSDsluCounter, 1117 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 1477 SdHoareTripleChecker+Invalid, 753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:48:59,133 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 1477 Invalid, 753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 751 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 22:48:59,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2025-01-09 22:48:59,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 989. [2025-01-09 22:48:59,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 989 states, 713 states have (on average 1.4109396914446002) internal successors, (1006), 801 states have internal predecessors, (1006), 91 states have call successors, (91), 54 states have call predecessors, (91), 83 states have return successors, (438), 133 states have call predecessors, (438), 91 states have call successors, (438) [2025-01-09 22:48:59,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 989 states and 1535 transitions. [2025-01-09 22:48:59,159 INFO L78 Accepts]: Start accepts. Automaton has 989 states and 1535 transitions. Word has length 54 [2025-01-09 22:48:59,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:48:59,159 INFO L471 AbstractCegarLoop]: Abstraction has 989 states and 1535 transitions. [2025-01-09 22:48:59,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:48:59,160 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 1535 transitions. [2025-01-09 22:48:59,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-01-09 22:48:59,160 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:48:59,160 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:48:59,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 22:48:59,160 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ASIdleErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2025-01-09 22:48:59,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:48:59,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1173721710, now seen corresponding path program 1 times [2025-01-09 22:48:59,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:48:59,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951439395] [2025-01-09 22:48:59,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:48:59,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:48:59,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-09 22:48:59,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-09 22:48:59,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:48:59,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:48:59,306 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:48:59,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:48:59,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951439395] [2025-01-09 22:48:59,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951439395] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:48:59,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:48:59,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 22:48:59,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912636028] [2025-01-09 22:48:59,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:48:59,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 22:48:59,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:48:59,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 22:48:59,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:48:59,308 INFO L87 Difference]: Start difference. First operand 989 states and 1535 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:48:59,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:48:59,611 INFO L93 Difference]: Finished difference Result 1115 states and 1764 transitions. [2025-01-09 22:48:59,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 22:48:59,612 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 55 [2025-01-09 22:48:59,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:48:59,617 INFO L225 Difference]: With dead ends: 1115 [2025-01-09 22:48:59,617 INFO L226 Difference]: Without dead ends: 1115 [2025-01-09 22:48:59,617 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-01-09 22:48:59,618 INFO L435 NwaCegarLoop]: 417 mSDtfsCounter, 116 mSDsluCounter, 2223 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 2640 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:48:59,618 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 2640 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 22:48:59,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1115 states. [2025-01-09 22:48:59,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1115 to 1093. [2025-01-09 22:48:59,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1093 states, 793 states have (on average 1.3682219419924337) internal successors, (1085), 873 states have internal predecessors, (1085), 95 states have call successors, (95), 58 states have call predecessors, (95), 103 states have return successors, (571), 161 states have call predecessors, (571), 95 states have call successors, (571) [2025-01-09 22:48:59,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1093 states to 1093 states and 1751 transitions. [2025-01-09 22:48:59,645 INFO L78 Accepts]: Start accepts. Automaton has 1093 states and 1751 transitions. Word has length 55 [2025-01-09 22:48:59,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:48:59,646 INFO L471 AbstractCegarLoop]: Abstraction has 1093 states and 1751 transitions. [2025-01-09 22:48:59,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:48:59,646 INFO L276 IsEmpty]: Start isEmpty. Operand 1093 states and 1751 transitions. [2025-01-09 22:48:59,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-09 22:48:59,646 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:48:59,646 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:48:59,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 22:48:59,647 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2025-01-09 22:48:59,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:48:59,647 INFO L85 PathProgramCache]: Analyzing trace with hash -337077908, now seen corresponding path program 1 times [2025-01-09 22:48:59,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:48:59,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133596015] [2025-01-09 22:48:59,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:48:59,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:48:59,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 22:48:59,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 22:48:59,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:48:59,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:48:59,713 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 22:48:59,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:48:59,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133596015] [2025-01-09 22:48:59,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133596015] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:48:59,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:48:59,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:48:59,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067352189] [2025-01-09 22:48:59,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:48:59,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:48:59,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:48:59,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:48:59,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:48:59,714 INFO L87 Difference]: Start difference. First operand 1093 states and 1751 transitions. Second operand has 4 states, 3 states have (on average 15.0) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 22:48:59,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:48:59,884 INFO L93 Difference]: Finished difference Result 1091 states and 1749 transitions. [2025-01-09 22:48:59,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:48:59,886 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 15.0) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 62 [2025-01-09 22:48:59,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:48:59,891 INFO L225 Difference]: With dead ends: 1091 [2025-01-09 22:48:59,891 INFO L226 Difference]: Without dead ends: 1091 [2025-01-09 22:48:59,891 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:48:59,892 INFO L435 NwaCegarLoop]: 359 mSDtfsCounter, 2 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 796 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:48:59,893 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 796 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:48:59,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1091 states. [2025-01-09 22:48:59,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1091 to 1091. [2025-01-09 22:48:59,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1091 states, 793 states have (on average 1.3656998738965953) internal successors, (1083), 871 states have internal predecessors, (1083), 95 states have call successors, (95), 58 states have call predecessors, (95), 103 states have return successors, (571), 161 states have call predecessors, (571), 95 states have call successors, (571) [2025-01-09 22:48:59,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1091 states to 1091 states and 1749 transitions. [2025-01-09 22:48:59,918 INFO L78 Accepts]: Start accepts. Automaton has 1091 states and 1749 transitions. Word has length 62 [2025-01-09 22:48:59,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:48:59,918 INFO L471 AbstractCegarLoop]: Abstraction has 1091 states and 1749 transitions. [2025-01-09 22:48:59,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 15.0) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 22:48:59,919 INFO L276 IsEmpty]: Start isEmpty. Operand 1091 states and 1749 transitions. [2025-01-09 22:48:59,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-09 22:48:59,921 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:48:59,921 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:48:59,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 22:48:59,921 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ASStartErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2025-01-09 22:48:59,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:48:59,922 INFO L85 PathProgramCache]: Analyzing trace with hash -337077907, now seen corresponding path program 1 times [2025-01-09 22:48:59,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:48:59,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669544603] [2025-01-09 22:48:59,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:48:59,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:48:59,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 22:48:59,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 22:48:59,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:48:59,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:49:00,151 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 22:49:00,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:49:00,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669544603] [2025-01-09 22:49:00,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669544603] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:49:00,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:49:00,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 22:49:00,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660735259] [2025-01-09 22:49:00,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:49:00,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 22:49:00,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:49:00,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 22:49:00,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:49:00,152 INFO L87 Difference]: Start difference. First operand 1091 states and 1749 transitions. Second operand has 9 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 4 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 22:49:00,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:49:00,299 INFO L93 Difference]: Finished difference Result 1348 states and 2221 transitions. [2025-01-09 22:49:00,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 22:49:00,299 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 4 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 62 [2025-01-09 22:49:00,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:49:00,305 INFO L225 Difference]: With dead ends: 1348 [2025-01-09 22:49:00,305 INFO L226 Difference]: Without dead ends: 1348 [2025-01-09 22:49:00,306 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-01-09 22:49:00,306 INFO L435 NwaCegarLoop]: 381 mSDtfsCounter, 92 mSDsluCounter, 2506 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 2887 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:49:00,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 2887 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:49:00,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1348 states. [2025-01-09 22:49:00,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1348 to 1284. [2025-01-09 22:49:00,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1284 states, 958 states have (on average 1.350730688935282) internal successors, (1294), 1037 states have internal predecessors, (1294), 107 states have call successors, (107), 77 states have call predecessors, (107), 119 states have return successors, (644), 169 states have call predecessors, (644), 107 states have call successors, (644) [2025-01-09 22:49:00,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1284 states to 1284 states and 2045 transitions. [2025-01-09 22:49:00,342 INFO L78 Accepts]: Start accepts. Automaton has 1284 states and 2045 transitions. Word has length 62 [2025-01-09 22:49:00,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:49:00,342 INFO L471 AbstractCegarLoop]: Abstraction has 1284 states and 2045 transitions. [2025-01-09 22:49:00,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 4 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 22:49:00,342 INFO L276 IsEmpty]: Start isEmpty. Operand 1284 states and 2045 transitions. [2025-01-09 22:49:00,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-09 22:49:00,342 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:49:00,342 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:49:00,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 22:49:00,343 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ASStartErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2025-01-09 22:49:00,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:49:00,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1986376205, now seen corresponding path program 1 times [2025-01-09 22:49:00,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:49:00,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011778151] [2025-01-09 22:49:00,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:49:00,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:49:00,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 22:49:00,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 22:49:00,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:49:00,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:49:00,952 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:49:00,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:49:00,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011778151] [2025-01-09 22:49:00,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011778151] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:49:00,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1337094088] [2025-01-09 22:49:00,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:49:00,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:49:00,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:49:00,955 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:49:00,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 22:49:01,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 22:49:01,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 22:49:01,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:49:01,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:49:01,112 INFO L256 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 69 conjuncts are in the unsatisfiable core [2025-01-09 22:49:01,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:49:01,124 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 10 treesize of output 8 [2025-01-09 22:49:01,133 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 1 [2025-01-09 22:49:01,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2025-01-09 22:49:01,187 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-09 22:49:01,187 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 82 treesize of output 75 [2025-01-09 22:49:01,192 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 31 treesize of output 21 [2025-01-09 22:49:01,196 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 42 treesize of output 25 [2025-01-09 22:49:01,226 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 47 treesize of output 29 [2025-01-09 22:49:01,231 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 30 treesize of output 25 [2025-01-09 22:49:01,239 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 37 treesize of output 25 [2025-01-09 22:49:01,251 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 29 [2025-01-09 22:49:01,255 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 30 treesize of output 25 [2025-01-09 22:49:01,259 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 41 treesize of output 25 [2025-01-09 22:49:01,274 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 29 [2025-01-09 22:49:01,279 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 30 treesize of output 25 [2025-01-09 22:49:01,283 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 41 treesize of output 25 [2025-01-09 22:49:01,333 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 32 treesize of output 20 [2025-01-09 22:49:01,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2025-01-09 22:49:01,339 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 9 treesize of output 3 [2025-01-09 22:49:01,401 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 47 treesize of output 29 [2025-01-09 22:49:01,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2025-01-09 22:49:01,410 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 37 treesize of output 25 [2025-01-09 22:49:01,446 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 41 treesize of output 23 [2025-01-09 22:49:01,450 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 25 treesize of output 13 [2025-01-09 22:49:01,456 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:49:01,456 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:49:01,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1337094088] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:49:01,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 22:49:01,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [12] total 17 [2025-01-09 22:49:01,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705564165] [2025-01-09 22:49:01,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:49:01,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 22:49:01,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:49:01,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 22:49:01,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2025-01-09 22:49:01,458 INFO L87 Difference]: Start difference. First operand 1284 states and 2045 transitions. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 3 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:49:01,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:49:01,932 INFO L93 Difference]: Finished difference Result 1281 states and 2029 transitions. [2025-01-09 22:49:01,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 22:49:01,933 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 3 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 62 [2025-01-09 22:49:01,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:49:01,937 INFO L225 Difference]: With dead ends: 1281 [2025-01-09 22:49:01,937 INFO L226 Difference]: Without dead ends: 1281 [2025-01-09 22:49:01,938 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2025-01-09 22:49:01,938 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 444 mSDsluCounter, 1342 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 1667 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 22:49:01,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [444 Valid, 1667 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 509 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 22:49:01,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1281 states. [2025-01-09 22:49:01,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1281 to 1265. [2025-01-09 22:49:01,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1265 states, 941 states have (on average 1.3528161530286928) internal successors, (1273), 1020 states have internal predecessors, (1273), 106 states have call successors, (106), 76 states have call predecessors, (106), 118 states have return successors, (635), 168 states have call predecessors, (635), 106 states have call successors, (635) [2025-01-09 22:49:01,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1265 states to 1265 states and 2014 transitions. [2025-01-09 22:49:01,966 INFO L78 Accepts]: Start accepts. Automaton has 1265 states and 2014 transitions. Word has length 62 [2025-01-09 22:49:01,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:49:01,966 INFO L471 AbstractCegarLoop]: Abstraction has 1265 states and 2014 transitions. [2025-01-09 22:49:01,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 3 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:49:01,967 INFO L276 IsEmpty]: Start isEmpty. Operand 1265 states and 2014 transitions. [2025-01-09 22:49:01,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-09 22:49:01,967 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:49:01,967 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:49:01,974 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 22:49:02,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:49:02,171 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ASStartErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2025-01-09 22:49:02,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:49:02,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1411772222, now seen corresponding path program 1 times [2025-01-09 22:49:02,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:49:02,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579300243] [2025-01-09 22:49:02,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:49:02,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:49:02,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 22:49:02,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 22:49:02,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:49:02,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:49:02,234 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 22:49:02,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:49:02,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579300243] [2025-01-09 22:49:02,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579300243] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:49:02,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:49:02,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:49:02,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584206516] [2025-01-09 22:49:02,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:49:02,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:49:02,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:49:02,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:49:02,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:49:02,235 INFO L87 Difference]: Start difference. First operand 1265 states and 2014 transitions. Second operand has 4 states, 3 states have (on average 15.333333333333334) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 22:49:02,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:49:02,411 INFO L93 Difference]: Finished difference Result 1263 states and 2012 transitions. [2025-01-09 22:49:02,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:49:02,411 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 15.333333333333334) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 63 [2025-01-09 22:49:02,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:49:02,416 INFO L225 Difference]: With dead ends: 1263 [2025-01-09 22:49:02,416 INFO L226 Difference]: Without dead ends: 1263 [2025-01-09 22:49:02,416 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:49:02,416 INFO L435 NwaCegarLoop]: 357 mSDtfsCounter, 2 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 794 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:49:02,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 794 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:49:02,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1263 states. [2025-01-09 22:49:02,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1263 to 1263. [2025-01-09 22:49:02,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1263 states, 941 states have (on average 1.350690754516472) internal successors, (1271), 1018 states have internal predecessors, (1271), 106 states have call successors, (106), 76 states have call predecessors, (106), 118 states have return successors, (635), 168 states have call predecessors, (635), 106 states have call successors, (635) [2025-01-09 22:49:02,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1263 states to 1263 states and 2012 transitions. [2025-01-09 22:49:02,446 INFO L78 Accepts]: Start accepts. Automaton has 1263 states and 2012 transitions. Word has length 63 [2025-01-09 22:49:02,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:49:02,446 INFO L471 AbstractCegarLoop]: Abstraction has 1263 states and 2012 transitions. [2025-01-09 22:49:02,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 15.333333333333334) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 22:49:02,447 INFO L276 IsEmpty]: Start isEmpty. Operand 1263 states and 2012 transitions. [2025-01-09 22:49:02,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-09 22:49:02,447 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:49:02,447 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:49:02,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 22:49:02,447 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ASStartErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2025-01-09 22:49:02,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:49:02,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1411772221, now seen corresponding path program 1 times [2025-01-09 22:49:02,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:49:02,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890479450] [2025-01-09 22:49:02,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:49:02,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:49:02,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 22:49:02,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 22:49:02,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:49:02,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 22:49:02,481 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 22:49:02,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 22:49:02,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 22:49:02,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:49:02,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 22:49:02,528 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 22:49:02,528 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 22:49:02,528 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ASStartErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (157 of 158 remaining) [2025-01-09 22:49:02,529 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (156 of 158 remaining) [2025-01-09 22:49:02,530 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (155 of 158 remaining) [2025-01-09 22:49:02,530 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (154 of 158 remaining) [2025-01-09 22:49:02,530 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (153 of 158 remaining) [2025-01-09 22:49:02,530 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (152 of 158 remaining) [2025-01-09 22:49:02,530 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (151 of 158 remaining) [2025-01-09 22:49:02,530 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (150 of 158 remaining) [2025-01-09 22:49:02,530 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (149 of 158 remaining) [2025-01-09 22:49:02,530 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (148 of 158 remaining) [2025-01-09 22:49:02,530 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (147 of 158 remaining) [2025-01-09 22:49:02,530 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (146 of 158 remaining) [2025-01-09 22:49:02,530 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (145 of 158 remaining) [2025-01-09 22:49:02,530 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (144 of 158 remaining) [2025-01-09 22:49:02,530 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (143 of 158 remaining) [2025-01-09 22:49:02,530 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (142 of 158 remaining) [2025-01-09 22:49:02,530 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (141 of 158 remaining) [2025-01-09 22:49:02,530 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (140 of 158 remaining) [2025-01-09 22:49:02,530 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (139 of 158 remaining) [2025-01-09 22:49:02,531 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (138 of 158 remaining) [2025-01-09 22:49:02,531 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (137 of 158 remaining) [2025-01-09 22:49:02,531 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (136 of 158 remaining) [2025-01-09 22:49:02,531 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (135 of 158 remaining) [2025-01-09 22:49:02,532 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (134 of 158 remaining) [2025-01-09 22:49:02,532 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (133 of 158 remaining) [2025-01-09 22:49:02,532 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (132 of 158 remaining) [2025-01-09 22:49:02,532 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (131 of 158 remaining) [2025-01-09 22:49:02,532 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (130 of 158 remaining) [2025-01-09 22:49:02,532 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (129 of 158 remaining) [2025-01-09 22:49:02,532 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (128 of 158 remaining) [2025-01-09 22:49:02,532 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (127 of 158 remaining) [2025-01-09 22:49:02,532 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (126 of 158 remaining) [2025-01-09 22:49:02,532 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (125 of 158 remaining) [2025-01-09 22:49:02,532 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (124 of 158 remaining) [2025-01-09 22:49:02,532 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location status_updateErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (123 of 158 remaining) [2025-01-09 22:49:02,532 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location status_updateErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (122 of 158 remaining) [2025-01-09 22:49:02,532 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location status_updateErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (121 of 158 remaining) [2025-01-09 22:49:02,532 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location status_updateErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (120 of 158 remaining) [2025-01-09 22:49:02,532 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (119 of 158 remaining) [2025-01-09 22:49:02,532 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (118 of 158 remaining) [2025-01-09 22:49:02,532 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (117 of 158 remaining) [2025-01-09 22:49:02,532 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (116 of 158 remaining) [2025-01-09 22:49:02,532 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (115 of 158 remaining) [2025-01-09 22:49:02,532 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (114 of 158 remaining) [2025-01-09 22:49:02,532 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (113 of 158 remaining) [2025-01-09 22:49:02,532 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (112 of 158 remaining) [2025-01-09 22:49:02,532 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (111 of 158 remaining) [2025-01-09 22:49:02,532 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (110 of 158 remaining) [2025-01-09 22:49:02,532 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (109 of 158 remaining) [2025-01-09 22:49:02,532 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (108 of 158 remaining) [2025-01-09 22:49:02,532 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (107 of 158 remaining) [2025-01-09 22:49:02,532 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (106 of 158 remaining) [2025-01-09 22:49:02,532 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (105 of 158 remaining) [2025-01-09 22:49:02,532 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (104 of 158 remaining) [2025-01-09 22:49:02,532 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (103 of 158 remaining) [2025-01-09 22:49:02,533 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (102 of 158 remaining) [2025-01-09 22:49:02,533 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (101 of 158 remaining) [2025-01-09 22:49:02,533 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (100 of 158 remaining) [2025-01-09 22:49:02,533 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (99 of 158 remaining) [2025-01-09 22:49:02,533 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (98 of 158 remaining) [2025-01-09 22:49:02,533 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (97 of 158 remaining) [2025-01-09 22:49:02,533 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (96 of 158 remaining) [2025-01-09 22:49:02,533 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (95 of 158 remaining) [2025-01-09 22:49:02,533 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (94 of 158 remaining) [2025-01-09 22:49:02,533 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (93 of 158 remaining) [2025-01-09 22:49:02,533 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (92 of 158 remaining) [2025-01-09 22:49:02,533 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (91 of 158 remaining) [2025-01-09 22:49:02,533 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (90 of 158 remaining) [2025-01-09 22:49:02,533 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 158 remaining) [2025-01-09 22:49:02,533 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 158 remaining) [2025-01-09 22:49:02,533 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 158 remaining) [2025-01-09 22:49:02,533 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 158 remaining) [2025-01-09 22:49:02,533 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 158 remaining) [2025-01-09 22:49:02,533 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 158 remaining) [2025-01-09 22:49:02,533 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 158 remaining) [2025-01-09 22:49:02,533 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 158 remaining) [2025-01-09 22:49:02,533 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 158 remaining) [2025-01-09 22:49:02,533 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 158 remaining) [2025-01-09 22:49:02,533 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 158 remaining) [2025-01-09 22:49:02,533 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 158 remaining) [2025-01-09 22:49:02,533 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 158 remaining) [2025-01-09 22:49:02,533 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 158 remaining) [2025-01-09 22:49:02,533 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 158 remaining) [2025-01-09 22:49:02,533 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 158 remaining) [2025-01-09 22:49:02,533 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 158 remaining) [2025-01-09 22:49:02,533 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 158 remaining) [2025-01-09 22:49:02,534 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 158 remaining) [2025-01-09 22:49:02,534 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 158 remaining) [2025-01-09 22:49:02,534 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 158 remaining) [2025-01-09 22:49:02,534 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 158 remaining) [2025-01-09 22:49:02,534 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 158 remaining) [2025-01-09 22:49:02,534 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 158 remaining) [2025-01-09 22:49:02,534 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 158 remaining) [2025-01-09 22:49:02,534 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 158 remaining) [2025-01-09 22:49:02,534 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 158 remaining) [2025-01-09 22:49:02,534 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 158 remaining) [2025-01-09 22:49:02,534 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 158 remaining) [2025-01-09 22:49:02,534 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 158 remaining) [2025-01-09 22:49:02,534 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 158 remaining) [2025-01-09 22:49:02,534 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 158 remaining) [2025-01-09 22:49:02,534 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 158 remaining) [2025-01-09 22:49:02,534 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 158 remaining) [2025-01-09 22:49:02,534 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr64REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 158 remaining) [2025-01-09 22:49:02,534 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 158 remaining) [2025-01-09 22:49:02,534 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 158 remaining) [2025-01-09 22:49:02,534 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 158 remaining) [2025-01-09 22:49:02,534 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr68REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 158 remaining) [2025-01-09 22:49:02,534 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr69REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 158 remaining) [2025-01-09 22:49:02,534 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 158 remaining) [2025-01-09 22:49:02,534 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 158 remaining) [2025-01-09 22:49:02,534 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 158 remaining) [2025-01-09 22:49:02,534 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 158 remaining) [2025-01-09 22:49:02,534 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 158 remaining) [2025-01-09 22:49:02,534 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 158 remaining) [2025-01-09 22:49:02,534 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 158 remaining) [2025-01-09 22:49:02,534 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 158 remaining) [2025-01-09 22:49:02,534 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 158 remaining) [2025-01-09 22:49:02,534 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 158 remaining) [2025-01-09 22:49:02,534 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 158 remaining) [2025-01-09 22:49:02,534 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 158 remaining) [2025-01-09 22:49:02,535 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 158 remaining) [2025-01-09 22:49:02,535 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 158 remaining) [2025-01-09 22:49:02,535 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStopErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 158 remaining) [2025-01-09 22:49:02,535 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStopErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 158 remaining) [2025-01-09 22:49:02,535 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStopErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (33 of 158 remaining) [2025-01-09 22:49:02,535 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStopErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE (32 of 158 remaining) [2025-01-09 22:49:02,535 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASNullErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 158 remaining) [2025-01-09 22:49:02,535 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASNullErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 158 remaining) [2025-01-09 22:49:02,535 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 158 remaining) [2025-01-09 22:49:02,535 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 158 remaining) [2025-01-09 22:49:02,535 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 158 remaining) [2025-01-09 22:49:02,535 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 158 remaining) [2025-01-09 22:49:02,535 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 158 remaining) [2025-01-09 22:49:02,535 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 158 remaining) [2025-01-09 22:49:02,535 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 158 remaining) [2025-01-09 22:49:02,535 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 158 remaining) [2025-01-09 22:49:02,535 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 158 remaining) [2025-01-09 22:49:02,535 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 158 remaining) [2025-01-09 22:49:02,535 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 158 remaining) [2025-01-09 22:49:02,535 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 158 remaining) [2025-01-09 22:49:02,535 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr12ASSERT_VIOLATIONMEMORY_LEAK (17 of 158 remaining) [2025-01-09 22:49:02,535 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 158 remaining) [2025-01-09 22:49:02,535 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 158 remaining) [2025-01-09 22:49:02,535 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 158 remaining) [2025-01-09 22:49:02,538 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 158 remaining) [2025-01-09 22:49:02,538 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 158 remaining) [2025-01-09 22:49:02,538 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 158 remaining) [2025-01-09 22:49:02,538 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 158 remaining) [2025-01-09 22:49:02,538 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 158 remaining) [2025-01-09 22:49:02,538 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 158 remaining) [2025-01-09 22:49:02,538 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 158 remaining) [2025-01-09 22:49:02,538 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 158 remaining) [2025-01-09 22:49:02,539 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 158 remaining) [2025-01-09 22:49:02,539 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 158 remaining) [2025-01-09 22:49:02,539 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 158 remaining) [2025-01-09 22:49:02,539 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 158 remaining) [2025-01-09 22:49:02,539 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 158 remaining) [2025-01-09 22:49:02,539 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK (0 of 158 remaining) [2025-01-09 22:49:02,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 22:49:02,541 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:49:02,574 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 22:49:02,578 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 10:49:02 BoogieIcfgContainer [2025-01-09 22:49:02,578 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 22:49:02,578 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 22:49:02,578 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 22:49:02,578 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 22:49:02,590 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:48:47" (3/4) ... [2025-01-09 22:49:02,591 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-01-09 22:49:02,622 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 16. [2025-01-09 22:49:02,660 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 22:49:02,660 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 22:49:02,660 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 22:49:02,664 INFO L158 Benchmark]: Toolchain (without parser) took 16975.84ms. Allocated memory was 201.3MB in the beginning and 444.6MB in the end (delta: 243.3MB). Free memory was 157.5MB in the beginning and 394.6MB in the end (delta: -237.1MB). Peak memory consumption was 204.7MB. Max. memory is 16.1GB. [2025-01-09 22:49:02,664 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 201.3MB. Free memory is still 116.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 22:49:02,664 INFO L158 Benchmark]: CACSL2BoogieTranslator took 447.88ms. Allocated memory is still 201.3MB. Free memory was 157.5MB in the beginning and 132.2MB in the end (delta: 25.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 22:49:02,664 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.09ms. Allocated memory is still 201.3MB. Free memory was 132.2MB in the beginning and 129.5MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 22:49:02,664 INFO L158 Benchmark]: Boogie Preprocessor took 64.25ms. Allocated memory is still 201.3MB. Free memory was 129.5MB in the beginning and 124.9MB in the end (delta: 4.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 22:49:02,664 INFO L158 Benchmark]: RCFGBuilder took 840.64ms. Allocated memory is still 201.3MB. Free memory was 124.9MB in the beginning and 64.7MB in the end (delta: 60.2MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-01-09 22:49:02,664 INFO L158 Benchmark]: TraceAbstraction took 15500.31ms. Allocated memory was 201.3MB in the beginning and 352.3MB in the end (delta: 151.0MB). Free memory was 64.3MB in the beginning and 108.2MB in the end (delta: -43.9MB). Peak memory consumption was 104.0MB. Max. memory is 16.1GB. [2025-01-09 22:49:02,664 INFO L158 Benchmark]: Witness Printer took 82.04ms. Allocated memory was 352.3MB in the beginning and 444.6MB in the end (delta: 92.3MB). Free memory was 108.2MB in the beginning and 394.6MB in the end (delta: -286.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 22:49:02,665 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28ms. Allocated memory is still 201.3MB. Free memory is still 116.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 447.88ms. Allocated memory is still 201.3MB. Free memory was 157.5MB in the beginning and 132.2MB in the end (delta: 25.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.09ms. Allocated memory is still 201.3MB. Free memory was 132.2MB in the beginning and 129.5MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 64.25ms. Allocated memory is still 201.3MB. Free memory was 129.5MB in the beginning and 124.9MB in the end (delta: 4.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 840.64ms. Allocated memory is still 201.3MB. Free memory was 124.9MB in the beginning and 64.7MB in the end (delta: 60.2MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * TraceAbstraction took 15500.31ms. Allocated memory was 201.3MB in the beginning and 352.3MB in the end (delta: 151.0MB). Free memory was 64.3MB in the beginning and 108.2MB in the end (delta: -43.9MB). Peak memory consumption was 104.0MB. Max. memory is 16.1GB. * Witness Printer took 82.04ms. Allocated memory was 352.3MB in the beginning and 444.6MB in the end (delta: 92.3MB). Free memory was 108.2MB in the beginning and 394.6MB in the end (delta: -286.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: -1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L779] user_t *user; VAL [user={0:0}] [L975] user = malloc(sizeof(user_t)) [L976] CALL user_initialize() [L966] EXPR, FCALL calloc(1, sizeof(info_t)) VAL [user={-1:0}] [L966] user->info = calloc(1, sizeof(info_t)) VAL [user={-1:0}] [L967] user->message.id = 11 VAL [user={-1:0}] [L968] EXPR user->info VAL [user={-1:0}] [L968] user->info->is_valid = 0 VAL [user={-1:0}] [L969] user->status = AS_NULL VAL [user={-1:0}] [L970] user->user_id = 11 VAL [user={-1:0}] [L971] user->timeout = 3 VAL [user={-1:0}] [L976] RET user_initialize() [L977] event_t e = {0}; [L977] event_t e = {0}; [L977] event_t e = {0}; [L977] event_t e = {0}; VAL [user={-1:0}] [L978] e.primitive = _EVENT_START VAL [user={-1:0}] [L979] CALL event_precess(&e) VAL [\old(e)={10:0}, user={-1:0}] [L943] EXPR user->status VAL [\old(e)={10:0}, e={10:0}, user={-1:0}] [L943] sys_state_t status = user->status; [L944] int rc = -1; VAL [\old(e)={10:0}, e={10:0}, rc=-1, status=1, user={-1:0}] [L945] COND TRUE status < AS_STATE_MAX [L947] case AS_NULL: VAL [\old(e)={10:0}, e={10:0}, rc=-1, status=1, user={-1:0}] [L948] CALL ASNull(e) VAL [\old(e)={10:0}, user={-1:0}] [L838] EXPR e->primitive VAL [\old(e)={10:0}, user={-1:0}] [L838] e_primitive_t primitive = e->primitive; [L839] COND TRUE primitive == _EVENT_START VAL [\old(e)={10:0}, user={-1:0}] [L840] CALL status_update(AS_START) VAL [\old(status)=2, user={-1:0}] [L814] COND TRUE status < AS_STATE_MAX VAL [\old(status)=2, status=2, user={-1:0}] [L815] EXPR user->status VAL [\old(status)=2, status=2, user={-1:0}] [L815] COND TRUE user->status != status [L816] user->status = status VAL [\old(status)=2, user={-1:0}] [L817] return 10; VAL [\old(status)=2, \result=10, user={-1:0}] [L840] RET status_update(AS_START) VAL [\old(e)={10:0}, user={-1:0}] [L841] CALL system_initialize() VAL [user={-1:0}] [L829] event_t e = {0}; [L829] event_t e = {0}; [L829] event_t e = {0}; [L829] event_t e = {0}; VAL [e={9:0}, user={-1:0}] [L830] EXPR user->info VAL [e={9:0}, user={-1:0}] [L830] EXPR user->info->is_valid VAL [e={9:0}, user={-1:0}] [L830] COND TRUE !user->info->is_valid [L831] e.primitive = _EVENT_CLOSE VAL [e={9:0}, user={-1:0}] [L835] CALL event_precess(&e) VAL [\old(e)={9:0}, user={-1:0}] [L943] EXPR user->status VAL [\old(e)={9:0}, e={9:0}, user={-1:0}] [L943] sys_state_t status = user->status; [L944] int rc = -1; VAL [\old(e)={9:0}, e={9:0}, rc=-1, status=2, user={-1:0}] [L945] COND TRUE status < AS_STATE_MAX [L947] case AS_NULL: [L950] case AS_START: VAL [\old(e)={9:0}, e={9:0}, rc=-1, status=2, user={-1:0}] [L951] CALL ASStart(e) VAL [\old(e)={9:0}, user={-1:0}] [L881] EXPR e->primitive VAL [\old(e)={9:0}, e={9:0}, user={-1:0}] [L881] e_primitive_t primitive = e->primitive; [L882] int rc = -1; [L884] case _EVENT_OPEN: VAL [\old(e)={9:0}, e={9:0}, primitive=3, rc=-1, user={-1:0}] [L884] case _EVENT_OPEN: [L898] case _EVENT_CLOSE: VAL [\old(e)={9:0}, e={9:0}, rc=-1, user={-1:0}] [L898] case _EVENT_CLOSE: [L899] message_t *message = &user->message; [L900] EXPR, FCALL calloc(0, sizeof(*message)) VAL [\old(e)={9:0}, e={9:0}, rc=-1, user={-1:0}] [L900] message = calloc(0, sizeof(*message)) [L901] message->id = 3 - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 686]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 973]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 387 locations, 158 error locations. Started 1 CEGAR loops. OverallTime: 15.4s, OverallIterations: 26, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4407 SdHoareTripleChecker+Valid, 7.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4387 mSDsluCounter, 33258 SdHoareTripleChecker+Invalid, 6.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 24386 mSDsCounter, 958 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11961 IncrementalHoareTripleChecker+Invalid, 12919 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 958 mSolverCounterUnsat, 8872 mSDtfsCounter, 11961 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 365 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1284occurred in iteration=23, InterpolantAutomatonStates: 183, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 25 MinimizatonAttempts, 786 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 1099 NumberOfCodeBlocks, 1099 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1009 ConstructedInterpolants, 0 QuantifiedInterpolants, 5329 SizeOfPredicates, 20 NumberOfNonLiveVariables, 971 ConjunctsInSsa, 81 ConjunctsInUnsatCore, 27 InterpolantComputations, 25 PerfectInterpolantSequences, 67/71 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-01-09 22:49:02,684 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)