./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/recursive-with-pointer/system-with-recursion.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version da043454 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/recursive-with-pointer/system-with-recursion.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 28343a8bb5773ba843b07d1b8fb91a39d212a68ad88db39fb299adc750a87da6 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:26:23,769 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:26:23,820 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-04-29 11:26:23,825 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:26:23,826 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:26:23,841 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:26:23,842 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:26:23,842 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:26:23,842 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-29 11:26:23,842 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-29 11:26:23,842 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:26:23,842 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:26:23,843 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:26:23,843 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:26:23,843 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:26:23,843 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:26:23,843 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:26:23,843 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:26:23,843 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:26:23,843 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:26:23,843 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-04-29 11:26:23,844 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-04-29 11:26:23,844 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-04-29 11:26:23,844 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:26:23,844 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-04-29 11:26:23,844 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:26:23,844 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:26:23,844 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:26:23,844 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:26:23,845 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:26:23,845 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:26:23,845 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:26:23,845 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:26:23,845 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:26:23,845 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:26:23,845 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:26:23,845 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:26:23,845 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:26:23,845 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:26:23,845 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:26:23,845 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:26:23,845 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:26:23,845 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:26:23,845 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:26:23,845 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:26:23,845 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:26:23,846 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/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 -> 28343a8bb5773ba843b07d1b8fb91a39d212a68ad88db39fb299adc750a87da6 [2025-04-29 11:26:24,050 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:26:24,056 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:26:24,058 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:26:24,059 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:26:24,060 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:26:24,060 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-with-pointer/system-with-recursion.c [2025-04-29 11:26:25,341 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc941d665/8869083716624a96980681e83dd0ff13/FLAG3e8f9f105 [2025-04-29 11:26:25,566 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:26:25,570 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-with-pointer/system-with-recursion.c [2025-04-29 11:26:25,571 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:26:25,571 WARN L117 ultiparseSymbolTable]: System include string.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:26:25,571 WARN L117 ultiparseSymbolTable]: System include assert.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:26:25,581 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc941d665/8869083716624a96980681e83dd0ff13/FLAG3e8f9f105 [2025-04-29 11:26:26,541 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc941d665/8869083716624a96980681e83dd0ff13 [2025-04-29 11:26:26,544 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:26:26,544 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:26:26,545 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:26:26,545 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:26:26,550 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:26:26,551 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:26:26" (1/1) ... [2025-04-29 11:26:26,551 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57068e9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:26:26, skipping insertion in model container [2025-04-29 11:26:26,551 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:26:26" (1/1) ... [2025-04-29 11:26:26,566 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:26:26,753 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:26:26,762 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:26:26,838 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:26:26,858 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:26:26,858 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:26:26 WrapperNode [2025-04-29 11:26:26,858 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:26:26,860 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:26:26,860 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:26:26,860 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:26:26,865 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:26:26" (1/1) ... [2025-04-29 11:26:26,877 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:26:26" (1/1) ... [2025-04-29 11:26:26,909 INFO L138 Inliner]: procedures = 30, calls = 141, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 231 [2025-04-29 11:26:26,909 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:26:26,910 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:26:26,910 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:26:26,910 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:26:26,917 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:26:26" (1/1) ... [2025-04-29 11:26:26,918 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:26:26" (1/1) ... [2025-04-29 11:26:26,927 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:26:26" (1/1) ... [2025-04-29 11:26:26,954 INFO L175 MemorySlicer]: Split 89 memory accesses to 2 slices as follows [19, 70]. 79 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [9, 0]. The 44 writes are split as follows [6, 38]. [2025-04-29 11:26:26,954 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:26:26" (1/1) ... [2025-04-29 11:26:26,955 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:26:26" (1/1) ... [2025-04-29 11:26:26,969 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:26:26" (1/1) ... [2025-04-29 11:26:26,972 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:26:26" (1/1) ... [2025-04-29 11:26:26,975 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:26:26" (1/1) ... [2025-04-29 11:26:26,980 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:26:26" (1/1) ... [2025-04-29 11:26:26,985 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:26:26" (1/1) ... [2025-04-29 11:26:26,993 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:26:26,996 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:26:26,996 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:26:26,996 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:26:26,997 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:26:26" (1/1) ... [2025-04-29 11:26:27,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:26:27,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:26:27,021 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-29 11:26:27,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-29 11:26:27,045 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-29 11:26:27,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-29 11:26:27,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-04-29 11:26:27,045 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-29 11:26:27,045 INFO L130 BoogieDeclarations]: Found specification of procedure ASStart [2025-04-29 11:26:27,045 INFO L138 BoogieDeclarations]: Found implementation of procedure ASStart [2025-04-29 11:26:27,045 INFO L130 BoogieDeclarations]: Found specification of procedure system_initialize [2025-04-29 11:26:27,046 INFO L138 BoogieDeclarations]: Found implementation of procedure system_initialize [2025-04-29 11:26:27,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-29 11:26:27,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-29 11:26:27,046 INFO L130 BoogieDeclarations]: Found specification of procedure status_update [2025-04-29 11:26:27,046 INFO L138 BoogieDeclarations]: Found implementation of procedure status_update [2025-04-29 11:26:27,046 INFO L130 BoogieDeclarations]: Found specification of procedure message_send [2025-04-29 11:26:27,046 INFO L138 BoogieDeclarations]: Found implementation of procedure message_send [2025-04-29 11:26:27,046 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-29 11:26:27,046 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-29 11:26:27,046 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2025-04-29 11:26:27,046 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2025-04-29 11:26:27,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-29 11:26:27,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-04-29 11:26:27,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-29 11:26:27,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-29 11:26:27,047 INFO L130 BoogieDeclarations]: Found specification of procedure event_precess [2025-04-29 11:26:27,047 INFO L138 BoogieDeclarations]: Found implementation of procedure event_precess [2025-04-29 11:26:27,047 INFO L130 BoogieDeclarations]: Found specification of procedure ASStop [2025-04-29 11:26:27,047 INFO L138 BoogieDeclarations]: Found implementation of procedure ASStop [2025-04-29 11:26:27,047 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-29 11:26:27,047 INFO L130 BoogieDeclarations]: Found specification of procedure ASNull [2025-04-29 11:26:27,047 INFO L138 BoogieDeclarations]: Found implementation of procedure ASNull [2025-04-29 11:26:27,047 INFO L130 BoogieDeclarations]: Found specification of procedure ASIdle [2025-04-29 11:26:27,047 INFO L138 BoogieDeclarations]: Found implementation of procedure ASIdle [2025-04-29 11:26:27,047 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:26:27,047 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:26:27,047 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-29 11:26:27,168 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:26:27,169 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:26:27,792 INFO L? ?]: Removed 322 outVars from TransFormulas that were not future-live. [2025-04-29 11:26:27,792 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:26:27,807 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:26:27,809 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-29 11:26:27,810 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:26:27 BoogieIcfgContainer [2025-04-29 11:26:27,810 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:26:27,811 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:26:27,811 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:26:27,815 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:26:27,815 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:26:26" (1/3) ... [2025-04-29 11:26:27,815 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@87dbcae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:26:27, skipping insertion in model container [2025-04-29 11:26:27,815 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:26:26" (2/3) ... [2025-04-29 11:26:27,816 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@87dbcae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:26:27, skipping insertion in model container [2025-04-29 11:26:27,816 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:26:27" (3/3) ... [2025-04-29 11:26:27,816 INFO L128 eAbstractionObserver]: Analyzing ICFG system-with-recursion.c [2025-04-29 11:26:27,826 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:26:27,827 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG system-with-recursion.c that has 10 procedures, 384 locations, 460 edges, 1 initial locations, 1 loop locations, and 157 error locations. [2025-04-29 11:26:27,871 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:26:27,879 INFO L340 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;@5ec061fc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:26:27,879 INFO L341 AbstractCegarLoop]: Starting to check reachability of 157 error locations. [2025-04-29 11:26:27,883 INFO L278 IsEmpty]: Start isEmpty. Operand has 384 states, 188 states have (on average 1.9840425531914894) internal successors, (373), 345 states have internal predecessors, (373), 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-04-29 11:26:27,887 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-29 11:26:27,887 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:26:27,888 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:26:27,888 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 154 more)] === [2025-04-29 11:26:27,892 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:26:27,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1453627186, now seen corresponding path program 1 times [2025-04-29 11:26:27,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:26:27,897 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633892989] [2025-04-29 11:26:27,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:26:27,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:26:27,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-29 11:26:27,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-29 11:26:27,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:26:27,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:26:28,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:26:28,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:26:28,135 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633892989] [2025-04-29 11:26:28,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633892989] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:26:28,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:26:28,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:26:28,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237442142] [2025-04-29 11:26:28,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:26:28,140 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:26:28,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:26:28,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:26:28,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:26:28,161 INFO L87 Difference]: Start difference. First operand has 384 states, 188 states have (on average 1.9840425531914894) internal successors, (373), 345 states have internal predecessors, (373), 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-04-29 11:26:28,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:26:28,469 INFO L93 Difference]: Finished difference Result 411 states and 476 transitions. [2025-04-29 11:26:28,471 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:26:28,472 INFO L79 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-04-29 11:26:28,473 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:26:28,480 INFO L225 Difference]: With dead ends: 411 [2025-04-29 11:26:28,480 INFO L226 Difference]: Without dead ends: 408 [2025-04-29 11:26:28,481 INFO L436 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-04-29 11:26:28,482 INFO L437 NwaCegarLoop]: 232 mSDtfsCounter, 383 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 278 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-04-29 11:26:28,483 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 278 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-29 11:26:28,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2025-04-29 11:26:28,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 376. [2025-04-29 11:26:28,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 199 states have (on average 1.849246231155779) internal successors, (368), 332 states have internal predecessors, (368), 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-04-29 11:26:28,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 437 transitions. [2025-04-29 11:26:28,542 INFO L79 Accepts]: Start accepts. Automaton has 376 states and 437 transitions. Word has length 7 [2025-04-29 11:26:28,542 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:26:28,542 INFO L485 AbstractCegarLoop]: Abstraction has 376 states and 437 transitions. [2025-04-29 11:26:28,542 INFO L486 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-04-29 11:26:28,542 INFO L278 IsEmpty]: Start isEmpty. Operand 376 states and 437 transitions. [2025-04-29 11:26:28,542 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-29 11:26:28,542 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:26:28,543 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:26:28,543 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:26:28,543 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 154 more)] === [2025-04-29 11:26:28,543 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:26:28,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1453627185, now seen corresponding path program 1 times [2025-04-29 11:26:28,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:26:28,543 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130676221] [2025-04-29 11:26:28,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:26:28,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:26:28,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-29 11:26:28,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-29 11:26:28,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:26:28,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:26:28,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:26:28,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:26:28,675 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130676221] [2025-04-29 11:26:28,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130676221] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:26:28,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:26:28,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:26:28,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769451578] [2025-04-29 11:26:28,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:26:28,677 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:26:28,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:26:28,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:26:28,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:26:28,677 INFO L87 Difference]: Start difference. First operand 376 states and 437 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-04-29 11:26:28,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:26:28,980 INFO L93 Difference]: Finished difference Result 373 states and 433 transitions. [2025-04-29 11:26:28,980 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:26:28,980 INFO L79 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-04-29 11:26:28,980 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:26:28,986 INFO L225 Difference]: With dead ends: 373 [2025-04-29 11:26:28,986 INFO L226 Difference]: Without dead ends: 373 [2025-04-29 11:26:28,986 INFO L436 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-04-29 11:26:28,986 INFO L437 NwaCegarLoop]: 381 mSDtfsCounter, 13 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 831 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-04-29 11:26:28,987 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 831 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-29 11:26:28,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2025-04-29 11:26:28,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 373. [2025-04-29 11:26:29,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 201 states have (on average 1.8109452736318408) 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-04-29 11:26:29,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 433 transitions. [2025-04-29 11:26:29,002 INFO L79 Accepts]: Start accepts. Automaton has 373 states and 433 transitions. Word has length 7 [2025-04-29 11:26:29,002 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:26:29,002 INFO L485 AbstractCegarLoop]: Abstraction has 373 states and 433 transitions. [2025-04-29 11:26:29,002 INFO L486 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-04-29 11:26:29,002 INFO L278 IsEmpty]: Start isEmpty. Operand 373 states and 433 transitions. [2025-04-29 11:26:29,002 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-04-29 11:26:29,003 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:26:29,003 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:26:29,003 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 11:26:29,003 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 154 more)] === [2025-04-29 11:26:29,003 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:26:29,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1233886034, now seen corresponding path program 1 times [2025-04-29 11:26:29,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:26:29,004 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110081454] [2025-04-29 11:26:29,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:26:29,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:26:29,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-29 11:26:29,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-29 11:26:29,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:26:29,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:26:29,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:26:29,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:26:29,162 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110081454] [2025-04-29 11:26:29,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110081454] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:26:29,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:26:29,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:26:29,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367647132] [2025-04-29 11:26:29,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:26:29,162 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:26:29,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:26:29,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:26:29,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:26:29,163 INFO L87 Difference]: Start difference. First operand 373 states and 433 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-04-29 11:26:29,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:26:29,478 INFO L93 Difference]: Finished difference Result 372 states and 432 transitions. [2025-04-29 11:26:29,479 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:26:29,479 INFO L79 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-04-29 11:26:29,479 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:26:29,480 INFO L225 Difference]: With dead ends: 372 [2025-04-29 11:26:29,480 INFO L226 Difference]: Without dead ends: 372 [2025-04-29 11:26:29,481 INFO L436 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-04-29 11:26:29,481 INFO L437 NwaCegarLoop]: 385 mSDtfsCounter, 2 mSDsluCounter, 701 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1086 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-04-29 11:26:29,481 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1086 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-29 11:26:29,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2025-04-29 11:26:29,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 372. [2025-04-29 11:26:29,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 201 states have (on average 1.8059701492537314) internal successors, (363), 327 states have internal predecessors, (363), 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-04-29 11:26:29,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 432 transitions. [2025-04-29 11:26:29,499 INFO L79 Accepts]: Start accepts. Automaton has 372 states and 432 transitions. Word has length 11 [2025-04-29 11:26:29,499 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:26:29,499 INFO L485 AbstractCegarLoop]: Abstraction has 372 states and 432 transitions. [2025-04-29 11:26:29,500 INFO L486 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-04-29 11:26:29,500 INFO L278 IsEmpty]: Start isEmpty. Operand 372 states and 432 transitions. [2025-04-29 11:26:29,500 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-04-29 11:26:29,500 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:26:29,500 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:26:29,500 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 11:26:29,500 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 154 more)] === [2025-04-29 11:26:29,501 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:26:29,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1233886035, now seen corresponding path program 1 times [2025-04-29 11:26:29,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:26:29,501 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852702302] [2025-04-29 11:26:29,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:26:29,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:26:29,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-29 11:26:29,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-29 11:26:29,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:26:29,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:26:29,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:26:29,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:26:29,709 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852702302] [2025-04-29 11:26:29,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852702302] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:26:29,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:26:29,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:26:29,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840525093] [2025-04-29 11:26:29,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:26:29,709 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:26:29,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:26:29,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:26:29,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:26:29,710 INFO L87 Difference]: Start difference. First operand 372 states and 432 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-04-29 11:26:30,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:26:30,013 INFO L93 Difference]: Finished difference Result 371 states and 431 transitions. [2025-04-29 11:26:30,013 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:26:30,014 INFO L79 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-04-29 11:26:30,014 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:26:30,016 INFO L225 Difference]: With dead ends: 371 [2025-04-29 11:26:30,017 INFO L226 Difference]: Without dead ends: 371 [2025-04-29 11:26:30,017 INFO L436 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-04-29 11:26:30,018 INFO L437 NwaCegarLoop]: 385 mSDtfsCounter, 1 mSDsluCounter, 682 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1067 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-04-29 11:26:30,018 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1067 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-29 11:26:30,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2025-04-29 11:26:30,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 371. [2025-04-29 11:26:30,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 201 states have (on average 1.800995024875622) internal successors, (362), 326 states have internal predecessors, (362), 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-04-29 11:26:30,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 431 transitions. [2025-04-29 11:26:30,027 INFO L79 Accepts]: Start accepts. Automaton has 371 states and 431 transitions. Word has length 11 [2025-04-29 11:26:30,027 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:26:30,028 INFO L485 AbstractCegarLoop]: Abstraction has 371 states and 431 transitions. [2025-04-29 11:26:30,028 INFO L486 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-04-29 11:26:30,028 INFO L278 IsEmpty]: Start isEmpty. Operand 371 states and 431 transitions. [2025-04-29 11:26:30,028 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-29 11:26:30,028 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:26:30,028 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:26:30,028 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-29 11:26:30,028 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 154 more)] === [2025-04-29 11:26:30,029 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:26:30,029 INFO L85 PathProgramCache]: Analyzing trace with hash 556636695, now seen corresponding path program 1 times [2025-04-29 11:26:30,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:26:30,029 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437280996] [2025-04-29 11:26:30,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:26:30,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:26:30,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-29 11:26:30,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-29 11:26:30,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:26:30,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:26:30,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:26:30,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:26:30,094 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437280996] [2025-04-29 11:26:30,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437280996] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:26:30,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:26:30,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:26:30,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963432953] [2025-04-29 11:26:30,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:26:30,094 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:26:30,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:26:30,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:26:30,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:26:30,095 INFO L87 Difference]: Start difference. First operand 371 states and 431 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-04-29 11:26:30,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:26:30,237 INFO L93 Difference]: Finished difference Result 370 states and 430 transitions. [2025-04-29 11:26:30,237 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:26:30,237 INFO L79 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-04-29 11:26:30,238 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:26:30,239 INFO L225 Difference]: With dead ends: 370 [2025-04-29 11:26:30,239 INFO L226 Difference]: Without dead ends: 370 [2025-04-29 11:26:30,239 INFO L436 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-04-29 11:26:30,240 INFO L437 NwaCegarLoop]: 386 mSDtfsCounter, 1 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 627 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-04-29 11:26:30,240 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 627 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:26:30,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2025-04-29 11:26:30,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 370. [2025-04-29 11:26:30,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 201 states have (on average 1.7960199004975124) internal successors, (361), 325 states have internal predecessors, (361), 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-04-29 11:26:30,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 430 transitions. [2025-04-29 11:26:30,251 INFO L79 Accepts]: Start accepts. Automaton has 370 states and 430 transitions. Word has length 17 [2025-04-29 11:26:30,252 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:26:30,252 INFO L485 AbstractCegarLoop]: Abstraction has 370 states and 430 transitions. [2025-04-29 11:26:30,252 INFO L486 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-04-29 11:26:30,252 INFO L278 IsEmpty]: Start isEmpty. Operand 370 states and 430 transitions. [2025-04-29 11:26:30,253 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-29 11:26:30,253 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:26:30,253 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:26:30,253 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-29 11:26:30,253 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 154 more)] === [2025-04-29 11:26:30,254 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:26:30,254 INFO L85 PathProgramCache]: Analyzing trace with hash 556636696, now seen corresponding path program 1 times [2025-04-29 11:26:30,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:26:30,254 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951337779] [2025-04-29 11:26:30,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:26:30,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:26:30,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-29 11:26:30,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-29 11:26:30,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:26:30,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:26:30,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:26:30,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:26:30,339 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951337779] [2025-04-29 11:26:30,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951337779] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:26:30,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:26:30,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:26:30,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63644585] [2025-04-29 11:26:30,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:26:30,340 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:26:30,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:26:30,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:26:30,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:26:30,340 INFO L87 Difference]: Start difference. First operand 370 states and 430 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-04-29 11:26:30,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:26:30,498 INFO L93 Difference]: Finished difference Result 369 states and 429 transitions. [2025-04-29 11:26:30,498 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:26:30,498 INFO L79 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-04-29 11:26:30,498 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:26:30,500 INFO L225 Difference]: With dead ends: 369 [2025-04-29 11:26:30,500 INFO L226 Difference]: Without dead ends: 369 [2025-04-29 11:26:30,500 INFO L436 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-04-29 11:26:30,500 INFO L437 NwaCegarLoop]: 386 mSDtfsCounter, 1 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 614 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-04-29 11:26:30,500 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 614 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:26:30,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2025-04-29 11:26:30,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 369. [2025-04-29 11:26:30,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 201 states have (on average 1.791044776119403) internal successors, (360), 324 states have internal predecessors, (360), 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-04-29 11:26:30,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 429 transitions. [2025-04-29 11:26:30,514 INFO L79 Accepts]: Start accepts. Automaton has 369 states and 429 transitions. Word has length 17 [2025-04-29 11:26:30,514 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:26:30,514 INFO L485 AbstractCegarLoop]: Abstraction has 369 states and 429 transitions. [2025-04-29 11:26:30,514 INFO L486 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-04-29 11:26:30,514 INFO L278 IsEmpty]: Start isEmpty. Operand 369 states and 429 transitions. [2025-04-29 11:26:30,515 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-29 11:26:30,515 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:26:30,515 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-04-29 11:26:30,515 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-29 11:26:30,515 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 154 more)] === [2025-04-29 11:26:30,516 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:26:30,516 INFO L85 PathProgramCache]: Analyzing trace with hash -104440839, now seen corresponding path program 1 times [2025-04-29 11:26:30,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:26:30,516 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839816257] [2025-04-29 11:26:30,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:26:30,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:26:30,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-29 11:26:30,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-29 11:26:30,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:26:30,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:26:30,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:26:30,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:26:30,666 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839816257] [2025-04-29 11:26:30,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839816257] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:26:30,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:26:30,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-29 11:26:30,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901022614] [2025-04-29 11:26:30,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:26:30,667 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-29 11:26:30,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:26:30,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-29 11:26:30,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:26:30,667 INFO L87 Difference]: Start difference. First operand 369 states and 429 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-04-29 11:26:31,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:26:31,126 INFO L93 Difference]: Finished difference Result 382 states and 445 transitions. [2025-04-29 11:26:31,126 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:26:31,126 INFO L79 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-04-29 11:26:31,127 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:26:31,128 INFO L225 Difference]: With dead ends: 382 [2025-04-29 11:26:31,128 INFO L226 Difference]: Without dead ends: 382 [2025-04-29 11:26:31,128 INFO L436 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-04-29 11:26:31,129 INFO L437 NwaCegarLoop]: 170 mSDtfsCounter, 715 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 715 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-29 11:26:31,129 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [715 Valid, 359 Invalid, 612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-29 11:26:31,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2025-04-29 11:26:31,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 350. [2025-04-29 11:26:31,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 201 states have (on average 1.6865671641791045) internal successors, (339), 305 states have internal predecessors, (339), 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-04-29 11:26:31,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 408 transitions. [2025-04-29 11:26:31,146 INFO L79 Accepts]: Start accepts. Automaton has 350 states and 408 transitions. Word has length 20 [2025-04-29 11:26:31,146 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:26:31,146 INFO L485 AbstractCegarLoop]: Abstraction has 350 states and 408 transitions. [2025-04-29 11:26:31,146 INFO L486 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-04-29 11:26:31,147 INFO L278 IsEmpty]: Start isEmpty. Operand 350 states and 408 transitions. [2025-04-29 11:26:31,147 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-29 11:26:31,147 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:26:31,147 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-04-29 11:26:31,147 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-29 11:26:31,147 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ASNullErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 154 more)] === [2025-04-29 11:26:31,148 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:26:31,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1006071900, now seen corresponding path program 1 times [2025-04-29 11:26:31,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:26:31,148 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146367896] [2025-04-29 11:26:31,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:26:31,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:26:31,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-29 11:26:31,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-29 11:26:31,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:26:31,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:26:31,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:26:31,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:26:31,344 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146367896] [2025-04-29 11:26:31,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146367896] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:26:31,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:26:31,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-29 11:26:31,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850934713] [2025-04-29 11:26:31,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:26:31,347 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-29 11:26:31,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:26:31,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-29 11:26:31,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:26:31,347 INFO L87 Difference]: Start difference. First operand 350 states and 408 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-04-29 11:26:31,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:26:31,775 INFO L93 Difference]: Finished difference Result 383 states and 454 transitions. [2025-04-29 11:26:31,776 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-29 11:26:31,776 INFO L79 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-04-29 11:26:31,776 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:26:31,778 INFO L225 Difference]: With dead ends: 383 [2025-04-29 11:26:31,779 INFO L226 Difference]: Without dead ends: 383 [2025-04-29 11:26:31,779 INFO L436 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-04-29 11:26:31,779 INFO L437 NwaCegarLoop]: 359 mSDtfsCounter, 43 mSDsluCounter, 1074 mSDsCounter, 0 mSdLazyCounter, 773 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 1433 SdHoareTripleChecker+Invalid, 775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-29 11:26:31,779 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 1433 Invalid, 775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 773 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-29 11:26:31,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2025-04-29 11:26:31,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 371. [2025-04-29 11:26:31,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 219 states have (on average 1.6666666666666667) internal successors, (365), 323 states have internal predecessors, (365), 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-04-29 11:26:31,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 438 transitions. [2025-04-29 11:26:31,791 INFO L79 Accepts]: Start accepts. Automaton has 371 states and 438 transitions. Word has length 26 [2025-04-29 11:26:31,792 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:26:31,792 INFO L485 AbstractCegarLoop]: Abstraction has 371 states and 438 transitions. [2025-04-29 11:26:31,792 INFO L486 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-04-29 11:26:31,792 INFO L278 IsEmpty]: Start isEmpty. Operand 371 states and 438 transitions. [2025-04-29 11:26:31,792 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-29 11:26:31,792 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:26:31,792 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-04-29 11:26:31,793 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-29 11:26:31,793 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ASNullErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 154 more)] === [2025-04-29 11:26:31,793 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:26:31,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1006071901, now seen corresponding path program 1 times [2025-04-29 11:26:31,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:26:31,793 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236041441] [2025-04-29 11:26:31,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:26:31,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:26:31,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-29 11:26:31,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-29 11:26:31,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:26:31,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:26:31,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:26:31,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:26:31,908 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236041441] [2025-04-29 11:26:31,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236041441] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:26:31,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:26:31,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-29 11:26:31,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696624034] [2025-04-29 11:26:31,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:26:31,908 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-29 11:26:31,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:26:31,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-29 11:26:31,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:26:31,909 INFO L87 Difference]: Start difference. First operand 371 states and 438 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-04-29 11:26:32,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:26:32,303 INFO L93 Difference]: Finished difference Result 382 states and 453 transitions. [2025-04-29 11:26:32,303 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-29 11:26:32,304 INFO L79 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-04-29 11:26:32,304 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:26:32,305 INFO L225 Difference]: With dead ends: 382 [2025-04-29 11:26:32,305 INFO L226 Difference]: Without dead ends: 382 [2025-04-29 11:26:32,306 INFO L436 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-04-29 11:26:32,306 INFO L437 NwaCegarLoop]: 360 mSDtfsCounter, 42 mSDsluCounter, 1047 mSDsCounter, 0 mSdLazyCounter, 799 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 1407 SdHoareTripleChecker+Invalid, 801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-29 11:26:32,306 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 1407 Invalid, 801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 799 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-29 11:26:32,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2025-04-29 11:26:32,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 371. [2025-04-29 11:26:32,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 219 states have (on average 1.6621004566210045) internal successors, (364), 323 states have internal predecessors, (364), 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-04-29 11:26:32,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 437 transitions. [2025-04-29 11:26:32,316 INFO L79 Accepts]: Start accepts. Automaton has 371 states and 437 transitions. Word has length 26 [2025-04-29 11:26:32,316 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:26:32,316 INFO L485 AbstractCegarLoop]: Abstraction has 371 states and 437 transitions. [2025-04-29 11:26:32,316 INFO L486 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-04-29 11:26:32,316 INFO L278 IsEmpty]: Start isEmpty. Operand 371 states and 437 transitions. [2025-04-29 11:26:32,317 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-29 11:26:32,317 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:26:32,317 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-04-29 11:26:32,317 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-29 11:26:32,317 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 154 more)] === [2025-04-29 11:26:32,318 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:26:32,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1131081811, now seen corresponding path program 1 times [2025-04-29 11:26:32,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:26:32,318 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289028230] [2025-04-29 11:26:32,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:26:32,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:26:32,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-29 11:26:32,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-29 11:26:32,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:26:32,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:26:32,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:26:32,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:26:32,455 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289028230] [2025-04-29 11:26:32,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289028230] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:26:32,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:26:32,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-29 11:26:32,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805775776] [2025-04-29 11:26:32,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:26:32,455 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:26:32,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:26:32,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:26:32,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:26:32,456 INFO L87 Difference]: Start difference. First operand 371 states and 437 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-04-29 11:26:32,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:26:32,592 INFO L93 Difference]: Finished difference Result 421 states and 489 transitions. [2025-04-29 11:26:32,592 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:26:32,592 INFO L79 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-04-29 11:26:32,592 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:26:32,593 INFO L225 Difference]: With dead ends: 421 [2025-04-29 11:26:32,594 INFO L226 Difference]: Without dead ends: 421 [2025-04-29 11:26:32,594 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-04-29 11:26:32,594 INFO L437 NwaCegarLoop]: 362 mSDtfsCounter, 57 mSDsluCounter, 1012 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 1374 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:26:32,594 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 1374 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:26:32,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2025-04-29 11:26:32,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 409. [2025-04-29 11:26:32,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 248 states have (on average 1.6088709677419355) internal successors, (399), 352 states have internal predecessors, (399), 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-04-29 11:26:32,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 486 transitions. [2025-04-29 11:26:32,603 INFO L79 Accepts]: Start accepts. Automaton has 409 states and 486 transitions. Word has length 27 [2025-04-29 11:26:32,603 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:26:32,603 INFO L485 AbstractCegarLoop]: Abstraction has 409 states and 486 transitions. [2025-04-29 11:26:32,604 INFO L486 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-04-29 11:26:32,604 INFO L278 IsEmpty]: Start isEmpty. Operand 409 states and 486 transitions. [2025-04-29 11:26:32,604 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-04-29 11:26:32,604 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:26:32,604 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-04-29 11:26:32,604 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-29 11:26:32,605 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting system_initializeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 154 more)] === [2025-04-29 11:26:32,605 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:26:32,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1403441703, now seen corresponding path program 1 times [2025-04-29 11:26:32,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:26:32,605 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102865285] [2025-04-29 11:26:32,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:26:32,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:26:32,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-29 11:26:32,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-29 11:26:32,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:26:32,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:26:32,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:26:32,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:26:32,678 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102865285] [2025-04-29 11:26:32,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102865285] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:26:32,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:26:32,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:26:32,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403223189] [2025-04-29 11:26:32,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:26:32,678 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:26:32,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:26:32,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:26:32,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:26:32,679 INFO L87 Difference]: Start difference. First operand 409 states and 486 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-04-29 11:26:32,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:26:32,716 INFO L93 Difference]: Finished difference Result 419 states and 496 transitions. [2025-04-29 11:26:32,717 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:26:32,717 INFO L79 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-04-29 11:26:32,718 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:26:32,719 INFO L225 Difference]: With dead ends: 419 [2025-04-29 11:26:32,719 INFO L226 Difference]: Without dead ends: 417 [2025-04-29 11:26:32,719 INFO L436 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-04-29 11:26:32,720 INFO L437 NwaCegarLoop]: 362 mSDtfsCounter, 12 mSDsluCounter, 704 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1066 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-04-29 11:26:32,720 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1066 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:26:32,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2025-04-29 11:26:32,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 417. [2025-04-29 11:26:32,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 255 states have (on average 1.5960784313725491) internal successors, (407), 359 states have internal predecessors, (407), 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-04-29 11:26:32,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 494 transitions. [2025-04-29 11:26:32,730 INFO L79 Accepts]: Start accepts. Automaton has 417 states and 494 transitions. Word has length 38 [2025-04-29 11:26:32,730 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:26:32,731 INFO L485 AbstractCegarLoop]: Abstraction has 417 states and 494 transitions. [2025-04-29 11:26:32,731 INFO L486 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-04-29 11:26:32,731 INFO L278 IsEmpty]: Start isEmpty. Operand 417 states and 494 transitions. [2025-04-29 11:26:32,732 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-29 11:26:32,732 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:26:32,732 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-04-29 11:26:32,732 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-29 11:26:32,732 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 154 more)] === [2025-04-29 11:26:32,733 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:26:32,733 INFO L85 PathProgramCache]: Analyzing trace with hash 2095666857, now seen corresponding path program 1 times [2025-04-29 11:26:32,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:26:32,733 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194787532] [2025-04-29 11:26:32,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:26:32,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:26:32,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-29 11:26:32,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-29 11:26:32,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:26:32,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:26:32,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-04-29 11:26:32,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:26:32,927 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194787532] [2025-04-29 11:26:32,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194787532] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:26:32,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:26:32,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-29 11:26:32,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119497100] [2025-04-29 11:26:32,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:26:32,928 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:26:32,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:26:32,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:26:32,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:26:32,929 INFO L87 Difference]: Start difference. First operand 417 states and 494 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-04-29 11:26:33,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:26:33,347 INFO L93 Difference]: Finished difference Result 461 states and 561 transitions. [2025-04-29 11:26:33,347 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-29 11:26:33,347 INFO L79 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-04-29 11:26:33,348 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:26:33,349 INFO L225 Difference]: With dead ends: 461 [2025-04-29 11:26:33,349 INFO L226 Difference]: Without dead ends: 454 [2025-04-29 11:26:33,350 INFO L436 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-04-29 11:26:33,350 INFO L437 NwaCegarLoop]: 319 mSDtfsCounter, 286 mSDsluCounter, 2026 mSDsCounter, 0 mSdLazyCounter, 707 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 2345 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-04-29 11:26:33,350 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 2345 Invalid, 750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 707 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-29 11:26:33,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2025-04-29 11:26:33,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 419. [2025-04-29 11:26:33,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 256 states have (on average 1.58984375) internal successors, (407), 361 states have internal predecessors, (407), 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-04-29 11:26:33,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 495 transitions. [2025-04-29 11:26:33,363 INFO L79 Accepts]: Start accepts. Automaton has 419 states and 495 transitions. Word has length 37 [2025-04-29 11:26:33,363 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:26:33,363 INFO L485 AbstractCegarLoop]: Abstraction has 419 states and 495 transitions. [2025-04-29 11:26:33,363 INFO L486 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-04-29 11:26:33,363 INFO L278 IsEmpty]: Start isEmpty. Operand 419 states and 495 transitions. [2025-04-29 11:26:33,363 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-29 11:26:33,364 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:26:33,364 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-04-29 11:26:33,364 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-29 11:26:33,364 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting system_initializeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 154 more)] === [2025-04-29 11:26:33,364 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:26:33,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1812454789, now seen corresponding path program 1 times [2025-04-29 11:26:33,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:26:33,364 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070660956] [2025-04-29 11:26:33,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:26:33,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:26:33,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-29 11:26:33,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-29 11:26:33,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:26:33,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:26:33,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:26:33,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:26:33,554 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070660956] [2025-04-29 11:26:33,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070660956] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:26:33,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:26:33,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-29 11:26:33,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198809347] [2025-04-29 11:26:33,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:26:33,555 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-29 11:26:33,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:26:33,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-29 11:26:33,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:26:33,555 INFO L87 Difference]: Start difference. First operand 419 states and 495 transitions. Second operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 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-04-29 11:26:33,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:26:33,889 INFO L93 Difference]: Finished difference Result 430 states and 517 transitions. [2025-04-29 11:26:33,889 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-29 11:26:33,890 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 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-04-29 11:26:33,890 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:26:33,892 INFO L225 Difference]: With dead ends: 430 [2025-04-29 11:26:33,892 INFO L226 Difference]: Without dead ends: 428 [2025-04-29 11:26:33,892 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2025-04-29 11:26:33,893 INFO L437 NwaCegarLoop]: 343 mSDtfsCounter, 155 mSDsluCounter, 914 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 1257 SdHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-29 11:26:33,893 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 1257 Invalid, 535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-29 11:26:33,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2025-04-29 11:26:33,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 421. [2025-04-29 11:26:33,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 255 states have (on average 1.5529411764705883) internal successors, (396), 358 states have internal predecessors, (396), 38 states have call successors, (38), 16 states have call predecessors, (38), 23 states have return successors, (74), 46 states have call predecessors, (74), 38 states have call successors, (74) [2025-04-29 11:26:33,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 508 transitions. [2025-04-29 11:26:33,903 INFO L79 Accepts]: Start accepts. Automaton has 421 states and 508 transitions. Word has length 40 [2025-04-29 11:26:33,903 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:26:33,903 INFO L485 AbstractCegarLoop]: Abstraction has 421 states and 508 transitions. [2025-04-29 11:26:33,903 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 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-04-29 11:26:33,903 INFO L278 IsEmpty]: Start isEmpty. Operand 421 states and 508 transitions. [2025-04-29 11:26:33,904 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-04-29 11:26:33,904 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:26:33,904 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-04-29 11:26:33,904 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-29 11:26:33,904 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting system_initializeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 154 more)] === [2025-04-29 11:26:33,905 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:26:33,905 INFO L85 PathProgramCache]: Analyzing trace with hash -815268963, now seen corresponding path program 1 times [2025-04-29 11:26:33,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:26:33,905 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271453780] [2025-04-29 11:26:33,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:26:33,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:26:33,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-29 11:26:33,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-29 11:26:33,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:26:33,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:26:34,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:26:34,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:26:34,375 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271453780] [2025-04-29 11:26:34,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271453780] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:26:34,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:26:34,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-29 11:26:34,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702847666] [2025-04-29 11:26:34,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:26:34,376 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-29 11:26:34,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:26:34,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-29 11:26:34,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-04-29 11:26:34,376 INFO L87 Difference]: Start difference. First operand 421 states and 508 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-04-29 11:26:35,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:26:35,232 INFO L93 Difference]: Finished difference Result 623 states and 807 transitions. [2025-04-29 11:26:35,232 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-29 11:26:35,232 INFO L79 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-04-29 11:26:35,233 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:26:35,235 INFO L225 Difference]: With dead ends: 623 [2025-04-29 11:26:35,235 INFO L226 Difference]: Without dead ends: 623 [2025-04-29 11:26:35,235 INFO L436 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-04-29 11:26:35,236 INFO L437 NwaCegarLoop]: 303 mSDtfsCounter, 675 mSDsluCounter, 1079 mSDsCounter, 0 mSdLazyCounter, 1182 mSolverCounterSat, 252 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 678 SdHoareTripleChecker+Valid, 1382 SdHoareTripleChecker+Invalid, 1434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 252 IncrementalHoareTripleChecker+Valid, 1182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-29 11:26:35,236 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [678 Valid, 1382 Invalid, 1434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [252 Valid, 1182 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-29 11:26:35,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2025-04-29 11:26:35,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 544. [2025-04-29 11:26:35,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 349 states have (on average 1.512893982808023) internal successors, (528), 455 states have internal predecessors, (528), 55 states have call successors, (55), 24 states have call predecessors, (55), 35 states have return successors, (123), 64 states have call predecessors, (123), 55 states have call successors, (123) [2025-04-29 11:26:35,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 706 transitions. [2025-04-29 11:26:35,251 INFO L79 Accepts]: Start accepts. Automaton has 544 states and 706 transitions. Word has length 42 [2025-04-29 11:26:35,251 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:26:35,251 INFO L485 AbstractCegarLoop]: Abstraction has 544 states and 706 transitions. [2025-04-29 11:26:35,251 INFO L486 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-04-29 11:26:35,251 INFO L278 IsEmpty]: Start isEmpty. Operand 544 states and 706 transitions. [2025-04-29 11:26:35,251 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-04-29 11:26:35,252 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:26:35,252 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-04-29 11:26:35,252 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-29 11:26:35,252 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting system_initializeErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 154 more)] === [2025-04-29 11:26:35,252 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:26:35,252 INFO L85 PathProgramCache]: Analyzing trace with hash -815268962, now seen corresponding path program 1 times [2025-04-29 11:26:35,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:26:35,252 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027310742] [2025-04-29 11:26:35,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:26:35,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:26:35,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-29 11:26:35,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-29 11:26:35,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:26:35,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:26:36,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:26:36,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:26:36,057 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027310742] [2025-04-29 11:26:36,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027310742] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:26:36,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:26:36,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-29 11:26:36,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112732527] [2025-04-29 11:26:36,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:26:36,058 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-29 11:26:36,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:26:36,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-29 11:26:36,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-04-29 11:26:36,059 INFO L87 Difference]: Start difference. First operand 544 states and 706 transitions. Second operand has 11 states, 10 states have (on average 3.5) internal successors, (35), 11 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-04-29 11:26:37,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:26:37,059 INFO L93 Difference]: Finished difference Result 665 states and 838 transitions. [2025-04-29 11:26:37,060 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-29 11:26:37,060 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.5) internal successors, (35), 11 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-04-29 11:26:37,060 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:26:37,062 INFO L225 Difference]: With dead ends: 665 [2025-04-29 11:26:37,062 INFO L226 Difference]: Without dead ends: 665 [2025-04-29 11:26:37,062 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2025-04-29 11:26:37,063 INFO L437 NwaCegarLoop]: 296 mSDtfsCounter, 598 mSDsluCounter, 965 mSDsCounter, 0 mSdLazyCounter, 1188 mSolverCounterSat, 240 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 601 SdHoareTripleChecker+Valid, 1261 SdHoareTripleChecker+Invalid, 1428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 240 IncrementalHoareTripleChecker+Valid, 1188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-29 11:26:37,063 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [601 Valid, 1261 Invalid, 1428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [240 Valid, 1188 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-04-29 11:26:37,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2025-04-29 11:26:37,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 545. [2025-04-29 11:26:37,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 353 states have (on average 1.5042492917847026) internal successors, (531), 453 states have internal predecessors, (531), 51 states have call successors, (51), 24 states have call predecessors, (51), 36 states have return successors, (105), 67 states have call predecessors, (105), 51 states have call successors, (105) [2025-04-29 11:26:37,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 687 transitions. [2025-04-29 11:26:37,076 INFO L79 Accepts]: Start accepts. Automaton has 545 states and 687 transitions. Word has length 42 [2025-04-29 11:26:37,077 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:26:37,077 INFO L485 AbstractCegarLoop]: Abstraction has 545 states and 687 transitions. [2025-04-29 11:26:37,077 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.5) internal successors, (35), 11 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-04-29 11:26:37,077 INFO L278 IsEmpty]: Start isEmpty. Operand 545 states and 687 transitions. [2025-04-29 11:26:37,077 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-04-29 11:26:37,077 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:26:37,077 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-04-29 11:26:37,078 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-29 11:26:37,078 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting system_initializeErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 154 more)] === [2025-04-29 11:26:37,078 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:26:37,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1789423202, now seen corresponding path program 1 times [2025-04-29 11:26:37,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:26:37,078 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570812107] [2025-04-29 11:26:37,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:26:37,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:26:37,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-04-29 11:26:37,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-04-29 11:26:37,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:26:37,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:26:37,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:26:37,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:26:37,137 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570812107] [2025-04-29 11:26:37,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570812107] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:26:37,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:26:37,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:26:37,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064667169] [2025-04-29 11:26:37,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:26:37,139 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:26:37,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:26:37,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:26:37,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:26:37,140 INFO L87 Difference]: Start difference. First operand 545 states and 687 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-04-29 11:26:37,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:26:37,266 INFO L93 Difference]: Finished difference Result 543 states and 683 transitions. [2025-04-29 11:26:37,266 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:26:37,266 INFO L79 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-04-29 11:26:37,266 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:26:37,268 INFO L225 Difference]: With dead ends: 543 [2025-04-29 11:26:37,268 INFO L226 Difference]: Without dead ends: 543 [2025-04-29 11:26:37,268 INFO L436 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-04-29 11:26:37,269 INFO L437 NwaCegarLoop]: 359 mSDtfsCounter, 5 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 576 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-04-29 11:26:37,269 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 576 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:26:37,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2025-04-29 11:26:37,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 543. [2025-04-29 11:26:37,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 353 states have (on average 1.4929178470254958) internal successors, (527), 451 states have internal predecessors, (527), 51 states have call successors, (51), 24 states have call predecessors, (51), 36 states have return successors, (105), 67 states have call predecessors, (105), 51 states have call successors, (105) [2025-04-29 11:26:37,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 683 transitions. [2025-04-29 11:26:37,281 INFO L79 Accepts]: Start accepts. Automaton has 543 states and 683 transitions. Word has length 44 [2025-04-29 11:26:37,281 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:26:37,281 INFO L485 AbstractCegarLoop]: Abstraction has 543 states and 683 transitions. [2025-04-29 11:26:37,282 INFO L486 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-04-29 11:26:37,282 INFO L278 IsEmpty]: Start isEmpty. Operand 543 states and 683 transitions. [2025-04-29 11:26:37,283 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-04-29 11:26:37,283 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:26:37,283 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-04-29 11:26:37,283 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-29 11:26:37,283 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting system_initializeErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 154 more)] === [2025-04-29 11:26:37,284 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:26:37,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1789423201, now seen corresponding path program 1 times [2025-04-29 11:26:37,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:26:37,284 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476630318] [2025-04-29 11:26:37,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:26:37,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:26:37,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-04-29 11:26:37,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-04-29 11:26:37,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:26:37,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:26:37,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:26:37,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:26:37,355 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476630318] [2025-04-29 11:26:37,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476630318] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:26:37,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:26:37,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:26:37,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005826174] [2025-04-29 11:26:37,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:26:37,356 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:26:37,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:26:37,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:26:37,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:26:37,357 INFO L87 Difference]: Start difference. First operand 543 states and 683 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-04-29 11:26:37,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:26:37,486 INFO L93 Difference]: Finished difference Result 541 states and 679 transitions. [2025-04-29 11:26:37,486 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:26:37,487 INFO L79 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-04-29 11:26:37,487 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:26:37,488 INFO L225 Difference]: With dead ends: 541 [2025-04-29 11:26:37,489 INFO L226 Difference]: Without dead ends: 541 [2025-04-29 11:26:37,489 INFO L436 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-04-29 11:26:37,489 INFO L437 NwaCegarLoop]: 359 mSDtfsCounter, 5 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 582 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-04-29 11:26:37,489 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 582 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:26:37,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2025-04-29 11:26:37,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 541. [2025-04-29 11:26:37,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 353 states have (on average 1.481586402266289) internal successors, (523), 449 states have internal predecessors, (523), 51 states have call successors, (51), 24 states have call predecessors, (51), 36 states have return successors, (105), 67 states have call predecessors, (105), 51 states have call successors, (105) [2025-04-29 11:26:37,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 679 transitions. [2025-04-29 11:26:37,515 INFO L79 Accepts]: Start accepts. Automaton has 541 states and 679 transitions. Word has length 44 [2025-04-29 11:26:37,515 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:26:37,515 INFO L485 AbstractCegarLoop]: Abstraction has 541 states and 679 transitions. [2025-04-29 11:26:37,515 INFO L486 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-04-29 11:26:37,515 INFO L278 IsEmpty]: Start isEmpty. Operand 541 states and 679 transitions. [2025-04-29 11:26:37,515 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-04-29 11:26:37,515 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:26:37,515 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-04-29 11:26:37,516 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-29 11:26:37,516 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ASNullErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 154 more)] === [2025-04-29 11:26:37,516 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:26:37,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1915602901, now seen corresponding path program 1 times [2025-04-29 11:26:37,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:26:37,516 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037290338] [2025-04-29 11:26:37,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:26:37,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:26:37,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-04-29 11:26:37,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-04-29 11:26:37,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:26:37,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:26:37,657 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:26:37,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:26:37,657 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037290338] [2025-04-29 11:26:37,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037290338] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:26:37,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:26:37,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-29 11:26:37,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602425174] [2025-04-29 11:26:37,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:26:37,658 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-29 11:26:37,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:26:37,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-29 11:26:37,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:26:37,658 INFO L87 Difference]: Start difference. First operand 541 states and 679 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-04-29 11:26:37,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:26:37,965 INFO L93 Difference]: Finished difference Result 607 states and 774 transitions. [2025-04-29 11:26:37,965 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-29 11:26:37,965 INFO L79 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-04-29 11:26:37,965 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:26:37,967 INFO L225 Difference]: With dead ends: 607 [2025-04-29 11:26:37,967 INFO L226 Difference]: Without dead ends: 607 [2025-04-29 11:26:37,968 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-04-29 11:26:37,968 INFO L437 NwaCegarLoop]: 415 mSDtfsCounter, 122 mSDsluCounter, 2210 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 2625 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-29 11:26:37,968 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 2625 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-29 11:26:37,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2025-04-29 11:26:37,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 581. [2025-04-29 11:26:37,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 581 states, 385 states have (on average 1.438961038961039) internal successors, (554), 476 states have internal predecessors, (554), 49 states have call successors, (49), 24 states have call predecessors, (49), 46 states have return successors, (154), 80 states have call predecessors, (154), 49 states have call successors, (154) [2025-04-29 11:26:37,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 757 transitions. [2025-04-29 11:26:37,983 INFO L79 Accepts]: Start accepts. Automaton has 581 states and 757 transitions. Word has length 53 [2025-04-29 11:26:37,983 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:26:37,983 INFO L485 AbstractCegarLoop]: Abstraction has 581 states and 757 transitions. [2025-04-29 11:26:37,984 INFO L486 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-04-29 11:26:37,984 INFO L278 IsEmpty]: Start isEmpty. Operand 581 states and 757 transitions. [2025-04-29 11:26:37,984 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-29 11:26:37,985 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:26:37,985 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-04-29 11:26:37,985 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-29 11:26:37,985 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 154 more)] === [2025-04-29 11:26:37,985 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:26:37,985 INFO L85 PathProgramCache]: Analyzing trace with hash -753476196, now seen corresponding path program 1 times [2025-04-29 11:26:37,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:26:37,985 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966816855] [2025-04-29 11:26:37,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:26:37,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:26:37,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-29 11:26:38,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-29 11:26:38,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:26:38,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:26:38,098 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:26:38,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:26:38,099 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966816855] [2025-04-29 11:26:38,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966816855] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:26:38,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:26:38,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-29 11:26:38,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129368275] [2025-04-29 11:26:38,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:26:38,100 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-29 11:26:38,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:26:38,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-29 11:26:38,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:26:38,101 INFO L87 Difference]: Start difference. First operand 581 states and 757 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-04-29 11:26:38,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:26:38,525 INFO L93 Difference]: Finished difference Result 711 states and 964 transitions. [2025-04-29 11:26:38,525 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-29 11:26:38,525 INFO L79 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-04-29 11:26:38,525 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:26:38,528 INFO L225 Difference]: With dead ends: 711 [2025-04-29 11:26:38,528 INFO L226 Difference]: Without dead ends: 711 [2025-04-29 11:26:38,528 INFO L436 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-04-29 11:26:38,529 INFO L437 NwaCegarLoop]: 357 mSDtfsCounter, 162 mSDsluCounter, 1067 mSDsCounter, 0 mSdLazyCounter, 887 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 1424 SdHoareTripleChecker+Invalid, 905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 887 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-29 11:26:38,529 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 1424 Invalid, 905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 887 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-29 11:26:38,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2025-04-29 11:26:38,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 639. [2025-04-29 11:26:38,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 639 states, 431 states have (on average 1.431554524361949) internal successors, (617), 526 states have internal predecessors, (617), 57 states have call successors, (57), 30 states have call predecessors, (57), 50 states have return successors, (184), 82 states have call predecessors, (184), 57 states have call successors, (184) [2025-04-29 11:26:38,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 858 transitions. [2025-04-29 11:26:38,547 INFO L79 Accepts]: Start accepts. Automaton has 639 states and 858 transitions. Word has length 54 [2025-04-29 11:26:38,547 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:26:38,547 INFO L485 AbstractCegarLoop]: Abstraction has 639 states and 858 transitions. [2025-04-29 11:26:38,547 INFO L486 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-04-29 11:26:38,548 INFO L278 IsEmpty]: Start isEmpty. Operand 639 states and 858 transitions. [2025-04-29 11:26:38,548 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-29 11:26:38,548 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:26:38,548 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-04-29 11:26:38,548 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-29 11:26:38,548 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 154 more)] === [2025-04-29 11:26:38,548 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:26:38,549 INFO L85 PathProgramCache]: Analyzing trace with hash -753476195, now seen corresponding path program 1 times [2025-04-29 11:26:38,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:26:38,549 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896395509] [2025-04-29 11:26:38,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:26:38,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:26:38,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-29 11:26:38,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-29 11:26:38,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:26:38,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:26:38,708 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:26:38,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:26:38,708 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896395509] [2025-04-29 11:26:38,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896395509] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:26:38,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:26:38,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-29 11:26:38,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247282636] [2025-04-29 11:26:38,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:26:38,709 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-29 11:26:38,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:26:38,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-29 11:26:38,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:26:38,709 INFO L87 Difference]: Start difference. First operand 639 states and 858 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-04-29 11:26:39,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:26:39,137 INFO L93 Difference]: Finished difference Result 705 states and 951 transitions. [2025-04-29 11:26:39,138 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-29 11:26:39,138 INFO L79 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-04-29 11:26:39,138 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:26:39,141 INFO L225 Difference]: With dead ends: 705 [2025-04-29 11:26:39,141 INFO L226 Difference]: Without dead ends: 705 [2025-04-29 11:26:39,142 INFO L436 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-04-29 11:26:39,144 INFO L437 NwaCegarLoop]: 364 mSDtfsCounter, 55 mSDsluCounter, 1128 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 1492 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.4s IncrementalHoareTripleChecker+Time [2025-04-29 11:26:39,144 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 1492 Invalid, 753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 751 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-29 11:26:39,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2025-04-29 11:26:39,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 687. [2025-04-29 11:26:39,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 687 states, 473 states have (on average 1.4207188160676534) internal successors, (672), 568 states have internal predecessors, (672), 59 states have call successors, (59), 34 states have call predecessors, (59), 54 states have return successors, (190), 84 states have call predecessors, (190), 59 states have call successors, (190) [2025-04-29 11:26:39,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 921 transitions. [2025-04-29 11:26:39,169 INFO L79 Accepts]: Start accepts. Automaton has 687 states and 921 transitions. Word has length 54 [2025-04-29 11:26:39,169 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:26:39,169 INFO L485 AbstractCegarLoop]: Abstraction has 687 states and 921 transitions. [2025-04-29 11:26:39,169 INFO L486 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-04-29 11:26:39,169 INFO L278 IsEmpty]: Start isEmpty. Operand 687 states and 921 transitions. [2025-04-29 11:26:39,170 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-04-29 11:26:39,170 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:26:39,170 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-04-29 11:26:39,170 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-29 11:26:39,170 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 154 more)] === [2025-04-29 11:26:39,171 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:26:39,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1179360416, now seen corresponding path program 1 times [2025-04-29 11:26:39,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:26:39,171 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202587841] [2025-04-29 11:26:39,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:26:39,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:26:39,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-04-29 11:26:39,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-04-29 11:26:39,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:26:39,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:26:39,244 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-04-29 11:26:39,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:26:39,245 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202587841] [2025-04-29 11:26:39,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202587841] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:26:39,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:26:39,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:26:39,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254305660] [2025-04-29 11:26:39,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:26:39,246 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:26:39,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:26:39,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:26:39,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:26:39,246 INFO L87 Difference]: Start difference. First operand 687 states and 921 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-04-29 11:26:39,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:26:39,473 INFO L93 Difference]: Finished difference Result 685 states and 919 transitions. [2025-04-29 11:26:39,474 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:26:39,474 INFO L79 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-04-29 11:26:39,474 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:26:39,477 INFO L225 Difference]: With dead ends: 685 [2025-04-29 11:26:39,477 INFO L226 Difference]: Without dead ends: 685 [2025-04-29 11:26:39,477 INFO L436 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-04-29 11:26:39,478 INFO L437 NwaCegarLoop]: 356 mSDtfsCounter, 2 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 787 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-04-29 11:26:39,478 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 787 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:26:39,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2025-04-29 11:26:39,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 685. [2025-04-29 11:26:39,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 685 states, 473 states have (on average 1.4164904862579282) internal successors, (670), 566 states have internal predecessors, (670), 59 states have call successors, (59), 34 states have call predecessors, (59), 54 states have return successors, (190), 84 states have call predecessors, (190), 59 states have call successors, (190) [2025-04-29 11:26:39,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 919 transitions. [2025-04-29 11:26:39,500 INFO L79 Accepts]: Start accepts. Automaton has 685 states and 919 transitions. Word has length 62 [2025-04-29 11:26:39,500 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:26:39,500 INFO L485 AbstractCegarLoop]: Abstraction has 685 states and 919 transitions. [2025-04-29 11:26:39,500 INFO L486 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-04-29 11:26:39,500 INFO L278 IsEmpty]: Start isEmpty. Operand 685 states and 919 transitions. [2025-04-29 11:26:39,500 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-04-29 11:26:39,500 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:26:39,500 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-04-29 11:26:39,500 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-29 11:26:39,501 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ASStartErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 154 more)] === [2025-04-29 11:26:39,501 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:26:39,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1179360415, now seen corresponding path program 1 times [2025-04-29 11:26:39,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:26:39,501 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497835154] [2025-04-29 11:26:39,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:26:39,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:26:39,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-04-29 11:26:39,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-04-29 11:26:39,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:26:39,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:26:39,739 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-29 11:26:39,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:26:39,739 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497835154] [2025-04-29 11:26:39,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497835154] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:26:39,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:26:39,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-29 11:26:39,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186164076] [2025-04-29 11:26:39,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:26:39,740 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-29 11:26:39,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:26:39,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-29 11:26:39,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-04-29 11:26:39,741 INFO L87 Difference]: Start difference. First operand 685 states and 919 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-04-29 11:26:39,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:26:39,916 INFO L93 Difference]: Finished difference Result 869 states and 1189 transitions. [2025-04-29 11:26:39,917 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-29 11:26:39,917 INFO L79 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-04-29 11:26:39,917 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:26:39,921 INFO L225 Difference]: With dead ends: 869 [2025-04-29 11:26:39,921 INFO L226 Difference]: Without dead ends: 869 [2025-04-29 11:26:39,921 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-04-29 11:26:39,922 INFO L437 NwaCegarLoop]: 369 mSDtfsCounter, 97 mSDsluCounter, 2446 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 2815 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:26:39,922 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 2815 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:26:39,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2025-04-29 11:26:39,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 812. [2025-04-29 11:26:39,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 582 states have (on average 1.3934707903780068) internal successors, (811), 676 states have internal predecessors, (811), 67 states have call successors, (67), 46 states have call predecessors, (67), 64 states have return successors, (216), 89 states have call predecessors, (216), 67 states have call successors, (216) [2025-04-29 11:26:39,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 1094 transitions. [2025-04-29 11:26:39,946 INFO L79 Accepts]: Start accepts. Automaton has 812 states and 1094 transitions. Word has length 62 [2025-04-29 11:26:39,947 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:26:39,947 INFO L485 AbstractCegarLoop]: Abstraction has 812 states and 1094 transitions. [2025-04-29 11:26:39,947 INFO L486 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-04-29 11:26:39,947 INFO L278 IsEmpty]: Start isEmpty. Operand 812 states and 1094 transitions. [2025-04-29 11:26:39,948 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-04-29 11:26:39,948 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:26:39,948 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-04-29 11:26:39,948 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-04-29 11:26:39,948 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ASStartErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 154 more)] === [2025-04-29 11:26:39,948 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:26:39,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1144093697, now seen corresponding path program 1 times [2025-04-29 11:26:39,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:26:39,949 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104091090] [2025-04-29 11:26:39,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:26:39,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:26:39,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-04-29 11:26:39,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-04-29 11:26:39,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:26:39,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:26:40,655 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:26:40,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:26:40,655 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104091090] [2025-04-29 11:26:40,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104091090] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:26:40,655 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [179502088] [2025-04-29 11:26:40,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:26:40,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:26:40,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:26:40,657 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:26:40,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-29 11:26:40,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-04-29 11:26:40,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-04-29 11:26:40,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:26:40,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:26:40,819 INFO L256 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 69 conjuncts are in the unsatisfiable core [2025-04-29 11:26:40,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:26:40,859 INFO L354 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-04-29 11:26:40,877 INFO L354 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-04-29 11:26:40,897 INFO L354 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-04-29 11:26:40,940 INFO L325 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-04-29 11:26:40,940 INFO L354 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-04-29 11:26:40,946 INFO L354 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-04-29 11:26:40,950 INFO L354 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-04-29 11:26:40,977 INFO L354 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-04-29 11:26:40,980 INFO L354 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-04-29 11:26:40,985 INFO L354 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-04-29 11:26:41,001 INFO L354 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-04-29 11:26:41,005 INFO L354 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-04-29 11:26:41,009 INFO L354 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-04-29 11:26:41,024 INFO L354 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-04-29 11:26:41,030 INFO L354 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-04-29 11:26:41,034 INFO L354 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-04-29 11:26:41,095 INFO L354 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-04-29 11:26:41,099 INFO L354 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-04-29 11:26:41,102 INFO L354 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-04-29 11:26:41,177 INFO L354 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-04-29 11:26:41,182 INFO L354 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-04-29 11:26:41,185 INFO L354 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-04-29 11:26:41,203 INFO L354 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-04-29 11:26:41,206 INFO L354 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-04-29 11:26:41,212 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:26:41,212 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:26:41,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [179502088] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:26:41,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 11:26:41,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [12] total 17 [2025-04-29 11:26:41,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351989041] [2025-04-29 11:26:41,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:26:41,213 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:26:41,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:26:41,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:26:41,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2025-04-29 11:26:41,213 INFO L87 Difference]: Start difference. First operand 812 states and 1094 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-04-29 11:26:41,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:26:41,817 INFO L93 Difference]: Finished difference Result 836 states and 1125 transitions. [2025-04-29 11:26:41,817 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-29 11:26:41,817 INFO L79 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-04-29 11:26:41,817 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:26:41,820 INFO L225 Difference]: With dead ends: 836 [2025-04-29 11:26:41,820 INFO L226 Difference]: Without dead ends: 836 [2025-04-29 11:26:41,821 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 61 SyntacticMatches, 6 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2025-04-29 11:26:41,821 INFO L437 NwaCegarLoop]: 325 mSDtfsCounter, 245 mSDsluCounter, 1711 mSDsCounter, 0 mSdLazyCounter, 709 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 2036 SdHoareTripleChecker+Invalid, 791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 709 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-29 11:26:41,821 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 2036 Invalid, 791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 709 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-29 11:26:41,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 836 states. [2025-04-29 11:26:41,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 836 to 793. [2025-04-29 11:26:41,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 793 states, 564 states have (on average 1.3953900709219857) internal successors, (787), 658 states have internal predecessors, (787), 66 states have call successors, (66), 45 states have call predecessors, (66), 64 states have return successors, (207), 89 states have call predecessors, (207), 66 states have call successors, (207) [2025-04-29 11:26:41,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 1060 transitions. [2025-04-29 11:26:41,838 INFO L79 Accepts]: Start accepts. Automaton has 793 states and 1060 transitions. Word has length 62 [2025-04-29 11:26:41,838 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:26:41,838 INFO L485 AbstractCegarLoop]: Abstraction has 793 states and 1060 transitions. [2025-04-29 11:26:41,839 INFO L486 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-04-29 11:26:41,839 INFO L278 IsEmpty]: Start isEmpty. Operand 793 states and 1060 transitions. [2025-04-29 11:26:41,839 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-04-29 11:26:41,839 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:26:41,839 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-04-29 11:26:41,846 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-29 11:26:42,044 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-04-29 11:26:42,044 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ASStartErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 154 more)] === [2025-04-29 11:26:42,044 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:26:42,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1832066354, now seen corresponding path program 1 times [2025-04-29 11:26:42,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:26:42,044 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447381303] [2025-04-29 11:26:42,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:26:42,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:26:42,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-04-29 11:26:42,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-04-29 11:26:42,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:26:42,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:26:42,120 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-04-29 11:26:42,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:26:42,120 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447381303] [2025-04-29 11:26:42,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447381303] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:26:42,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:26:42,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:26:42,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668775710] [2025-04-29 11:26:42,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:26:42,120 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:26:42,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:26:42,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:26:42,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:26:42,121 INFO L87 Difference]: Start difference. First operand 793 states and 1060 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-04-29 11:26:42,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:26:42,319 INFO L93 Difference]: Finished difference Result 791 states and 1058 transitions. [2025-04-29 11:26:42,320 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:26:42,320 INFO L79 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-04-29 11:26:42,320 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:26:42,323 INFO L225 Difference]: With dead ends: 791 [2025-04-29 11:26:42,323 INFO L226 Difference]: Without dead ends: 791 [2025-04-29 11:26:42,323 INFO L436 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-04-29 11:26:42,323 INFO L437 NwaCegarLoop]: 354 mSDtfsCounter, 2 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 785 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-04-29 11:26:42,324 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 785 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:26:42,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2025-04-29 11:26:42,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 791. [2025-04-29 11:26:42,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 791 states, 564 states have (on average 1.3918439716312057) internal successors, (785), 656 states have internal predecessors, (785), 66 states have call successors, (66), 45 states have call predecessors, (66), 64 states have return successors, (207), 89 states have call predecessors, (207), 66 states have call successors, (207) [2025-04-29 11:26:42,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 1058 transitions. [2025-04-29 11:26:42,340 INFO L79 Accepts]: Start accepts. Automaton has 791 states and 1058 transitions. Word has length 63 [2025-04-29 11:26:42,340 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:26:42,340 INFO L485 AbstractCegarLoop]: Abstraction has 791 states and 1058 transitions. [2025-04-29 11:26:42,340 INFO L486 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-04-29 11:26:42,340 INFO L278 IsEmpty]: Start isEmpty. Operand 791 states and 1058 transitions. [2025-04-29 11:26:42,340 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-04-29 11:26:42,340 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:26:42,340 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-04-29 11:26:42,341 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-04-29 11:26:42,341 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ASStartErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 154 more)] === [2025-04-29 11:26:42,341 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:26:42,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1832066353, now seen corresponding path program 1 times [2025-04-29 11:26:42,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:26:42,341 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220507793] [2025-04-29 11:26:42,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:26:42,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:26:42,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-04-29 11:26:42,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-04-29 11:26:42,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:26:42,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:26:42,371 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-29 11:26:42,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-04-29 11:26:42,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-04-29 11:26:42,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:26:42,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:26:42,430 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-29 11:26:42,430 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-29 11:26:42,431 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ASStartErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (156 of 157 remaining) [2025-04-29 11:26:42,432 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (155 of 157 remaining) [2025-04-29 11:26:42,432 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (154 of 157 remaining) [2025-04-29 11:26:42,432 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (153 of 157 remaining) [2025-04-29 11:26:42,432 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (152 of 157 remaining) [2025-04-29 11:26:42,432 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (151 of 157 remaining) [2025-04-29 11:26:42,432 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (150 of 157 remaining) [2025-04-29 11:26:42,432 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (149 of 157 remaining) [2025-04-29 11:26:42,432 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (148 of 157 remaining) [2025-04-29 11:26:42,432 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (147 of 157 remaining) [2025-04-29 11:26:42,432 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (146 of 157 remaining) [2025-04-29 11:26:42,433 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (145 of 157 remaining) [2025-04-29 11:26:42,433 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (144 of 157 remaining) [2025-04-29 11:26:42,433 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (143 of 157 remaining) [2025-04-29 11:26:42,433 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (142 of 157 remaining) [2025-04-29 11:26:42,433 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (141 of 157 remaining) [2025-04-29 11:26:42,433 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (140 of 157 remaining) [2025-04-29 11:26:42,433 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (139 of 157 remaining) [2025-04-29 11:26:42,433 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (138 of 157 remaining) [2025-04-29 11:26:42,433 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (137 of 157 remaining) [2025-04-29 11:26:42,433 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (136 of 157 remaining) [2025-04-29 11:26:42,433 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (135 of 157 remaining) [2025-04-29 11:26:42,433 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (134 of 157 remaining) [2025-04-29 11:26:42,433 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (133 of 157 remaining) [2025-04-29 11:26:42,433 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (132 of 157 remaining) [2025-04-29 11:26:42,433 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (131 of 157 remaining) [2025-04-29 11:26:42,433 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (130 of 157 remaining) [2025-04-29 11:26:42,433 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (129 of 157 remaining) [2025-04-29 11:26:42,433 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (128 of 157 remaining) [2025-04-29 11:26:42,433 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (127 of 157 remaining) [2025-04-29 11:26:42,433 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (126 of 157 remaining) [2025-04-29 11:26:42,433 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (125 of 157 remaining) [2025-04-29 11:26:42,433 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (124 of 157 remaining) [2025-04-29 11:26:42,433 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (123 of 157 remaining) [2025-04-29 11:26:42,433 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (122 of 157 remaining) [2025-04-29 11:26:42,433 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (121 of 157 remaining) [2025-04-29 11:26:42,433 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ASStopErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (120 of 157 remaining) [2025-04-29 11:26:42,433 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ASStopErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (119 of 157 remaining) [2025-04-29 11:26:42,433 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ASStopErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (118 of 157 remaining) [2025-04-29 11:26:42,433 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ASStopErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE (117 of 157 remaining) [2025-04-29 11:26:42,433 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location status_updateErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (116 of 157 remaining) [2025-04-29 11:26:42,435 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location status_updateErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (115 of 157 remaining) [2025-04-29 11:26:42,435 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location status_updateErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (114 of 157 remaining) [2025-04-29 11:26:42,435 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location status_updateErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (113 of 157 remaining) [2025-04-29 11:26:42,435 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (112 of 157 remaining) [2025-04-29 11:26:42,435 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (111 of 157 remaining) [2025-04-29 11:26:42,435 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (110 of 157 remaining) [2025-04-29 11:26:42,436 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (109 of 157 remaining) [2025-04-29 11:26:42,436 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (108 of 157 remaining) [2025-04-29 11:26:42,436 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (107 of 157 remaining) [2025-04-29 11:26:42,436 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (106 of 157 remaining) [2025-04-29 11:26:42,436 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (105 of 157 remaining) [2025-04-29 11:26:42,436 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (104 of 157 remaining) [2025-04-29 11:26:42,436 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (103 of 157 remaining) [2025-04-29 11:26:42,436 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (102 of 157 remaining) [2025-04-29 11:26:42,436 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (101 of 157 remaining) [2025-04-29 11:26:42,436 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (100 of 157 remaining) [2025-04-29 11:26:42,436 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (99 of 157 remaining) [2025-04-29 11:26:42,436 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (98 of 157 remaining) [2025-04-29 11:26:42,436 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (97 of 157 remaining) [2025-04-29 11:26:42,436 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (96 of 157 remaining) [2025-04-29 11:26:42,436 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (95 of 157 remaining) [2025-04-29 11:26:42,436 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (94 of 157 remaining) [2025-04-29 11:26:42,436 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (93 of 157 remaining) [2025-04-29 11:26:42,436 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (92 of 157 remaining) [2025-04-29 11:26:42,436 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (91 of 157 remaining) [2025-04-29 11:26:42,436 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (90 of 157 remaining) [2025-04-29 11:26:42,436 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 157 remaining) [2025-04-29 11:26:42,436 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 157 remaining) [2025-04-29 11:26:42,436 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 157 remaining) [2025-04-29 11:26:42,437 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 157 remaining) [2025-04-29 11:26:42,437 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 157 remaining) [2025-04-29 11:26:42,437 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 157 remaining) [2025-04-29 11:26:42,437 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 157 remaining) [2025-04-29 11:26:42,437 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 157 remaining) [2025-04-29 11:26:42,437 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 157 remaining) [2025-04-29 11:26:42,437 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 157 remaining) [2025-04-29 11:26:42,437 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 157 remaining) [2025-04-29 11:26:42,437 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 157 remaining) [2025-04-29 11:26:42,438 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 157 remaining) [2025-04-29 11:26:42,438 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 157 remaining) [2025-04-29 11:26:42,438 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 157 remaining) [2025-04-29 11:26:42,438 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 157 remaining) [2025-04-29 11:26:42,438 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 157 remaining) [2025-04-29 11:26:42,438 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 157 remaining) [2025-04-29 11:26:42,438 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 157 remaining) [2025-04-29 11:26:42,438 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 157 remaining) [2025-04-29 11:26:42,438 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 157 remaining) [2025-04-29 11:26:42,438 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 157 remaining) [2025-04-29 11:26:42,438 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 157 remaining) [2025-04-29 11:26:42,438 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 157 remaining) [2025-04-29 11:26:42,438 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 157 remaining) [2025-04-29 11:26:42,438 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 157 remaining) [2025-04-29 11:26:42,438 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 157 remaining) [2025-04-29 11:26:42,438 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 157 remaining) [2025-04-29 11:26:42,438 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 157 remaining) [2025-04-29 11:26:42,438 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 157 remaining) [2025-04-29 11:26:42,438 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 157 remaining) [2025-04-29 11:26:42,438 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 157 remaining) [2025-04-29 11:26:42,438 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 157 remaining) [2025-04-29 11:26:42,438 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 157 remaining) [2025-04-29 11:26:42,438 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 157 remaining) [2025-04-29 11:26:42,438 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 157 remaining) [2025-04-29 11:26:42,438 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 157 remaining) [2025-04-29 11:26:42,438 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 157 remaining) [2025-04-29 11:26:42,439 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 157 remaining) [2025-04-29 11:26:42,439 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 157 remaining) [2025-04-29 11:26:42,439 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 157 remaining) [2025-04-29 11:26:42,439 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr64REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 157 remaining) [2025-04-29 11:26:42,439 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 157 remaining) [2025-04-29 11:26:42,439 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 157 remaining) [2025-04-29 11:26:42,439 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 157 remaining) [2025-04-29 11:26:42,439 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr68REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 157 remaining) [2025-04-29 11:26:42,439 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr69REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 157 remaining) [2025-04-29 11:26:42,439 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 157 remaining) [2025-04-29 11:26:42,439 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 157 remaining) [2025-04-29 11:26:42,439 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 157 remaining) [2025-04-29 11:26:42,439 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 157 remaining) [2025-04-29 11:26:42,439 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 157 remaining) [2025-04-29 11:26:42,439 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 157 remaining) [2025-04-29 11:26:42,439 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 157 remaining) [2025-04-29 11:26:42,439 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 157 remaining) [2025-04-29 11:26:42,439 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 157 remaining) [2025-04-29 11:26:42,439 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 157 remaining) [2025-04-29 11:26:42,439 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 157 remaining) [2025-04-29 11:26:42,439 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 157 remaining) [2025-04-29 11:26:42,439 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ASNullErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 157 remaining) [2025-04-29 11:26:42,440 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ASNullErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 157 remaining) [2025-04-29 11:26:42,440 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 157 remaining) [2025-04-29 11:26:42,440 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 157 remaining) [2025-04-29 11:26:42,440 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 157 remaining) [2025-04-29 11:26:42,440 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 157 remaining) [2025-04-29 11:26:42,440 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 157 remaining) [2025-04-29 11:26:42,440 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 157 remaining) [2025-04-29 11:26:42,440 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 157 remaining) [2025-04-29 11:26:42,440 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 157 remaining) [2025-04-29 11:26:42,440 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 157 remaining) [2025-04-29 11:26:42,440 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 157 remaining) [2025-04-29 11:26:42,441 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 157 remaining) [2025-04-29 11:26:42,441 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 157 remaining) [2025-04-29 11:26:42,441 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 157 remaining) [2025-04-29 11:26:42,441 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 157 remaining) [2025-04-29 11:26:42,441 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 157 remaining) [2025-04-29 11:26:42,441 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 157 remaining) [2025-04-29 11:26:42,441 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 157 remaining) [2025-04-29 11:26:42,441 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 157 remaining) [2025-04-29 11:26:42,441 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 157 remaining) [2025-04-29 11:26:42,441 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 157 remaining) [2025-04-29 11:26:42,441 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 157 remaining) [2025-04-29 11:26:42,441 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 157 remaining) [2025-04-29 11:26:42,441 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 157 remaining) [2025-04-29 11:26:42,441 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 157 remaining) [2025-04-29 11:26:42,441 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 157 remaining) [2025-04-29 11:26:42,441 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 157 remaining) [2025-04-29 11:26:42,441 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 157 remaining) [2025-04-29 11:26:42,441 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 157 remaining) [2025-04-29 11:26:42,441 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK (0 of 157 remaining) [2025-04-29 11:26:42,441 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-04-29 11:26:42,444 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] [2025-04-29 11:26:42,490 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-29 11:26:42,494 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.04 11:26:42 BoogieIcfgContainer [2025-04-29 11:26:42,494 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-29 11:26:42,494 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-29 11:26:42,494 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-29 11:26:42,494 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-29 11:26:42,495 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:26:27" (3/4) ... [2025-04-29 11:26:42,495 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-04-29 11:26:42,544 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 16. [2025-04-29 11:26:42,593 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-04-29 11:26:42,593 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-04-29 11:26:42,593 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-29 11:26:42,593 INFO L158 Benchmark]: Toolchain (without parser) took 16048.92ms. Allocated memory was 167.8MB in the beginning and 453.0MB in the end (delta: 285.2MB). Free memory was 123.7MB in the beginning and 405.6MB in the end (delta: -281.8MB). Peak memory consumption was 262.3MB. Max. memory is 16.1GB. [2025-04-29 11:26:42,593 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 120.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:26:42,593 INFO L158 Benchmark]: CACSL2BoogieTranslator took 313.30ms. Allocated memory is still 167.8MB. Free memory was 123.7MB in the beginning and 104.6MB in the end (delta: 19.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-29 11:26:42,594 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.72ms. Allocated memory is still 167.8MB. Free memory was 104.6MB in the beginning and 102.3MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:26:42,594 INFO L158 Benchmark]: Boogie Preprocessor took 84.84ms. Allocated memory is still 167.8MB. Free memory was 102.3MB in the beginning and 97.5MB in the end (delta: 4.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-29 11:26:42,594 INFO L158 Benchmark]: RCFGBuilder took 814.06ms. Allocated memory is still 167.8MB. Free memory was 97.5MB in the beginning and 38.4MB in the end (delta: 59.1MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-04-29 11:26:42,594 INFO L158 Benchmark]: TraceAbstraction took 14682.81ms. Allocated memory was 167.8MB in the beginning and 453.0MB in the end (delta: 285.2MB). Free memory was 37.9MB in the beginning and 155.6MB in the end (delta: -117.6MB). Peak memory consumption was 168.4MB. Max. memory is 16.1GB. [2025-04-29 11:26:42,594 INFO L158 Benchmark]: Witness Printer took 98.50ms. Allocated memory is still 453.0MB. Free memory was 155.6MB in the beginning and 405.6MB in the end (delta: -250.0MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. [2025-04-29 11:26:42,598 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.20ms. Allocated memory is still 201.3MB. Free memory is still 120.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 313.30ms. Allocated memory is still 167.8MB. Free memory was 123.7MB in the beginning and 104.6MB in the end (delta: 19.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.72ms. Allocated memory is still 167.8MB. Free memory was 104.6MB in the beginning and 102.3MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 84.84ms. Allocated memory is still 167.8MB. Free memory was 102.3MB in the beginning and 97.5MB in the end (delta: 4.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 814.06ms. Allocated memory is still 167.8MB. Free memory was 97.5MB in the beginning and 38.4MB in the end (delta: 59.1MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * TraceAbstraction took 14682.81ms. Allocated memory was 167.8MB in the beginning and 453.0MB in the end (delta: 285.2MB). Free memory was 37.9MB in the beginning and 155.6MB in the end (delta: -117.6MB). Peak memory consumption was 168.4MB. Max. memory is 16.1GB. * Witness Printer took 98.50ms. Allocated memory is still 453.0MB. Free memory was 155.6MB in the beginning and 405.6MB in the end (delta: -250.0MB). Peak memory consumption was 10.0MB. 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: [L110] user_t *user; VAL [user={0:0}] [L323] user = malloc(sizeof(user_t)) [L324] CALL user_initialize() [L313] EXPR, FCALL calloc(1, sizeof(info_t)) VAL [user={-1:0}] [L313] user->info = calloc(1, sizeof(info_t)) VAL [user={-1:0}] [L314] user->message.id = 11 VAL [user={-1:0}] [L315] EXPR user->info VAL [user={-1:0}] [L315] user->info->is_valid = 0 VAL [user={-1:0}] [L316] user->status = AS_NULL VAL [user={-1:0}] [L317] user->user_id = 11 VAL [user={-1:0}] [L318] user->timeout = 3 VAL [user={-1:0}] [L324] RET user_initialize() [L325] event_t e = {0}; [L325] event_t e = {0}; [L325] event_t e = {0}; [L325] event_t e = {0}; VAL [user={-1:0}] [L326] e.primitive = _EVENT_START VAL [user={-1:0}] [L327] CALL event_precess(&e) VAL [\at(e, Pre)={6:0}, user={-1:0}] [L289] EXPR user->status VAL [\at(e, Pre)={6:0}, e={6:0}, user={-1:0}] [L289] sys_state_t status = user->status; [L290] int rc = -1; VAL [\at(e, Pre)={6:0}, e={6:0}, rc=-1, status=1, user={-1:0}] [L291] COND TRUE status < AS_STATE_MAX [L293] case AS_NULL: VAL [\at(e, Pre)={6:0}, e={6:0}, rc=-1, status=1, user={-1:0}] [L294] CALL ASNull(e) VAL [\at(e, Pre)={6:0}, user={-1:0}] [L175] EXPR e->primitive VAL [\at(e, Pre)={6:0}, user={-1:0}] [L175] e_primitive_t primitive = e->primitive; [L176] COND TRUE primitive == _EVENT_START VAL [\at(e, Pre)={6:0}, user={-1:0}] [L177] CALL status_update(AS_START) VAL [\at(status, Pre)=2, user={-1:0}] [L149] COND TRUE status < AS_STATE_MAX VAL [\at(status, Pre)=2, status=2, user={-1:0}] [L150] EXPR user->status VAL [\at(status, Pre)=2, status=2, user={-1:0}] [L150] COND TRUE user->status != status [L151] user->status = status VAL [\at(status, Pre)=2, user={-1:0}] [L152] return 10; VAL [\at(status, Pre)=2, \result=10, user={-1:0}] [L177] RET status_update(AS_START) VAL [\at(e, Pre)={6:0}, user={-1:0}] [L178] CALL system_initialize() VAL [user={-1:0}] [L165] event_t e = {0}; [L165] event_t e = {0}; [L165] event_t e = {0}; [L165] event_t e = {0}; VAL [e={5:0}, user={-1:0}] [L167] EXPR user->info VAL [e={5:0}, user={-1:0}] [L167] EXPR user->info->is_valid VAL [e={5:0}, user={-1:0}] [L167] COND TRUE !user->info->is_valid [L168] e.primitive = _EVENT_CLOSE VAL [e={5:0}, user={-1:0}] [L172] CALL event_precess(&e) VAL [\at(e, Pre)={5:0}, user={-1:0}] [L289] EXPR user->status VAL [\at(e, Pre)={5:0}, e={5:0}, user={-1:0}] [L289] sys_state_t status = user->status; [L290] int rc = -1; VAL [\at(e, Pre)={5:0}, e={5:0}, rc=-1, status=2, user={-1:0}] [L291] COND TRUE status < AS_STATE_MAX [L293] case AS_NULL: [L296] case AS_START: VAL [\at(e, Pre)={5:0}, e={5:0}, rc=-1, status=2, user={-1:0}] [L297] CALL ASStart(e) VAL [\at(e, Pre)={5:0}, user={-1:0}] [L222] EXPR e->primitive VAL [\at(e, Pre)={5:0}, e={5:0}, user={-1:0}] [L222] e_primitive_t primitive = e->primitive; [L223] int rc = -1; [L225] case _EVENT_OPEN: VAL [\at(e, Pre)={5:0}, e={5:0}, primitive=3, rc=-1, user={-1:0}] [L225] case _EVENT_OPEN: [L239] case _EVENT_CLOSE: VAL [\at(e, Pre)={5:0}, e={5:0}, rc=-1, user={-1:0}] [L239] case _EVENT_CLOSE: [L240] message_t *message = &user->message; [L241] EXPR, FCALL calloc(0, sizeof(*message)) VAL [\at(e, Pre)={5:0}, e={5:0}, rc=-1, user={-1:0}] [L241] message = calloc(0, sizeof(*message)) [L242] 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: -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: 321]: 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, 384 locations, 460 edges, 157 error locations. Started 1 CEGAR loops. OverallTime: 14.6s, OverallIterations: 25, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3699 SdHoareTripleChecker+Valid, 7.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3679 mSDsluCounter, 29509 SdHoareTripleChecker+Invalid, 6.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 21222 mSDsCounter, 850 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11444 IncrementalHoareTripleChecker+Invalid, 12294 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 850 mSolverCounterUnsat, 8287 mSDtfsCounter, 11444 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 288 GetRequests, 131 SyntacticMatches, 6 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=812occurred in iteration=22, InterpolantAutomatonStates: 167, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 24 MinimizatonAttempts, 556 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 991 NumberOfCodeBlocks, 991 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 903 ConstructedInterpolants, 0 QuantifiedInterpolants, 4870 SizeOfPredicates, 14 NumberOfNonLiveVariables, 498 ConjunctsInSsa, 69 ConjunctsInUnsatCore, 25 InterpolantComputations, 24 PerfectInterpolantSequences, 56/58 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-04-29 11:26:42,626 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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)