./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/goblint-regression/09-regions_12-arraycollapse_rc.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version da043454 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/goblint-regression/09-regions_12-arraycollapse_rc.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9e4e26886ce6e46608edb906008cd9014525a46a71411e5b4afda7a4d77d247c --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:15:55,710 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:15:55,767 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-04-29 11:15:55,771 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:15:55,771 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:15:55,797 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:15:55,798 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:15:55,798 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:15:55,798 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-29 11:15:55,798 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-29 11:15:55,799 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:15:55,799 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:15:55,799 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:15:55,799 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:15:55,800 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:15:55,800 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:15:55,800 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:15:55,800 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:15:55,800 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:15:55,800 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:15:55,801 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-04-29 11:15:55,801 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-04-29 11:15:55,801 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-04-29 11:15:55,801 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:15:55,801 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-04-29 11:15:55,801 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:15:55,801 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:15:55,801 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:15:55,801 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:15:55,801 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:15:55,802 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:15:55,802 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:15:55,802 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:15:55,802 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:15:55,802 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:15:55,802 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:15:55,802 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:15:55,802 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:15:55,802 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:15:55,802 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:15:55,802 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:15:55,803 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:15:55,803 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:15:55,803 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:15:55,803 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:15:55,803 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:15:55,803 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 -> 9e4e26886ce6e46608edb906008cd9014525a46a71411e5b4afda7a4d77d247c [2025-04-29 11:15:56,011 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:15:56,018 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:15:56,019 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:15:56,020 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:15:56,020 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:15:56,021 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/09-regions_12-arraycollapse_rc.c [2025-04-29 11:15:57,325 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/caa0915a7/85ddaa71f5424acc8018392272ade802/FLAG7813b1402 [2025-04-29 11:15:57,510 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:15:57,511 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/09-regions_12-arraycollapse_rc.c [2025-04-29 11:15:57,512 WARN L117 ultiparseSymbolTable]: System include pthread.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:15:57,512 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:15:57,513 WARN L117 ultiparseSymbolTable]: System include stdio.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:15:57,517 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/caa0915a7/85ddaa71f5424acc8018392272ade802/FLAG7813b1402 [2025-04-29 11:15:58,526 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/caa0915a7/85ddaa71f5424acc8018392272ade802 [2025-04-29 11:15:58,528 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:15:58,528 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:15:58,529 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:15:58,529 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:15:58,532 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:15:58,533 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:15:58" (1/1) ... [2025-04-29 11:15:58,534 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bcbd58c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:15:58, skipping insertion in model container [2025-04-29 11:15:58,534 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:15:58" (1/1) ... [2025-04-29 11:15:58,548 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:15:58,716 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:15:58,738 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:15:58,775 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:15:58,793 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:15:58,793 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:15:58 WrapperNode [2025-04-29 11:15:58,793 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:15:58,794 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:15:58,794 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:15:58,794 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:15:58,798 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:15:58" (1/1) ... [2025-04-29 11:15:58,809 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:15:58" (1/1) ... [2025-04-29 11:15:58,841 INFO L138 Inliner]: procedures = 20, calls = 54, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 175 [2025-04-29 11:15:58,841 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:15:58,843 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:15:58,843 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:15:58,843 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:15:58,850 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:15:58" (1/1) ... [2025-04-29 11:15:58,850 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:15:58" (1/1) ... [2025-04-29 11:15:58,855 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:15:58" (1/1) ... [2025-04-29 11:15:58,878 INFO L175 MemorySlicer]: Split 48 memory accesses to 3 slices as follows [10, 16, 22]. 46 percent of accesses are in the largest equivalence class. The 20 initializations are split as follows [10, 10, 0]. The 17 writes are split as follows [0, 1, 16]. [2025-04-29 11:15:58,879 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:15:58" (1/1) ... [2025-04-29 11:15:58,880 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:15:58" (1/1) ... [2025-04-29 11:15:58,891 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:15:58" (1/1) ... [2025-04-29 11:15:58,892 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:15:58" (1/1) ... [2025-04-29 11:15:58,900 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:15:58" (1/1) ... [2025-04-29 11:15:58,901 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:15:58" (1/1) ... [2025-04-29 11:15:58,902 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:15:58" (1/1) ... [2025-04-29 11:15:58,906 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:15:58,907 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:15:58,907 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:15:58,907 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:15:58,912 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:15:58" (1/1) ... [2025-04-29 11:15:58,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:15:58,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:15:58,936 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-29 11:15:58,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-29 11:15:58,951 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-29 11:15:58,951 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-04-29 11:15:58,951 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-04-29 11:15:58,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-04-29 11:15:58,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-04-29 11:15:58,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-04-29 11:15:58,952 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-29 11:15:58,952 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-29 11:15:58,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-29 11:15:58,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-29 11:15:58,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-29 11:15:58,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-29 11:15:58,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-04-29 11:15:58,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-04-29 11:15:58,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-29 11:15:58,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-29 11:15:58,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-04-29 11:15:58,952 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-29 11:15:58,952 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-29 11:15:58,952 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:15:58,952 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:15:58,952 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-29 11:15:58,952 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-29 11:15:58,952 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-04-29 11:15:58,952 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-04-29 11:15:58,952 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-04-29 11:15:58,954 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-29 11:15:59,030 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:15:59,032 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:15:59,389 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-29 11:15:59,389 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:15:59,576 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:15:59,577 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-29 11:15:59,577 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:15:59 BoogieIcfgContainer [2025-04-29 11:15:59,577 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:15:59,579 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:15:59,579 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:15:59,582 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:15:59,582 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:15:58" (1/3) ... [2025-04-29 11:15:59,583 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@521fa9a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:15:59, skipping insertion in model container [2025-04-29 11:15:59,583 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:15:58" (2/3) ... [2025-04-29 11:15:59,584 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@521fa9a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:15:59, skipping insertion in model container [2025-04-29 11:15:59,584 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:15:59" (3/3) ... [2025-04-29 11:15:59,585 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_12-arraycollapse_rc.c [2025-04-29 11:15:59,596 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:15:59,597 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_12-arraycollapse_rc.c that has 2 procedures, 101 locations, 100 edges, 1 initial locations, 1 loop locations, and 57 error locations. [2025-04-29 11:15:59,598 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-29 11:15:59,650 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-29 11:15:59,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 104 places, 101 transitions, 206 flow [2025-04-29 11:15:59,712 INFO L116 PetriNetUnfolderBase]: 1/100 cut-off events. [2025-04-29 11:15:59,715 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:15:59,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 100 events. 1/100 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 335 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2025-04-29 11:15:59,719 INFO L82 GeneralOperation]: Start removeDead. Operand has 104 places, 101 transitions, 206 flow [2025-04-29 11:15:59,721 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 103 places, 100 transitions, 203 flow [2025-04-29 11:15:59,731 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:15:59,744 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;@42b6292b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:15:59,744 INFO L341 AbstractCegarLoop]: Starting to check reachability of 70 error locations. [2025-04-29 11:15:59,748 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-29 11:15:59,749 INFO L116 PetriNetUnfolderBase]: 0/4 cut-off events. [2025-04-29 11:15:59,749 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:15:59,749 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:15:59,749 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-04-29 11:15:59,750 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2025-04-29 11:15:59,753 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:15:59,753 INFO L85 PathProgramCache]: Analyzing trace with hash 533128, now seen corresponding path program 1 times [2025-04-29 11:15:59,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:15:59,758 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53505613] [2025-04-29 11:15:59,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:15:59,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:15:59,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-29 11:15:59,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-29 11:15:59,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:15:59,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:59,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:15:59,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:15:59,927 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53505613] [2025-04-29 11:15:59,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53505613] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:15:59,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:15:59,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:15:59,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646357048] [2025-04-29 11:15:59,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:15:59,934 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:15:59,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:15:59,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:15:59,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:16:00,044 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 101 [2025-04-29 11:16:00,046 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 100 transitions, 203 flow. Second operand has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:00,046 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:16:00,047 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 101 [2025-04-29 11:16:00,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:16:00,183 INFO L116 PetriNetUnfolderBase]: 64/290 cut-off events. [2025-04-29 11:16:00,184 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:16:00,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 457 conditions, 290 events. 64/290 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1360 event pairs, 63 based on Foata normal form. 0/224 useless extension candidates. Maximal degree in co-relation 377. Up to 157 conditions per place. [2025-04-29 11:16:00,190 INFO L140 encePairwiseOnDemand]: 89/101 looper letters, 30 selfloop transitions, 6 changer transitions 0/94 dead transitions. [2025-04-29 11:16:00,191 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 94 transitions, 263 flow [2025-04-29 11:16:00,192 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:16:00,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:16:00,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 219 transitions. [2025-04-29 11:16:00,203 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7227722772277227 [2025-04-29 11:16:00,204 INFO L175 Difference]: Start difference. First operand has 103 places, 100 transitions, 203 flow. Second operand 3 states and 219 transitions. [2025-04-29 11:16:00,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 94 transitions, 263 flow [2025-04-29 11:16:00,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 94 transitions, 262 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:16:00,211 INFO L231 Difference]: Finished difference. Result has 98 places, 94 transitions, 202 flow [2025-04-29 11:16:00,214 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=202, PETRI_PLACES=98, PETRI_TRANSITIONS=94} [2025-04-29 11:16:00,216 INFO L279 CegarLoopForPetriNet]: 103 programPoint places, -5 predicate places. [2025-04-29 11:16:00,217 INFO L485 AbstractCegarLoop]: Abstraction has has 98 places, 94 transitions, 202 flow [2025-04-29 11:16:00,218 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:00,218 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:16:00,218 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-04-29 11:16:00,218 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:16:00,218 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2025-04-29 11:16:00,219 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:00,219 INFO L85 PathProgramCache]: Analyzing trace with hash 533129, now seen corresponding path program 1 times [2025-04-29 11:16:00,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:16:00,219 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801784536] [2025-04-29 11:16:00,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:00,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:16:00,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-29 11:16:00,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-29 11:16:00,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:00,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:00,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:16:00,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:16:00,345 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801784536] [2025-04-29 11:16:00,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801784536] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:16:00,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:16:00,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:16:00,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246241302] [2025-04-29 11:16:00,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:16:00,346 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:16:00,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:16:00,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:16:00,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:16:00,421 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 101 [2025-04-29 11:16:00,421 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 94 transitions, 202 flow. Second operand has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:00,421 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:16:00,421 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 101 [2025-04-29 11:16:00,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:16:00,507 INFO L116 PetriNetUnfolderBase]: 64/284 cut-off events. [2025-04-29 11:16:00,507 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-29 11:16:00,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 454 conditions, 284 events. 64/284 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1331 event pairs, 63 based on Foata normal form. 6/224 useless extension candidates. Maximal degree in co-relation 411. Up to 157 conditions per place. [2025-04-29 11:16:00,508 INFO L140 encePairwiseOnDemand]: 89/101 looper letters, 27 selfloop transitions, 6 changer transitions 0/88 dead transitions. [2025-04-29 11:16:00,508 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 88 transitions, 256 flow [2025-04-29 11:16:00,509 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:16:00,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:16:00,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 225 transitions. [2025-04-29 11:16:00,510 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7425742574257426 [2025-04-29 11:16:00,510 INFO L175 Difference]: Start difference. First operand has 98 places, 94 transitions, 202 flow. Second operand 3 states and 225 transitions. [2025-04-29 11:16:00,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 88 transitions, 256 flow [2025-04-29 11:16:00,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 88 transitions, 244 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:16:00,511 INFO L231 Difference]: Finished difference. Result has 92 places, 88 transitions, 190 flow [2025-04-29 11:16:00,512 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=190, PETRI_PLACES=92, PETRI_TRANSITIONS=88} [2025-04-29 11:16:00,512 INFO L279 CegarLoopForPetriNet]: 103 programPoint places, -11 predicate places. [2025-04-29 11:16:00,512 INFO L485 AbstractCegarLoop]: Abstraction has has 92 places, 88 transitions, 190 flow [2025-04-29 11:16:00,512 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:00,512 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:16:00,512 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-04-29 11:16:00,513 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 11:16:00,513 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2025-04-29 11:16:00,513 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:00,513 INFO L85 PathProgramCache]: Analyzing trace with hash 512352597, now seen corresponding path program 1 times [2025-04-29 11:16:00,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:16:00,513 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368959276] [2025-04-29 11:16:00,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:00,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:16:00,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-29 11:16:00,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-29 11:16:00,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:00,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:00,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:16:00,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:16:00,695 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368959276] [2025-04-29 11:16:00,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368959276] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:16:00,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:16:00,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:16:00,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891346819] [2025-04-29 11:16:00,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:16:00,695 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:16:00,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:16:00,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:16:00,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:16:00,941 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 101 [2025-04-29 11:16:00,942 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 88 transitions, 190 flow. Second operand has 6 states, 6 states have (on average 58.833333333333336) internal successors, (353), 6 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:00,942 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:16:00,942 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 101 [2025-04-29 11:16:00,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:16:01,030 INFO L116 PetriNetUnfolderBase]: 73/300 cut-off events. [2025-04-29 11:16:01,031 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:16:01,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 492 conditions, 300 events. 73/300 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1390 event pairs, 72 based on Foata normal form. 1/243 useless extension candidates. Maximal degree in co-relation 448. Up to 181 conditions per place. [2025-04-29 11:16:01,035 INFO L140 encePairwiseOnDemand]: 94/101 looper letters, 36 selfloop transitions, 1 changer transitions 0/82 dead transitions. [2025-04-29 11:16:01,036 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 82 transitions, 252 flow [2025-04-29 11:16:01,036 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:16:01,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:16:01,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 217 transitions. [2025-04-29 11:16:01,037 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7161716171617162 [2025-04-29 11:16:01,037 INFO L175 Difference]: Start difference. First operand has 92 places, 88 transitions, 190 flow. Second operand 3 states and 217 transitions. [2025-04-29 11:16:01,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 82 transitions, 252 flow [2025-04-29 11:16:01,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 82 transitions, 240 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:16:01,041 INFO L231 Difference]: Finished difference. Result has 86 places, 82 transitions, 168 flow [2025-04-29 11:16:01,041 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=168, PETRI_PLACES=86, PETRI_TRANSITIONS=82} [2025-04-29 11:16:01,042 INFO L279 CegarLoopForPetriNet]: 103 programPoint places, -17 predicate places. [2025-04-29 11:16:01,042 INFO L485 AbstractCegarLoop]: Abstraction has has 86 places, 82 transitions, 168 flow [2025-04-29 11:16:01,043 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 58.833333333333336) internal successors, (353), 6 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:01,043 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:16:01,043 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-04-29 11:16:01,043 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 11:16:01,043 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2025-04-29 11:16:01,044 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:01,044 INFO L85 PathProgramCache]: Analyzing trace with hash 512352598, now seen corresponding path program 1 times [2025-04-29 11:16:01,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:16:01,045 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579817300] [2025-04-29 11:16:01,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:01,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:16:01,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-29 11:16:01,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-29 11:16:01,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:01,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:01,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:16:01,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:16:01,212 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579817300] [2025-04-29 11:16:01,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579817300] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:16:01,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:16:01,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:16:01,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434389274] [2025-04-29 11:16:01,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:16:01,212 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:16:01,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:16:01,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:16:01,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:16:01,424 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 101 [2025-04-29 11:16:01,425 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 82 transitions, 168 flow. Second operand has 5 states, 5 states have (on average 54.8) internal successors, (274), 5 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:01,425 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:16:01,425 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 101 [2025-04-29 11:16:01,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:16:01,546 INFO L116 PetriNetUnfolderBase]: 64/289 cut-off events. [2025-04-29 11:16:01,546 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:16:01,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 289 events. 64/289 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1256 event pairs, 63 based on Foata normal form. 0/228 useless extension candidates. Maximal degree in co-relation 457. Up to 162 conditions per place. [2025-04-29 11:16:01,548 INFO L140 encePairwiseOnDemand]: 92/101 looper letters, 36 selfloop transitions, 6 changer transitions 0/89 dead transitions. [2025-04-29 11:16:01,549 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 89 transitions, 266 flow [2025-04-29 11:16:01,549 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:16:01,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-29 11:16:01,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 261 transitions. [2025-04-29 11:16:01,551 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6460396039603961 [2025-04-29 11:16:01,553 INFO L175 Difference]: Start difference. First operand has 86 places, 82 transitions, 168 flow. Second operand 4 states and 261 transitions. [2025-04-29 11:16:01,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 89 transitions, 266 flow [2025-04-29 11:16:01,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 89 transitions, 265 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:16:01,557 INFO L231 Difference]: Finished difference. Result has 90 places, 87 transitions, 215 flow [2025-04-29 11:16:01,558 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=215, PETRI_PLACES=90, PETRI_TRANSITIONS=87} [2025-04-29 11:16:01,558 INFO L279 CegarLoopForPetriNet]: 103 programPoint places, -13 predicate places. [2025-04-29 11:16:01,558 INFO L485 AbstractCegarLoop]: Abstraction has has 90 places, 87 transitions, 215 flow [2025-04-29 11:16:01,559 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 54.8) internal successors, (274), 5 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:01,559 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:16:01,559 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:16:01,559 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-29 11:16:01,559 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2025-04-29 11:16:01,560 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:01,560 INFO L85 PathProgramCache]: Analyzing trace with hash 444057393, now seen corresponding path program 1 times [2025-04-29 11:16:01,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:16:01,560 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534063083] [2025-04-29 11:16:01,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:01,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:16:01,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-29 11:16:01,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-29 11:16:01,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:01,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:01,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:16:01,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:16:01,805 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534063083] [2025-04-29 11:16:01,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534063083] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:16:01,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:16:01,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-29 11:16:01,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131228485] [2025-04-29 11:16:01,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:16:01,805 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-29 11:16:01,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:16:01,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-29 11:16:01,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:16:02,125 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 101 [2025-04-29 11:16:02,126 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 87 transitions, 215 flow. Second operand has 7 states, 7 states have (on average 51.285714285714285) internal successors, (359), 7 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:02,126 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:16:02,126 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 101 [2025-04-29 11:16:02,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:16:02,279 INFO L116 PetriNetUnfolderBase]: 64/283 cut-off events. [2025-04-29 11:16:02,279 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-29 11:16:02,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 487 conditions, 283 events. 64/283 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1216 event pairs, 63 based on Foata normal form. 0/234 useless extension candidates. Maximal degree in co-relation 478. Up to 154 conditions per place. [2025-04-29 11:16:02,281 INFO L140 encePairwiseOnDemand]: 85/101 looper letters, 29 selfloop transitions, 17 changer transitions 0/83 dead transitions. [2025-04-29 11:16:02,282 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 83 transitions, 299 flow [2025-04-29 11:16:02,282 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-29 11:16:02,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-29 11:16:02,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 445 transitions. [2025-04-29 11:16:02,283 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5507425742574258 [2025-04-29 11:16:02,284 INFO L175 Difference]: Start difference. First operand has 90 places, 87 transitions, 215 flow. Second operand 8 states and 445 transitions. [2025-04-29 11:16:02,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 83 transitions, 299 flow [2025-04-29 11:16:02,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 83 transitions, 297 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:16:02,286 INFO L231 Difference]: Finished difference. Result has 92 places, 83 transitions, 239 flow [2025-04-29 11:16:02,286 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=239, PETRI_PLACES=92, PETRI_TRANSITIONS=83} [2025-04-29 11:16:02,289 INFO L279 CegarLoopForPetriNet]: 103 programPoint places, -11 predicate places. [2025-04-29 11:16:02,290 INFO L485 AbstractCegarLoop]: Abstraction has has 92 places, 83 transitions, 239 flow [2025-04-29 11:16:02,290 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 51.285714285714285) internal successors, (359), 7 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:02,290 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:16:02,290 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:16:02,290 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-29 11:16:02,290 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2025-04-29 11:16:02,290 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:02,290 INFO L85 PathProgramCache]: Analyzing trace with hash 444057394, now seen corresponding path program 1 times [2025-04-29 11:16:02,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:16:02,290 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928548875] [2025-04-29 11:16:02,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:02,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:16:02,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-29 11:16:02,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-29 11:16:02,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:02,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:02,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:16:02,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:16:02,577 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928548875] [2025-04-29 11:16:02,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928548875] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:16:02,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:16:02,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-29 11:16:02,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265882228] [2025-04-29 11:16:02,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:16:02,578 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-29 11:16:02,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:16:02,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-29 11:16:02,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:16:03,135 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 101 [2025-04-29 11:16:03,136 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 83 transitions, 239 flow. Second operand has 7 states, 7 states have (on average 48.285714285714285) internal successors, (338), 7 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:03,136 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:16:03,136 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 101 [2025-04-29 11:16:03,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:16:03,273 INFO L116 PetriNetUnfolderBase]: 64/279 cut-off events. [2025-04-29 11:16:03,273 INFO L117 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-04-29 11:16:03,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 498 conditions, 279 events. 64/279 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1217 event pairs, 63 based on Foata normal form. 2/234 useless extension candidates. Maximal degree in co-relation 489. Up to 158 conditions per place. [2025-04-29 11:16:03,274 INFO L140 encePairwiseOnDemand]: 91/101 looper letters, 32 selfloop transitions, 13 changer transitions 0/81 dead transitions. [2025-04-29 11:16:03,274 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 81 transitions, 325 flow [2025-04-29 11:16:03,274 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:16:03,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-29 11:16:03,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 371 transitions. [2025-04-29 11:16:03,275 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5247524752475248 [2025-04-29 11:16:03,275 INFO L175 Difference]: Start difference. First operand has 92 places, 83 transitions, 239 flow. Second operand 7 states and 371 transitions. [2025-04-29 11:16:03,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 81 transitions, 325 flow [2025-04-29 11:16:03,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 81 transitions, 291 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-04-29 11:16:03,277 INFO L231 Difference]: Finished difference. Result has 89 places, 81 transitions, 227 flow [2025-04-29 11:16:03,277 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=227, PETRI_PLACES=89, PETRI_TRANSITIONS=81} [2025-04-29 11:16:03,277 INFO L279 CegarLoopForPetriNet]: 103 programPoint places, -14 predicate places. [2025-04-29 11:16:03,277 INFO L485 AbstractCegarLoop]: Abstraction has has 89 places, 81 transitions, 227 flow [2025-04-29 11:16:03,277 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 48.285714285714285) internal successors, (338), 7 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:03,278 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:16:03,278 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:16:03,278 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-29 11:16:03,278 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2025-04-29 11:16:03,278 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:03,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1537411850, now seen corresponding path program 1 times [2025-04-29 11:16:03,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:16:03,278 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986904574] [2025-04-29 11:16:03,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:03,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:16:03,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-29 11:16:03,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-29 11:16:03,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:03,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:03,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:16:03,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:16:03,343 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986904574] [2025-04-29 11:16:03,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986904574] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:16:03,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:16:03,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:16:03,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14465768] [2025-04-29 11:16:03,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:16:03,344 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:16:03,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:16:03,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:16:03,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:16:03,455 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 101 [2025-04-29 11:16:03,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 81 transitions, 227 flow. Second operand has 5 states, 5 states have (on average 58.0) internal successors, (290), 5 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:03,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:16:03,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 101 [2025-04-29 11:16:03,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:16:03,556 INFO L116 PetriNetUnfolderBase]: 64/277 cut-off events. [2025-04-29 11:16:03,556 INFO L117 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-04-29 11:16:03,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 490 conditions, 277 events. 64/277 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1201 event pairs, 63 based on Foata normal form. 2/230 useless extension candidates. Maximal degree in co-relation 481. Up to 158 conditions per place. [2025-04-29 11:16:03,558 INFO L140 encePairwiseOnDemand]: 92/101 looper letters, 30 selfloop transitions, 13 changer transitions 0/80 dead transitions. [2025-04-29 11:16:03,558 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 80 transitions, 311 flow [2025-04-29 11:16:03,561 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:16:03,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-29 11:16:03,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 319 transitions. [2025-04-29 11:16:03,563 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6316831683168317 [2025-04-29 11:16:03,563 INFO L175 Difference]: Start difference. First operand has 89 places, 81 transitions, 227 flow. Second operand 5 states and 319 transitions. [2025-04-29 11:16:03,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 80 transitions, 311 flow [2025-04-29 11:16:03,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 80 transitions, 285 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-04-29 11:16:03,564 INFO L231 Difference]: Finished difference. Result has 86 places, 80 transitions, 225 flow [2025-04-29 11:16:03,564 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=225, PETRI_PLACES=86, PETRI_TRANSITIONS=80} [2025-04-29 11:16:03,565 INFO L279 CegarLoopForPetriNet]: 103 programPoint places, -17 predicate places. [2025-04-29 11:16:03,565 INFO L485 AbstractCegarLoop]: Abstraction has has 86 places, 80 transitions, 225 flow [2025-04-29 11:16:03,565 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 58.0) internal successors, (290), 5 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:03,565 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:16:03,565 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:16:03,565 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-29 11:16:03,565 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2025-04-29 11:16:03,569 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:03,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1537411851, now seen corresponding path program 1 times [2025-04-29 11:16:03,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:16:03,569 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936267812] [2025-04-29 11:16:03,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:03,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:16:03,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-29 11:16:03,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-29 11:16:03,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:03,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:03,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:16:03,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:16:03,698 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936267812] [2025-04-29 11:16:03,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936267812] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:16:03,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:16:03,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:16:03,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293876591] [2025-04-29 11:16:03,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:16:03,699 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:16:03,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:16:03,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:16:03,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:16:03,852 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 101 [2025-04-29 11:16:03,853 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 80 transitions, 225 flow. Second operand has 5 states, 5 states have (on average 60.6) internal successors, (303), 5 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:03,853 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:16:03,853 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 101 [2025-04-29 11:16:03,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:16:03,956 INFO L116 PetriNetUnfolderBase]: 64/275 cut-off events. [2025-04-29 11:16:03,956 INFO L117 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-04-29 11:16:03,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 483 conditions, 275 events. 64/275 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1193 event pairs, 63 based on Foata normal form. 2/228 useless extension candidates. Maximal degree in co-relation 474. Up to 158 conditions per place. [2025-04-29 11:16:03,957 INFO L140 encePairwiseOnDemand]: 92/101 looper letters, 27 selfloop transitions, 13 changer transitions 0/79 dead transitions. [2025-04-29 11:16:03,957 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 79 transitions, 303 flow [2025-04-29 11:16:03,958 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:16:03,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-29 11:16:03,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 331 transitions. [2025-04-29 11:16:03,959 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6554455445544555 [2025-04-29 11:16:03,959 INFO L175 Difference]: Start difference. First operand has 86 places, 80 transitions, 225 flow. Second operand 5 states and 331 transitions. [2025-04-29 11:16:03,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 79 transitions, 303 flow [2025-04-29 11:16:03,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 79 transitions, 277 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-29 11:16:03,960 INFO L231 Difference]: Finished difference. Result has 85 places, 79 transitions, 223 flow [2025-04-29 11:16:03,960 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=197, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=223, PETRI_PLACES=85, PETRI_TRANSITIONS=79} [2025-04-29 11:16:03,961 INFO L279 CegarLoopForPetriNet]: 103 programPoint places, -18 predicate places. [2025-04-29 11:16:03,961 INFO L485 AbstractCegarLoop]: Abstraction has has 85 places, 79 transitions, 223 flow [2025-04-29 11:16:03,961 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 60.6) internal successors, (303), 5 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:03,961 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:16:03,961 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:16:03,961 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-29 11:16:03,961 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2025-04-29 11:16:03,962 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:03,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1859604554, now seen corresponding path program 1 times [2025-04-29 11:16:03,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:16:03,962 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433192784] [2025-04-29 11:16:03,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:03,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:16:03,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-29 11:16:03,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-29 11:16:03,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:03,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:04,252 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:16:04,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:16:04,252 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433192784] [2025-04-29 11:16:04,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433192784] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:16:04,252 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [714410986] [2025-04-29 11:16:04,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:04,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:16:04,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:16:04,256 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:16:04,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-29 11:16:04,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-29 11:16:04,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-29 11:16:04,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:04,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:04,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-29 11:16:04,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:16:04,431 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:16:04,437 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-04-29 11:16:04,493 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:16:04,494 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-04-29 11:16:04,573 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:16:04,574 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-04-29 11:16:04,602 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:16:04,603 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:16:04,784 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:16:04,784 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 61 [2025-04-29 11:16:04,857 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-29 11:16:04,858 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2025-04-29 11:16:04,914 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:16:04,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [714410986] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:16:04,915 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:16:04,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 14 [2025-04-29 11:16:04,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320535815] [2025-04-29 11:16:04,915 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:16:04,915 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-29 11:16:04,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:16:04,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-29 11:16:04,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2025-04-29 11:16:06,475 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 101 [2025-04-29 11:16:06,476 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 79 transitions, 223 flow. Second operand has 16 states, 16 states have (on average 55.0625) internal successors, (881), 16 states have internal predecessors, (881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:06,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:16:06,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 101 [2025-04-29 11:16:06,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:16:06,863 INFO L116 PetriNetUnfolderBase]: 75/327 cut-off events. [2025-04-29 11:16:06,863 INFO L117 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2025-04-29 11:16:06,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 603 conditions, 327 events. 75/327 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1459 event pairs, 72 based on Foata normal form. 6/279 useless extension candidates. Maximal degree in co-relation 594. Up to 177 conditions per place. [2025-04-29 11:16:06,865 INFO L140 encePairwiseOnDemand]: 92/101 looper letters, 49 selfloop transitions, 12 changer transitions 0/99 dead transitions. [2025-04-29 11:16:06,865 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 99 transitions, 449 flow [2025-04-29 11:16:06,865 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:16:06,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-29 11:16:06,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 439 transitions. [2025-04-29 11:16:06,866 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.620933521923621 [2025-04-29 11:16:06,866 INFO L175 Difference]: Start difference. First operand has 85 places, 79 transitions, 223 flow. Second operand 7 states and 439 transitions. [2025-04-29 11:16:06,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 99 transitions, 449 flow [2025-04-29 11:16:06,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 99 transitions, 387 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-29 11:16:06,868 INFO L231 Difference]: Finished difference. Result has 91 places, 87 transitions, 293 flow [2025-04-29 11:16:06,868 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=293, PETRI_PLACES=91, PETRI_TRANSITIONS=87} [2025-04-29 11:16:06,868 INFO L279 CegarLoopForPetriNet]: 103 programPoint places, -12 predicate places. [2025-04-29 11:16:06,868 INFO L485 AbstractCegarLoop]: Abstraction has has 91 places, 87 transitions, 293 flow [2025-04-29 11:16:06,871 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 55.0625) internal successors, (881), 16 states have internal predecessors, (881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:06,871 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:16:06,871 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-04-29 11:16:06,877 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-29 11:16:07,075 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:16:07,075 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2025-04-29 11:16:07,076 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:07,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1314043005, now seen corresponding path program 1 times [2025-04-29 11:16:07,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:16:07,076 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814197045] [2025-04-29 11:16:07,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:07,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:16:07,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-29 11:16:07,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-29 11:16:07,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:07,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:07,214 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:16:07,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:16:07,214 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814197045] [2025-04-29 11:16:07,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814197045] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:16:07,214 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [108931598] [2025-04-29 11:16:07,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:07,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:16:07,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:16:07,216 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-29 11:16:07,218 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-29 11:16:07,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-29 11:16:07,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-29 11:16:07,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:07,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:07,360 INFO L256 TraceCheckSpWp]: Trace formula consists of 546 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-29 11:16:07,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:16:07,385 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:16:07,385 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:16:07,421 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:16:07,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [108931598] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:16:07,422 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:16:07,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-04-29 11:16:07,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164980785] [2025-04-29 11:16:07,422 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:16:07,422 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-29 11:16:07,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:16:07,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-29 11:16:07,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-04-29 11:16:07,435 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 101 [2025-04-29 11:16:07,435 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 87 transitions, 293 flow. Second operand has 9 states, 9 states have (on average 72.55555555555556) internal successors, (653), 9 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:07,436 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:16:07,436 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 101 [2025-04-29 11:16:07,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:16:07,583 INFO L116 PetriNetUnfolderBase]: 64/316 cut-off events. [2025-04-29 11:16:07,584 INFO L117 PetriNetUnfolderBase]: For 102/102 co-relation queries the response was YES. [2025-04-29 11:16:07,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 611 conditions, 316 events. 64/316 cut-off events. For 102/102 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1153 event pairs, 63 based on Foata normal form. 4/272 useless extension candidates. Maximal degree in co-relation 596. Up to 153 conditions per place. [2025-04-29 11:16:07,585 INFO L140 encePairwiseOnDemand]: 97/101 looper letters, 61 selfloop transitions, 8 changer transitions 0/109 dead transitions. [2025-04-29 11:16:07,585 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 109 transitions, 527 flow [2025-04-29 11:16:07,585 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-29 11:16:07,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-29 11:16:07,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 617 transitions. [2025-04-29 11:16:07,586 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7636138613861386 [2025-04-29 11:16:07,586 INFO L175 Difference]: Start difference. First operand has 91 places, 87 transitions, 293 flow. Second operand 8 states and 617 transitions. [2025-04-29 11:16:07,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 109 transitions, 527 flow [2025-04-29 11:16:07,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 109 transitions, 515 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-04-29 11:16:07,589 INFO L231 Difference]: Finished difference. Result has 100 places, 88 transitions, 317 flow [2025-04-29 11:16:07,589 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=265, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=317, PETRI_PLACES=100, PETRI_TRANSITIONS=88} [2025-04-29 11:16:07,590 INFO L279 CegarLoopForPetriNet]: 103 programPoint places, -3 predicate places. [2025-04-29 11:16:07,590 INFO L485 AbstractCegarLoop]: Abstraction has has 100 places, 88 transitions, 317 flow [2025-04-29 11:16:07,590 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 72.55555555555556) internal successors, (653), 9 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:07,590 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:16:07,590 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1] [2025-04-29 11:16:07,597 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-29 11:16:07,790 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,SelfDestructingSolverStorable9 [2025-04-29 11:16:07,791 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2025-04-29 11:16:07,791 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:07,791 INFO L85 PathProgramCache]: Analyzing trace with hash 339334950, now seen corresponding path program 2 times [2025-04-29 11:16:07,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:16:07,791 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611957167] [2025-04-29 11:16:07,791 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:16:07,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:16:07,823 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-04-29 11:16:07,911 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-04-29 11:16:07,911 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:16:07,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:08,933 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:16:08,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:16:08,933 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611957167] [2025-04-29 11:16:08,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611957167] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:16:08,933 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [16449668] [2025-04-29 11:16:08,933 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:16:08,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:16:08,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:16:08,935 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:16:08,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-29 11:16:09,054 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-04-29 11:16:09,144 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-04-29 11:16:09,144 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:16:09,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:09,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 942 conjuncts, 73 conjuncts are in the unsatisfiable core [2025-04-29 11:16:09,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:16:09,190 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:16:09,191 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-04-29 11:16:09,231 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:16:09,233 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-04-29 11:16:09,301 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:16:09,302 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-04-29 11:16:09,338 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:16:09,339 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-04-29 11:16:09,427 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:16:09,427 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-29 11:16:09,433 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-04-29 11:16:09,484 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 15 treesize of output 1 [2025-04-29 11:16:09,489 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:16:09,489 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-04-29 11:16:09,595 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:16:09,596 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-04-29 11:16:09,627 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:16:09,628 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-04-29 11:16:09,692 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:16:09,693 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-04-29 11:16:09,724 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:16:09,725 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:16:09,878 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:16:09,878 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 61 [2025-04-29 11:16:09,935 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-29 11:16:09,936 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2025-04-29 11:16:10,080 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:16:10,080 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 61 [2025-04-29 11:16:10,138 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-29 11:16:10,138 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2025-04-29 11:16:10,286 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:16:10,286 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 61 [2025-04-29 11:16:10,341 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-29 11:16:10,341 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2025-04-29 11:16:10,501 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:16:10,501 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 61 [2025-04-29 11:16:10,562 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-29 11:16:10,562 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2025-04-29 11:16:10,638 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:16:10,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [16449668] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:16:10,639 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:16:10,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 10] total 37 [2025-04-29 11:16:10,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578462846] [2025-04-29 11:16:10,639 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:16:10,639 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-04-29 11:16:10,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:16:10,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-04-29 11:16:10,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=301, Invalid=1181, Unknown=0, NotChecked=0, Total=1482 [2025-04-29 11:16:17,376 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 101 [2025-04-29 11:16:17,378 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 88 transitions, 317 flow. Second operand has 39 states, 39 states have (on average 55.46153846153846) internal successors, (2163), 39 states have internal predecessors, (2163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:17,378 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:16:17,378 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 101 [2025-04-29 11:16:17,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:16:18,363 INFO L116 PetriNetUnfolderBase]: 77/389 cut-off events. [2025-04-29 11:16:18,363 INFO L117 PetriNetUnfolderBase]: For 263/263 co-relation queries the response was YES. [2025-04-29 11:16:18,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 834 conditions, 389 events. 77/389 cut-off events. For 263/263 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1514 event pairs, 72 based on Foata normal form. 6/344 useless extension candidates. Maximal degree in co-relation 815. Up to 179 conditions per place. [2025-04-29 11:16:18,365 INFO L140 encePairwiseOnDemand]: 93/101 looper letters, 77 selfloop transitions, 28 changer transitions 0/143 dead transitions. [2025-04-29 11:16:18,365 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 143 transitions, 861 flow [2025-04-29 11:16:18,365 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-29 11:16:18,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-04-29 11:16:18,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1065 transitions. [2025-04-29 11:16:18,367 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5858085808580858 [2025-04-29 11:16:18,367 INFO L175 Difference]: Start difference. First operand has 100 places, 88 transitions, 317 flow. Second operand 18 states and 1065 transitions. [2025-04-29 11:16:18,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 143 transitions, 861 flow [2025-04-29 11:16:18,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 143 transitions, 845 flow, removed 5 selfloop flow, removed 3 redundant places. [2025-04-29 11:16:18,370 INFO L231 Difference]: Finished difference. Result has 125 places, 108 transitions, 609 flow [2025-04-29 11:16:18,370 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=309, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=609, PETRI_PLACES=125, PETRI_TRANSITIONS=108} [2025-04-29 11:16:18,371 INFO L279 CegarLoopForPetriNet]: 103 programPoint places, 22 predicate places. [2025-04-29 11:16:18,371 INFO L485 AbstractCegarLoop]: Abstraction has has 125 places, 108 transitions, 609 flow [2025-04-29 11:16:18,371 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 55.46153846153846) internal successors, (2163), 39 states have internal predecessors, (2163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:18,371 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:16:18,371 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1] [2025-04-29 11:16:18,378 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-29 11:16:18,572 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:16:18,572 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2025-04-29 11:16:18,572 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:18,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1726465709, now seen corresponding path program 2 times [2025-04-29 11:16:18,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:16:18,573 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523781901] [2025-04-29 11:16:18,573 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:16:18,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:16:18,609 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 65 statements into 2 equivalence classes. [2025-04-29 11:16:18,636 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 65 of 65 statements. [2025-04-29 11:16:18,637 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:16:18,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:18,827 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:16:18,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:16:18,828 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523781901] [2025-04-29 11:16:18,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523781901] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:16:18,828 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1221225044] [2025-04-29 11:16:18,828 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:16:18,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:16:18,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:16:18,830 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:16:18,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-29 11:16:19,000 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 65 statements into 2 equivalence classes. [2025-04-29 11:16:19,106 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 65 of 65 statements. [2025-04-29 11:16:19,106 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:16:19,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:19,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 1342 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-29 11:16:19,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:16:19,178 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:16:19,179 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:16:19,263 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:16:19,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1221225044] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:16:19,263 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:16:19,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 12 [2025-04-29 11:16:19,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538562776] [2025-04-29 11:16:19,263 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:16:19,263 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-29 11:16:19,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:16:19,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-29 11:16:19,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-04-29 11:16:19,277 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 101 [2025-04-29 11:16:19,278 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 108 transitions, 609 flow. Second operand has 13 states, 13 states have (on average 73.84615384615384) internal successors, (960), 13 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:19,278 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:16:19,278 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 101 [2025-04-29 11:16:19,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:16:19,434 INFO L116 PetriNetUnfolderBase]: 64/358 cut-off events. [2025-04-29 11:16:19,434 INFO L117 PetriNetUnfolderBase]: For 570/570 co-relation queries the response was YES. [2025-04-29 11:16:19,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 857 conditions, 358 events. 64/358 cut-off events. For 570/570 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1149 event pairs, 63 based on Foata normal form. 4/314 useless extension candidates. Maximal degree in co-relation 826. Up to 153 conditions per place. [2025-04-29 11:16:19,436 INFO L140 encePairwiseOnDemand]: 97/101 looper letters, 86 selfloop transitions, 12 changer transitions 0/138 dead transitions. [2025-04-29 11:16:19,436 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 138 transitions, 961 flow [2025-04-29 11:16:19,436 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-29 11:16:19,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-29 11:16:19,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 917 transitions. [2025-04-29 11:16:19,438 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7566006600660066 [2025-04-29 11:16:19,438 INFO L175 Difference]: Start difference. First operand has 125 places, 108 transitions, 609 flow. Second operand 12 states and 917 transitions. [2025-04-29 11:16:19,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 138 transitions, 961 flow [2025-04-29 11:16:19,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 138 transitions, 853 flow, removed 35 selfloop flow, removed 8 redundant places. [2025-04-29 11:16:19,444 INFO L231 Difference]: Finished difference. Result has 129 places, 105 transitions, 489 flow [2025-04-29 11:16:19,444 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=453, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=489, PETRI_PLACES=129, PETRI_TRANSITIONS=105} [2025-04-29 11:16:19,444 INFO L279 CegarLoopForPetriNet]: 103 programPoint places, 26 predicate places. [2025-04-29 11:16:19,445 INFO L485 AbstractCegarLoop]: Abstraction has has 129 places, 105 transitions, 489 flow [2025-04-29 11:16:19,445 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 73.84615384615384) internal successors, (960), 13 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:19,445 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:16:19,445 INFO L206 CegarLoopForPetriNet]: trace histogram [11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 1, 1] [2025-04-29 11:16:19,455 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-29 11:16:19,651 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:16:19,651 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2025-04-29 11:16:19,651 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:19,651 INFO L85 PathProgramCache]: Analyzing trace with hash -663393826, now seen corresponding path program 3 times [2025-04-29 11:16:19,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:16:19,652 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467359812] [2025-04-29 11:16:19,652 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:16:19,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:16:19,706 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 105 statements into 11 equivalence classes. [2025-04-29 11:16:20,259 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 105 of 105 statements. [2025-04-29 11:16:20,259 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-04-29 11:16:20,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:20,639 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 399 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:16:20,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:16:20,639 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467359812] [2025-04-29 11:16:20,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467359812] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:16:20,639 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [980157753] [2025-04-29 11:16:20,639 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:16:20,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:16:20,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:16:20,641 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:16:20,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-29 11:16:20,848 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 105 statements into 11 equivalence classes. Killed by 15