./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/recursive-with-pointer/system-with-recursion.i --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.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 74e63e86abbcab22438f70ee6d7d7ef12eaada509b0f0a56fb5cf815aaf53aab --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-30 10:46:33,783 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-30 10:46:33,819 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-04-30 10:46:33,823 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-30 10:46:33,823 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-30 10:46:33,842 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-30 10:46:33,843 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-30 10:46:33,843 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-30 10:46:33,844 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-30 10:46:33,844 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-30 10:46:33,844 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-30 10:46:33,844 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-30 10:46:33,844 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-30 10:46:33,844 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-30 10:46:33,844 INFO L153 SettingsManager]: * Use SBE=true [2025-04-30 10:46:33,845 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-30 10:46:33,845 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-30 10:46:33,845 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-30 10:46:33,845 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-30 10:46:33,845 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-30 10:46:33,845 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-04-30 10:46:33,845 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-04-30 10:46:33,845 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-04-30 10:46:33,845 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-30 10:46:33,845 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-04-30 10:46:33,845 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-30 10:46:33,846 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-30 10:46:33,846 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-30 10:46:33,846 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-30 10:46:33,846 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-30 10:46:33,846 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:46:33,846 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:46:33,846 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:46:33,846 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:46:33,847 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-30 10:46:33,847 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:46:33,847 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:46:33,847 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:46:33,847 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:46:33,847 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-30 10:46:33,847 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-30 10:46:33,847 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-30 10:46:33,847 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-30 10:46:33,847 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-30 10:46:33,847 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-30 10:46:33,847 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-30 10:46:33,848 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 -> 74e63e86abbcab22438f70ee6d7d7ef12eaada509b0f0a56fb5cf815aaf53aab [2025-04-30 10:46:34,080 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-30 10:46:34,087 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-30 10:46:34,089 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-30 10:46:34,090 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-30 10:46:34,090 INFO L274 PluginConnector]: CDTParser initialized [2025-04-30 10:46:34,092 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.i [2025-04-30 10:46:35,394 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6b4f60e3/fce9d4172e954d52b06ea97ec3071bd5/FLAG93a3736f0 [2025-04-30 10:46:35,663 INFO L389 CDTParser]: Found 1 translation units. [2025-04-30 10:46:35,664 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-with-pointer/system-with-recursion.i [2025-04-30 10:46:35,675 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6b4f60e3/fce9d4172e954d52b06ea97ec3071bd5/FLAG93a3736f0 [2025-04-30 10:46:36,395 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6b4f60e3/fce9d4172e954d52b06ea97ec3071bd5 [2025-04-30 10:46:36,397 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-30 10:46:36,398 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-30 10:46:36,398 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-30 10:46:36,398 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-30 10:46:36,401 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-30 10:46:36,401 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:46:36" (1/1) ... [2025-04-30 10:46:36,402 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55934a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:46:36, skipping insertion in model container [2025-04-30 10:46:36,402 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:46:36" (1/1) ... [2025-04-30 10:46:36,434 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-30 10:46:36,774 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:46:36,783 INFO L200 MainTranslator]: Completed pre-run [2025-04-30 10:46:36,855 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:46:36,883 INFO L204 MainTranslator]: Completed translation [2025-04-30 10:46:36,883 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:46:36 WrapperNode [2025-04-30 10:46:36,883 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-30 10:46:36,884 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-30 10:46:36,884 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-30 10:46:36,884 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-30 10:46:36,888 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:46:36" (1/1) ... [2025-04-30 10:46:36,901 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:46:36" (1/1) ... [2025-04-30 10:46:36,927 INFO L138 Inliner]: procedures = 184, calls = 145, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 236 [2025-04-30 10:46:36,927 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-30 10:46:36,928 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-30 10:46:36,928 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-30 10:46:36,928 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-30 10:46:36,941 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:46:36" (1/1) ... [2025-04-30 10:46:36,941 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:46:36" (1/1) ... [2025-04-30 10:46:36,947 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:46:36" (1/1) ... [2025-04-30 10:46:36,977 INFO L175 MemorySlicer]: Split 91 memory accesses to 3 slices as follows [2, 70, 19]. 77 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 0, 9]. The 44 writes are split as follows [0, 38, 6]. [2025-04-30 10:46:36,977 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:46:36" (1/1) ... [2025-04-30 10:46:36,977 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:46:36" (1/1) ... [2025-04-30 10:46:36,996 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:46:36" (1/1) ... [2025-04-30 10:46:36,997 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:46:36" (1/1) ... [2025-04-30 10:46:37,006 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:46:36" (1/1) ... [2025-04-30 10:46:37,008 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:46:36" (1/1) ... [2025-04-30 10:46:37,010 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:46:36" (1/1) ... [2025-04-30 10:46:37,015 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-30 10:46:37,016 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-30 10:46:37,016 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-30 10:46:37,016 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-30 10:46:37,016 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:46:36" (1/1) ... [2025-04-30 10:46:37,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:46:37,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:46:37,041 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-30 10:46:37,046 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-30 10:46:37,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-30 10:46:37,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-30 10:46:37,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-04-30 10:46:37,060 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2025-04-30 10:46:37,061 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2025-04-30 10:46:37,061 INFO L130 BoogieDeclarations]: Found specification of procedure event_precess [2025-04-30 10:46:37,061 INFO L138 BoogieDeclarations]: Found implementation of procedure event_precess [2025-04-30 10:46:37,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-30 10:46:37,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-30 10:46:37,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-04-30 10:46:37,061 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-30 10:46:37,061 INFO L130 BoogieDeclarations]: Found specification of procedure ASNull [2025-04-30 10:46:37,061 INFO L138 BoogieDeclarations]: Found implementation of procedure ASNull [2025-04-30 10:46:37,061 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-30 10:46:37,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-30 10:46:37,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-04-30 10:46:37,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-04-30 10:46:37,061 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-30 10:46:37,062 INFO L130 BoogieDeclarations]: Found specification of procedure ASStart [2025-04-30 10:46:37,062 INFO L138 BoogieDeclarations]: Found implementation of procedure ASStart [2025-04-30 10:46:37,062 INFO L130 BoogieDeclarations]: Found specification of procedure status_update [2025-04-30 10:46:37,062 INFO L138 BoogieDeclarations]: Found implementation of procedure status_update [2025-04-30 10:46:37,062 INFO L130 BoogieDeclarations]: Found specification of procedure message_send [2025-04-30 10:46:37,062 INFO L138 BoogieDeclarations]: Found implementation of procedure message_send [2025-04-30 10:46:37,062 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-30 10:46:37,062 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-04-30 10:46:37,062 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-04-30 10:46:37,062 INFO L130 BoogieDeclarations]: Found specification of procedure ASIdle [2025-04-30 10:46:37,062 INFO L138 BoogieDeclarations]: Found implementation of procedure ASIdle [2025-04-30 10:46:37,062 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-30 10:46:37,062 INFO L130 BoogieDeclarations]: Found specification of procedure system_initialize [2025-04-30 10:46:37,063 INFO L138 BoogieDeclarations]: Found implementation of procedure system_initialize [2025-04-30 10:46:37,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-30 10:46:37,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-30 10:46:37,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-30 10:46:37,063 INFO L130 BoogieDeclarations]: Found specification of procedure ASStop [2025-04-30 10:46:37,063 INFO L138 BoogieDeclarations]: Found implementation of procedure ASStop [2025-04-30 10:46:37,063 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-30 10:46:37,063 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-30 10:46:37,181 INFO L234 CfgBuilder]: Building ICFG [2025-04-30 10:46:37,183 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-30 10:46:37,859 INFO L? ?]: Removed 322 outVars from TransFormulas that were not future-live. [2025-04-30 10:46:37,859 INFO L283 CfgBuilder]: Performing block encoding [2025-04-30 10:46:37,878 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-30 10:46:37,881 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-30 10:46:37,881 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:46:37 BoogieIcfgContainer [2025-04-30 10:46:37,881 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-30 10:46:37,883 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-30 10:46:37,883 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-30 10:46:37,886 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-30 10:46:37,886 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.04 10:46:36" (1/3) ... [2025-04-30 10:46:37,886 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14d34c36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:46:37, skipping insertion in model container [2025-04-30 10:46:37,886 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:46:36" (2/3) ... [2025-04-30 10:46:37,886 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14d34c36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:46:37, skipping insertion in model container [2025-04-30 10:46:37,886 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:46:37" (3/3) ... [2025-04-30 10:46:37,888 INFO L128 eAbstractionObserver]: Analyzing ICFG system-with-recursion.i [2025-04-30 10:46:37,897 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-30 10:46:37,900 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG system-with-recursion.i that has 10 procedures, 387 locations, 464 edges, 1 initial locations, 1 loop locations, and 158 error locations. [2025-04-30 10:46:37,936 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:46:37,946 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;@79d00cb4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:46:37,946 INFO L341 AbstractCegarLoop]: Starting to check reachability of 158 error locations. [2025-04-30 10:46:37,954 INFO L278 IsEmpty]: Start isEmpty. Operand has 387 states, 190 states have (on average 1.9842105263157894) internal successors, (377), 348 states have internal predecessors, (377), 29 states have call successors, (29), 9 states have call predecessors, (29), 9 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-04-30 10:46:37,958 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-30 10:46:37,958 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:46:37,958 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:46:37,959 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2025-04-30 10:46:37,962 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:46:37,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1798451593, now seen corresponding path program 1 times [2025-04-30 10:46:37,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:46:37,971 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741029019] [2025-04-30 10:46:37,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:46:37,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:46:38,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-30 10:46:38,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-30 10:46:38,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:46:38,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:46:38,216 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-30 10:46:38,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:46:38,217 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741029019] [2025-04-30 10:46:38,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741029019] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:46:38,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:46:38,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:46:38,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718415846] [2025-04-30 10:46:38,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:46:38,222 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:46:38,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:46:38,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:46:38,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:46:38,239 INFO L87 Difference]: Start difference. First operand has 387 states, 190 states have (on average 1.9842105263157894) internal successors, (377), 348 states have internal predecessors, (377), 29 states have call successors, (29), 9 states have call predecessors, (29), 9 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:46:38,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:46:38,591 INFO L93 Difference]: Finished difference Result 414 states and 479 transitions. [2025-04-30 10:46:38,592 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:46:38,593 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-30 10:46:38,594 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:46:38,601 INFO L225 Difference]: With dead ends: 414 [2025-04-30 10:46:38,602 INFO L226 Difference]: Without dead ends: 412 [2025-04-30 10:46:38,603 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-30 10:46:38,608 INFO L437 NwaCegarLoop]: 235 mSDtfsCounter, 386 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-30 10:46:38,608 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 281 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-30 10:46:38,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2025-04-30 10:46:38,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 380. [2025-04-30 10:46:38,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 202 states have (on average 1.8415841584158417) internal successors, (372), 336 states have internal predecessors, (372), 32 states have call successors, (32), 11 states have call predecessors, (32), 11 states have return successors, (37), 32 states have call predecessors, (37), 32 states have call successors, (37) [2025-04-30 10:46:38,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 441 transitions. [2025-04-30 10:46:38,668 INFO L79 Accepts]: Start accepts. Automaton has 380 states and 441 transitions. Word has length 7 [2025-04-30 10:46:38,668 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:46:38,668 INFO L485 AbstractCegarLoop]: Abstraction has 380 states and 441 transitions. [2025-04-30 10:46:38,668 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-30 10:46:38,668 INFO L278 IsEmpty]: Start isEmpty. Operand 380 states and 441 transitions. [2025-04-30 10:46:38,669 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-30 10:46:38,669 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:46:38,669 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:46:38,669 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-30 10:46:38,669 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2025-04-30 10:46:38,669 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:46:38,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1798451592, now seen corresponding path program 1 times [2025-04-30 10:46:38,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:46:38,670 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864648847] [2025-04-30 10:46:38,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:46:38,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:46:38,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-30 10:46:38,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-30 10:46:38,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:46:38,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:46:38,785 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-30 10:46:38,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:46:38,785 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864648847] [2025-04-30 10:46:38,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864648847] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:46:38,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:46:38,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:46:38,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630909819] [2025-04-30 10:46:38,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:46:38,787 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:46:38,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:46:38,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:46:38,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:46:38,787 INFO L87 Difference]: Start difference. First operand 380 states and 441 transitions. Second operand has 4 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:46:39,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:46:39,044 INFO L93 Difference]: Finished difference Result 377 states and 437 transitions. [2025-04-30 10:46:39,044 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:46:39,044 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-30 10:46:39,044 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:46:39,046 INFO L225 Difference]: With dead ends: 377 [2025-04-30 10:46:39,046 INFO L226 Difference]: Without dead ends: 377 [2025-04-30 10:46:39,046 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-30 10:46:39,046 INFO L437 NwaCegarLoop]: 385 mSDtfsCounter, 13 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 843 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:46:39,047 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 843 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:46:39,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2025-04-30 10:46:39,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2025-04-30 10:46:39,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 204 states have (on average 1.803921568627451) internal successors, (368), 332 states have internal predecessors, (368), 32 states have call successors, (32), 12 states have call predecessors, (32), 12 states have return successors, (37), 32 states have call predecessors, (37), 32 states have call successors, (37) [2025-04-30 10:46:39,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 437 transitions. [2025-04-30 10:46:39,063 INFO L79 Accepts]: Start accepts. Automaton has 377 states and 437 transitions. Word has length 7 [2025-04-30 10:46:39,063 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:46:39,063 INFO L485 AbstractCegarLoop]: Abstraction has 377 states and 437 transitions. [2025-04-30 10:46:39,063 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-30 10:46:39,063 INFO L278 IsEmpty]: Start isEmpty. Operand 377 states and 437 transitions. [2025-04-30 10:46:39,064 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-04-30 10:46:39,064 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:46:39,064 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:46:39,064 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-30 10:46:39,064 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2025-04-30 10:46:39,064 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:46:39,065 INFO L85 PathProgramCache]: Analyzing trace with hash -996852037, now seen corresponding path program 1 times [2025-04-30 10:46:39,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:46:39,065 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073814223] [2025-04-30 10:46:39,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:46:39,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:46:39,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-30 10:46:39,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-30 10:46:39,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:46:39,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:46:39,241 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-30 10:46:39,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:46:39,241 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073814223] [2025-04-30 10:46:39,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073814223] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:46:39,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:46:39,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:46:39,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812609905] [2025-04-30 10:46:39,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:46:39,242 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:46:39,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:46:39,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:46:39,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:46:39,243 INFO L87 Difference]: Start difference. First operand 377 states and 437 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:46:39,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:46:39,548 INFO L93 Difference]: Finished difference Result 376 states and 436 transitions. [2025-04-30 10:46:39,549 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:46:39,549 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-30 10:46:39,549 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:46:39,551 INFO L225 Difference]: With dead ends: 376 [2025-04-30 10:46:39,552 INFO L226 Difference]: Without dead ends: 376 [2025-04-30 10:46:39,552 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-30 10:46:39,552 INFO L437 NwaCegarLoop]: 389 mSDtfsCounter, 2 mSDsluCounter, 713 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1102 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-30 10:46:39,552 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1102 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-30 10:46:39,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2025-04-30 10:46:39,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 376. [2025-04-30 10:46:39,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 204 states have (on average 1.7990196078431373) internal successors, (367), 331 states have internal predecessors, (367), 32 states have call successors, (32), 12 states have call predecessors, (32), 12 states have return successors, (37), 32 states have call predecessors, (37), 32 states have call successors, (37) [2025-04-30 10:46:39,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 436 transitions. [2025-04-30 10:46:39,567 INFO L79 Accepts]: Start accepts. Automaton has 376 states and 436 transitions. Word has length 11 [2025-04-30 10:46:39,567 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:46:39,567 INFO L485 AbstractCegarLoop]: Abstraction has 376 states and 436 transitions. [2025-04-30 10:46:39,567 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-30 10:46:39,567 INFO L278 IsEmpty]: Start isEmpty. Operand 376 states and 436 transitions. [2025-04-30 10:46:39,567 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-04-30 10:46:39,568 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:46:39,568 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:46:39,568 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-30 10:46:39,568 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2025-04-30 10:46:39,568 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:46:39,568 INFO L85 PathProgramCache]: Analyzing trace with hash -996852036, now seen corresponding path program 1 times [2025-04-30 10:46:39,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:46:39,568 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114155007] [2025-04-30 10:46:39,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:46:39,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:46:39,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-30 10:46:39,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-30 10:46:39,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:46:39,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:46:39,750 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-30 10:46:39,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:46:39,751 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114155007] [2025-04-30 10:46:39,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114155007] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:46:39,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:46:39,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:46:39,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588943437] [2025-04-30 10:46:39,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:46:39,751 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:46:39,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:46:39,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:46:39,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:46:39,752 INFO L87 Difference]: Start difference. First operand 376 states and 436 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:46:40,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:46:40,058 INFO L93 Difference]: Finished difference Result 375 states and 435 transitions. [2025-04-30 10:46:40,058 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:46:40,059 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-30 10:46:40,059 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:46:40,060 INFO L225 Difference]: With dead ends: 375 [2025-04-30 10:46:40,061 INFO L226 Difference]: Without dead ends: 375 [2025-04-30 10:46:40,061 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-30 10:46:40,062 INFO L437 NwaCegarLoop]: 389 mSDtfsCounter, 1 mSDsluCounter, 694 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1083 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-30 10:46:40,062 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1083 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-30 10:46:40,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2025-04-30 10:46:40,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 375. [2025-04-30 10:46:40,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 204 states have (on average 1.7941176470588236) internal successors, (366), 330 states have internal predecessors, (366), 32 states have call successors, (32), 12 states have call predecessors, (32), 12 states have return successors, (37), 32 states have call predecessors, (37), 32 states have call successors, (37) [2025-04-30 10:46:40,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 435 transitions. [2025-04-30 10:46:40,077 INFO L79 Accepts]: Start accepts. Automaton has 375 states and 435 transitions. Word has length 11 [2025-04-30 10:46:40,078 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:46:40,078 INFO L485 AbstractCegarLoop]: Abstraction has 375 states and 435 transitions. [2025-04-30 10:46:40,078 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-30 10:46:40,078 INFO L278 IsEmpty]: Start isEmpty. Operand 375 states and 435 transitions. [2025-04-30 10:46:40,078 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-30 10:46:40,078 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:46:40,078 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:46:40,078 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-30 10:46:40,078 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2025-04-30 10:46:40,079 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:46:40,079 INFO L85 PathProgramCache]: Analyzing trace with hash -880937440, now seen corresponding path program 1 times [2025-04-30 10:46:40,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:46:40,079 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483575068] [2025-04-30 10:46:40,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:46:40,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:46:40,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-30 10:46:40,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-30 10:46:40,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:46:40,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:46:40,142 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-30 10:46:40,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:46:40,143 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483575068] [2025-04-30 10:46:40,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483575068] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:46:40,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:46:40,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:46:40,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307249928] [2025-04-30 10:46:40,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:46:40,144 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:46:40,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:46:40,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:46:40,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:46:40,147 INFO L87 Difference]: Start difference. First operand 375 states and 435 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:46:40,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:46:40,282 INFO L93 Difference]: Finished difference Result 374 states and 434 transitions. [2025-04-30 10:46:40,283 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:46:40,283 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-30 10:46:40,283 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:46:40,284 INFO L225 Difference]: With dead ends: 374 [2025-04-30 10:46:40,285 INFO L226 Difference]: Without dead ends: 374 [2025-04-30 10:46:40,285 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-30 10:46:40,285 INFO L437 NwaCegarLoop]: 390 mSDtfsCounter, 1 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:46:40,286 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 635 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:46:40,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2025-04-30 10:46:40,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 374. [2025-04-30 10:46:40,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 204 states have (on average 1.7892156862745099) internal successors, (365), 329 states have internal predecessors, (365), 32 states have call successors, (32), 12 states have call predecessors, (32), 12 states have return successors, (37), 32 states have call predecessors, (37), 32 states have call successors, (37) [2025-04-30 10:46:40,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 434 transitions. [2025-04-30 10:46:40,302 INFO L79 Accepts]: Start accepts. Automaton has 374 states and 434 transitions. Word has length 17 [2025-04-30 10:46:40,302 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:46:40,302 INFO L485 AbstractCegarLoop]: Abstraction has 374 states and 434 transitions. [2025-04-30 10:46:40,302 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-30 10:46:40,303 INFO L278 IsEmpty]: Start isEmpty. Operand 374 states and 434 transitions. [2025-04-30 10:46:40,303 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-30 10:46:40,303 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:46:40,303 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:46:40,303 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-30 10:46:40,304 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2025-04-30 10:46:40,304 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:46:40,305 INFO L85 PathProgramCache]: Analyzing trace with hash -880937439, now seen corresponding path program 1 times [2025-04-30 10:46:40,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:46:40,305 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286783625] [2025-04-30 10:46:40,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:46:40,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:46:40,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-30 10:46:40,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-30 10:46:40,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:46:40,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:46:40,391 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-30 10:46:40,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:46:40,391 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286783625] [2025-04-30 10:46:40,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286783625] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:46:40,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:46:40,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:46:40,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600674503] [2025-04-30 10:46:40,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:46:40,392 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:46:40,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:46:40,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:46:40,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:46:40,393 INFO L87 Difference]: Start difference. First operand 374 states and 434 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:46:40,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:46:40,572 INFO L93 Difference]: Finished difference Result 373 states and 433 transitions. [2025-04-30 10:46:40,572 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:46:40,573 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-30 10:46:40,573 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:46:40,574 INFO L225 Difference]: With dead ends: 373 [2025-04-30 10:46:40,575 INFO L226 Difference]: Without dead ends: 373 [2025-04-30 10:46:40,575 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-30 10:46:40,576 INFO L437 NwaCegarLoop]: 390 mSDtfsCounter, 1 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:46:40,576 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 622 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:46:40,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2025-04-30 10:46:40,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 373. [2025-04-30 10:46:40,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 204 states have (on average 1.7843137254901962) internal successors, (364), 328 states have internal predecessors, (364), 32 states have call successors, (32), 12 states have call predecessors, (32), 12 states have return successors, (37), 32 states have call predecessors, (37), 32 states have call successors, (37) [2025-04-30 10:46:40,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 433 transitions. [2025-04-30 10:46:40,591 INFO L79 Accepts]: Start accepts. Automaton has 373 states and 433 transitions. Word has length 17 [2025-04-30 10:46:40,592 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:46:40,592 INFO L485 AbstractCegarLoop]: Abstraction has 373 states and 433 transitions. [2025-04-30 10:46:40,592 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-30 10:46:40,592 INFO L278 IsEmpty]: Start isEmpty. Operand 373 states and 433 transitions. [2025-04-30 10:46:40,593 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-30 10:46:40,593 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:46:40,593 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-30 10:46:40,593 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-30 10:46:40,593 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2025-04-30 10:46:40,593 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:46:40,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1756576041, now seen corresponding path program 1 times [2025-04-30 10:46:40,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:46:40,594 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676350962] [2025-04-30 10:46:40,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:46:40,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:46:40,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-30 10:46:40,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-30 10:46:40,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:46:40,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:46:40,777 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-30 10:46:40,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:46:40,778 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676350962] [2025-04-30 10:46:40,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676350962] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:46:40,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:46:40,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-30 10:46:40,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599917764] [2025-04-30 10:46:40,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:46:40,779 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-30 10:46:40,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:46:40,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-30 10:46:40,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:46:40,780 INFO L87 Difference]: Start difference. First operand 373 states and 433 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:46:41,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:46:41,267 INFO L93 Difference]: Finished difference Result 386 states and 449 transitions. [2025-04-30 10:46:41,268 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-30 10:46:41,268 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-30 10:46:41,268 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:46:41,270 INFO L225 Difference]: With dead ends: 386 [2025-04-30 10:46:41,270 INFO L226 Difference]: Without dead ends: 386 [2025-04-30 10:46:41,270 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-30 10:46:41,271 INFO L437 NwaCegarLoop]: 174 mSDtfsCounter, 1016 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1016 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-30 10:46:41,271 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1016 Valid, 331 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-30 10:46:41,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2025-04-30 10:46:41,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 354. [2025-04-30 10:46:41,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 204 states have (on average 1.6813725490196079) internal successors, (343), 309 states have internal predecessors, (343), 32 states have call successors, (32), 12 states have call predecessors, (32), 12 states have return successors, (37), 32 states have call predecessors, (37), 32 states have call successors, (37) [2025-04-30 10:46:41,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 412 transitions. [2025-04-30 10:46:41,282 INFO L79 Accepts]: Start accepts. Automaton has 354 states and 412 transitions. Word has length 20 [2025-04-30 10:46:41,282 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:46:41,282 INFO L485 AbstractCegarLoop]: Abstraction has 354 states and 412 transitions. [2025-04-30 10:46:41,282 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-30 10:46:41,282 INFO L278 IsEmpty]: Start isEmpty. Operand 354 states and 412 transitions. [2025-04-30 10:46:41,283 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-30 10:46:41,283 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:46:41,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] [2025-04-30 10:46:41,283 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-30 10:46:41,283 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ASNullErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2025-04-30 10:46:41,283 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:46:41,284 INFO L85 PathProgramCache]: Analyzing trace with hash 83868256, now seen corresponding path program 1 times [2025-04-30 10:46:41,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:46:41,284 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943152095] [2025-04-30 10:46:41,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:46:41,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:46:41,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-30 10:46:41,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-30 10:46:41,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:46:41,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:46:41,420 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-30 10:46:41,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:46:41,420 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943152095] [2025-04-30 10:46:41,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943152095] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:46:41,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:46:41,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-30 10:46:41,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211937080] [2025-04-30 10:46:41,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:46:41,422 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-30 10:46:41,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:46:41,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-30 10:46:41,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:46:41,422 INFO L87 Difference]: Start difference. First operand 354 states and 412 transitions. Second operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:46:41,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:46:41,799 INFO L93 Difference]: Finished difference Result 387 states and 458 transitions. [2025-04-30 10:46:41,799 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-30 10:46:41,799 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-30 10:46:41,799 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:46:41,801 INFO L225 Difference]: With dead ends: 387 [2025-04-30 10:46:41,801 INFO L226 Difference]: Without dead ends: 387 [2025-04-30 10:46:41,801 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-30 10:46:41,801 INFO L437 NwaCegarLoop]: 363 mSDtfsCounter, 43 mSDsluCounter, 1064 mSDsCounter, 0 mSdLazyCounter, 803 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 1427 SdHoareTripleChecker+Invalid, 805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 803 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-30 10:46:41,801 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 1427 Invalid, 805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 803 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-30 10:46:41,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2025-04-30 10:46:41,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 375. [2025-04-30 10:46:41,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 222 states have (on average 1.662162162162162) internal successors, (369), 327 states have internal predecessors, (369), 33 states have call successors, (33), 14 states have call predecessors, (33), 14 states have return successors, (40), 33 states have call predecessors, (40), 33 states have call successors, (40) [2025-04-30 10:46:41,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 442 transitions. [2025-04-30 10:46:41,816 INFO L79 Accepts]: Start accepts. Automaton has 375 states and 442 transitions. Word has length 26 [2025-04-30 10:46:41,816 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:46:41,816 INFO L485 AbstractCegarLoop]: Abstraction has 375 states and 442 transitions. [2025-04-30 10:46:41,816 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-30 10:46:41,816 INFO L278 IsEmpty]: Start isEmpty. Operand 375 states and 442 transitions. [2025-04-30 10:46:41,817 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-30 10:46:41,818 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:46:41,818 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-30 10:46:41,818 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-30 10:46:41,818 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ASNullErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2025-04-30 10:46:41,818 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:46:41,819 INFO L85 PathProgramCache]: Analyzing trace with hash 83868257, now seen corresponding path program 1 times [2025-04-30 10:46:41,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:46:41,819 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976675416] [2025-04-30 10:46:41,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:46:41,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:46:41,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-30 10:46:41,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-30 10:46:41,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:46:41,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:46:42,039 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-30 10:46:42,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:46:42,040 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976675416] [2025-04-30 10:46:42,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976675416] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:46:42,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:46:42,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-30 10:46:42,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367372023] [2025-04-30 10:46:42,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:46:42,040 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-30 10:46:42,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:46:42,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-30 10:46:42,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:46:42,041 INFO L87 Difference]: Start difference. First operand 375 states and 442 transitions. Second operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:46:42,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:46:42,440 INFO L93 Difference]: Finished difference Result 386 states and 457 transitions. [2025-04-30 10:46:42,440 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-30 10:46:42,440 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-30 10:46:42,440 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:46:42,442 INFO L225 Difference]: With dead ends: 386 [2025-04-30 10:46:42,442 INFO L226 Difference]: Without dead ends: 386 [2025-04-30 10:46:42,442 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-30 10:46:42,442 INFO L437 NwaCegarLoop]: 364 mSDtfsCounter, 42 mSDsluCounter, 1097 mSDsCounter, 0 mSdLazyCounter, 769 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 1461 SdHoareTripleChecker+Invalid, 771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-30 10:46:42,442 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 1461 Invalid, 771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 769 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-30 10:46:42,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2025-04-30 10:46:42,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 375. [2025-04-30 10:46:42,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 222 states have (on average 1.6576576576576576) internal successors, (368), 327 states have internal predecessors, (368), 33 states have call successors, (33), 14 states have call predecessors, (33), 14 states have return successors, (40), 33 states have call predecessors, (40), 33 states have call successors, (40) [2025-04-30 10:46:42,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 441 transitions. [2025-04-30 10:46:42,449 INFO L79 Accepts]: Start accepts. Automaton has 375 states and 441 transitions. Word has length 26 [2025-04-30 10:46:42,450 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:46:42,450 INFO L485 AbstractCegarLoop]: Abstraction has 375 states and 441 transitions. [2025-04-30 10:46:42,450 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-30 10:46:42,450 INFO L278 IsEmpty]: Start isEmpty. Operand 375 states and 441 transitions. [2025-04-30 10:46:42,450 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-30 10:46:42,450 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:46:42,450 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-30 10:46:42,451 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-30 10:46:42,451 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2025-04-30 10:46:42,451 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:46:42,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1697872296, now seen corresponding path program 1 times [2025-04-30 10:46:42,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:46:42,451 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724840227] [2025-04-30 10:46:42,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:46:42,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:46:42,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-30 10:46:42,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-30 10:46:42,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:46:42,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:46:42,603 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-30 10:46:42,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:46:42,603 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724840227] [2025-04-30 10:46:42,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724840227] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:46:42,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:46:42,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-30 10:46:42,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083185446] [2025-04-30 10:46:42,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:46:42,604 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:46:42,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:46:42,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:46:42,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:46:42,604 INFO L87 Difference]: Start difference. First operand 375 states and 441 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:46:42,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:46:42,744 INFO L93 Difference]: Finished difference Result 425 states and 492 transitions. [2025-04-30 10:46:42,744 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-30 10:46:42,744 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-30 10:46:42,744 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:46:42,745 INFO L225 Difference]: With dead ends: 425 [2025-04-30 10:46:42,745 INFO L226 Difference]: Without dead ends: 425 [2025-04-30 10:46:42,746 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:46:42,746 INFO L437 NwaCegarLoop]: 364 mSDtfsCounter, 58 mSDsluCounter, 1373 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 1737 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:46:42,746 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 1737 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:46:42,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2025-04-30 10:46:42,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 413. [2025-04-30 10:46:42,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 251 states have (on average 1.6015936254980079) internal successors, (402), 356 states have internal predecessors, (402), 37 states have call successors, (37), 18 states have call predecessors, (37), 19 states have return successors, (50), 38 states have call predecessors, (50), 37 states have call successors, (50) [2025-04-30 10:46:42,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 489 transitions. [2025-04-30 10:46:42,755 INFO L79 Accepts]: Start accepts. Automaton has 413 states and 489 transitions. Word has length 27 [2025-04-30 10:46:42,755 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:46:42,756 INFO L485 AbstractCegarLoop]: Abstraction has 413 states and 489 transitions. [2025-04-30 10:46:42,756 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-30 10:46:42,756 INFO L278 IsEmpty]: Start isEmpty. Operand 413 states and 489 transitions. [2025-04-30 10:46:42,758 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-04-30 10:46:42,758 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:46:42,758 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-30 10:46:42,758 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-30 10:46:42,759 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting system_initializeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2025-04-30 10:46:42,759 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:46:42,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1466731203, now seen corresponding path program 1 times [2025-04-30 10:46:42,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:46:42,760 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629912106] [2025-04-30 10:46:42,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:46:42,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:46:42,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-30 10:46:42,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-30 10:46:42,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:46:42,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:46:42,828 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-30 10:46:42,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:46:42,828 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629912106] [2025-04-30 10:46:42,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629912106] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:46:42,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:46:42,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:46:42,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226175388] [2025-04-30 10:46:42,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:46:42,829 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:46:42,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:46:42,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:46:42,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:46:42,829 INFO L87 Difference]: Start difference. First operand 413 states and 489 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-30 10:46:42,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:46:42,866 INFO L93 Difference]: Finished difference Result 423 states and 499 transitions. [2025-04-30 10:46:42,866 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:46:42,867 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-30 10:46:42,867 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:46:42,868 INFO L225 Difference]: With dead ends: 423 [2025-04-30 10:46:42,868 INFO L226 Difference]: Without dead ends: 421 [2025-04-30 10:46:42,868 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-30 10:46:42,869 INFO L437 NwaCegarLoop]: 365 mSDtfsCounter, 12 mSDsluCounter, 710 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1075 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:46:42,869 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1075 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:46:42,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2025-04-30 10:46:42,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 421. [2025-04-30 10:46:42,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 258 states have (on average 1.5891472868217054) internal successors, (410), 363 states have internal predecessors, (410), 37 states have call successors, (37), 19 states have call predecessors, (37), 20 states have return successors, (50), 38 states have call predecessors, (50), 37 states have call successors, (50) [2025-04-30 10:46:42,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 497 transitions. [2025-04-30 10:46:42,880 INFO L79 Accepts]: Start accepts. Automaton has 421 states and 497 transitions. Word has length 38 [2025-04-30 10:46:42,880 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:46:42,880 INFO L485 AbstractCegarLoop]: Abstraction has 421 states and 497 transitions. [2025-04-30 10:46:42,881 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-30 10:46:42,881 INFO L278 IsEmpty]: Start isEmpty. Operand 421 states and 497 transitions. [2025-04-30 10:46:42,882 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-30 10:46:42,882 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:46:42,882 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-30 10:46:42,882 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-30 10:46:42,882 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2025-04-30 10:46:42,883 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:46:42,883 INFO L85 PathProgramCache]: Analyzing trace with hash -850465204, now seen corresponding path program 1 times [2025-04-30 10:46:42,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:46:42,883 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088021442] [2025-04-30 10:46:42,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:46:42,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:46:42,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-30 10:46:42,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-30 10:46:42,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:46:42,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:46:43,064 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-30 10:46:43,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:46:43,064 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088021442] [2025-04-30 10:46:43,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088021442] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:46:43,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:46:43,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-30 10:46:43,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630194577] [2025-04-30 10:46:43,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:46:43,066 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-30 10:46:43,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:46:43,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-30 10:46:43,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:46:43,066 INFO L87 Difference]: Start difference. First operand 421 states and 497 transitions. Second operand has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-30 10:46:43,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:46:43,490 INFO L93 Difference]: Finished difference Result 465 states and 564 transitions. [2025-04-30 10:46:43,491 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-30 10:46:43,491 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-30 10:46:43,491 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:46:43,493 INFO L225 Difference]: With dead ends: 465 [2025-04-30 10:46:43,494 INFO L226 Difference]: Without dead ends: 458 [2025-04-30 10:46:43,494 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-30 10:46:43,494 INFO L437 NwaCegarLoop]: 322 mSDtfsCounter, 289 mSDsluCounter, 2048 mSDsCounter, 0 mSdLazyCounter, 707 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 2370 SdHoareTripleChecker+Invalid, 750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-30 10:46:43,495 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 2370 Invalid, 750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 707 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-30 10:46:43,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2025-04-30 10:46:43,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 423. [2025-04-30 10:46:43,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 259 states have (on average 1.583011583011583) internal successors, (410), 365 states have internal predecessors, (410), 37 states have call successors, (37), 19 states have call predecessors, (37), 21 states have return successors, (51), 38 states have call predecessors, (51), 37 states have call successors, (51) [2025-04-30 10:46:43,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 498 transitions. [2025-04-30 10:46:43,508 INFO L79 Accepts]: Start accepts. Automaton has 423 states and 498 transitions. Word has length 37 [2025-04-30 10:46:43,508 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:46:43,508 INFO L485 AbstractCegarLoop]: Abstraction has 423 states and 498 transitions. [2025-04-30 10:46:43,508 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-30 10:46:43,509 INFO L278 IsEmpty]: Start isEmpty. Operand 423 states and 498 transitions. [2025-04-30 10:46:43,510 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-30 10:46:43,510 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:46:43,510 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-30 10:46:43,510 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-30 10:46:43,510 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting system_initializeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2025-04-30 10:46:43,510 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:46:43,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1140093467, now seen corresponding path program 1 times [2025-04-30 10:46:43,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:46:43,511 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642140212] [2025-04-30 10:46:43,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:46:43,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:46:43,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-30 10:46:43,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-30 10:46:43,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:46:43,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:46:43,674 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-30 10:46:43,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:46:43,674 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642140212] [2025-04-30 10:46:43,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642140212] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:46:43,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:46:43,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-30 10:46:43,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129122172] [2025-04-30 10:46:43,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:46:43,675 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-30 10:46:43,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:46:43,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-30 10:46:43,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:46:43,676 INFO L87 Difference]: Start difference. First operand 423 states and 498 transitions. Second operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-30 10:46:44,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:46:44,427 INFO L93 Difference]: Finished difference Result 604 states and 805 transitions. [2025-04-30 10:46:44,428 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-30 10:46:44,428 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 40 [2025-04-30 10:46:44,428 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:46:44,431 INFO L225 Difference]: With dead ends: 604 [2025-04-30 10:46:44,431 INFO L226 Difference]: Without dead ends: 598 [2025-04-30 10:46:44,431 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2025-04-30 10:46:44,431 INFO L437 NwaCegarLoop]: 473 mSDtfsCounter, 450 mSDsluCounter, 1662 mSDsCounter, 0 mSdLazyCounter, 1017 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 2135 SdHoareTripleChecker+Invalid, 1159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 1017 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-30 10:46:44,433 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [450 Valid, 2135 Invalid, 1159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 1017 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-30 10:46:44,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2025-04-30 10:46:44,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 527. [2025-04-30 10:46:44,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 339 states have (on average 1.519174041297935) internal successors, (515), 440 states have internal predecessors, (515), 49 states have call successors, (49), 24 states have call predecessors, (49), 33 states have return successors, (117), 62 states have call predecessors, (117), 49 states have call successors, (117) [2025-04-30 10:46:44,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 681 transitions. [2025-04-30 10:46:44,453 INFO L79 Accepts]: Start accepts. Automaton has 527 states and 681 transitions. Word has length 40 [2025-04-30 10:46:44,454 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:46:44,454 INFO L485 AbstractCegarLoop]: Abstraction has 527 states and 681 transitions. [2025-04-30 10:46:44,454 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-30 10:46:44,454 INFO L278 IsEmpty]: Start isEmpty. Operand 527 states and 681 transitions. [2025-04-30 10:46:44,455 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-04-30 10:46:44,456 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:46:44,456 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-30 10:46:44,456 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-30 10:46:44,456 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting system_initializeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2025-04-30 10:46:44,456 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:46:44,456 INFO L85 PathProgramCache]: Analyzing trace with hash 884069767, now seen corresponding path program 1 times [2025-04-30 10:46:44,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:46:44,457 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328621064] [2025-04-30 10:46:44,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:46:44,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:46:44,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-30 10:46:44,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-30 10:46:44,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:46:44,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:46:44,926 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-30 10:46:44,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:46:44,927 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328621064] [2025-04-30 10:46:44,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328621064] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:46:44,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:46:44,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-30 10:46:44,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429913030] [2025-04-30 10:46:44,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:46:44,927 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-30 10:46:44,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:46:44,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-30 10:46:44,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:46:44,928 INFO L87 Difference]: Start difference. First operand 527 states and 681 transitions. Second operand has 9 states, 8 states have (on average 4.375) internal successors, (35), 9 states have internal predecessors, (35), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-30 10:46:45,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:46:45,641 INFO L93 Difference]: Finished difference Result 808 states and 1143 transitions. [2025-04-30 10:46:45,641 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-30 10:46:45,641 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-30 10:46:45,642 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:46:45,645 INFO L225 Difference]: With dead ends: 808 [2025-04-30 10:46:45,645 INFO L226 Difference]: Without dead ends: 806 [2025-04-30 10:46:45,646 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-30 10:46:45,646 INFO L437 NwaCegarLoop]: 302 mSDtfsCounter, 552 mSDsluCounter, 1012 mSDsCounter, 0 mSdLazyCounter, 1011 mSolverCounterSat, 218 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 555 SdHoareTripleChecker+Valid, 1314 SdHoareTripleChecker+Invalid, 1229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 218 IncrementalHoareTripleChecker+Valid, 1011 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-30 10:46:45,646 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [555 Valid, 1314 Invalid, 1229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [218 Valid, 1011 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-30 10:46:45,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2025-04-30 10:46:45,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 662. [2025-04-30 10:46:45,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 444 states have (on average 1.481981981981982) internal successors, (658), 546 states have internal predecessors, (658), 64 states have call successors, (64), 32 states have call predecessors, (64), 48 states have return successors, (180), 83 states have call predecessors, (180), 64 states have call successors, (180) [2025-04-30 10:46:45,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 902 transitions. [2025-04-30 10:46:45,668 INFO L79 Accepts]: Start accepts. Automaton has 662 states and 902 transitions. Word has length 42 [2025-04-30 10:46:45,668 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:46:45,668 INFO L485 AbstractCegarLoop]: Abstraction has 662 states and 902 transitions. [2025-04-30 10:46:45,668 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-30 10:46:45,668 INFO L278 IsEmpty]: Start isEmpty. Operand 662 states and 902 transitions. [2025-04-30 10:46:45,668 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-04-30 10:46:45,668 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:46:45,669 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-30 10:46:45,669 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-30 10:46:45,669 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting system_initializeErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2025-04-30 10:46:45,669 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:46:45,669 INFO L85 PathProgramCache]: Analyzing trace with hash 884069768, now seen corresponding path program 1 times [2025-04-30 10:46:45,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:46:45,669 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029937821] [2025-04-30 10:46:45,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:46:45,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:46:45,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-30 10:46:45,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-30 10:46:45,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:46:45,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:46:46,465 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-30 10:46:46,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:46:46,466 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029937821] [2025-04-30 10:46:46,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029937821] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:46:46,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:46:46,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-30 10:46:46,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345313097] [2025-04-30 10:46:46,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:46:46,466 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-30 10:46:46,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:46:46,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-30 10:46:46,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-04-30 10:46:46,467 INFO L87 Difference]: Start difference. First operand 662 states and 902 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-30 10:46:47,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:46:47,308 INFO L93 Difference]: Finished difference Result 879 states and 1194 transitions. [2025-04-30 10:46:47,309 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-30 10:46:47,309 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-30 10:46:47,309 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:46:47,312 INFO L225 Difference]: With dead ends: 879 [2025-04-30 10:46:47,312 INFO L226 Difference]: Without dead ends: 879 [2025-04-30 10:46:47,314 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-30 10:46:47,314 INFO L437 NwaCegarLoop]: 296 mSDtfsCounter, 956 mSDsluCounter, 822 mSDsCounter, 0 mSdLazyCounter, 945 mSolverCounterSat, 343 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 959 SdHoareTripleChecker+Valid, 1118 SdHoareTripleChecker+Invalid, 1288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 343 IncrementalHoareTripleChecker+Valid, 945 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-30 10:46:47,315 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [959 Valid, 1118 Invalid, 1288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [343 Valid, 945 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-30 10:46:47,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2025-04-30 10:46:47,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 676. [2025-04-30 10:46:47,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 676 states, 457 states have (on average 1.4660831509846828) internal successors, (670), 551 states have internal predecessors, (670), 61 states have call successors, (61), 32 states have call predecessors, (61), 52 states have return successors, (198), 92 states have call predecessors, (198), 61 states have call successors, (198) [2025-04-30 10:46:47,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 929 transitions. [2025-04-30 10:46:47,337 INFO L79 Accepts]: Start accepts. Automaton has 676 states and 929 transitions. Word has length 42 [2025-04-30 10:46:47,337 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:46:47,337 INFO L485 AbstractCegarLoop]: Abstraction has 676 states and 929 transitions. [2025-04-30 10:46:47,337 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-30 10:46:47,338 INFO L278 IsEmpty]: Start isEmpty. Operand 676 states and 929 transitions. [2025-04-30 10:46:47,339 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-04-30 10:46:47,339 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:46:47,339 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-30 10:46:47,339 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-30 10:46:47,339 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting system_initializeErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2025-04-30 10:46:47,339 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:46:47,339 INFO L85 PathProgramCache]: Analyzing trace with hash -812476152, now seen corresponding path program 1 times [2025-04-30 10:46:47,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:46:47,340 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328106946] [2025-04-30 10:46:47,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:46:47,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:46:47,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-04-30 10:46:47,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-04-30 10:46:47,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:46:47,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:46:47,398 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-30 10:46:47,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:46:47,400 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328106946] [2025-04-30 10:46:47,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328106946] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:46:47,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:46:47,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:46:47,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596782265] [2025-04-30 10:46:47,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:46:47,400 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:46:47,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:46:47,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:46:47,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:46:47,400 INFO L87 Difference]: Start difference. First operand 676 states and 929 transitions. Second operand has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-30 10:46:47,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:46:47,526 INFO L93 Difference]: Finished difference Result 674 states and 925 transitions. [2025-04-30 10:46:47,526 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:46:47,526 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-30 10:46:47,526 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:46:47,529 INFO L225 Difference]: With dead ends: 674 [2025-04-30 10:46:47,529 INFO L226 Difference]: Without dead ends: 674 [2025-04-30 10:46:47,529 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-30 10:46:47,529 INFO L437 NwaCegarLoop]: 362 mSDtfsCounter, 5 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:46:47,529 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 582 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:46:47,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2025-04-30 10:46:47,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 674. [2025-04-30 10:46:47,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 674 states, 457 states have (on average 1.4573304157549234) internal successors, (666), 549 states have internal predecessors, (666), 61 states have call successors, (61), 32 states have call predecessors, (61), 52 states have return successors, (198), 92 states have call predecessors, (198), 61 states have call successors, (198) [2025-04-30 10:46:47,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 925 transitions. [2025-04-30 10:46:47,546 INFO L79 Accepts]: Start accepts. Automaton has 674 states and 925 transitions. Word has length 44 [2025-04-30 10:46:47,546 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:46:47,546 INFO L485 AbstractCegarLoop]: Abstraction has 674 states and 925 transitions. [2025-04-30 10:46:47,546 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-30 10:46:47,546 INFO L278 IsEmpty]: Start isEmpty. Operand 674 states and 925 transitions. [2025-04-30 10:46:47,547 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-04-30 10:46:47,547 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:46:47,547 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-30 10:46:47,547 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-30 10:46:47,547 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting system_initializeErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2025-04-30 10:46:47,548 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:46:47,548 INFO L85 PathProgramCache]: Analyzing trace with hash -812476151, now seen corresponding path program 1 times [2025-04-30 10:46:47,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:46:47,548 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559133057] [2025-04-30 10:46:47,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:46:47,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:46:47,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-04-30 10:46:47,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-04-30 10:46:47,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:46:47,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:46:47,636 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-30 10:46:47,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:46:47,636 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559133057] [2025-04-30 10:46:47,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559133057] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:46:47,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:46:47,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:46:47,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266408525] [2025-04-30 10:46:47,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:46:47,637 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:46:47,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:46:47,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:46:47,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:46:47,638 INFO L87 Difference]: Start difference. First operand 674 states and 925 transitions. Second operand has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-30 10:46:47,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:46:47,767 INFO L93 Difference]: Finished difference Result 672 states and 921 transitions. [2025-04-30 10:46:47,768 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:46:47,768 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-30 10:46:47,768 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:46:47,770 INFO L225 Difference]: With dead ends: 672 [2025-04-30 10:46:47,771 INFO L226 Difference]: Without dead ends: 672 [2025-04-30 10:46:47,771 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-30 10:46:47,771 INFO L437 NwaCegarLoop]: 362 mSDtfsCounter, 5 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:46:47,771 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 588 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:46:47,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2025-04-30 10:46:47,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 672. [2025-04-30 10:46:47,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 457 states have (on average 1.4485776805251642) internal successors, (662), 547 states have internal predecessors, (662), 61 states have call successors, (61), 32 states have call predecessors, (61), 52 states have return successors, (198), 92 states have call predecessors, (198), 61 states have call successors, (198) [2025-04-30 10:46:47,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 921 transitions. [2025-04-30 10:46:47,786 INFO L79 Accepts]: Start accepts. Automaton has 672 states and 921 transitions. Word has length 44 [2025-04-30 10:46:47,786 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:46:47,786 INFO L485 AbstractCegarLoop]: Abstraction has 672 states and 921 transitions. [2025-04-30 10:46:47,786 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-30 10:46:47,786 INFO L278 IsEmpty]: Start isEmpty. Operand 672 states and 921 transitions. [2025-04-30 10:46:47,786 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-04-30 10:46:47,786 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:46:47,786 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-30 10:46:47,786 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-30 10:46:47,786 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ASNullErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2025-04-30 10:46:47,786 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:46:47,787 INFO L85 PathProgramCache]: Analyzing trace with hash 148800592, now seen corresponding path program 1 times [2025-04-30 10:46:47,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:46:47,787 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230764872] [2025-04-30 10:46:47,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:46:47,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:46:47,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-04-30 10:46:47,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-04-30 10:46:47,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:46:47,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:46:48,032 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:46:48,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:46:48,032 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230764872] [2025-04-30 10:46:48,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230764872] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:46:48,032 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1423055600] [2025-04-30 10:46:48,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:46:48,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:46:48,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:46:48,034 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-30 10:46:48,036 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-30 10:46:48,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-04-30 10:46:48,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-04-30 10:46:48,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:46:48,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:46:48,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-30 10:46:48,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:46:48,250 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-30 10:46:48,299 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 15 treesize of output 7 [2025-04-30 10:46:48,330 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-30 10:46:48,331 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:46:48,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1423055600] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:46:48,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:46:48,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [14] total 19 [2025-04-30 10:46:48,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655656691] [2025-04-30 10:46:48,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:46:48,332 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-30 10:46:48,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:46:48,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-30 10:46:48,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2025-04-30 10:46:48,333 INFO L87 Difference]: Start difference. First operand 672 states and 921 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-30 10:46:48,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:46:48,736 INFO L93 Difference]: Finished difference Result 882 states and 1297 transitions. [2025-04-30 10:46:48,736 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-30 10:46:48,736 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-30 10:46:48,736 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:46:48,740 INFO L225 Difference]: With dead ends: 882 [2025-04-30 10:46:48,741 INFO L226 Difference]: Without dead ends: 878 [2025-04-30 10:46:48,741 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=519, Unknown=0, NotChecked=0, Total=600 [2025-04-30 10:46:48,741 INFO L437 NwaCegarLoop]: 395 mSDtfsCounter, 193 mSDsluCounter, 2110 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 2505 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-30 10:46:48,742 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 2505 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-30 10:46:48,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2025-04-30 10:46:48,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 833. [2025-04-30 10:46:48,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 833 states, 583 states have (on average 1.4168096054888508) internal successors, (826), 665 states have internal predecessors, (826), 77 states have call successors, (77), 40 states have call predecessors, (77), 71 states have return successors, (349), 127 states have call predecessors, (349), 77 states have call successors, (349) [2025-04-30 10:46:48,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 1252 transitions. [2025-04-30 10:46:48,767 INFO L79 Accepts]: Start accepts. Automaton has 833 states and 1252 transitions. Word has length 53 [2025-04-30 10:46:48,767 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:46:48,767 INFO L485 AbstractCegarLoop]: Abstraction has 833 states and 1252 transitions. [2025-04-30 10:46:48,767 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-30 10:46:48,767 INFO L278 IsEmpty]: Start isEmpty. Operand 833 states and 1252 transitions. [2025-04-30 10:46:48,768 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-30 10:46:48,768 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:46:48,768 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-30 10:46:48,776 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-30 10:46:48,968 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,SelfDestructingSolverStorable17 [2025-04-30 10:46:48,969 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2025-04-30 10:46:48,969 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:46:48,969 INFO L85 PathProgramCache]: Analyzing trace with hash 315030120, now seen corresponding path program 1 times [2025-04-30 10:46:48,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:46:48,969 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141891317] [2025-04-30 10:46:48,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:46:48,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:46:48,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-30 10:46:48,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-30 10:46:48,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:46:48,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:46:49,075 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-30 10:46:49,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:46:49,075 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141891317] [2025-04-30 10:46:49,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141891317] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:46:49,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:46:49,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-30 10:46:49,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517154715] [2025-04-30 10:46:49,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:46:49,076 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-30 10:46:49,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:46:49,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-30 10:46:49,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:46:49,076 INFO L87 Difference]: Start difference. First operand 833 states and 1252 transitions. Second operand has 7 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-30 10:46:49,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:46:49,495 INFO L93 Difference]: Finished difference Result 1028 states and 1639 transitions. [2025-04-30 10:46:49,495 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-30 10:46:49,495 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 54 [2025-04-30 10:46:49,496 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:46:49,500 INFO L225 Difference]: With dead ends: 1028 [2025-04-30 10:46:49,501 INFO L226 Difference]: Without dead ends: 1028 [2025-04-30 10:46:49,501 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-30 10:46:49,501 INFO L437 NwaCegarLoop]: 341 mSDtfsCounter, 182 mSDsluCounter, 1025 mSDsCounter, 0 mSdLazyCounter, 838 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 1366 SdHoareTripleChecker+Invalid, 858 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 838 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-30 10:46:49,502 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 1366 Invalid, 858 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 838 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-30 10:46:49,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1028 states. [2025-04-30 10:46:49,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1028 to 941. [2025-04-30 10:46:49,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 941 states, 671 states have (on average 1.4157973174366616) internal successors, (950), 759 states have internal predecessors, (950), 89 states have call successors, (89), 50 states have call predecessors, (89), 79 states have return successors, (430), 131 states have call predecessors, (430), 89 states have call successors, (430) [2025-04-30 10:46:49,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 1469 transitions. [2025-04-30 10:46:49,530 INFO L79 Accepts]: Start accepts. Automaton has 941 states and 1469 transitions. Word has length 54 [2025-04-30 10:46:49,530 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:46:49,530 INFO L485 AbstractCegarLoop]: Abstraction has 941 states and 1469 transitions. [2025-04-30 10:46:49,530 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-30 10:46:49,530 INFO L278 IsEmpty]: Start isEmpty. Operand 941 states and 1469 transitions. [2025-04-30 10:46:49,530 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-30 10:46:49,530 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:46:49,530 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-30 10:46:49,531 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-30 10:46:49,531 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2025-04-30 10:46:49,531 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:46:49,531 INFO L85 PathProgramCache]: Analyzing trace with hash 315030121, now seen corresponding path program 1 times [2025-04-30 10:46:49,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:46:49,531 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768104232] [2025-04-30 10:46:49,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:46:49,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:46:49,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-30 10:46:49,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-30 10:46:49,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:46:49,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:46:49,725 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-30 10:46:49,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:46:49,725 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768104232] [2025-04-30 10:46:49,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768104232] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:46:49,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:46:49,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-30 10:46:49,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773712639] [2025-04-30 10:46:49,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:46:49,726 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-30 10:46:49,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:46:49,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-30 10:46:49,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:46:49,726 INFO L87 Difference]: Start difference. First operand 941 states and 1469 transitions. Second operand has 7 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-30 10:46:50,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:46:50,129 INFO L93 Difference]: Finished difference Result 1011 states and 1592 transitions. [2025-04-30 10:46:50,129 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-30 10:46:50,130 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-30 10:46:50,130 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:46:50,135 INFO L225 Difference]: With dead ends: 1011 [2025-04-30 10:46:50,135 INFO L226 Difference]: Without dead ends: 1011 [2025-04-30 10:46:50,135 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-30 10:46:50,136 INFO L437 NwaCegarLoop]: 360 mSDtfsCounter, 53 mSDsluCounter, 1117 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 1477 SdHoareTripleChecker+Invalid, 753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-30 10:46:50,136 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 1477 Invalid, 753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 751 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-30 10:46:50,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2025-04-30 10:46:50,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 989. [2025-04-30 10:46:50,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 989 states, 713 states have (on average 1.4109396914446002) internal successors, (1006), 801 states have internal predecessors, (1006), 91 states have call successors, (91), 54 states have call predecessors, (91), 83 states have return successors, (438), 133 states have call predecessors, (438), 91 states have call successors, (438) [2025-04-30 10:46:50,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 989 states and 1535 transitions. [2025-04-30 10:46:50,166 INFO L79 Accepts]: Start accepts. Automaton has 989 states and 1535 transitions. Word has length 54 [2025-04-30 10:46:50,167 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:46:50,167 INFO L485 AbstractCegarLoop]: Abstraction has 989 states and 1535 transitions. [2025-04-30 10:46:50,167 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-30 10:46:50,167 INFO L278 IsEmpty]: Start isEmpty. Operand 989 states and 1535 transitions. [2025-04-30 10:46:50,167 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-04-30 10:46:50,167 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:46:50,168 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:46:50,168 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-30 10:46:50,168 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ASIdleErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2025-04-30 10:46:50,169 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:46:50,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1173721710, now seen corresponding path program 1 times [2025-04-30 10:46:50,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:46:50,169 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089024678] [2025-04-30 10:46:50,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:46:50,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:46:50,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-04-30 10:46:50,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-04-30 10:46:50,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:46:50,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:46:50,301 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-30 10:46:50,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:46:50,302 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089024678] [2025-04-30 10:46:50,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089024678] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:46:50,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:46:50,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-30 10:46:50,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436703734] [2025-04-30 10:46:50,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:46:50,303 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-30 10:46:50,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:46:50,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-30 10:46:50,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:46:50,304 INFO L87 Difference]: Start difference. First operand 989 states and 1535 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-30 10:46:50,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:46:50,577 INFO L93 Difference]: Finished difference Result 1115 states and 1764 transitions. [2025-04-30 10:46:50,577 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-30 10:46:50,577 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 55 [2025-04-30 10:46:50,577 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:46:50,582 INFO L225 Difference]: With dead ends: 1115 [2025-04-30 10:46:50,582 INFO L226 Difference]: Without dead ends: 1115 [2025-04-30 10:46:50,582 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-04-30 10:46:50,582 INFO L437 NwaCegarLoop]: 417 mSDtfsCounter, 116 mSDsluCounter, 2223 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 2640 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:46:50,583 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 2640 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:46:50,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1115 states. [2025-04-30 10:46:50,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1115 to 1093. [2025-04-30 10:46:50,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1093 states, 793 states have (on average 1.3682219419924337) internal successors, (1085), 873 states have internal predecessors, (1085), 95 states have call successors, (95), 58 states have call predecessors, (95), 103 states have return successors, (571), 161 states have call predecessors, (571), 95 states have call successors, (571) [2025-04-30 10:46:50,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1093 states to 1093 states and 1751 transitions. [2025-04-30 10:46:50,609 INFO L79 Accepts]: Start accepts. Automaton has 1093 states and 1751 transitions. Word has length 55 [2025-04-30 10:46:50,609 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:46:50,609 INFO L485 AbstractCegarLoop]: Abstraction has 1093 states and 1751 transitions. [2025-04-30 10:46:50,610 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-30 10:46:50,610 INFO L278 IsEmpty]: Start isEmpty. Operand 1093 states and 1751 transitions. [2025-04-30 10:46:50,610 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-04-30 10:46:50,610 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:46:50,610 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-30 10:46:50,610 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-30 10:46:50,610 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2025-04-30 10:46:50,611 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:46:50,611 INFO L85 PathProgramCache]: Analyzing trace with hash -337077908, now seen corresponding path program 1 times [2025-04-30 10:46:50,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:46:50,611 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045738376] [2025-04-30 10:46:50,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:46:50,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:46:50,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-04-30 10:46:50,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-04-30 10:46:50,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:46:50,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:46:50,665 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-30 10:46:50,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:46:50,666 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045738376] [2025-04-30 10:46:50,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045738376] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:46:50,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:46:50,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:46:50,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253196171] [2025-04-30 10:46:50,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:46:50,666 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:46:50,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:46:50,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:46:50,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:46:50,667 INFO L87 Difference]: Start difference. First operand 1093 states and 1751 transitions. Second operand has 4 states, 3 states have (on average 15.0) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-04-30 10:46:50,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:46:50,852 INFO L93 Difference]: Finished difference Result 1091 states and 1749 transitions. [2025-04-30 10:46:50,852 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:46:50,853 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-30 10:46:50,853 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:46:50,857 INFO L225 Difference]: With dead ends: 1091 [2025-04-30 10:46:50,857 INFO L226 Difference]: Without dead ends: 1091 [2025-04-30 10:46:50,858 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-30 10:46:50,859 INFO L437 NwaCegarLoop]: 359 mSDtfsCounter, 2 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 796 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:46:50,859 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 796 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:46:50,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1091 states. [2025-04-30 10:46:50,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1091 to 1091. [2025-04-30 10:46:50,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1091 states, 793 states have (on average 1.3656998738965953) internal successors, (1083), 871 states have internal predecessors, (1083), 95 states have call successors, (95), 58 states have call predecessors, (95), 103 states have return successors, (571), 161 states have call predecessors, (571), 95 states have call successors, (571) [2025-04-30 10:46:50,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1091 states to 1091 states and 1749 transitions. [2025-04-30 10:46:50,886 INFO L79 Accepts]: Start accepts. Automaton has 1091 states and 1749 transitions. Word has length 62 [2025-04-30 10:46:50,887 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:46:50,887 INFO L485 AbstractCegarLoop]: Abstraction has 1091 states and 1749 transitions. [2025-04-30 10:46:50,887 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-30 10:46:50,887 INFO L278 IsEmpty]: Start isEmpty. Operand 1091 states and 1749 transitions. [2025-04-30 10:46:50,889 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-04-30 10:46:50,890 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:46:50,890 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-30 10:46:50,890 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-04-30 10:46:50,890 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ASStartErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2025-04-30 10:46:50,890 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:46:50,890 INFO L85 PathProgramCache]: Analyzing trace with hash -337077907, now seen corresponding path program 1 times [2025-04-30 10:46:50,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:46:50,891 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503960082] [2025-04-30 10:46:50,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:46:50,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:46:50,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-04-30 10:46:50,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-04-30 10:46:50,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:46:50,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:46:51,074 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-30 10:46:51,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:46:51,075 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503960082] [2025-04-30 10:46:51,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503960082] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:46:51,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:46:51,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-30 10:46:51,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118335474] [2025-04-30 10:46:51,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:46:51,076 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-30 10:46:51,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:46:51,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-30 10:46:51,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:46:51,077 INFO L87 Difference]: Start difference. First operand 1091 states and 1749 transitions. Second operand has 9 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 4 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-04-30 10:46:51,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:46:51,248 INFO L93 Difference]: Finished difference Result 1348 states and 2221 transitions. [2025-04-30 10:46:51,248 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-30 10:46:51,248 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-30 10:46:51,249 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:46:51,255 INFO L225 Difference]: With dead ends: 1348 [2025-04-30 10:46:51,255 INFO L226 Difference]: Without dead ends: 1348 [2025-04-30 10:46:51,255 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-30 10:46:51,256 INFO L437 NwaCegarLoop]: 381 mSDtfsCounter, 92 mSDsluCounter, 2506 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 2887 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:46:51,256 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 2887 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:46:51,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1348 states. [2025-04-30 10:46:51,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1348 to 1284. [2025-04-30 10:46:51,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1284 states, 958 states have (on average 1.350730688935282) internal successors, (1294), 1037 states have internal predecessors, (1294), 107 states have call successors, (107), 77 states have call predecessors, (107), 119 states have return successors, (644), 169 states have call predecessors, (644), 107 states have call successors, (644) [2025-04-30 10:46:51,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1284 states to 1284 states and 2045 transitions. [2025-04-30 10:46:51,301 INFO L79 Accepts]: Start accepts. Automaton has 1284 states and 2045 transitions. Word has length 62 [2025-04-30 10:46:51,301 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:46:51,301 INFO L485 AbstractCegarLoop]: Abstraction has 1284 states and 2045 transitions. [2025-04-30 10:46:51,301 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-30 10:46:51,301 INFO L278 IsEmpty]: Start isEmpty. Operand 1284 states and 2045 transitions. [2025-04-30 10:46:51,302 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-04-30 10:46:51,302 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:46:51,302 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-30 10:46:51,302 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-04-30 10:46:51,302 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ASStartErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2025-04-30 10:46:51,303 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:46:51,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1986376205, now seen corresponding path program 1 times [2025-04-30 10:46:51,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:46:51,303 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580677096] [2025-04-30 10:46:51,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:46:51,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:46:51,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-04-30 10:46:51,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-04-30 10:46:51,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:46:51,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:46:51,962 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-30 10:46:51,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:46:51,962 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580677096] [2025-04-30 10:46:51,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580677096] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:46:51,963 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [612415457] [2025-04-30 10:46:51,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:46:51,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:46:51,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:46:51,964 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:46:51,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-30 10:46:52,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-04-30 10:46:52,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-04-30 10:46:52,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:46:52,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:46:52,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 80 conjuncts are in the unsatisfiable core [2025-04-30 10:46:52,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:46:52,126 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-30 10:46:52,162 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-30 10:46:52,167 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-04-30 10:46:52,191 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 29 treesize of output 13 [2025-04-30 10:46:52,195 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 14 [2025-04-30 10:46:52,232 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:46:52,233 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 71 [2025-04-30 10:46:52,236 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-30 10:46:52,238 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 32 [2025-04-30 10:46:52,280 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-30 10:46:52,286 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-30 10:46:52,294 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 46 treesize of output 28 [2025-04-30 10:46:52,312 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-30 10:46:52,319 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-30 10:46:52,323 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 50 treesize of output 28 [2025-04-30 10:46:52,339 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-30 10:46:52,351 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-30 10:46:52,354 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 50 treesize of output 28 [2025-04-30 10:46:52,464 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-30 10:46:52,468 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-30 10:46:52,472 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-30 10:46:52,568 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-30 10:46:52,573 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-30 10:46:52,581 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 46 treesize of output 28 [2025-04-30 10:46:52,637 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-30 10:46:52,642 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 34 treesize of output 16 [2025-04-30 10:46:52,669 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-30 10:46:52,669 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:46:52,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [612415457] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:46:52,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:46:52,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [12] total 20 [2025-04-30 10:46:52,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239385157] [2025-04-30 10:46:52,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:46:52,669 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-30 10:46:52,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:46:52,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-30 10:46:52,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2025-04-30 10:46:52,670 INFO L87 Difference]: Start difference. First operand 1284 states and 2045 transitions. Second operand has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 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-30 10:46:53,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:46:53,209 INFO L93 Difference]: Finished difference Result 1281 states and 2029 transitions. [2025-04-30 10:46:53,209 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-30 10:46:53,210 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 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-30 10:46:53,210 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:46:53,215 INFO L225 Difference]: With dead ends: 1281 [2025-04-30 10:46:53,215 INFO L226 Difference]: Without dead ends: 1281 [2025-04-30 10:46:53,215 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 58 SyntacticMatches, 6 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=454, Unknown=0, NotChecked=0, Total=552 [2025-04-30 10:46:53,216 INFO L437 NwaCegarLoop]: 308 mSDtfsCounter, 652 mSDsluCounter, 1264 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 662 SdHoareTripleChecker+Valid, 1572 SdHoareTripleChecker+Invalid, 742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-30 10:46:53,216 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [662 Valid, 1572 Invalid, 742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 604 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-30 10:46:53,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1281 states. [2025-04-30 10:46:53,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1281 to 1265. [2025-04-30 10:46:53,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1265 states, 941 states have (on average 1.3528161530286928) internal successors, (1273), 1020 states have internal predecessors, (1273), 106 states have call successors, (106), 76 states have call predecessors, (106), 118 states have return successors, (635), 168 states have call predecessors, (635), 106 states have call successors, (635) [2025-04-30 10:46:53,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1265 states to 1265 states and 2014 transitions. [2025-04-30 10:46:53,248 INFO L79 Accepts]: Start accepts. Automaton has 1265 states and 2014 transitions. Word has length 62 [2025-04-30 10:46:53,249 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:46:53,249 INFO L485 AbstractCegarLoop]: Abstraction has 1265 states and 2014 transitions. [2025-04-30 10:46:53,249 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 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-30 10:46:53,249 INFO L278 IsEmpty]: Start isEmpty. Operand 1265 states and 2014 transitions. [2025-04-30 10:46:53,249 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-04-30 10:46:53,249 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:46:53,249 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-30 10:46:53,256 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-30 10:46:53,453 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-04-30 10:46:53,454 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ASStartErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2025-04-30 10:46:53,454 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:46:53,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1411772222, now seen corresponding path program 1 times [2025-04-30 10:46:53,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:46:53,455 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343185869] [2025-04-30 10:46:53,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:46:53,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:46:53,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-04-30 10:46:53,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-04-30 10:46:53,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:46:53,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:46:53,516 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-30 10:46:53,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:46:53,516 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343185869] [2025-04-30 10:46:53,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343185869] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:46:53,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:46:53,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:46:53,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735417366] [2025-04-30 10:46:53,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:46:53,517 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:46:53,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:46:53,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:46:53,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:46:53,517 INFO L87 Difference]: Start difference. First operand 1265 states and 2014 transitions. Second operand has 4 states, 3 states have (on average 15.333333333333334) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-04-30 10:46:53,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:46:53,698 INFO L93 Difference]: Finished difference Result 1263 states and 2012 transitions. [2025-04-30 10:46:53,699 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:46:53,699 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-30 10:46:53,699 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:46:53,704 INFO L225 Difference]: With dead ends: 1263 [2025-04-30 10:46:53,704 INFO L226 Difference]: Without dead ends: 1263 [2025-04-30 10:46:53,704 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-30 10:46:53,704 INFO L437 NwaCegarLoop]: 357 mSDtfsCounter, 2 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 794 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:46:53,706 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 794 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:46:53,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1263 states. [2025-04-30 10:46:53,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1263 to 1263. [2025-04-30 10:46:53,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1263 states, 941 states have (on average 1.350690754516472) internal successors, (1271), 1018 states have internal predecessors, (1271), 106 states have call successors, (106), 76 states have call predecessors, (106), 118 states have return successors, (635), 168 states have call predecessors, (635), 106 states have call successors, (635) [2025-04-30 10:46:53,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1263 states to 1263 states and 2012 transitions. [2025-04-30 10:46:53,738 INFO L79 Accepts]: Start accepts. Automaton has 1263 states and 2012 transitions. Word has length 63 [2025-04-30 10:46:53,738 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:46:53,738 INFO L485 AbstractCegarLoop]: Abstraction has 1263 states and 2012 transitions. [2025-04-30 10:46:53,738 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-30 10:46:53,739 INFO L278 IsEmpty]: Start isEmpty. Operand 1263 states and 2012 transitions. [2025-04-30 10:46:53,739 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-04-30 10:46:53,739 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:46:53,739 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-30 10:46:53,739 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-04-30 10:46:53,739 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ASStartErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2025-04-30 10:46:53,739 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:46:53,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1411772221, now seen corresponding path program 1 times [2025-04-30 10:46:53,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:46:53,739 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568587888] [2025-04-30 10:46:53,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:46:53,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:46:53,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-04-30 10:46:53,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-04-30 10:46:53,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:46:53,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-30 10:46:53,769 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-30 10:46:53,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-04-30 10:46:53,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-04-30 10:46:53,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:46:53,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-30 10:46:53,816 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-30 10:46:53,816 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-30 10:46:53,818 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ASStartErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (157 of 158 remaining) [2025-04-30 10:46:53,820 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (156 of 158 remaining) [2025-04-30 10:46:53,820 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (155 of 158 remaining) [2025-04-30 10:46:53,820 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (154 of 158 remaining) [2025-04-30 10:46:53,820 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (153 of 158 remaining) [2025-04-30 10:46:53,820 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (152 of 158 remaining) [2025-04-30 10:46:53,820 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (151 of 158 remaining) [2025-04-30 10:46:53,820 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (150 of 158 remaining) [2025-04-30 10:46:53,820 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (149 of 158 remaining) [2025-04-30 10:46:53,820 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (148 of 158 remaining) [2025-04-30 10:46:53,820 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (147 of 158 remaining) [2025-04-30 10:46:53,820 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (146 of 158 remaining) [2025-04-30 10:46:53,820 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (145 of 158 remaining) [2025-04-30 10:46:53,820 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (144 of 158 remaining) [2025-04-30 10:46:53,820 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (143 of 158 remaining) [2025-04-30 10:46:53,820 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (142 of 158 remaining) [2025-04-30 10:46:53,820 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (141 of 158 remaining) [2025-04-30 10:46:53,820 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (140 of 158 remaining) [2025-04-30 10:46:53,820 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (139 of 158 remaining) [2025-04-30 10:46:53,820 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (138 of 158 remaining) [2025-04-30 10:46:53,820 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (137 of 158 remaining) [2025-04-30 10:46:53,820 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (136 of 158 remaining) [2025-04-30 10:46:53,820 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (135 of 158 remaining) [2025-04-30 10:46:53,820 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (134 of 158 remaining) [2025-04-30 10:46:53,820 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (133 of 158 remaining) [2025-04-30 10:46:53,820 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (132 of 158 remaining) [2025-04-30 10:46:53,821 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (131 of 158 remaining) [2025-04-30 10:46:53,821 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (130 of 158 remaining) [2025-04-30 10:46:53,821 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (129 of 158 remaining) [2025-04-30 10:46:53,821 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (128 of 158 remaining) [2025-04-30 10:46:53,821 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (127 of 158 remaining) [2025-04-30 10:46:53,821 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (126 of 158 remaining) [2025-04-30 10:46:53,821 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (125 of 158 remaining) [2025-04-30 10:46:53,821 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (124 of 158 remaining) [2025-04-30 10:46:53,821 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location status_updateErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (123 of 158 remaining) [2025-04-30 10:46:53,821 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location status_updateErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (122 of 158 remaining) [2025-04-30 10:46:53,821 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location status_updateErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (121 of 158 remaining) [2025-04-30 10:46:53,821 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location status_updateErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (120 of 158 remaining) [2025-04-30 10:46:53,821 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (119 of 158 remaining) [2025-04-30 10:46:53,821 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (118 of 158 remaining) [2025-04-30 10:46:53,821 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (117 of 158 remaining) [2025-04-30 10:46:53,821 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (116 of 158 remaining) [2025-04-30 10:46:53,821 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (115 of 158 remaining) [2025-04-30 10:46:53,821 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (114 of 158 remaining) [2025-04-30 10:46:53,821 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (113 of 158 remaining) [2025-04-30 10:46:53,821 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (112 of 158 remaining) [2025-04-30 10:46:53,821 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (111 of 158 remaining) [2025-04-30 10:46:53,821 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (110 of 158 remaining) [2025-04-30 10:46:53,821 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (109 of 158 remaining) [2025-04-30 10:46:53,821 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (108 of 158 remaining) [2025-04-30 10:46:53,821 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (107 of 158 remaining) [2025-04-30 10:46:53,821 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (106 of 158 remaining) [2025-04-30 10:46:53,821 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (105 of 158 remaining) [2025-04-30 10:46:53,821 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (104 of 158 remaining) [2025-04-30 10:46:53,822 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (103 of 158 remaining) [2025-04-30 10:46:53,822 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (102 of 158 remaining) [2025-04-30 10:46:53,822 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (101 of 158 remaining) [2025-04-30 10:46:53,822 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (100 of 158 remaining) [2025-04-30 10:46:53,822 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (99 of 158 remaining) [2025-04-30 10:46:53,822 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (98 of 158 remaining) [2025-04-30 10:46:53,822 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (97 of 158 remaining) [2025-04-30 10:46:53,822 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (96 of 158 remaining) [2025-04-30 10:46:53,822 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (95 of 158 remaining) [2025-04-30 10:46:53,822 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (94 of 158 remaining) [2025-04-30 10:46:53,822 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (93 of 158 remaining) [2025-04-30 10:46:53,822 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (92 of 158 remaining) [2025-04-30 10:46:53,822 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (91 of 158 remaining) [2025-04-30 10:46:53,822 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (90 of 158 remaining) [2025-04-30 10:46:53,822 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 158 remaining) [2025-04-30 10:46:53,823 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 158 remaining) [2025-04-30 10:46:53,823 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 158 remaining) [2025-04-30 10:46:53,823 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 158 remaining) [2025-04-30 10:46:53,823 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 158 remaining) [2025-04-30 10:46:53,823 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 158 remaining) [2025-04-30 10:46:53,823 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 158 remaining) [2025-04-30 10:46:53,823 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 158 remaining) [2025-04-30 10:46:53,823 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 158 remaining) [2025-04-30 10:46:53,823 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 158 remaining) [2025-04-30 10:46:53,823 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 158 remaining) [2025-04-30 10:46:53,823 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 158 remaining) [2025-04-30 10:46:53,823 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 158 remaining) [2025-04-30 10:46:53,823 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 158 remaining) [2025-04-30 10:46:53,823 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 158 remaining) [2025-04-30 10:46:53,823 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 158 remaining) [2025-04-30 10:46:53,823 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 158 remaining) [2025-04-30 10:46:53,823 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 158 remaining) [2025-04-30 10:46:53,823 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 158 remaining) [2025-04-30 10:46:53,823 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 158 remaining) [2025-04-30 10:46:53,823 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 158 remaining) [2025-04-30 10:46:53,823 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 158 remaining) [2025-04-30 10:46:53,823 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 158 remaining) [2025-04-30 10:46:53,823 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 158 remaining) [2025-04-30 10:46:53,823 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 158 remaining) [2025-04-30 10:46:53,823 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 158 remaining) [2025-04-30 10:46:53,824 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 158 remaining) [2025-04-30 10:46:53,824 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 158 remaining) [2025-04-30 10:46:53,824 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 158 remaining) [2025-04-30 10:46:53,824 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 158 remaining) [2025-04-30 10:46:53,824 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 158 remaining) [2025-04-30 10:46:53,824 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 158 remaining) [2025-04-30 10:46:53,824 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 158 remaining) [2025-04-30 10:46:53,824 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 158 remaining) [2025-04-30 10:46:53,824 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr64REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 158 remaining) [2025-04-30 10:46:53,824 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 158 remaining) [2025-04-30 10:46:53,824 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 158 remaining) [2025-04-30 10:46:53,824 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 158 remaining) [2025-04-30 10:46:53,824 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr68REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 158 remaining) [2025-04-30 10:46:53,824 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr69REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 158 remaining) [2025-04-30 10:46:53,824 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 158 remaining) [2025-04-30 10:46:53,824 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 158 remaining) [2025-04-30 10:46:53,824 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 158 remaining) [2025-04-30 10:46:53,824 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 158 remaining) [2025-04-30 10:46:53,824 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 158 remaining) [2025-04-30 10:46:53,824 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 158 remaining) [2025-04-30 10:46:53,824 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 158 remaining) [2025-04-30 10:46:53,824 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 158 remaining) [2025-04-30 10:46:53,824 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 158 remaining) [2025-04-30 10:46:53,824 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 158 remaining) [2025-04-30 10:46:53,824 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 158 remaining) [2025-04-30 10:46:53,824 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 158 remaining) [2025-04-30 10:46:53,825 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 158 remaining) [2025-04-30 10:46:53,825 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 158 remaining) [2025-04-30 10:46:53,825 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ASStopErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 158 remaining) [2025-04-30 10:46:53,825 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ASStopErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 158 remaining) [2025-04-30 10:46:53,825 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ASStopErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (33 of 158 remaining) [2025-04-30 10:46:53,825 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ASStopErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE (32 of 158 remaining) [2025-04-30 10:46:53,825 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ASNullErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 158 remaining) [2025-04-30 10:46:53,825 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ASNullErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 158 remaining) [2025-04-30 10:46:53,825 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 158 remaining) [2025-04-30 10:46:53,825 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 158 remaining) [2025-04-30 10:46:53,825 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 158 remaining) [2025-04-30 10:46:53,825 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 158 remaining) [2025-04-30 10:46:53,825 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 158 remaining) [2025-04-30 10:46:53,825 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 158 remaining) [2025-04-30 10:46:53,825 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 158 remaining) [2025-04-30 10:46:53,825 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 158 remaining) [2025-04-30 10:46:53,825 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 158 remaining) [2025-04-30 10:46:53,825 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 158 remaining) [2025-04-30 10:46:53,825 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 158 remaining) [2025-04-30 10:46:53,825 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 158 remaining) [2025-04-30 10:46:53,825 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr12ASSERT_VIOLATIONMEMORY_LEAK (17 of 158 remaining) [2025-04-30 10:46:53,825 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 158 remaining) [2025-04-30 10:46:53,825 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 158 remaining) [2025-04-30 10:46:53,825 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 158 remaining) [2025-04-30 10:46:53,825 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 158 remaining) [2025-04-30 10:46:53,825 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 158 remaining) [2025-04-30 10:46:53,825 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 158 remaining) [2025-04-30 10:46:53,825 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 158 remaining) [2025-04-30 10:46:53,825 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 158 remaining) [2025-04-30 10:46:53,825 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 158 remaining) [2025-04-30 10:46:53,825 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 158 remaining) [2025-04-30 10:46:53,825 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 158 remaining) [2025-04-30 10:46:53,825 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 158 remaining) [2025-04-30 10:46:53,825 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 158 remaining) [2025-04-30 10:46:53,825 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 158 remaining) [2025-04-30 10:46:53,826 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 158 remaining) [2025-04-30 10:46:53,826 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 158 remaining) [2025-04-30 10:46:53,826 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK (0 of 158 remaining) [2025-04-30 10:46:53,826 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-04-30 10:46:53,828 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:46:53,870 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-30 10:46:53,873 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.04 10:46:53 BoogieIcfgContainer [2025-04-30 10:46:53,873 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-30 10:46:53,873 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-30 10:46:53,873 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-30 10:46:53,873 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-30 10:46:53,874 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:46:37" (3/4) ... [2025-04-30 10:46:53,874 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-04-30 10:46:53,913 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 16. [2025-04-30 10:46:53,953 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-04-30 10:46:53,953 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-04-30 10:46:53,953 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-30 10:46:53,954 INFO L158 Benchmark]: Toolchain (without parser) took 17556.27ms. Allocated memory was 142.6MB in the beginning and 511.7MB in the end (delta: 369.1MB). Free memory was 103.4MB in the beginning and 242.5MB in the end (delta: -139.1MB). Peak memory consumption was 232.8MB. Max. memory is 16.1GB. [2025-04-30 10:46:53,954 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 201.3MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:46:53,954 INFO L158 Benchmark]: CACSL2BoogieTranslator took 485.35ms. Allocated memory is still 142.6MB. Free memory was 103.4MB in the beginning and 75.8MB in the end (delta: 27.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-04-30 10:46:53,954 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.11ms. Allocated memory is still 142.6MB. Free memory was 75.8MB in the beginning and 72.5MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:46:53,954 INFO L158 Benchmark]: Boogie Preprocessor took 87.44ms. Allocated memory is still 142.6MB. Free memory was 72.5MB in the beginning and 67.4MB in the end (delta: 5.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-30 10:46:53,954 INFO L158 Benchmark]: RCFGBuilder took 865.92ms. Allocated memory is still 142.6MB. Free memory was 67.4MB in the beginning and 74.2MB in the end (delta: -6.8MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-04-30 10:46:53,955 INFO L158 Benchmark]: TraceAbstraction took 15989.98ms. Allocated memory was 142.6MB in the beginning and 511.7MB in the end (delta: 369.1MB). Free memory was 74.2MB in the beginning and 250.9MB in the end (delta: -176.7MB). Peak memory consumption was 190.9MB. Max. memory is 16.1GB. [2025-04-30 10:46:53,955 INFO L158 Benchmark]: Witness Printer took 80.25ms. Allocated memory is still 511.7MB. Free memory was 250.9MB in the beginning and 242.5MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-30 10:46:53,955 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28ms. Allocated memory is still 201.3MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 485.35ms. Allocated memory is still 142.6MB. Free memory was 103.4MB in the beginning and 75.8MB in the end (delta: 27.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.11ms. Allocated memory is still 142.6MB. Free memory was 75.8MB in the beginning and 72.5MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 87.44ms. Allocated memory is still 142.6MB. Free memory was 72.5MB in the beginning and 67.4MB in the end (delta: 5.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 865.92ms. Allocated memory is still 142.6MB. Free memory was 67.4MB in the beginning and 74.2MB in the end (delta: -6.8MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 15989.98ms. Allocated memory was 142.6MB in the beginning and 511.7MB in the end (delta: 369.1MB). Free memory was 74.2MB in the beginning and 250.9MB in the end (delta: -176.7MB). Peak memory consumption was 190.9MB. Max. memory is 16.1GB. * Witness Printer took 80.25ms. Allocated memory is still 511.7MB. Free memory was 250.9MB in the beginning and 242.5MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: -1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L779] user_t *user; VAL [user={0:0}] [L975] user = malloc(sizeof(user_t)) [L976] CALL user_initialize() [L966] EXPR, FCALL calloc(1, sizeof(info_t)) VAL [user={-1:0}] [L966] user->info = calloc(1, sizeof(info_t)) VAL [user={-1:0}] [L967] user->message.id = 11 VAL [user={-1:0}] [L968] EXPR user->info VAL [user={-1:0}] [L968] user->info->is_valid = 0 VAL [user={-1:0}] [L969] user->status = AS_NULL VAL [user={-1:0}] [L970] user->user_id = 11 VAL [user={-1:0}] [L971] user->timeout = 3 VAL [user={-1:0}] [L976] RET user_initialize() [L977] event_t e = {0}; [L977] event_t e = {0}; [L977] event_t e = {0}; [L977] event_t e = {0}; VAL [user={-1:0}] [L978] e.primitive = _EVENT_START VAL [user={-1:0}] [L979] CALL event_precess(&e) VAL [\at(e, Pre)={10:0}, user={-1:0}] [L943] EXPR user->status VAL [\at(e, Pre)={10:0}, e={10:0}, user={-1:0}] [L943] sys_state_t status = user->status; [L944] int rc = -1; VAL [\at(e, Pre)={10:0}, e={10:0}, rc=-1, status=1, user={-1:0}] [L945] COND TRUE status < AS_STATE_MAX [L947] case AS_NULL: VAL [\at(e, Pre)={10:0}, e={10:0}, rc=-1, status=1, user={-1:0}] [L948] CALL ASNull(e) VAL [\at(e, Pre)={10:0}, user={-1:0}] [L838] EXPR e->primitive VAL [\at(e, Pre)={10:0}, user={-1:0}] [L838] e_primitive_t primitive = e->primitive; [L839] COND TRUE primitive == _EVENT_START VAL [\at(e, Pre)={10:0}, user={-1:0}] [L840] CALL status_update(AS_START) VAL [\at(status, Pre)=2, user={-1:0}] [L814] COND TRUE status < AS_STATE_MAX VAL [\at(status, Pre)=2, status=2, user={-1:0}] [L815] EXPR user->status VAL [\at(status, Pre)=2, status=2, user={-1:0}] [L815] COND TRUE user->status != status [L816] user->status = status VAL [\at(status, Pre)=2, user={-1:0}] [L817] return 10; VAL [\at(status, Pre)=2, \result=10, user={-1:0}] [L840] RET status_update(AS_START) VAL [\at(e, Pre)={10:0}, user={-1:0}] [L841] CALL system_initialize() VAL [user={-1:0}] [L829] event_t e = {0}; [L829] event_t e = {0}; [L829] event_t e = {0}; [L829] event_t e = {0}; VAL [e={9:0}, user={-1:0}] [L830] EXPR user->info VAL [e={9:0}, user={-1:0}] [L830] EXPR user->info->is_valid VAL [e={9:0}, user={-1:0}] [L830] COND TRUE !user->info->is_valid [L831] e.primitive = _EVENT_CLOSE VAL [e={9:0}, user={-1:0}] [L835] CALL event_precess(&e) VAL [\at(e, Pre)={9:0}, user={-1:0}] [L943] EXPR user->status VAL [\at(e, Pre)={9:0}, e={9:0}, user={-1:0}] [L943] sys_state_t status = user->status; [L944] int rc = -1; VAL [\at(e, Pre)={9:0}, e={9:0}, rc=-1, status=2, user={-1:0}] [L945] COND TRUE status < AS_STATE_MAX [L947] case AS_NULL: [L950] case AS_START: VAL [\at(e, Pre)={9:0}, e={9:0}, rc=-1, status=2, user={-1:0}] [L951] CALL ASStart(e) VAL [\at(e, Pre)={9:0}, user={-1:0}] [L881] EXPR e->primitive VAL [\at(e, Pre)={9:0}, e={9:0}, user={-1:0}] [L881] e_primitive_t primitive = e->primitive; [L882] int rc = -1; [L884] case _EVENT_OPEN: VAL [\at(e, Pre)={9:0}, e={9:0}, primitive=3, rc=-1, user={-1:0}] [L884] case _EVENT_OPEN: [L898] case _EVENT_CLOSE: VAL [\at(e, Pre)={9:0}, e={9:0}, rc=-1, user={-1:0}] [L898] case _EVENT_CLOSE: [L899] message_t *message = &user->message; [L900] EXPR, FCALL calloc(0, sizeof(*message)) VAL [\at(e, Pre)={9:0}, e={9:0}, rc=-1, user={-1:0}] [L900] message = calloc(0, sizeof(*message)) [L901] message->id = 3 - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 686]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 973]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 387 locations, 464 edges, 158 error locations. Started 1 CEGAR loops. OverallTime: 15.9s, OverallIterations: 26, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5154 SdHoareTripleChecker+Valid, 7.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5124 mSDsluCounter, 32741 SdHoareTripleChecker+Invalid, 6.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 23898 mSDsCounter, 1158 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11838 IncrementalHoareTripleChecker+Invalid, 12996 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1158 mSolverCounterUnsat, 8843 mSDtfsCounter, 11838 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 368 GetRequests, 177 SyntacticMatches, 6 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1284occurred in iteration=23, InterpolantAutomatonStates: 187, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 25 MinimizatonAttempts, 808 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 1099 NumberOfCodeBlocks, 1099 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1009 ConstructedInterpolants, 0 QuantifiedInterpolants, 5566 SizeOfPredicates, 20 NumberOfNonLiveVariables, 971 ConjunctsInSsa, 92 ConjunctsInUnsatCore, 27 InterpolantComputations, 25 PerfectInterpolantSequences, 67/71 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-04-30 10:46:53,974 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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)