./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/goblint-regression/09-regions_04-list2_nr.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_04-list2_nr.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 6b660f04f83becd21e4ff512c323a1198b0ce2547661a7b848e55ab597e13bce --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:15:52,421 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:15:52,464 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:52,467 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:15:52,468 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:15:52,491 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:15:52,492 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:15:52,492 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:15:52,492 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-29 11:15:52,493 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-29 11:15:52,493 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:15:52,493 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:15:52,493 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:15:52,493 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:15:52,494 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:15:52,494 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:15:52,494 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:15:52,494 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:15:52,494 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:15:52,494 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:15:52,494 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-04-29 11:15:52,494 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-04-29 11:15:52,494 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-04-29 11:15:52,494 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:15:52,494 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-04-29 11:15:52,494 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:15:52,494 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:15:52,494 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:15:52,494 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:15:52,494 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:15:52,494 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:15:52,494 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:15:52,494 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:15:52,494 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:15:52,494 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:15:52,494 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:15:52,495 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:15:52,495 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:15:52,495 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:15:52,495 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:15:52,495 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:15:52,495 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:15:52,495 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:15:52,495 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:15:52,495 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:15:52,495 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:15:52,495 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 -> 6b660f04f83becd21e4ff512c323a1198b0ce2547661a7b848e55ab597e13bce [2025-04-29 11:15:52,718 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:15:52,726 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:15:52,729 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:15:52,730 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:15:52,731 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:15:52,732 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/09-regions_04-list2_nr.c [2025-04-29 11:15:54,083 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e6367970/e487b663790b4eb08a7e3940b8767663/FLAG47054d065 [2025-04-29 11:15:54,287 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:15:54,289 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/09-regions_04-list2_nr.c [2025-04-29 11:15:54,291 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:54,292 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:54,292 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:54,297 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e6367970/e487b663790b4eb08a7e3940b8767663/FLAG47054d065 [2025-04-29 11:15:55,133 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e6367970/e487b663790b4eb08a7e3940b8767663 [2025-04-29 11:15:55,135 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:15:55,136 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:15:55,137 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:15:55,137 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:15:55,141 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:15:55,142 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:15:55" (1/1) ... [2025-04-29 11:15:55,142 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1172c831 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:15:55, skipping insertion in model container [2025-04-29 11:15:55,142 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:15:55" (1/1) ... [2025-04-29 11:15:55,154 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:15:55,308 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:15:55,318 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:15:55,345 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:15:55,357 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:15:55,357 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:15:55 WrapperNode [2025-04-29 11:15:55,357 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:15:55,358 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:15:55,358 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:15:55,358 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:15:55,363 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:55" (1/1) ... [2025-04-29 11:15:55,372 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:55" (1/1) ... [2025-04-29 11:15:55,390 INFO L138 Inliner]: procedures = 15, calls = 37, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 81 [2025-04-29 11:15:55,390 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:15:55,391 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:15:55,391 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:15:55,391 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:15:55,396 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:55" (1/1) ... [2025-04-29 11:15:55,396 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:55" (1/1) ... [2025-04-29 11:15:55,401 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:55" (1/1) ... [2025-04-29 11:15:55,419 INFO L175 MemorySlicer]: Split 22 memory accesses to 3 slices as follows [20, 1, 1]. 91 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [0, 1, 1]. The 12 writes are split as follows [12, 0, 0]. [2025-04-29 11:15:55,422 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:55" (1/1) ... [2025-04-29 11:15:55,422 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:55" (1/1) ... [2025-04-29 11:15:55,431 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:55" (1/1) ... [2025-04-29 11:15:55,431 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:55" (1/1) ... [2025-04-29 11:15:55,436 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:55" (1/1) ... [2025-04-29 11:15:55,437 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:55" (1/1) ... [2025-04-29 11:15:55,437 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:55" (1/1) ... [2025-04-29 11:15:55,441 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:15:55,441 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:15:55,441 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:15:55,441 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:15:55,442 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:15:55" (1/1) ... [2025-04-29 11:15:55,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:15:55,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:15:55,463 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:55,468 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:55,485 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-29 11:15:55,485 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-04-29 11:15:55,485 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-04-29 11:15:55,485 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-29 11:15:55,485 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-29 11:15:55,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-29 11:15:55,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-29 11:15:55,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-29 11:15:55,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-29 11:15:55,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-04-29 11:15:55,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-04-29 11:15:55,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-29 11:15:55,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-29 11:15:55,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-04-29 11:15:55,486 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-29 11:15:55,486 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-29 11:15:55,486 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:15:55,487 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:15:55,487 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-29 11:15:55,487 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-29 11:15:55,487 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-04-29 11:15:55,487 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-04-29 11:15:55,487 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-04-29 11:15:55,488 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:55,569 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:15:55,570 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:15:55,857 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-29 11:15:55,858 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:15:55,962 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:15:55,962 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-29 11:15:55,962 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:15:55 BoogieIcfgContainer [2025-04-29 11:15:55,962 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:15:55,964 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:15:55,964 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:15:55,967 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:15:55,967 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:15:55" (1/3) ... [2025-04-29 11:15:55,968 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e230f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:15:55, skipping insertion in model container [2025-04-29 11:15:55,968 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:15:55" (2/3) ... [2025-04-29 11:15:55,968 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e230f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:15:55, skipping insertion in model container [2025-04-29 11:15:55,968 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:15:55" (3/3) ... [2025-04-29 11:15:55,969 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_04-list2_nr.c [2025-04-29 11:15:55,979 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:15:55,980 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_04-list2_nr.c that has 2 procedures, 84 locations, 82 edges, 1 initial locations, 0 loop locations, and 41 error locations. [2025-04-29 11:15:55,981 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-29 11:15:56,027 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-29 11:15:56,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 87 places, 83 transitions, 170 flow [2025-04-29 11:15:56,107 INFO L116 PetriNetUnfolderBase]: 0/82 cut-off events. [2025-04-29 11:15:56,109 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:15:56,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86 conditions, 82 events. 0/82 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 176 event pairs, 0 based on Foata normal form. 0/41 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2025-04-29 11:15:56,110 INFO L82 GeneralOperation]: Start removeDead. Operand has 87 places, 83 transitions, 170 flow [2025-04-29 11:15:56,114 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 86 places, 82 transitions, 167 flow [2025-04-29 11:15:56,120 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:15:56,135 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;@5ecdf96a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:15:56,135 INFO L341 AbstractCegarLoop]: Starting to check reachability of 54 error locations. [2025-04-29 11:15:56,137 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-29 11:15:56,137 INFO L116 PetriNetUnfolderBase]: 0/2 cut-off events. [2025-04-29 11:15:56,137 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:15:56,138 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:15:56,138 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-04-29 11:15:56,138 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2025-04-29 11:15:56,142 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:15:56,143 INFO L85 PathProgramCache]: Analyzing trace with hash 10719, now seen corresponding path program 1 times [2025-04-29 11:15:56,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:15:56,148 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181567687] [2025-04-29 11:15:56,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:15:56,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:15:56,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-29 11:15:56,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-29 11:15:56,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:15:56,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:56,315 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:56,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:15:56,316 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181567687] [2025-04-29 11:15:56,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181567687] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:15:56,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:15:56,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-29 11:15:56,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888057867] [2025-04-29 11:15:56,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:15:56,324 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:15:56,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:15:56,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:15:56,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:15:56,432 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 83 [2025-04-29 11:15:56,434 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 82 transitions, 167 flow. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 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:15:56,434 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:15:56,434 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 83 [2025-04-29 11:15:56,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:15:56,566 INFO L116 PetriNetUnfolderBase]: 99/363 cut-off events. [2025-04-29 11:15:56,566 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:15:56,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 598 conditions, 363 events. 99/363 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1758 event pairs, 99 based on Foata normal form. 0/307 useless extension candidates. Maximal degree in co-relation 557. Up to 223 conditions per place. [2025-04-29 11:15:56,570 INFO L140 encePairwiseOnDemand]: 71/83 looper letters, 28 selfloop transitions, 4 changer transitions 0/74 dead transitions. [2025-04-29 11:15:56,571 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 74 transitions, 215 flow [2025-04-29 11:15:56,571 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:15:56,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:15:56,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 169 transitions. [2025-04-29 11:15:56,581 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.678714859437751 [2025-04-29 11:15:56,583 INFO L175 Difference]: Start difference. First operand has 86 places, 82 transitions, 167 flow. Second operand 3 states and 169 transitions. [2025-04-29 11:15:56,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 74 transitions, 215 flow [2025-04-29 11:15:56,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 74 transitions, 214 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:15:56,589 INFO L231 Difference]: Finished difference. Result has 79 places, 74 transitions, 158 flow [2025-04-29 11:15:56,591 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=158, PETRI_PLACES=79, PETRI_TRANSITIONS=74} [2025-04-29 11:15:56,594 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, -7 predicate places. [2025-04-29 11:15:56,595 INFO L485 AbstractCegarLoop]: Abstraction has has 79 places, 74 transitions, 158 flow [2025-04-29 11:15:56,595 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 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:15:56,596 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:15:56,596 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-04-29 11:15:56,596 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:15:56,596 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2025-04-29 11:15:56,597 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:15:56,597 INFO L85 PathProgramCache]: Analyzing trace with hash 10720, now seen corresponding path program 1 times [2025-04-29 11:15:56,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:15:56,597 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995584060] [2025-04-29 11:15:56,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:15:56,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:15:56,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-29 11:15:56,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-29 11:15:56,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:15:56,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:56,684 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:56,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:15:56,684 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995584060] [2025-04-29 11:15:56,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995584060] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:15:56,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:15:56,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-29 11:15:56,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350302154] [2025-04-29 11:15:56,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:15:56,685 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:15:56,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:15:56,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:15:56,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:15:56,755 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 83 [2025-04-29 11:15:56,755 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 74 transitions, 158 flow. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 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:15:56,755 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:15:56,755 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 83 [2025-04-29 11:15:56,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:15:56,883 INFO L116 PetriNetUnfolderBase]: 99/355 cut-off events. [2025-04-29 11:15:56,884 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-29 11:15:56,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 590 conditions, 355 events. 99/355 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1746 event pairs, 99 based on Foata normal form. 6/305 useless extension candidates. Maximal degree in co-relation 565. Up to 223 conditions per place. [2025-04-29 11:15:56,888 INFO L140 encePairwiseOnDemand]: 71/83 looper letters, 24 selfloop transitions, 4 changer transitions 0/66 dead transitions. [2025-04-29 11:15:56,888 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 66 transitions, 198 flow [2025-04-29 11:15:56,889 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:15:56,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:15:56,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 177 transitions. [2025-04-29 11:15:56,892 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7108433734939759 [2025-04-29 11:15:56,892 INFO L175 Difference]: Start difference. First operand has 79 places, 74 transitions, 158 flow. Second operand 3 states and 177 transitions. [2025-04-29 11:15:56,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 66 transitions, 198 flow [2025-04-29 11:15:56,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 66 transitions, 190 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:15:56,894 INFO L231 Difference]: Finished difference. Result has 71 places, 66 transitions, 142 flow [2025-04-29 11:15:56,894 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=142, PETRI_PLACES=71, PETRI_TRANSITIONS=66} [2025-04-29 11:15:56,895 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, -15 predicate places. [2025-04-29 11:15:56,895 INFO L485 AbstractCegarLoop]: Abstraction has has 71 places, 66 transitions, 142 flow [2025-04-29 11:15:56,895 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 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:15:56,896 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:15:56,896 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-29 11:15:56,896 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 11:15:56,896 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2025-04-29 11:15:56,897 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:15:56,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1318836311, now seen corresponding path program 1 times [2025-04-29 11:15:56,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:15:56,897 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368393362] [2025-04-29 11:15:56,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:15:56,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:15:56,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-29 11:15:56,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-29 11:15:56,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:15:56,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:57,024 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:57,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:15:57,024 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368393362] [2025-04-29 11:15:57,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368393362] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:15:57,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:15:57,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:15:57,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152997142] [2025-04-29 11:15:57,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:15:57,025 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:15:57,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:15:57,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:15:57,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:15:57,133 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 83 [2025-04-29 11:15:57,133 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 66 transitions, 142 flow. Second operand has 5 states, 5 states have (on average 40.2) internal successors, (201), 5 states have internal predecessors, (201), 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:15:57,133 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:15:57,133 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 83 [2025-04-29 11:15:57,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:15:57,240 INFO L116 PetriNetUnfolderBase]: 110/387 cut-off events. [2025-04-29 11:15:57,240 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:15:57,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 649 conditions, 387 events. 110/387 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1949 event pairs, 110 based on Foata normal form. 1/333 useless extension candidates. Maximal degree in co-relation 621. Up to 249 conditions per place. [2025-04-29 11:15:57,243 INFO L140 encePairwiseOnDemand]: 78/83 looper letters, 31 selfloop transitions, 2 changer transitions 0/63 dead transitions. [2025-04-29 11:15:57,244 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 63 transitions, 202 flow [2025-04-29 11:15:57,245 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:15:57,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-29 11:15:57,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 192 transitions. [2025-04-29 11:15:57,247 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5783132530120482 [2025-04-29 11:15:57,247 INFO L175 Difference]: Start difference. First operand has 71 places, 66 transitions, 142 flow. Second operand 4 states and 192 transitions. [2025-04-29 11:15:57,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 63 transitions, 202 flow [2025-04-29 11:15:57,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 63 transitions, 194 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:15:57,248 INFO L231 Difference]: Finished difference. Result has 69 places, 63 transitions, 132 flow [2025-04-29 11:15:57,249 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=132, PETRI_PLACES=69, PETRI_TRANSITIONS=63} [2025-04-29 11:15:57,250 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, -17 predicate places. [2025-04-29 11:15:57,250 INFO L485 AbstractCegarLoop]: Abstraction has has 69 places, 63 transitions, 132 flow [2025-04-29 11:15:57,250 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 40.2) internal successors, (201), 5 states have internal predecessors, (201), 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:15:57,250 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:15:57,250 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-29 11:15:57,251 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 11:15:57,251 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2025-04-29 11:15:57,251 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:15:57,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1318836312, now seen corresponding path program 1 times [2025-04-29 11:15:57,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:15:57,251 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693514014] [2025-04-29 11:15:57,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:15:57,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:15:57,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-29 11:15:57,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-29 11:15:57,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:15:57,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:57,348 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:57,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:15:57,348 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693514014] [2025-04-29 11:15:57,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693514014] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:15:57,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:15:57,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:15:57,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555809895] [2025-04-29 11:15:57,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:15:57,349 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:15:57,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:15:57,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:15:57,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:15:57,402 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 83 [2025-04-29 11:15:57,403 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 63 transitions, 132 flow. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 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:15:57,403 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:15:57,403 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 83 [2025-04-29 11:15:57,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:15:57,469 INFO L116 PetriNetUnfolderBase]: 99/345 cut-off events. [2025-04-29 11:15:57,469 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-29 11:15:57,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 578 conditions, 345 events. 99/345 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1697 event pairs, 99 based on Foata normal form. 11/306 useless extension candidates. Maximal degree in co-relation 565. Up to 225 conditions per place. [2025-04-29 11:15:57,472 INFO L140 encePairwiseOnDemand]: 79/83 looper letters, 27 selfloop transitions, 1 changer transitions 0/60 dead transitions. [2025-04-29 11:15:57,472 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 60 transitions, 182 flow [2025-04-29 11:15:57,472 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:15:57,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:15:57,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 187 transitions. [2025-04-29 11:15:57,473 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.751004016064257 [2025-04-29 11:15:57,474 INFO L175 Difference]: Start difference. First operand has 69 places, 63 transitions, 132 flow. Second operand 3 states and 187 transitions. [2025-04-29 11:15:57,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 60 transitions, 182 flow [2025-04-29 11:15:57,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 60 transitions, 179 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:15:57,476 INFO L231 Difference]: Finished difference. Result has 66 places, 60 transitions, 125 flow [2025-04-29 11:15:57,477 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=125, PETRI_PLACES=66, PETRI_TRANSITIONS=60} [2025-04-29 11:15:57,477 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, -20 predicate places. [2025-04-29 11:15:57,478 INFO L485 AbstractCegarLoop]: Abstraction has has 66 places, 60 transitions, 125 flow [2025-04-29 11:15:57,478 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 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:15:57,478 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:15:57,478 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:15:57,478 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-29 11:15:57,479 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2025-04-29 11:15:57,479 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:15:57,479 INFO L85 PathProgramCache]: Analyzing trace with hash -611631119, now seen corresponding path program 1 times [2025-04-29 11:15:57,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:15:57,479 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788015037] [2025-04-29 11:15:57,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:15:57,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:15:57,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-29 11:15:57,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-29 11:15:57,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:15:57,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:57,673 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:57,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:15:57,673 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788015037] [2025-04-29 11:15:57,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788015037] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:15:57,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:15:57,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:15:57,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000584170] [2025-04-29 11:15:57,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:15:57,674 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:15:57,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:15:57,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:15:57,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:15:57,748 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 83 [2025-04-29 11:15:57,749 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 60 transitions, 125 flow. Second operand has 4 states, 4 states have (on average 49.75) internal successors, (199), 4 states have internal predecessors, (199), 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:15:57,749 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:15:57,750 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 83 [2025-04-29 11:15:57,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:15:57,823 INFO L116 PetriNetUnfolderBase]: 110/353 cut-off events. [2025-04-29 11:15:57,824 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:15:57,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 613 conditions, 353 events. 110/353 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1659 event pairs, 110 based on Foata normal form. 0/322 useless extension candidates. Maximal degree in co-relation 603. Up to 248 conditions per place. [2025-04-29 11:15:57,827 INFO L140 encePairwiseOnDemand]: 79/83 looper letters, 32 selfloop transitions, 1 changer transitions 0/57 dead transitions. [2025-04-29 11:15:57,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 57 transitions, 185 flow [2025-04-29 11:15:57,827 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:15:57,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:15:57,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 177 transitions. [2025-04-29 11:15:57,828 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7108433734939759 [2025-04-29 11:15:57,828 INFO L175 Difference]: Start difference. First operand has 66 places, 60 transitions, 125 flow. Second operand 3 states and 177 transitions. [2025-04-29 11:15:57,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 57 transitions, 185 flow [2025-04-29 11:15:57,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 57 transitions, 184 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:15:57,830 INFO L231 Difference]: Finished difference. Result has 64 places, 57 transitions, 120 flow [2025-04-29 11:15:57,830 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=120, PETRI_PLACES=64, PETRI_TRANSITIONS=57} [2025-04-29 11:15:57,831 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, -22 predicate places. [2025-04-29 11:15:57,831 INFO L485 AbstractCegarLoop]: Abstraction has has 64 places, 57 transitions, 120 flow [2025-04-29 11:15:57,831 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 49.75) internal successors, (199), 4 states have internal predecessors, (199), 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:15:57,831 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:15:57,831 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:15:57,831 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-29 11:15:57,831 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2025-04-29 11:15:57,832 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:15:57,832 INFO L85 PathProgramCache]: Analyzing trace with hash -611631118, now seen corresponding path program 1 times [2025-04-29 11:15:57,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:15:57,832 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427098709] [2025-04-29 11:15:57,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:15:57,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:15:57,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-29 11:15:57,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-29 11:15:57,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:15:57,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:58,046 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:58,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:15:58,047 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427098709] [2025-04-29 11:15:58,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427098709] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:15:58,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:15:58,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:15:58,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93911017] [2025-04-29 11:15:58,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:15:58,048 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:15:58,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:15:58,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:15:58,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:15:58,156 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 83 [2025-04-29 11:15:58,157 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 57 transitions, 120 flow. Second operand has 5 states, 5 states have (on average 38.2) internal successors, (191), 5 states have internal predecessors, (191), 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:15:58,157 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:15:58,157 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 83 [2025-04-29 11:15:58,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:15:58,262 INFO L116 PetriNetUnfolderBase]: 110/341 cut-off events. [2025-04-29 11:15:58,262 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:15:58,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 602 conditions, 341 events. 110/341 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1574 event pairs, 110 based on Foata normal form. 0/310 useless extension candidates. Maximal degree in co-relation 592. Up to 246 conditions per place. [2025-04-29 11:15:58,264 INFO L140 encePairwiseOnDemand]: 78/83 looper letters, 31 selfloop transitions, 2 changer transitions 0/54 dead transitions. [2025-04-29 11:15:58,264 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 54 transitions, 180 flow [2025-04-29 11:15:58,264 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:15:58,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-29 11:15:58,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 180 transitions. [2025-04-29 11:15:58,265 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5421686746987951 [2025-04-29 11:15:58,265 INFO L175 Difference]: Start difference. First operand has 64 places, 57 transitions, 120 flow. Second operand 4 states and 180 transitions. [2025-04-29 11:15:58,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 54 transitions, 180 flow [2025-04-29 11:15:58,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 54 transitions, 179 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:15:58,266 INFO L231 Difference]: Finished difference. Result has 63 places, 54 transitions, 117 flow [2025-04-29 11:15:58,266 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=117, PETRI_PLACES=63, PETRI_TRANSITIONS=54} [2025-04-29 11:15:58,266 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, -23 predicate places. [2025-04-29 11:15:58,266 INFO L485 AbstractCegarLoop]: Abstraction has has 63 places, 54 transitions, 117 flow [2025-04-29 11:15:58,266 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.2) internal successors, (191), 5 states have internal predecessors, (191), 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:15:58,266 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:15:58,266 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:15:58,267 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-29 11:15:58,267 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2025-04-29 11:15:58,267 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:15:58,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1244431167, now seen corresponding path program 1 times [2025-04-29 11:15:58,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:15:58,267 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753441373] [2025-04-29 11:15:58,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:15:58,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:15:58,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-29 11:15:58,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-29 11:15:58,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:15:58,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:58,837 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:58,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:15:58,838 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753441373] [2025-04-29 11:15:58,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753441373] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:15:58,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:15:58,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-29 11:15:58,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493742901] [2025-04-29 11:15:58,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:15:58,839 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-29 11:15:58,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:15:58,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-29 11:15:58,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-04-29 11:15:59,474 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 83 [2025-04-29 11:15:59,475 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 54 transitions, 117 flow. Second operand has 13 states, 13 states have (on average 37.23076923076923) internal successors, (484), 13 states have internal predecessors, (484), 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:15:59,475 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:15:59,475 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 83 [2025-04-29 11:15:59,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:15:59,762 INFO L116 PetriNetUnfolderBase]: 194/579 cut-off events. [2025-04-29 11:15:59,762 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:15:59,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1020 conditions, 579 events. 194/579 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 3141 event pairs, 18 based on Foata normal form. 0/525 useless extension candidates. Maximal degree in co-relation 1010. Up to 137 conditions per place. [2025-04-29 11:15:59,764 INFO L140 encePairwiseOnDemand]: 69/83 looper letters, 59 selfloop transitions, 21 changer transitions 0/98 dead transitions. [2025-04-29 11:15:59,764 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 98 transitions, 365 flow [2025-04-29 11:15:59,764 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-29 11:15:59,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-29 11:15:59,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 478 transitions. [2025-04-29 11:15:59,766 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5235487404162102 [2025-04-29 11:15:59,766 INFO L175 Difference]: Start difference. First operand has 63 places, 54 transitions, 117 flow. Second operand 11 states and 478 transitions. [2025-04-29 11:15:59,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 98 transitions, 365 flow [2025-04-29 11:15:59,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 98 transitions, 362 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:15:59,771 INFO L231 Difference]: Finished difference. Result has 75 places, 65 transitions, 212 flow [2025-04-29 11:15:59,771 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=212, PETRI_PLACES=75, PETRI_TRANSITIONS=65} [2025-04-29 11:15:59,771 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, -11 predicate places. [2025-04-29 11:15:59,771 INFO L485 AbstractCegarLoop]: Abstraction has has 75 places, 65 transitions, 212 flow [2025-04-29 11:15:59,772 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 37.23076923076923) internal successors, (484), 13 states have internal predecessors, (484), 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:15:59,772 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:15:59,772 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:15:59,772 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-29 11:15:59,772 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2025-04-29 11:15:59,772 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:15:59,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1244431168, now seen corresponding path program 1 times [2025-04-29 11:15:59,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:15:59,775 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028726018] [2025-04-29 11:15:59,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:15:59,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:15:59,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-29 11:15:59,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-29 11:15:59,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:15:59,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:00,385 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,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:16:00,386 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028726018] [2025-04-29 11:16:00,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028726018] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:16:00,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:16:00,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-29 11:16:00,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842089095] [2025-04-29 11:16:00,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:16:00,386 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:16:00,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:16:00,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:16:00,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:16:00,777 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 83 [2025-04-29 11:16:00,778 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 65 transitions, 212 flow. Second operand has 10 states, 10 states have (on average 36.6) internal successors, (366), 10 states have internal predecessors, (366), 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,778 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:16:00,778 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 83 [2025-04-29 11:16:00,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:16:01,063 INFO L116 PetriNetUnfolderBase]: 190/594 cut-off events. [2025-04-29 11:16:01,063 INFO L117 PetriNetUnfolderBase]: For 164/164 co-relation queries the response was YES. [2025-04-29 11:16:01,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1222 conditions, 594 events. 190/594 cut-off events. For 164/164 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 3358 event pairs, 10 based on Foata normal form. 11/548 useless extension candidates. Maximal degree in co-relation 1206. Up to 226 conditions per place. [2025-04-29 11:16:01,066 INFO L140 encePairwiseOnDemand]: 73/83 looper letters, 72 selfloop transitions, 17 changer transitions 0/106 dead transitions. [2025-04-29 11:16:01,066 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 106 transitions, 492 flow [2025-04-29 11:16:01,067 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-29 11:16:01,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-29 11:16:01,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 471 transitions. [2025-04-29 11:16:01,069 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.515881708652793 [2025-04-29 11:16:01,069 INFO L175 Difference]: Start difference. First operand has 75 places, 65 transitions, 212 flow. Second operand 11 states and 471 transitions. [2025-04-29 11:16:01,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 106 transitions, 492 flow [2025-04-29 11:16:01,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 106 transitions, 484 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-29 11:16:01,074 INFO L231 Difference]: Finished difference. Result has 83 places, 69 transitions, 269 flow [2025-04-29 11:16:01,074 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=269, PETRI_PLACES=83, PETRI_TRANSITIONS=69} [2025-04-29 11:16:01,075 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, -3 predicate places. [2025-04-29 11:16:01,076 INFO L485 AbstractCegarLoop]: Abstraction has has 83 places, 69 transitions, 269 flow [2025-04-29 11:16:01,077 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 36.6) internal successors, (366), 10 states have internal predecessors, (366), 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,077 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:16:01,077 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:16:01,077 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-29 11:16:01,077 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2025-04-29 11:16:01,077 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:01,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1299603868, now seen corresponding path program 1 times [2025-04-29 11:16:01,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:16:01,078 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955527113] [2025-04-29 11:16:01,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:01,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:16:01,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-29 11:16:01,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-29 11:16:01,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:01,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:01,755 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,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:16:01,756 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955527113] [2025-04-29 11:16:01,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955527113] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:16:01,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:16:01,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-29 11:16:01,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19651792] [2025-04-29 11:16:01,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:16:01,756 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-29 11:16:01,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:16:01,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-29 11:16:01,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-04-29 11:16:02,417 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 83 [2025-04-29 11:16:02,418 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 69 transitions, 269 flow. Second operand has 13 states, 13 states have (on average 33.15384615384615) internal successors, (431), 13 states have internal predecessors, (431), 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,418 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:16:02,418 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 83 [2025-04-29 11:16:02,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:16:02,776 INFO L116 PetriNetUnfolderBase]: 212/627 cut-off events. [2025-04-29 11:16:02,776 INFO L117 PetriNetUnfolderBase]: For 309/309 co-relation queries the response was YES. [2025-04-29 11:16:02,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1401 conditions, 627 events. 212/627 cut-off events. For 309/309 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 3486 event pairs, 5 based on Foata normal form. 17/596 useless extension candidates. Maximal degree in co-relation 1382. Up to 315 conditions per place. [2025-04-29 11:16:02,781 INFO L140 encePairwiseOnDemand]: 72/83 looper letters, 66 selfloop transitions, 18 changer transitions 0/98 dead transitions. [2025-04-29 11:16:02,781 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 98 transitions, 518 flow [2025-04-29 11:16:02,781 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-29 11:16:02,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-29 11:16:02,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 431 transitions. [2025-04-29 11:16:02,784 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4720700985761227 [2025-04-29 11:16:02,785 INFO L175 Difference]: Start difference. First operand has 83 places, 69 transitions, 269 flow. Second operand 11 states and 431 transitions. [2025-04-29 11:16:02,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 98 transitions, 518 flow [2025-04-29 11:16:02,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 98 transitions, 489 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-04-29 11:16:02,787 INFO L231 Difference]: Finished difference. Result has 87 places, 69 transitions, 285 flow [2025-04-29 11:16:02,789 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=285, PETRI_PLACES=87, PETRI_TRANSITIONS=69} [2025-04-29 11:16:02,790 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 1 predicate places. [2025-04-29 11:16:02,790 INFO L485 AbstractCegarLoop]: Abstraction has has 87 places, 69 transitions, 285 flow [2025-04-29 11:16:02,790 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 33.15384615384615) internal successors, (431), 13 states have internal predecessors, (431), 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,791 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:16:02,791 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:16:02,791 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-29 11:16:02,791 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2025-04-29 11:16:02,791 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:02,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1299603867, now seen corresponding path program 1 times [2025-04-29 11:16:02,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:16:02,792 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988953733] [2025-04-29 11:16:02,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:02,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:16:02,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-29 11:16:02,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-29 11:16:02,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:02,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:03,163 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,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:16:03,163 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988953733] [2025-04-29 11:16:03,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988953733] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:16:03,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:16:03,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-29 11:16:03,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743733858] [2025-04-29 11:16:03,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:16:03,164 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-29 11:16:03,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:16:03,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-29 11:16:03,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-04-29 11:16:03,581 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 83 [2025-04-29 11:16:03,582 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 69 transitions, 285 flow. Second operand has 12 states, 12 states have (on average 35.25) internal successors, (423), 12 states have internal predecessors, (423), 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,582 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:16:03,582 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 83 [2025-04-29 11:16:03,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:16:03,854 INFO L116 PetriNetUnfolderBase]: 194/547 cut-off events. [2025-04-29 11:16:03,854 INFO L117 PetriNetUnfolderBase]: For 262/262 co-relation queries the response was YES. [2025-04-29 11:16:03,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1267 conditions, 547 events. 194/547 cut-off events. For 262/262 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2829 event pairs, 6 based on Foata normal form. 16/541 useless extension candidates. Maximal degree in co-relation 1248. Up to 228 conditions per place. [2025-04-29 11:16:03,857 INFO L140 encePairwiseOnDemand]: 71/83 looper letters, 63 selfloop transitions, 20 changer transitions 0/97 dead transitions. [2025-04-29 11:16:03,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 97 transitions, 525 flow [2025-04-29 11:16:03,858 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-29 11:16:03,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-29 11:16:03,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 453 transitions. [2025-04-29 11:16:03,859 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.49616648411829134 [2025-04-29 11:16:03,859 INFO L175 Difference]: Start difference. First operand has 87 places, 69 transitions, 285 flow. Second operand 11 states and 453 transitions. [2025-04-29 11:16:03,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 97 transitions, 525 flow [2025-04-29 11:16:03,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 97 transitions, 500 flow, removed 1 selfloop flow, removed 7 redundant places. [2025-04-29 11:16:03,862 INFO L231 Difference]: Finished difference. Result has 88 places, 69 transitions, 309 flow [2025-04-29 11:16:03,863 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=309, PETRI_PLACES=88, PETRI_TRANSITIONS=69} [2025-04-29 11:16:03,863 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 2 predicate places. [2025-04-29 11:16:03,863 INFO L485 AbstractCegarLoop]: Abstraction has has 88 places, 69 transitions, 309 flow [2025-04-29 11:16:03,863 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 35.25) internal successors, (423), 12 states have internal predecessors, (423), 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,864 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:16:03,864 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:16:03,864 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-29 11:16:03,864 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2025-04-29 11:16:03,864 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:03,864 INFO L85 PathProgramCache]: Analyzing trace with hash -310828702, now seen corresponding path program 1 times [2025-04-29 11:16:03,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:16:03,864 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785065000] [2025-04-29 11:16:03,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:03,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:16:03,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-29 11:16:03,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-29 11:16:03,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:03,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:03,928 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,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:16:03,929 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785065000] [2025-04-29 11:16:03,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785065000] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:16:03,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:16:03,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:16:03,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863714106] [2025-04-29 11:16:03,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:16:03,930 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:16:03,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:16:03,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:16:03,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:16:03,931 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 83 [2025-04-29 11:16:03,932 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 69 transitions, 309 flow. Second operand has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 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,932 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:16:03,932 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 83 [2025-04-29 11:16:03,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:16:04,010 INFO L116 PetriNetUnfolderBase]: 131/417 cut-off events. [2025-04-29 11:16:04,010 INFO L117 PetriNetUnfolderBase]: For 319/319 co-relation queries the response was YES. [2025-04-29 11:16:04,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 979 conditions, 417 events. 131/417 cut-off events. For 319/319 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2178 event pairs, 51 based on Foata normal form. 6/402 useless extension candidates. Maximal degree in co-relation 961. Up to 221 conditions per place. [2025-04-29 11:16:04,012 INFO L140 encePairwiseOnDemand]: 77/83 looper letters, 59 selfloop transitions, 6 changer transitions 0/90 dead transitions. [2025-04-29 11:16:04,012 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 90 transitions, 519 flow [2025-04-29 11:16:04,013 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:16:04,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:16:04,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 213 transitions. [2025-04-29 11:16:04,013 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8554216867469879 [2025-04-29 11:16:04,013 INFO L175 Difference]: Start difference. First operand has 88 places, 69 transitions, 309 flow. Second operand 3 states and 213 transitions. [2025-04-29 11:16:04,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 90 transitions, 519 flow [2025-04-29 11:16:04,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 90 transitions, 473 flow, removed 3 selfloop flow, removed 8 redundant places. [2025-04-29 11:16:04,016 INFO L231 Difference]: Finished difference. Result has 82 places, 70 transitions, 286 flow [2025-04-29 11:16:04,016 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=286, PETRI_PLACES=82, PETRI_TRANSITIONS=70} [2025-04-29 11:16:04,017 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, -4 predicate places. [2025-04-29 11:16:04,017 INFO L485 AbstractCegarLoop]: Abstraction has has 82 places, 70 transitions, 286 flow [2025-04-29 11:16:04,017 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 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:04,017 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:16:04,017 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:16:04,017 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-29 11:16:04,017 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2025-04-29 11:16:04,017 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:04,018 INFO L85 PathProgramCache]: Analyzing trace with hash 757758767, now seen corresponding path program 1 times [2025-04-29 11:16:04,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:16:04,018 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523047159] [2025-04-29 11:16:04,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:04,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:16:04,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-29 11:16:04,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-29 11:16:04,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:04,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:04,152 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:04,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:16:04,152 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523047159] [2025-04-29 11:16:04,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523047159] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:16:04,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:16:04,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:16:04,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131126419] [2025-04-29 11:16:04,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:16:04,153 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:16:04,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:16:04,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:16:04,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:16:04,228 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 83 [2025-04-29 11:16:04,228 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 70 transitions, 286 flow. Second operand has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 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:04,228 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:16:04,228 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 83 [2025-04-29 11:16:04,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:16:04,337 INFO L116 PetriNetUnfolderBase]: 167/513 cut-off events. [2025-04-29 11:16:04,337 INFO L117 PetriNetUnfolderBase]: For 297/298 co-relation queries the response was YES. [2025-04-29 11:16:04,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1222 conditions, 513 events. 167/513 cut-off events. For 297/298 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2843 event pairs, 55 based on Foata normal form. 10/498 useless extension candidates. Maximal degree in co-relation 1206. Up to 190 conditions per place. [2025-04-29 11:16:04,340 INFO L140 encePairwiseOnDemand]: 76/83 looper letters, 58 selfloop transitions, 16 changer transitions 0/93 dead transitions. [2025-04-29 11:16:04,340 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 93 transitions, 517 flow [2025-04-29 11:16:04,340 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:16:04,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-29 11:16:04,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 305 transitions. [2025-04-29 11:16:04,341 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7349397590361446 [2025-04-29 11:16:04,341 INFO L175 Difference]: Start difference. First operand has 82 places, 70 transitions, 286 flow. Second operand 5 states and 305 transitions. [2025-04-29 11:16:04,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 93 transitions, 517 flow [2025-04-29 11:16:04,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 93 transitions, 504 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:16:04,343 INFO L231 Difference]: Finished difference. Result has 87 places, 72 transitions, 347 flow [2025-04-29 11:16:04,344 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=347, PETRI_PLACES=87, PETRI_TRANSITIONS=72} [2025-04-29 11:16:04,344 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 1 predicate places. [2025-04-29 11:16:04,344 INFO L485 AbstractCegarLoop]: Abstraction has has 87 places, 72 transitions, 347 flow [2025-04-29 11:16:04,344 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 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:04,344 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:16:04,344 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:16:04,344 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-29 11:16:04,344 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2025-04-29 11:16:04,345 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:04,345 INFO L85 PathProgramCache]: Analyzing trace with hash 757758766, now seen corresponding path program 1 times [2025-04-29 11:16:04,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:16:04,345 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284897085] [2025-04-29 11:16:04,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:04,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:16:04,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-29 11:16:04,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-29 11:16:04,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:04,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:04,446 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:04,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:16:04,447 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284897085] [2025-04-29 11:16:04,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284897085] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:16:04,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:16:04,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:16:04,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643951230] [2025-04-29 11:16:04,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:16:04,448 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:16:04,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:16:04,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:16:04,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:16:04,557 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 83 [2025-04-29 11:16:04,557 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 72 transitions, 347 flow. Second operand has 6 states, 6 states have (on average 44.333333333333336) internal successors, (266), 6 states have internal predecessors, (266), 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:04,557 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:16:04,557 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 83 [2025-04-29 11:16:04,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:16:04,673 INFO L116 PetriNetUnfolderBase]: 167/511 cut-off events. [2025-04-29 11:16:04,674 INFO L117 PetriNetUnfolderBase]: For 468/469 co-relation queries the response was YES. [2025-04-29 11:16:04,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1311 conditions, 511 events. 167/511 cut-off events. For 468/469 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2818 event pairs, 60 based on Foata normal form. 11/498 useless extension candidates. Maximal degree in co-relation 1292. Up to 226 conditions per place. [2025-04-29 11:16:04,676 INFO L140 encePairwiseOnDemand]: 71/83 looper letters, 48 selfloop transitions, 23 changer transitions 0/90 dead transitions. [2025-04-29 11:16:04,677 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 90 transitions, 545 flow [2025-04-29 11:16:04,677 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:16:04,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:16:04,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 303 transitions. [2025-04-29 11:16:04,678 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.608433734939759 [2025-04-29 11:16:04,678 INFO L175 Difference]: Start difference. First operand has 87 places, 72 transitions, 347 flow. Second operand 6 states and 303 transitions. [2025-04-29 11:16:04,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 90 transitions, 545 flow [2025-04-29 11:16:04,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 90 transitions, 539 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:16:04,681 INFO L231 Difference]: Finished difference. Result has 94 places, 73 transitions, 434 flow [2025-04-29 11:16:04,681 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=341, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=434, PETRI_PLACES=94, PETRI_TRANSITIONS=73} [2025-04-29 11:16:04,682 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 8 predicate places. [2025-04-29 11:16:04,682 INFO L485 AbstractCegarLoop]: Abstraction has has 94 places, 73 transitions, 434 flow [2025-04-29 11:16:04,682 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 44.333333333333336) internal successors, (266), 6 states have internal predecessors, (266), 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:04,682 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:16:04,682 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:16:04,682 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-29 11:16:04,683 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2025-04-29 11:16:04,683 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:04,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1363854387, now seen corresponding path program 1 times [2025-04-29 11:16:04,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:16:04,683 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628425715] [2025-04-29 11:16:04,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:04,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:16:04,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-29 11:16:04,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-29 11:16:04,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:04,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:05,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:16:05,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:16:05,058 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628425715] [2025-04-29 11:16:05,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628425715] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:16:05,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:16:05,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-29 11:16:05,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323225750] [2025-04-29 11:16:05,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:16:05,059 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-29 11:16:05,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:16:05,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-29 11:16:05,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-04-29 11:16:05,589 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 83 [2025-04-29 11:16:05,590 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 73 transitions, 434 flow. Second operand has 13 states, 13 states have (on average 34.61538461538461) internal successors, (450), 13 states have internal predecessors, (450), 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:05,590 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:16:05,590 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 83 [2025-04-29 11:16:05,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:16:06,132 INFO L116 PetriNetUnfolderBase]: 191/563 cut-off events. [2025-04-29 11:16:06,132 INFO L117 PetriNetUnfolderBase]: For 1044/1044 co-relation queries the response was YES. [2025-04-29 11:16:06,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1639 conditions, 563 events. 191/563 cut-off events. For 1044/1044 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 3072 event pairs, 12 based on Foata normal form. 6/544 useless extension candidates. Maximal degree in co-relation 1615. Up to 91 conditions per place. [2025-04-29 11:16:06,135 INFO L140 encePairwiseOnDemand]: 67/83 looper letters, 73 selfloop transitions, 53 changer transitions 3/142 dead transitions. [2025-04-29 11:16:06,135 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 142 transitions, 1002 flow [2025-04-29 11:16:06,135 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-29 11:16:06,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-04-29 11:16:06,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 834 transitions. [2025-04-29 11:16:06,137 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.45673603504928806 [2025-04-29 11:16:06,137 INFO L175 Difference]: Start difference. First operand has 94 places, 73 transitions, 434 flow. Second operand 22 states and 834 transitions. [2025-04-29 11:16:06,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 142 transitions, 1002 flow [2025-04-29 11:16:06,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 142 transitions, 947 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-29 11:16:06,142 INFO L231 Difference]: Finished difference. Result has 113 places, 92 transitions, 629 flow [2025-04-29 11:16:06,142 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=396, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=629, PETRI_PLACES=113, PETRI_TRANSITIONS=92} [2025-04-29 11:16:06,143 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 27 predicate places. [2025-04-29 11:16:06,143 INFO L485 AbstractCegarLoop]: Abstraction has has 113 places, 92 transitions, 629 flow [2025-04-29 11:16:06,143 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 34.61538461538461) internal successors, (450), 13 states have internal predecessors, (450), 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,143 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:16:06,143 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:16:06,144 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-29 11:16:06,144 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2025-04-29 11:16:06,144 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:06,144 INFO L85 PathProgramCache]: Analyzing trace with hash 398800980, now seen corresponding path program 1 times [2025-04-29 11:16:06,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:16:06,144 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037741429] [2025-04-29 11:16:06,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:06,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:16:06,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-29 11:16:06,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-29 11:16:06,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:06,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:06,481 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:06,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:16:06,482 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037741429] [2025-04-29 11:16:06,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037741429] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:16:06,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:16:06,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-29 11:16:06,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646557549] [2025-04-29 11:16:06,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:16:06,482 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-29 11:16:06,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:16:06,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-29 11:16:06,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-04-29 11:16:06,901 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 83 [2025-04-29 11:16:06,902 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 92 transitions, 629 flow. Second operand has 12 states, 12 states have (on average 36.75) internal successors, (441), 12 states have internal predecessors, (441), 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,902 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:16:06,902 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 83 [2025-04-29 11:16:06,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:16:07,203 INFO L116 PetriNetUnfolderBase]: 168/511 cut-off events. [2025-04-29 11:16:07,203 INFO L117 PetriNetUnfolderBase]: For 943/943 co-relation queries the response was YES. [2025-04-29 11:16:07,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1624 conditions, 511 events. 168/511 cut-off events. For 943/943 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2814 event pairs, 33 based on Foata normal form. 6/497 useless extension candidates. Maximal degree in co-relation 1597. Up to 87 conditions per place. [2025-04-29 11:16:07,206 INFO L140 encePairwiseOnDemand]: 69/83 looper letters, 62 selfloop transitions, 44 changer transitions 0/121 dead transitions. [2025-04-29 11:16:07,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 121 transitions, 933 flow [2025-04-29 11:16:07,207 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-29 11:16:07,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-29 11:16:07,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 499 transitions. [2025-04-29 11:16:07,209 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.501004016064257 [2025-04-29 11:16:07,209 INFO L175 Difference]: Start difference. First operand has 113 places, 92 transitions, 629 flow. Second operand 12 states and 499 transitions. [2025-04-29 11:16:07,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 121 transitions, 933 flow [2025-04-29 11:16:07,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 121 transitions, 845 flow, removed 1 selfloop flow, removed 13 redundant places. [2025-04-29 11:16:07,215 INFO L231 Difference]: Finished difference. Result has 113 places, 92 transitions, 650 flow [2025-04-29 11:16:07,215 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=541, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=650, PETRI_PLACES=113, PETRI_TRANSITIONS=92} [2025-04-29 11:16:07,215 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 27 predicate places. [2025-04-29 11:16:07,216 INFO L485 AbstractCegarLoop]: Abstraction has has 113 places, 92 transitions, 650 flow [2025-04-29 11:16:07,216 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 36.75) internal successors, (441), 12 states have internal predecessors, (441), 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,216 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:16:07,216 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:16:07,216 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-29 11:16:07,217 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2025-04-29 11:16:07,217 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:07,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1791339719, now seen corresponding path program 1 times [2025-04-29 11:16:07,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:16:07,218 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191814278] [2025-04-29 11:16:07,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:07,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:16:07,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-29 11:16:07,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-29 11:16:07,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:07,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:07,540 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:07,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:16:07,540 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191814278] [2025-04-29 11:16:07,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191814278] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:16:07,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:16:07,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-29 11:16:07,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756044380] [2025-04-29 11:16:07,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:16:07,545 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-29 11:16:07,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:16:07,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-29 11:16:07,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-04-29 11:16:08,000 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 83 [2025-04-29 11:16:08,001 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 92 transitions, 650 flow. Second operand has 14 states, 14 states have (on average 35.42857142857143) internal successors, (496), 14 states have internal predecessors, (496), 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:08,001 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:16:08,001 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 83 [2025-04-29 11:16:08,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:16:08,370 INFO L116 PetriNetUnfolderBase]: 207/611 cut-off events. [2025-04-29 11:16:08,370 INFO L117 PetriNetUnfolderBase]: For 1409/1409 co-relation queries the response was YES. [2025-04-29 11:16:08,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1980 conditions, 611 events. 207/611 cut-off events. For 1409/1409 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3493 event pairs, 15 based on Foata normal form. 40/648 useless extension candidates. Maximal degree in co-relation 1951. Up to 102 conditions per place. [2025-04-29 11:16:08,374 INFO L140 encePairwiseOnDemand]: 64/83 looper letters, 93 selfloop transitions, 54 changer transitions 1/160 dead transitions. [2025-04-29 11:16:08,374 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 160 transitions, 1284 flow [2025-04-29 11:16:08,374 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-29 11:16:08,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-04-29 11:16:08,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 806 transitions. [2025-04-29 11:16:08,376 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4855421686746988 [2025-04-29 11:16:08,376 INFO L175 Difference]: Start difference. First operand has 113 places, 92 transitions, 650 flow. Second operand 20 states and 806 transitions. [2025-04-29 11:16:08,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 160 transitions, 1284 flow [2025-04-29 11:16:08,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 160 transitions, 1160 flow, removed 0 selfloop flow, removed 11 redundant places. [2025-04-29 11:16:08,382 INFO L231 Difference]: Finished difference. Result has 126 places, 104 transitions, 836 flow [2025-04-29 11:16:08,382 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=558, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=836, PETRI_PLACES=126, PETRI_TRANSITIONS=104} [2025-04-29 11:16:08,382 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 40 predicate places. [2025-04-29 11:16:08,383 INFO L485 AbstractCegarLoop]: Abstraction has has 126 places, 104 transitions, 836 flow [2025-04-29 11:16:08,383 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 35.42857142857143) internal successors, (496), 14 states have internal predecessors, (496), 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:08,383 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:16:08,383 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:16:08,383 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-29 11:16:08,383 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2025-04-29 11:16:08,384 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:08,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1791339718, now seen corresponding path program 1 times [2025-04-29 11:16:08,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:16:08,384 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940258945] [2025-04-29 11:16:08,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:08,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:16:08,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-29 11:16:08,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-29 11:16:08,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:08,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:08,813 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:16:08,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:16:08,813 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940258945] [2025-04-29 11:16:08,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940258945] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:16:08,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:16:08,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-29 11:16:08,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112958179] [2025-04-29 11:16:08,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:16:08,814 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-29 11:16:08,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:16:08,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-29 11:16:08,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-04-29 11:16:09,444 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 83 [2025-04-29 11:16:09,445 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 104 transitions, 836 flow. Second operand has 13 states, 13 states have (on average 33.53846153846154) internal successors, (436), 13 states have internal predecessors, (436), 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:09,445 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:16:09,445 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 83 [2025-04-29 11:16:09,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:16:09,844 INFO L116 PetriNetUnfolderBase]: 225/586 cut-off events. [2025-04-29 11:16:09,844 INFO L117 PetriNetUnfolderBase]: For 1724/1724 co-relation queries the response was YES. [2025-04-29 11:16:09,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2153 conditions, 586 events. 225/586 cut-off events. For 1724/1724 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 3054 event pairs, 30 based on Foata normal form. 27/610 useless extension candidates. Maximal degree in co-relation 2116. Up to 189 conditions per place. [2025-04-29 11:16:09,847 INFO L140 encePairwiseOnDemand]: 67/83 looper letters, 84 selfloop transitions, 35 changer transitions 16/143 dead transitions. [2025-04-29 11:16:09,847 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 143 transitions, 1263 flow [2025-04-29 11:16:09,847 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-29 11:16:09,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-04-29 11:16:09,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 674 transitions. [2025-04-29 11:16:09,848 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.45113788487282463 [2025-04-29 11:16:09,848 INFO L175 Difference]: Start difference. First operand has 126 places, 104 transitions, 836 flow. Second operand 18 states and 674 transitions. [2025-04-29 11:16:09,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 143 transitions, 1263 flow [2025-04-29 11:16:09,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 143 transitions, 1228 flow, removed 0 selfloop flow, removed 9 redundant places. [2025-04-29 11:16:09,854 INFO L231 Difference]: Finished difference. Result has 132 places, 89 transitions, 715 flow [2025-04-29 11:16:09,855 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=797, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=715, PETRI_PLACES=132, PETRI_TRANSITIONS=89} [2025-04-29 11:16:09,855 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 46 predicate places. [2025-04-29 11:16:09,855 INFO L485 AbstractCegarLoop]: Abstraction has has 132 places, 89 transitions, 715 flow [2025-04-29 11:16:09,855 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 33.53846153846154) internal successors, (436), 13 states have internal predecessors, (436), 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:09,855 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:16:09,856 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:16:09,856 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-29 11:16:09,856 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2025-04-29 11:16:09,856 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:09,856 INFO L85 PathProgramCache]: Analyzing trace with hash 43631794, now seen corresponding path program 1 times [2025-04-29 11:16:09,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:16:09,856 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590249259] [2025-04-29 11:16:09,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:09,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:16:09,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-29 11:16:09,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-29 11:16:09,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:09,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:16:09,876 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-29 11:16:09,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-29 11:16:09,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-29 11:16:09,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:09,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:16:09,915 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-29 11:16:09,915 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-29 11:16:09,915 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK (53 of 54 remaining) [2025-04-29 11:16:09,916 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 54 remaining) [2025-04-29 11:16:09,916 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 54 remaining) [2025-04-29 11:16:09,916 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 54 remaining) [2025-04-29 11:16:09,916 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 54 remaining) [2025-04-29 11:16:09,917 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 54 remaining) [2025-04-29 11:16:09,917 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 54 remaining) [2025-04-29 11:16:09,917 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 54 remaining) [2025-04-29 11:16:09,917 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 54 remaining) [2025-04-29 11:16:09,917 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 54 remaining) [2025-04-29 11:16:09,917 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 54 remaining) [2025-04-29 11:16:09,917 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 54 remaining) [2025-04-29 11:16:09,917 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 54 remaining) [2025-04-29 11:16:09,917 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 54 remaining) [2025-04-29 11:16:09,917 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 54 remaining) [2025-04-29 11:16:09,917 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 54 remaining) [2025-04-29 11:16:09,917 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 54 remaining) [2025-04-29 11:16:09,917 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 54 remaining) [2025-04-29 11:16:09,917 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 54 remaining) [2025-04-29 11:16:09,917 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 54 remaining) [2025-04-29 11:16:09,917 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 54 remaining) [2025-04-29 11:16:09,917 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 54 remaining) [2025-04-29 11:16:09,917 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 54 remaining) [2025-04-29 11:16:09,917 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 54 remaining) [2025-04-29 11:16:09,917 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 54 remaining) [2025-04-29 11:16:09,917 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 54 remaining) [2025-04-29 11:16:09,917 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 54 remaining) [2025-04-29 11:16:09,917 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 54 remaining) [2025-04-29 11:16:09,917 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 54 remaining) [2025-04-29 11:16:09,917 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 54 remaining) [2025-04-29 11:16:09,917 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 54 remaining) [2025-04-29 11:16:09,917 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 54 remaining) [2025-04-29 11:16:09,917 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 54 remaining) [2025-04-29 11:16:09,917 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 54 remaining) [2025-04-29 11:16:09,917 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 54 remaining) [2025-04-29 11:16:09,917 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 54 remaining) [2025-04-29 11:16:09,917 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 54 remaining) [2025-04-29 11:16:09,917 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 54 remaining) [2025-04-29 11:16:09,919 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 54 remaining) [2025-04-29 11:16:09,920 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 54 remaining) [2025-04-29 11:16:09,920 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 54 remaining) [2025-04-29 11:16:09,920 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 54 remaining) [2025-04-29 11:16:09,920 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 54 remaining) [2025-04-29 11:16:09,920 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 54 remaining) [2025-04-29 11:16:09,920 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 54 remaining) [2025-04-29 11:16:09,920 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 54 remaining) [2025-04-29 11:16:09,920 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 54 remaining) [2025-04-29 11:16:09,920 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 54 remaining) [2025-04-29 11:16:09,920 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 54 remaining) [2025-04-29 11:16:09,920 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 54 remaining) [2025-04-29 11:16:09,920 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 54 remaining) [2025-04-29 11:16:09,921 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 54 remaining) [2025-04-29 11:16:09,921 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 54 remaining) [2025-04-29 11:16:09,921 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 54 remaining) [2025-04-29 11:16:09,921 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-29 11:16:09,921 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:16:09,965 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-29 11:16:09,966 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-29 11:16:09,970 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.04 11:16:09 BasicIcfg [2025-04-29 11:16:09,970 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-29 11:16:09,971 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-29 11:16:09,971 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-29 11:16:09,971 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-29 11:16:09,971 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:15:55" (3/4) ... [2025-04-29 11:16:09,972 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-04-29 11:16:09,973 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-29 11:16:09,974 INFO L158 Benchmark]: Toolchain (without parser) took 14837.59ms. Allocated memory was 142.6MB in the beginning and 503.3MB in the end (delta: 360.7MB). Free memory was 113.3MB in the beginning and 369.2MB in the end (delta: -255.9MB). Peak memory consumption was 108.1MB. Max. memory is 16.1GB. [2025-04-29 11:16:09,974 INFO L158 Benchmark]: CDTParser took 0.52ms. Allocated memory is still 201.3MB. Free memory is still 122.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:16:09,974 INFO L158 Benchmark]: CACSL2BoogieTranslator took 220.58ms. Allocated memory is still 142.6MB. Free memory was 113.3MB in the beginning and 98.9MB in the end (delta: 14.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-29 11:16:09,974 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.03ms. Allocated memory is still 142.6MB. Free memory was 98.9MB in the beginning and 97.1MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:16:09,975 INFO L158 Benchmark]: Boogie Preprocessor took 50.18ms. Allocated memory is still 142.6MB. Free memory was 97.1MB in the beginning and 94.9MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:16:09,975 INFO L158 Benchmark]: RCFGBuilder took 521.08ms. Allocated memory is still 142.6MB. Free memory was 94.9MB in the beginning and 51.7MB in the end (delta: 43.1MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-04-29 11:16:09,977 INFO L158 Benchmark]: TraceAbstraction took 14006.46ms. Allocated memory was 142.6MB in the beginning and 503.3MB in the end (delta: 360.7MB). Free memory was 51.3MB in the beginning and 369.3MB in the end (delta: -318.0MB). Peak memory consumption was 41.0MB. Max. memory is 16.1GB. [2025-04-29 11:16:09,977 INFO L158 Benchmark]: Witness Printer took 2.39ms. Allocated memory is still 503.3MB. Free memory was 369.3MB in the beginning and 369.2MB in the end (delta: 68.4kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-29 11:16:09,977 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.52ms. Allocated memory is still 201.3MB. Free memory is still 122.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 220.58ms. Allocated memory is still 142.6MB. Free memory was 113.3MB in the beginning and 98.9MB in the end (delta: 14.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.03ms. Allocated memory is still 142.6MB. Free memory was 98.9MB in the beginning and 97.1MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 50.18ms. Allocated memory is still 142.6MB. Free memory was 97.1MB in the beginning and 94.9MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 521.08ms. Allocated memory is still 142.6MB. Free memory was 94.9MB in the beginning and 51.7MB in the end (delta: 43.1MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 14006.46ms. Allocated memory was 142.6MB in the beginning and 503.3MB in the end (delta: 360.7MB). Free memory was 51.3MB in the beginning and 369.3MB in the end (delta: -318.0MB). Peak memory consumption was 41.0MB. Max. memory is 16.1GB. * Witness Printer took 2.39ms. Allocated memory is still 503.3MB. Free memory was 369.3MB in the beginning and 369.2MB in the end (delta: 68.4kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 36]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 36. Possible FailurePath: [L12-L15] 0 struct s { int datum; struct s *next; } *A, *B; [L22] 0 pthread_mutex_t A_mutex = PTHREAD_MUTEX_INITIALIZER; [L22] 0 pthread_mutex_t A_mutex = PTHREAD_MUTEX_INITIALIZER; [L23] 0 pthread_mutex_t B_mutex = PTHREAD_MUTEX_INITIALIZER; [L23] 0 pthread_mutex_t B_mutex = PTHREAD_MUTEX_INITIALIZER; [L37] 0 pthread_t t1; [L38] 0 struct s *p = malloc(sizeof(struct s)); [L39] CALL 0 init(p,9) [L18] 0 p -> datum = x VAL [A={0:0}, A_mutex={1:0}, B={0:0}, B_mutex={2:0}] [L19] 0 p -> next = NULL [L39] RET 0 init(p,9) [L41] 0 A = malloc(sizeof(struct s)) [L42] CALL 0 init(A,3) [L18] 0 p -> datum = x VAL [A={-3:0}, A_mutex={1:0}, B={0:0}, B_mutex={2:0}] [L19] 0 p -> next = NULL [L42] RET 0 init(A,3) [L43] 0 A->next = p [L44] 0 B = malloc(sizeof(struct s)) [L45] CALL 0 init(B,5) [L18] 0 p -> datum = x VAL [A={-3:0}, A_mutex={1:0}, B={-4:0}, B_mutex={2:0}] [L19] 0 p -> next = NULL [L45] RET 0 init(B,5) [L47] 0 p = malloc(sizeof(struct s)) [L48] CALL 0 init(p,9) [L18] 0 p -> datum = x VAL [A={-3:0}, A_mutex={1:0}, B={-4:0}, B_mutex={2:0}] [L19] 0 p -> next = NULL [L48] RET 0 init(p,9) [L49] 0 B->next = p [L51] FCALL, FORK 0 pthread_create(&t1, NULL, t_fun, NULL) VAL [A={-3:0}, A_mutex={1:0}, B={-4:0}, B_mutex={2:0}, \at(arg, Pre)={0:0}, p={-5:0}, t1=-1] [L54] EXPR 0 A->next [L54] 0 p = A->next [L55] 0 p->datum [L59] EXPR 0 B->next [L59] 0 p = B->next [L60] 0 p->datum [L62] 0 return 0; VAL [A={-3:0}, A_mutex={1:0}, B={-4:0}, B_mutex={2:0}, \at(arg, Pre)={0:0}, \result=0, p={-5:0}, t1=-1] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 51]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 113 locations, 111 edges, 54 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 13.9s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5217 SdHoareTripleChecker+Valid, 6.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4224 mSDsluCounter, 2013 SdHoareTripleChecker+Invalid, 5.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1829 mSDsCounter, 406 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14648 IncrementalHoareTripleChecker+Invalid, 15054 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 406 mSolverCounterUnsat, 184 mSDtfsCounter, 14648 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 208 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 648 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=836occurred in iteration=16, InterpolantAutomatonStates: 150, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 297 NumberOfCodeBlocks, 297 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 254 ConstructedInterpolants, 0 QuantifiedInterpolants, 3688 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 1/1 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-04-29 11:16:09,999 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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_04-list2_nr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.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 6b660f04f83becd21e4ff512c323a1198b0ce2547661a7b848e55ab597e13bce --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:16:11,817 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:16:11,913 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2025-04-29 11:16:11,918 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:16:11,919 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:16:11,935 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:16:11,935 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:16:11,935 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:16:11,935 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-29 11:16:11,936 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-29 11:16:11,936 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:16:11,936 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:16:11,936 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:16:11,936 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:16:11,936 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:16:11,936 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:16:11,936 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:16:11,936 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:16:11,937 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:16:11,937 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:16:11,937 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-04-29 11:16:11,937 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-04-29 11:16:11,937 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-04-29 11:16:11,937 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:16:11,937 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-04-29 11:16:11,937 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-04-29 11:16:11,937 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-04-29 11:16:11,937 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:16:11,937 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:16:11,938 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:16:11,938 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:16:11,938 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:16:11,938 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:16:11,938 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:16:11,938 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:16:11,938 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:16:11,938 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:16:11,938 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:16:11,938 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:16:11,938 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:16:11,939 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:16:11,939 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:16:11,939 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:16:11,939 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-04-29 11:16:11,939 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-04-29 11:16:11,939 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:16:11,939 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:16:11,939 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:16:11,939 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 -> 6b660f04f83becd21e4ff512c323a1198b0ce2547661a7b848e55ab597e13bce [2025-04-29 11:16:12,173 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:16:12,180 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:16:12,182 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:16:12,184 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:16:12,184 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:16:12,185 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/09-regions_04-list2_nr.c [2025-04-29 11:16:13,444 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f47c965e/33c2d558bcd34a9fbf412ee738531687/FLAGa4de7100c [2025-04-29 11:16:13,602 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:16:13,602 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/09-regions_04-list2_nr.c [2025-04-29 11:16:13,603 WARN L117 ultiparseSymbolTable]: System include pthread.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:16:13,604 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:16:13,604 WARN L117 ultiparseSymbolTable]: System include stdio.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:16:13,608 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f47c965e/33c2d558bcd34a9fbf412ee738531687/FLAGa4de7100c [2025-04-29 11:16:14,494 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f47c965e/33c2d558bcd34a9fbf412ee738531687 [2025-04-29 11:16:14,496 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:16:14,497 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:16:14,498 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:16:14,498 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:16:14,501 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:16:14,501 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:16:14" (1/1) ... [2025-04-29 11:16:14,502 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1be25cc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:16:14, skipping insertion in model container [2025-04-29 11:16:14,502 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:16:14" (1/1) ... [2025-04-29 11:16:14,512 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:16:14,636 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:16:14,650 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:16:14,674 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:16:14,687 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:16:14,687 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:16:14 WrapperNode [2025-04-29 11:16:14,688 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:16:14,689 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:16:14,689 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:16:14,689 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:16:14,694 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:16:14" (1/1) ... [2025-04-29 11:16:14,703 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:16:14" (1/1) ... [2025-04-29 11:16:14,721 INFO L138 Inliner]: procedures = 15, calls = 37, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 81 [2025-04-29 11:16:14,721 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:16:14,722 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:16:14,722 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:16:14,722 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:16:14,728 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:16:14" (1/1) ... [2025-04-29 11:16:14,729 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:16:14" (1/1) ... [2025-04-29 11:16:14,737 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:16:14" (1/1) ... [2025-04-29 11:16:14,753 INFO L175 MemorySlicer]: Split 22 memory accesses to 3 slices as follows [1, 1, 20]. 91 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [1, 1, 0]. The 12 writes are split as follows [0, 0, 12]. [2025-04-29 11:16:14,756 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:16:14" (1/1) ... [2025-04-29 11:16:14,757 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:16:14" (1/1) ... [2025-04-29 11:16:14,766 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:16:14" (1/1) ... [2025-04-29 11:16:14,769 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:16:14" (1/1) ... [2025-04-29 11:16:14,773 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:16:14" (1/1) ... [2025-04-29 11:16:14,777 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:16:14" (1/1) ... [2025-04-29 11:16:14,778 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:16:14" (1/1) ... [2025-04-29 11:16:14,786 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:16:14,787 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:16:14,790 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:16:14,791 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:16:14,792 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:16:14" (1/1) ... [2025-04-29 11:16:14,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:16:14,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:16:14,819 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:16:14,821 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:16:14,840 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-29 11:16:14,842 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-04-29 11:16:14,842 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-04-29 11:16:14,842 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-29 11:16:14,842 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-29 11:16:14,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-04-29 11:16:14,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-04-29 11:16:14,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-04-29 11:16:14,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-29 11:16:14,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-04-29 11:16:14,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-04-29 11:16:14,843 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-29 11:16:14,843 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-29 11:16:14,843 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-04-29 11:16:14,843 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-04-29 11:16:14,843 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-04-29 11:16:14,844 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:16:14,844 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:16:14,844 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-04-29 11:16:14,844 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-04-29 11:16:14,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-04-29 11:16:14,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-04-29 11:16:14,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-04-29 11:16:14,846 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:16:14,945 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:16:14,946 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:16:15,357 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-29 11:16:15,357 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:16:15,529 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:16:15,530 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-29 11:16:15,531 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:16:15 BoogieIcfgContainer [2025-04-29 11:16:15,531 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:16:15,532 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:16:15,533 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:16:15,536 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:16:15,536 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:16:14" (1/3) ... [2025-04-29 11:16:15,537 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c7f36c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:16:15, skipping insertion in model container [2025-04-29 11:16:15,537 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:16:14" (2/3) ... [2025-04-29 11:16:15,537 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c7f36c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:16:15, skipping insertion in model container [2025-04-29 11:16:15,537 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:16:15" (3/3) ... [2025-04-29 11:16:15,539 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_04-list2_nr.c [2025-04-29 11:16:15,549 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:16:15,550 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_04-list2_nr.c that has 2 procedures, 84 locations, 82 edges, 1 initial locations, 0 loop locations, and 41 error locations. [2025-04-29 11:16:15,550 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-29 11:16:15,596 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-29 11:16:15,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 87 places, 83 transitions, 170 flow [2025-04-29 11:16:15,672 INFO L116 PetriNetUnfolderBase]: 0/82 cut-off events. [2025-04-29 11:16:15,675 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:16:15,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86 conditions, 82 events. 0/82 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 176 event pairs, 0 based on Foata normal form. 0/41 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2025-04-29 11:16:15,677 INFO L82 GeneralOperation]: Start removeDead. Operand has 87 places, 83 transitions, 170 flow [2025-04-29 11:16:15,680 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 86 places, 82 transitions, 167 flow [2025-04-29 11:16:15,687 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:16:15,696 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;@45379fc2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:16:15,696 INFO L341 AbstractCegarLoop]: Starting to check reachability of 54 error locations. [2025-04-29 11:16:15,699 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-29 11:16:15,699 INFO L116 PetriNetUnfolderBase]: 0/2 cut-off events. [2025-04-29 11:16:15,699 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:16:15,699 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:16:15,699 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-04-29 11:16:15,700 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2025-04-29 11:16:15,704 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:15,704 INFO L85 PathProgramCache]: Analyzing trace with hash 10719, now seen corresponding path program 1 times [2025-04-29 11:16:15,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 11:16:15,711 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [23152606] [2025-04-29 11:16:15,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:15,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:16:15,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:16:15,714 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:15,715 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:15,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-29 11:16:15,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-29 11:16:15,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:15,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:15,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-29 11:16:15,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:16:15,838 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2025-04-29 11:16:15,853 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:15,855 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:16:15,856 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 11:16:15,856 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [23152606] [2025-04-29 11:16:15,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [23152606] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:16:15,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:16:15,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-29 11:16:15,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771502585] [2025-04-29 11:16:15,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:16:15,863 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:16:15,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 11:16:15,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:16:15,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:16:15,972 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 83 [2025-04-29 11:16:15,974 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 82 transitions, 167 flow. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 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:15,974 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:16:15,975 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 83 [2025-04-29 11:16:15,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:16:16,201 INFO L116 PetriNetUnfolderBase]: 99/363 cut-off events. [2025-04-29 11:16:16,202 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:16:16,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 598 conditions, 363 events. 99/363 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1758 event pairs, 99 based on Foata normal form. 0/307 useless extension candidates. Maximal degree in co-relation 557. Up to 223 conditions per place. [2025-04-29 11:16:16,205 INFO L140 encePairwiseOnDemand]: 71/83 looper letters, 28 selfloop transitions, 4 changer transitions 0/74 dead transitions. [2025-04-29 11:16:16,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 74 transitions, 215 flow [2025-04-29 11:16:16,206 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:16:16,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:16:16,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 169 transitions. [2025-04-29 11:16:16,213 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.678714859437751 [2025-04-29 11:16:16,214 INFO L175 Difference]: Start difference. First operand has 86 places, 82 transitions, 167 flow. Second operand 3 states and 169 transitions. [2025-04-29 11:16:16,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 74 transitions, 215 flow [2025-04-29 11:16:16,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 74 transitions, 214 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:16:16,223 INFO L231 Difference]: Finished difference. Result has 79 places, 74 transitions, 158 flow [2025-04-29 11:16:16,225 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=158, PETRI_PLACES=79, PETRI_TRANSITIONS=74} [2025-04-29 11:16:16,228 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, -7 predicate places. [2025-04-29 11:16:16,228 INFO L485 AbstractCegarLoop]: Abstraction has has 79 places, 74 transitions, 158 flow [2025-04-29 11:16:16,228 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 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:16,228 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:16:16,228 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-04-29 11:16:16,238 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-29 11:16:16,433 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:16:16,433 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2025-04-29 11:16:16,434 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:16,434 INFO L85 PathProgramCache]: Analyzing trace with hash 10720, now seen corresponding path program 1 times [2025-04-29 11:16:16,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 11:16:16,434 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1279981434] [2025-04-29 11:16:16,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:16,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:16:16,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:16:16,436 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:16,437 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:16,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-29 11:16:16,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-29 11:16:16,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:16,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:16,483 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-29 11:16:16,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:16:16,494 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-29 11:16:16,503 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:16,503 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:16:16,503 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 11:16:16,503 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1279981434] [2025-04-29 11:16:16,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1279981434] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:16:16,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:16:16,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-29 11:16:16,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739380804] [2025-04-29 11:16:16,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:16:16,505 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:16:16,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 11:16:16,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:16:16,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:16:16,604 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 83 [2025-04-29 11:16:16,605 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 74 transitions, 158 flow. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 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:16,605 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:16:16,605 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 83 [2025-04-29 11:16:16,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:16:16,746 INFO L116 PetriNetUnfolderBase]: 99/355 cut-off events. [2025-04-29 11:16:16,746 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-29 11:16:16,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 590 conditions, 355 events. 99/355 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1746 event pairs, 99 based on Foata normal form. 6/305 useless extension candidates. Maximal degree in co-relation 565. Up to 223 conditions per place. [2025-04-29 11:16:16,748 INFO L140 encePairwiseOnDemand]: 71/83 looper letters, 24 selfloop transitions, 4 changer transitions 0/66 dead transitions. [2025-04-29 11:16:16,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 66 transitions, 198 flow [2025-04-29 11:16:16,749 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:16:16,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:16:16,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 177 transitions. [2025-04-29 11:16:16,750 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7108433734939759 [2025-04-29 11:16:16,750 INFO L175 Difference]: Start difference. First operand has 79 places, 74 transitions, 158 flow. Second operand 3 states and 177 transitions. [2025-04-29 11:16:16,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 66 transitions, 198 flow [2025-04-29 11:16:16,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 66 transitions, 190 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:16:16,751 INFO L231 Difference]: Finished difference. Result has 71 places, 66 transitions, 142 flow [2025-04-29 11:16:16,751 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=142, PETRI_PLACES=71, PETRI_TRANSITIONS=66} [2025-04-29 11:16:16,752 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, -15 predicate places. [2025-04-29 11:16:16,752 INFO L485 AbstractCegarLoop]: Abstraction has has 71 places, 66 transitions, 142 flow [2025-04-29 11:16:16,752 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 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:16,752 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:16:16,752 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-29 11:16:16,758 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-29 11:16:16,957 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 [2025-04-29 11:16:16,957 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2025-04-29 11:16:16,957 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:16,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1318836311, now seen corresponding path program 1 times [2025-04-29 11:16:16,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 11:16:16,958 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [155400019] [2025-04-29 11:16:16,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:16,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:16:16,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:16:16,959 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:16,961 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:17,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-29 11:16:17,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-29 11:16:17,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:17,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:17,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-29 11:16:17,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:16:17,037 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2025-04-29 11:16:17,046 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:17,046 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:16:17,046 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 11:16:17,046 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [155400019] [2025-04-29 11:16:17,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [155400019] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:16:17,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:16:17,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:16:17,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715218554] [2025-04-29 11:16:17,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:16:17,046 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:16:17,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 11:16:17,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:16:17,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:16:17,129 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 83 [2025-04-29 11:16:17,129 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 66 transitions, 142 flow. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 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,129 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:16:17,129 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 83 [2025-04-29 11:16:17,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:16:17,238 INFO L116 PetriNetUnfolderBase]: 110/387 cut-off events. [2025-04-29 11:16:17,239 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-29 11:16:17,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 645 conditions, 387 events. 110/387 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1950 event pairs, 110 based on Foata normal form. 1/333 useless extension candidates. Maximal degree in co-relation 621. Up to 248 conditions per place. [2025-04-29 11:16:17,242 INFO L140 encePairwiseOnDemand]: 79/83 looper letters, 28 selfloop transitions, 1 changer transitions 0/63 dead transitions. [2025-04-29 11:16:17,242 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 63 transitions, 194 flow [2025-04-29 11:16:17,243 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:16:17,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:16:17,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 185 transitions. [2025-04-29 11:16:17,244 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7429718875502008 [2025-04-29 11:16:17,245 INFO L175 Difference]: Start difference. First operand has 71 places, 66 transitions, 142 flow. Second operand 3 states and 185 transitions. [2025-04-29 11:16:17,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 63 transitions, 194 flow [2025-04-29 11:16:17,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 63 transitions, 186 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:16:17,246 INFO L231 Difference]: Finished difference. Result has 68 places, 63 transitions, 130 flow [2025-04-29 11:16:17,246 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=68, PETRI_TRANSITIONS=63} [2025-04-29 11:16:17,247 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, -18 predicate places. [2025-04-29 11:16:17,247 INFO L485 AbstractCegarLoop]: Abstraction has has 68 places, 63 transitions, 130 flow [2025-04-29 11:16:17,247 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 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,247 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:16:17,247 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-29 11:16:17,253 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:17,447 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:16:17,448 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2025-04-29 11:16:17,448 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:17,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1318836312, now seen corresponding path program 1 times [2025-04-29 11:16:17,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 11:16:17,448 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [684489729] [2025-04-29 11:16:17,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:17,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:16:17,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:16:17,450 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:17,451 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:17,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-29 11:16:17,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-29 11:16:17,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:17,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:17,514 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-29 11:16:17,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:16:17,520 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-29 11:16:17,542 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:17,543 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:16:17,543 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 11:16:17,543 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [684489729] [2025-04-29 11:16:17,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [684489729] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:16:17,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:16:17,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:16:17,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242893135] [2025-04-29 11:16:17,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:16:17,543 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:16:17,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 11:16:17,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:16:17,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:16:17,654 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 83 [2025-04-29 11:16:17,655 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 63 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 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,655 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:16:17,655 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 83 [2025-04-29 11:16:17,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:16:17,761 INFO L116 PetriNetUnfolderBase]: 99/345 cut-off events. [2025-04-29 11:16:17,761 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-29 11:16:17,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 577 conditions, 345 events. 99/345 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1697 event pairs, 99 based on Foata normal form. 11/306 useless extension candidates. Maximal degree in co-relation 568. Up to 225 conditions per place. [2025-04-29 11:16:17,763 INFO L140 encePairwiseOnDemand]: 79/83 looper letters, 27 selfloop transitions, 1 changer transitions 0/60 dead transitions. [2025-04-29 11:16:17,763 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 60 transitions, 180 flow [2025-04-29 11:16:17,763 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:16:17,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:16:17,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 187 transitions. [2025-04-29 11:16:17,764 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.751004016064257 [2025-04-29 11:16:17,764 INFO L175 Difference]: Start difference. First operand has 68 places, 63 transitions, 130 flow. Second operand 3 states and 187 transitions. [2025-04-29 11:16:17,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 60 transitions, 180 flow [2025-04-29 11:16:17,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 60 transitions, 179 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:16:17,767 INFO L231 Difference]: Finished difference. Result has 66 places, 60 transitions, 125 flow [2025-04-29 11:16:17,767 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=125, PETRI_PLACES=66, PETRI_TRANSITIONS=60} [2025-04-29 11:16:17,767 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, -20 predicate places. [2025-04-29 11:16:17,767 INFO L485 AbstractCegarLoop]: Abstraction has has 66 places, 60 transitions, 125 flow [2025-04-29 11:16:17,767 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 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,767 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:16:17,767 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:16:17,775 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-29 11:16:17,968 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:16:17,968 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2025-04-29 11:16:17,968 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:17,968 INFO L85 PathProgramCache]: Analyzing trace with hash -611631119, now seen corresponding path program 1 times [2025-04-29 11:16:17,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 11:16:17,969 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [159569666] [2025-04-29 11:16:17,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:17,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:16:17,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:16:17,970 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:17,971 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:18,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-29 11:16:18,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-29 11:16:18,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:18,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:18,054 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-29 11:16:18,057 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:16:18,066 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2025-04-29 11:16:18,095 INFO L325 Elim1Store]: treesize reduction 15, result has 42.3 percent of original size [2025-04-29 11:16:18,095 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 17 [2025-04-29 11:16:18,125 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:18,125 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:16:18,125 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 11:16:18,126 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [159569666] [2025-04-29 11:16:18,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [159569666] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:16:18,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:16:18,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:16:18,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574922198] [2025-04-29 11:16:18,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:16:18,126 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:16:18,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 11:16:18,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:16:18,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:16:18,266 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 83 [2025-04-29 11:16:18,267 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 60 transitions, 125 flow. Second operand has 4 states, 4 states have (on average 49.75) internal successors, (199), 4 states have internal predecessors, (199), 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,267 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:16:18,267 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 83 [2025-04-29 11:16:18,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:16:18,379 INFO L116 PetriNetUnfolderBase]: 110/353 cut-off events. [2025-04-29 11:16:18,379 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:16:18,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 613 conditions, 353 events. 110/353 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1659 event pairs, 110 based on Foata normal form. 0/322 useless extension candidates. Maximal degree in co-relation 602. Up to 248 conditions per place. [2025-04-29 11:16:18,381 INFO L140 encePairwiseOnDemand]: 79/83 looper letters, 32 selfloop transitions, 1 changer transitions 0/57 dead transitions. [2025-04-29 11:16:18,381 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 57 transitions, 185 flow [2025-04-29 11:16:18,381 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:16:18,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:16:18,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 177 transitions. [2025-04-29 11:16:18,382 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7108433734939759 [2025-04-29 11:16:18,382 INFO L175 Difference]: Start difference. First operand has 66 places, 60 transitions, 125 flow. Second operand 3 states and 177 transitions. [2025-04-29 11:16:18,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 57 transitions, 185 flow [2025-04-29 11:16:18,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 57 transitions, 184 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:16:18,383 INFO L231 Difference]: Finished difference. Result has 64 places, 57 transitions, 120 flow [2025-04-29 11:16:18,383 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=120, PETRI_PLACES=64, PETRI_TRANSITIONS=57} [2025-04-29 11:16:18,384 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, -22 predicate places. [2025-04-29 11:16:18,384 INFO L485 AbstractCegarLoop]: Abstraction has has 64 places, 57 transitions, 120 flow [2025-04-29 11:16:18,384 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 49.75) internal successors, (199), 4 states have internal predecessors, (199), 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,384 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:16:18,384 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:16:18,391 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-29 11:16:18,584 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:16:18,585 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2025-04-29 11:16:18,585 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:18,585 INFO L85 PathProgramCache]: Analyzing trace with hash -611631118, now seen corresponding path program 1 times [2025-04-29 11:16:18,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 11:16:18,585 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [646517658] [2025-04-29 11:16:18,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:18,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:16:18,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:16:18,587 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:16:18,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-29 11:16:18,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-29 11:16:18,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-29 11:16:18,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:18,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:18,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-29 11:16:18,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:16:18,689 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-29 11:16:18,722 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:16:18,723 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:18,733 INFO L325 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-04-29 11:16:18,733 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 13 [2025-04-29 11:16:18,755 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:18,755 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:16:18,755 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 11:16:18,756 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [646517658] [2025-04-29 11:16:18,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [646517658] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:16:18,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:16:18,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:16:18,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963090332] [2025-04-29 11:16:18,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:16:18,756 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:16:18,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 11:16:18,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:16:18,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:16:18,982 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 83 [2025-04-29 11:16:18,982 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 57 transitions, 120 flow. Second operand has 5 states, 5 states have (on average 46.2) internal successors, (231), 5 states have internal predecessors, (231), 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,982 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:16:18,982 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 83 [2025-04-29 11:16:18,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:16:19,144 INFO L116 PetriNetUnfolderBase]: 110/341 cut-off events. [2025-04-29 11:16:19,144 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:16:19,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 602 conditions, 341 events. 110/341 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1574 event pairs, 110 based on Foata normal form. 0/310 useless extension candidates. Maximal degree in co-relation 591. Up to 246 conditions per place. [2025-04-29 11:16:19,146 INFO L140 encePairwiseOnDemand]: 78/83 looper letters, 31 selfloop transitions, 2 changer transitions 0/54 dead transitions. [2025-04-29 11:16:19,146 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 54 transitions, 180 flow [2025-04-29 11:16:19,146 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:16:19,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-29 11:16:19,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 212 transitions. [2025-04-29 11:16:19,147 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6385542168674698 [2025-04-29 11:16:19,147 INFO L175 Difference]: Start difference. First operand has 64 places, 57 transitions, 120 flow. Second operand 4 states and 212 transitions. [2025-04-29 11:16:19,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 54 transitions, 180 flow [2025-04-29 11:16:19,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 54 transitions, 179 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:16:19,148 INFO L231 Difference]: Finished difference. Result has 63 places, 54 transitions, 117 flow [2025-04-29 11:16:19,148 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=117, PETRI_PLACES=63, PETRI_TRANSITIONS=54} [2025-04-29 11:16:19,149 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, -23 predicate places. [2025-04-29 11:16:19,149 INFO L485 AbstractCegarLoop]: Abstraction has has 63 places, 54 transitions, 117 flow [2025-04-29 11:16:19,149 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 46.2) internal successors, (231), 5 states have internal predecessors, (231), 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,149 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:16:19,149 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:16:19,156 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-29 11:16:19,349 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:16:19,350 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2025-04-29 11:16:19,350 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:19,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1244431167, now seen corresponding path program 1 times [2025-04-29 11:16:19,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 11:16:19,351 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1256051925] [2025-04-29 11:16:19,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:19,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:16:19,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:16:19,352 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:16:19,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-29 11:16:19,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-29 11:16:19,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-29 11:16:19,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:19,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:19,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-29 11:16:19,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:16:19,502 INFO L325 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2025-04-29 11:16:19,502 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2025-04-29 11:16:19,619 INFO L325 Elim1Store]: treesize reduction 62, result has 36.1 percent of original size [2025-04-29 11:16:19,620 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 32 treesize of output 55 [2025-04-29 11:16:19,644 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-04-29 11:16:19,691 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 33 [2025-04-29 11:16:19,741 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 33 [2025-04-29 11:16:19,795 INFO L325 Elim1Store]: treesize reduction 90, result has 33.8 percent of original size [2025-04-29 11:16:19,795 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 64 [2025-04-29 11:16:19,886 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 41 [2025-04-29 11:16:19,937 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 41 [2025-04-29 11:16:19,986 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 33 [2025-04-29 11:16:20,148 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 19 [2025-04-29 11:16:20,208 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:20,208 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:16:20,208 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 11:16:20,208 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1256051925] [2025-04-29 11:16:20,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1256051925] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:16:20,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:16:20,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-29 11:16:20,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489022422] [2025-04-29 11:16:20,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:16:20,209 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-29 11:16:20,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 11:16:20,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-29 11:16:20,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-04-29 11:16:21,094 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 83 [2025-04-29 11:16:21,095 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 54 transitions, 117 flow. Second operand has 11 states, 11 states have (on average 35.45454545454545) internal successors, (390), 11 states have internal predecessors, (390), 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:21,095 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:16:21,095 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 83 [2025-04-29 11:16:21,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:16:22,047 INFO L116 PetriNetUnfolderBase]: 168/519 cut-off events. [2025-04-29 11:16:22,047 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:16:22,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 907 conditions, 519 events. 168/519 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2771 event pairs, 18 based on Foata normal form. 0/473 useless extension candidates. Maximal degree in co-relation 896. Up to 85 conditions per place. [2025-04-29 11:16:22,049 INFO L140 encePairwiseOnDemand]: 70/83 looper letters, 61 selfloop transitions, 19 changer transitions 0/99 dead transitions. [2025-04-29 11:16:22,049 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 99 transitions, 367 flow [2025-04-29 11:16:22,049 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-29 11:16:22,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-29 11:16:22,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 490 transitions. [2025-04-29 11:16:22,051 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4919678714859438 [2025-04-29 11:16:22,051 INFO L175 Difference]: Start difference. First operand has 63 places, 54 transitions, 117 flow. Second operand 12 states and 490 transitions. [2025-04-29 11:16:22,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 99 transitions, 367 flow [2025-04-29 11:16:22,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 99 transitions, 364 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:16:22,055 INFO L231 Difference]: Finished difference. Result has 75 places, 63 transitions, 195 flow [2025-04-29 11:16:22,056 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=195, PETRI_PLACES=75, PETRI_TRANSITIONS=63} [2025-04-29 11:16:22,057 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, -11 predicate places. [2025-04-29 11:16:22,058 INFO L485 AbstractCegarLoop]: Abstraction has has 75 places, 63 transitions, 195 flow [2025-04-29 11:16:22,058 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 35.45454545454545) internal successors, (390), 11 states have internal predecessors, (390), 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:22,058 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:16:22,058 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:16:22,065 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-29 11:16:22,258 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:16:22,259 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2025-04-29 11:16:22,259 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:22,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1244431168, now seen corresponding path program 1 times [2025-04-29 11:16:22,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 11:16:22,260 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1364391211] [2025-04-29 11:16:22,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:22,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:16:22,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:16:22,261 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:16:22,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-29 11:16:22,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-29 11:16:22,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-29 11:16:22,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:22,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:22,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-04-29 11:16:22,359 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:16:22,369 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-29 11:16:22,413 INFO L325 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2025-04-29 11:16:22,413 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2025-04-29 11:16:22,421 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:22,493 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-04-29 11:16:22,508 INFO L325 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2025-04-29 11:16:22,508 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 1 case distinctions, treesize of input 18 treesize of output 20 [2025-04-29 11:16:22,555 INFO L325 Elim1Store]: treesize reduction 66, result has 34.7 percent of original size [2025-04-29 11:16:22,556 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 34 treesize of output 48 [2025-04-29 11:16:22,573 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 13 treesize of output 9 [2025-04-29 11:16:22,617 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-04-29 11:16:22,637 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 42 [2025-04-29 11:16:22,701 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-04-29 11:16:22,710 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 42 [2025-04-29 11:16:22,738 INFO L325 Elim1Store]: treesize reduction 18, result has 51.4 percent of original size [2025-04-29 11:16:22,738 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 37 [2025-04-29 11:16:22,757 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2025-04-29 11:16:22,821 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-04-29 11:16:22,831 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 39 [2025-04-29 11:16:22,869 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 39 [2025-04-29 11:16:22,876 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-04-29 11:16:22,923 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 31 [2025-04-29 11:16:22,930 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-04-29 11:16:23,067 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 17 [2025-04-29 11:16:23,074 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-04-29 11:16:23,100 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:23,100 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:16:23,100 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 11:16:23,100 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1364391211] [2025-04-29 11:16:23,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1364391211] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:16:23,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:16:23,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-29 11:16:23,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771362534] [2025-04-29 11:16:23,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:16:23,101 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-29 11:16:23,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 11:16:23,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-29 11:16:23,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-04-29 11:16:24,613 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 83 [2025-04-29 11:16:24,614 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 63 transitions, 195 flow. Second operand has 12 states, 12 states have (on average 32.333333333333336) internal successors, (388), 12 states have internal predecessors, (388), 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:24,614 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:16:24,614 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 83 [2025-04-29 11:16:24,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:16:25,518 INFO L116 PetriNetUnfolderBase]: 206/589 cut-off events. [2025-04-29 11:16:25,518 INFO L117 PetriNetUnfolderBase]: For 148/148 co-relation queries the response was YES. [2025-04-29 11:16:25,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1222 conditions, 589 events. 206/589 cut-off events. For 148/148 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 3175 event pairs, 27 based on Foata normal form. 12/555 useless extension candidates. Maximal degree in co-relation 1206. Up to 256 conditions per place. [2025-04-29 11:16:25,521 INFO L140 encePairwiseOnDemand]: 72/83 looper letters, 73 selfloop transitions, 17 changer transitions 0/106 dead transitions. [2025-04-29 11:16:25,522 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 106 transitions, 471 flow [2025-04-29 11:16:25,522 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-29 11:16:25,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-29 11:16:25,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 493 transitions. [2025-04-29 11:16:25,524 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4569045412418906 [2025-04-29 11:16:25,525 INFO L175 Difference]: Start difference. First operand has 75 places, 63 transitions, 195 flow. Second operand 13 states and 493 transitions. [2025-04-29 11:16:25,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 106 transitions, 471 flow [2025-04-29 11:16:25,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 106 transitions, 463 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-29 11:16:25,529 INFO L231 Difference]: Finished difference. Result has 85 places, 66 transitions, 246 flow [2025-04-29 11:16:25,529 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=187, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=246, PETRI_PLACES=85, PETRI_TRANSITIONS=66} [2025-04-29 11:16:25,529 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, -1 predicate places. [2025-04-29 11:16:25,529 INFO L485 AbstractCegarLoop]: Abstraction has has 85 places, 66 transitions, 246 flow [2025-04-29 11:16:25,530 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 32.333333333333336) internal successors, (388), 12 states have internal predecessors, (388), 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:25,530 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:16:25,530 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:16:25,539 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-04-29 11:16:25,730 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:16:25,730 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2025-04-29 11:16:25,731 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:25,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1299603868, now seen corresponding path program 1 times [2025-04-29 11:16:25,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 11:16:25,731 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1451145528] [2025-04-29 11:16:25,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:25,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:16:25,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:16:25,733 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:16:25,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-29 11:16:25,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-29 11:16:25,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-29 11:16:25,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:25,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:25,831 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-04-29 11:16:25,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:16:25,843 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2025-04-29 11:16:25,846 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-29 11:16:25,872 INFO L325 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-04-29 11:16:25,872 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-04-29 11:16:25,891 INFO L325 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2025-04-29 11:16:25,891 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2025-04-29 11:16:25,956 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-04-29 11:16:25,964 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-04-29 11:16:25,979 INFO L325 Elim1Store]: treesize reduction 25, result has 45.7 percent of original size [2025-04-29 11:16:25,980 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 1 case distinctions, treesize of input 20 treesize of output 25 [2025-04-29 11:16:26,027 INFO L325 Elim1Store]: treesize reduction 66, result has 34.7 percent of original size [2025-04-29 11:16:26,027 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 34 treesize of output 48 [2025-04-29 11:16:26,087 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-04-29 11:16:26,097 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 42 [2025-04-29 11:16:26,123 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-04-29 11:16:26,136 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 42 [2025-04-29 11:16:26,154 INFO L325 Elim1Store]: treesize reduction 12, result has 55.6 percent of original size [2025-04-29 11:16:26,154 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 28 [2025-04-29 11:16:26,168 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2025-04-29 11:16:26,217 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-04-29 11:16:26,223 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 39 [2025-04-29 11:16:26,248 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 39 [2025-04-29 11:16:26,254 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-04-29 11:16:26,320 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 39 [2025-04-29 11:16:26,328 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-04-29 11:16:26,460 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 17 [2025-04-29 11:16:26,466 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-04-29 11:16:26,489 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:26,490 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:16:26,490 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 11:16:26,490 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1451145528] [2025-04-29 11:16:26,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1451145528] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:16:26,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:16:26,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-29 11:16:26,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830431985] [2025-04-29 11:16:26,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:16:26,490 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:16:26,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 11:16:26,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:16:26,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:16:27,799 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 83 [2025-04-29 11:16:27,800 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 66 transitions, 246 flow. Second operand has 10 states, 10 states have (on average 42.5) internal successors, (425), 10 states have internal predecessors, (425), 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:27,800 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:16:27,800 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 83 [2025-04-29 11:16:27,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:16:28,603 INFO L116 PetriNetUnfolderBase]: 184/568 cut-off events. [2025-04-29 11:16:28,603 INFO L117 PetriNetUnfolderBase]: For 242/242 co-relation queries the response was YES. [2025-04-29 11:16:28,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1220 conditions, 568 events. 184/568 cut-off events. For 242/242 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 3150 event pairs, 20 based on Foata normal form. 14/540 useless extension candidates. Maximal degree in co-relation 1201. Up to 272 conditions per place. [2025-04-29 11:16:28,607 INFO L140 encePairwiseOnDemand]: 72/83 looper letters, 63 selfloop transitions, 16 changer transitions 0/94 dead transitions. [2025-04-29 11:16:28,607 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 94 transitions, 479 flow [2025-04-29 11:16:28,608 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-29 11:16:28,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-29 11:16:28,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 528 transitions. [2025-04-29 11:16:28,609 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5783132530120482 [2025-04-29 11:16:28,609 INFO L175 Difference]: Start difference. First operand has 85 places, 66 transitions, 246 flow. Second operand 11 states and 528 transitions. [2025-04-29 11:16:28,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 94 transitions, 479 flow [2025-04-29 11:16:28,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 94 transitions, 430 flow, removed 5 selfloop flow, removed 9 redundant places. [2025-04-29 11:16:28,614 INFO L231 Difference]: Finished difference. Result has 84 places, 66 transitions, 238 flow [2025-04-29 11:16:28,614 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=238, PETRI_PLACES=84, PETRI_TRANSITIONS=66} [2025-04-29 11:16:28,615 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, -2 predicate places. [2025-04-29 11:16:28,615 INFO L485 AbstractCegarLoop]: Abstraction has has 84 places, 66 transitions, 238 flow [2025-04-29 11:16:28,616 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 42.5) internal successors, (425), 10 states have internal predecessors, (425), 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:28,616 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:16:28,616 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:16:28,623 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-04-29 11:16:28,816 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:16:28,816 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2025-04-29 11:16:28,817 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:28,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1299603867, now seen corresponding path program 1 times [2025-04-29 11:16:28,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 11:16:28,817 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2128863184] [2025-04-29 11:16:28,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:28,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:16:28,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:16:28,819 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:16:28,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-04-29 11:16:28,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-29 11:16:28,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-29 11:16:28,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:28,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:28,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-29 11:16:28,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:16:28,933 INFO L325 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2025-04-29 11:16:28,934 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2025-04-29 11:16:28,977 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-04-29 11:16:29,004 INFO L325 Elim1Store]: treesize reduction 66, result has 34.7 percent of original size [2025-04-29 11:16:29,005 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 34 treesize of output 48 [2025-04-29 11:16:29,040 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 33 [2025-04-29 11:16:29,086 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 33 [2025-04-29 11:16:29,131 INFO L325 Elim1Store]: treesize reduction 90, result has 33.8 percent of original size [2025-04-29 11:16:29,132 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 64 [2025-04-29 11:16:29,194 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 41 [2025-04-29 11:16:29,220 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 41 [2025-04-29 11:16:29,256 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 33 [2025-04-29 11:16:29,364 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 19 [2025-04-29 11:16:29,397 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:29,397 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:16:29,398 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 11:16:29,398 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2128863184] [2025-04-29 11:16:29,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2128863184] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:16:29,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:16:29,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-29 11:16:29,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385169135] [2025-04-29 11:16:29,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:16:29,398 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-29 11:16:29,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 11:16:29,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-29 11:16:29,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-04-29 11:16:30,394 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 83 [2025-04-29 11:16:30,395 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 66 transitions, 238 flow. Second operand has 12 states, 12 states have (on average 32.25) internal successors, (387), 12 states have internal predecessors, (387), 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:30,395 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:16:30,395 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 83 [2025-04-29 11:16:30,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:16:31,260 INFO L116 PetriNetUnfolderBase]: 188/535 cut-off events. [2025-04-29 11:16:31,260 INFO L117 PetriNetUnfolderBase]: For 135/135 co-relation queries the response was YES. [2025-04-29 11:16:31,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1184 conditions, 535 events. 188/535 cut-off events. For 135/135 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2773 event pairs, 6 based on Foata normal form. 13/526 useless extension candidates. Maximal degree in co-relation 1166. Up to 130 conditions per place. [2025-04-29 11:16:31,262 INFO L140 encePairwiseOnDemand]: 68/83 looper letters, 62 selfloop transitions, 28 changer transitions 0/104 dead transitions. [2025-04-29 11:16:31,262 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 104 transitions, 508 flow [2025-04-29 11:16:31,263 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-29 11:16:31,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-04-29 11:16:31,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 526 transitions. [2025-04-29 11:16:31,264 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.45266781411359724 [2025-04-29 11:16:31,264 INFO L175 Difference]: Start difference. First operand has 84 places, 66 transitions, 238 flow. Second operand 14 states and 526 transitions. [2025-04-29 11:16:31,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 104 transitions, 508 flow [2025-04-29 11:16:31,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 104 transitions, 486 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-04-29 11:16:31,266 INFO L231 Difference]: Finished difference. Result has 88 places, 69 transitions, 289 flow [2025-04-29 11:16:31,266 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=289, PETRI_PLACES=88, PETRI_TRANSITIONS=69} [2025-04-29 11:16:31,266 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 2 predicate places. [2025-04-29 11:16:31,268 INFO L485 AbstractCegarLoop]: Abstraction has has 88 places, 69 transitions, 289 flow [2025-04-29 11:16:31,268 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 32.25) internal successors, (387), 12 states have internal predecessors, (387), 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:31,268 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:16:31,268 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:16:31,275 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-04-29 11:16:31,469 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:16:31,469 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2025-04-29 11:16:31,469 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:31,469 INFO L85 PathProgramCache]: Analyzing trace with hash 364641032, now seen corresponding path program 1 times [2025-04-29 11:16:31,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 11:16:31,470 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [405964966] [2025-04-29 11:16:31,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:31,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:16:31,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:16:31,471 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:16:31,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-04-29 11:16:31,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-29 11:16:31,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-29 11:16:31,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:31,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:31,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-29 11:16:31,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:16:31,564 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2025-04-29 11:16:31,570 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:31,570 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:16:31,570 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 11:16:31,570 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [405964966] [2025-04-29 11:16:31,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [405964966] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:16:31,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:16:31,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:16:31,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340758335] [2025-04-29 11:16:31,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:16:31,571 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:16:31,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 11:16:31,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:16:31,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:16:31,571 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 83 [2025-04-29 11:16:31,571 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 69 transitions, 289 flow. Second operand has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 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:31,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:16:31,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 83 [2025-04-29 11:16:31,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:16:31,694 INFO L116 PetriNetUnfolderBase]: 125/406 cut-off events. [2025-04-29 11:16:31,694 INFO L117 PetriNetUnfolderBase]: For 207/207 co-relation queries the response was YES. [2025-04-29 11:16:31,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 949 conditions, 406 events. 125/406 cut-off events. For 207/207 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2108 event pairs, 49 based on Foata normal form. 6/391 useless extension candidates. Maximal degree in co-relation 932. Up to 213 conditions per place. [2025-04-29 11:16:31,696 INFO L140 encePairwiseOnDemand]: 77/83 looper letters, 58 selfloop transitions, 6 changer transitions 0/89 dead transitions. [2025-04-29 11:16:31,696 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 89 transitions, 490 flow [2025-04-29 11:16:31,697 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:16:31,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:16:31,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 213 transitions. [2025-04-29 11:16:31,697 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8554216867469879 [2025-04-29 11:16:31,697 INFO L175 Difference]: Start difference. First operand has 88 places, 69 transitions, 289 flow. Second operand 3 states and 213 transitions. [2025-04-29 11:16:31,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 89 transitions, 490 flow [2025-04-29 11:16:31,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 89 transitions, 416 flow, removed 2 selfloop flow, removed 11 redundant places. [2025-04-29 11:16:31,702 INFO L231 Difference]: Finished difference. Result has 79 places, 70 transitions, 250 flow [2025-04-29 11:16:31,702 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=250, PETRI_PLACES=79, PETRI_TRANSITIONS=70} [2025-04-29 11:16:31,702 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, -7 predicate places. [2025-04-29 11:16:31,703 INFO L485 AbstractCegarLoop]: Abstraction has has 79 places, 70 transitions, 250 flow [2025-04-29 11:16:31,703 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 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:31,703 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:16:31,703 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:16:31,710 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-04-29 11:16:31,907 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:16:31,907 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2025-04-29 11:16:31,907 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:31,907 INFO L85 PathProgramCache]: Analyzing trace with hash 757758767, now seen corresponding path program 1 times [2025-04-29 11:16:31,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 11:16:31,907 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1133613020] [2025-04-29 11:16:31,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:31,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:16:31,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:16:31,909 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:16:31,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-04-29 11:16:31,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-29 11:16:31,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-29 11:16:31,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:31,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:31,998 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-29 11:16:31,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:16:32,003 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-29 11:16:32,018 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-04-29 11:16:32,021 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-04-29 11:16:32,062 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2025-04-29 11:16:32,066 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:32,066 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:16:32,066 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 11:16:32,066 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1133613020] [2025-04-29 11:16:32,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1133613020] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:16:32,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:16:32,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:16:32,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636908242] [2025-04-29 11:16:32,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:16:32,067 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:16:32,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 11:16:32,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:16:32,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:16:32,227 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 83 [2025-04-29 11:16:32,227 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 70 transitions, 250 flow. Second operand has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 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:32,227 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:16:32,227 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 83 [2025-04-29 11:16:32,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:16:32,373 INFO L116 PetriNetUnfolderBase]: 161/493 cut-off events. [2025-04-29 11:16:32,373 INFO L117 PetriNetUnfolderBase]: For 146/147 co-relation queries the response was YES. [2025-04-29 11:16:32,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1140 conditions, 493 events. 161/493 cut-off events. For 146/147 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2683 event pairs, 57 based on Foata normal form. 10/480 useless extension candidates. Maximal degree in co-relation 1125. Up to 190 conditions per place. [2025-04-29 11:16:32,375 INFO L140 encePairwiseOnDemand]: 76/83 looper letters, 59 selfloop transitions, 15 changer transitions 0/93 dead transitions. [2025-04-29 11:16:32,375 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 93 transitions, 480 flow [2025-04-29 11:16:32,376 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:16:32,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-29 11:16:32,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 305 transitions. [2025-04-29 11:16:32,376 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7349397590361446 [2025-04-29 11:16:32,376 INFO L175 Difference]: Start difference. First operand has 79 places, 70 transitions, 250 flow. Second operand 5 states and 305 transitions. [2025-04-29 11:16:32,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 93 transitions, 480 flow [2025-04-29 11:16:32,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 93 transitions, 467 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:16:32,378 INFO L231 Difference]: Finished difference. Result has 84 places, 72 transitions, 306 flow [2025-04-29 11:16:32,378 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=306, PETRI_PLACES=84, PETRI_TRANSITIONS=72} [2025-04-29 11:16:32,378 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, -2 predicate places. [2025-04-29 11:16:32,379 INFO L485 AbstractCegarLoop]: Abstraction has has 84 places, 72 transitions, 306 flow [2025-04-29 11:16:32,379 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 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:32,379 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:16:32,379 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:16:32,385 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-04-29 11:16:32,579 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:16:32,579 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2025-04-29 11:16:32,580 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:32,580 INFO L85 PathProgramCache]: Analyzing trace with hash 757758766, now seen corresponding path program 1 times [2025-04-29 11:16:32,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 11:16:32,580 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [944301298] [2025-04-29 11:16:32,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:32,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:16:32,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:16:32,582 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:16:32,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-04-29 11:16:32,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-29 11:16:32,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-29 11:16:32,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:32,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:32,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-29 11:16:32,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:16:32,685 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-04-29 11:16:32,705 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-04-29 11:16:32,707 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:32,707 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:16:32,707 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 11:16:32,707 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [944301298] [2025-04-29 11:16:32,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [944301298] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:16:32,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:16:32,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:16:32,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001672101] [2025-04-29 11:16:32,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:16:32,707 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:16:32,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 11:16:32,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:16:32,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:16:32,919 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 83 [2025-04-29 11:16:32,919 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 72 transitions, 306 flow. Second operand has 5 states, 5 states have (on average 53.0) internal successors, (265), 5 states have internal predecessors, (265), 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:32,919 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:16:32,919 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 83 [2025-04-29 11:16:32,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:16:33,128 INFO L116 PetriNetUnfolderBase]: 161/486 cut-off events. [2025-04-29 11:16:33,128 INFO L117 PetriNetUnfolderBase]: For 247/248 co-relation queries the response was YES. [2025-04-29 11:16:33,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1219 conditions, 486 events. 161/486 cut-off events. For 247/248 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2587 event pairs, 74 based on Foata normal form. 11/479 useless extension candidates. Maximal degree in co-relation 1201. Up to 223 conditions per place. [2025-04-29 11:16:33,130 INFO L140 encePairwiseOnDemand]: 71/83 looper letters, 49 selfloop transitions, 22 changer transitions 0/90 dead transitions. [2025-04-29 11:16:33,130 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 90 transitions, 504 flow [2025-04-29 11:16:33,131 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:16:33,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:16:33,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 351 transitions. [2025-04-29 11:16:33,132 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7048192771084337 [2025-04-29 11:16:33,132 INFO L175 Difference]: Start difference. First operand has 84 places, 72 transitions, 306 flow. Second operand 6 states and 351 transitions. [2025-04-29 11:16:33,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 90 transitions, 504 flow [2025-04-29 11:16:33,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 90 transitions, 498 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:16:33,134 INFO L231 Difference]: Finished difference. Result has 91 places, 73 transitions, 389 flow [2025-04-29 11:16:33,134 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=389, PETRI_PLACES=91, PETRI_TRANSITIONS=73} [2025-04-29 11:16:33,135 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 5 predicate places. [2025-04-29 11:16:33,135 INFO L485 AbstractCegarLoop]: Abstraction has has 91 places, 73 transitions, 389 flow [2025-04-29 11:16:33,135 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 53.0) internal successors, (265), 5 states have internal predecessors, (265), 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:33,135 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:16:33,135 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:16:33,142 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-04-29 11:16:33,336 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:16:33,336 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2025-04-29 11:16:33,336 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:33,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1363854386, now seen corresponding path program 1 times [2025-04-29 11:16:33,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 11:16:33,336 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [767740131] [2025-04-29 11:16:33,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:33,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:16:33,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:16:33,338 INFO L229 MonitoredProcess]: Starting monitored process 15 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:33,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-04-29 11:16:33,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-29 11:16:33,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-29 11:16:33,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:33,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:33,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-29 11:16:33,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:16:33,460 INFO L325 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-04-29 11:16:33,460 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 13 [2025-04-29 11:16:33,486 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-04-29 11:16:33,500 INFO L325 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2025-04-29 11:16:33,500 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2025-04-29 11:16:33,521 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2025-04-29 11:16:33,549 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2025-04-29 11:16:33,564 INFO L325 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2025-04-29 11:16:33,564 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2025-04-29 11:16:33,587 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2025-04-29 11:16:33,601 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2025-04-29 11:16:33,617 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2025-04-29 11:16:33,682 INFO L325 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-04-29 11:16:33,682 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2025-04-29 11:16:33,709 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2025-04-29 11:16:33,715 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:33,715 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:16:33,715 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 11:16:33,715 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [767740131] [2025-04-29 11:16:33,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [767740131] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:16:33,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:16:33,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-29 11:16:33,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136260078] [2025-04-29 11:16:33,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:16:33,715 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-29 11:16:33,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 11:16:33,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-29 11:16:33,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-04-29 11:16:34,736 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 83 [2025-04-29 11:16:34,736 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 73 transitions, 389 flow. Second operand has 14 states, 14 states have (on average 32.5) internal successors, (455), 14 states have internal predecessors, (455), 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:34,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:16:34,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 83 [2025-04-29 11:16:34,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:16:35,404 INFO L116 PetriNetUnfolderBase]: 192/559 cut-off events. [2025-04-29 11:16:35,405 INFO L117 PetriNetUnfolderBase]: For 758/758 co-relation queries the response was YES. [2025-04-29 11:16:35,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1592 conditions, 559 events. 192/559 cut-off events. For 758/758 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3096 event pairs, 36 based on Foata normal form. 7/543 useless extension candidates. Maximal degree in co-relation 1569. Up to 94 conditions per place. [2025-04-29 11:16:35,407 INFO L140 encePairwiseOnDemand]: 68/83 looper letters, 64 selfloop transitions, 38 changer transitions 3/119 dead transitions. [2025-04-29 11:16:35,407 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 119 transitions, 797 flow [2025-04-29 11:16:35,407 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-29 11:16:35,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-04-29 11:16:35,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 517 transitions. [2025-04-29 11:16:35,409 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4449225473321859 [2025-04-29 11:16:35,409 INFO L175 Difference]: Start difference. First operand has 91 places, 73 transitions, 389 flow. Second operand 14 states and 517 transitions. [2025-04-29 11:16:35,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 119 transitions, 797 flow [2025-04-29 11:16:35,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 119 transitions, 751 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-29 11:16:35,412 INFO L231 Difference]: Finished difference. Result has 103 places, 82 transitions, 515 flow [2025-04-29 11:16:35,412 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=353, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=515, PETRI_PLACES=103, PETRI_TRANSITIONS=82} [2025-04-29 11:16:35,413 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 17 predicate places. [2025-04-29 11:16:35,413 INFO L485 AbstractCegarLoop]: Abstraction has has 103 places, 82 transitions, 515 flow [2025-04-29 11:16:35,413 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 32.5) internal successors, (455), 14 states have internal predecessors, (455), 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:35,413 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:16:35,413 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:16:35,420 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-04-29 11:16:35,613 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:16:35,614 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2025-04-29 11:16:35,614 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:35,614 INFO L85 PathProgramCache]: Analyzing trace with hash 496654813, now seen corresponding path program 1 times [2025-04-29 11:16:35,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 11:16:35,614 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1156249399] [2025-04-29 11:16:35,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:35,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:16:35,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:16:35,616 INFO L229 MonitoredProcess]: Starting monitored process 16 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:35,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-04-29 11:16:35,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-29 11:16:35,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-29 11:16:35,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:35,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:35,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-04-29 11:16:35,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:16:35,799 INFO L325 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-04-29 11:16:35,799 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 13 [2025-04-29 11:16:35,829 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-04-29 11:16:35,845 INFO L325 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2025-04-29 11:16:35,846 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2025-04-29 11:16:35,852 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-04-29 11:16:35,879 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2025-04-29 11:16:35,884 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-04-29 11:16:35,925 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2025-04-29 11:16:35,945 INFO L325 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2025-04-29 11:16:35,945 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2025-04-29 11:16:35,954 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-04-29 11:16:35,984 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2025-04-29 11:16:35,992 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-04-29 11:16:36,007 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-04-29 11:16:36,013 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2025-04-29 11:16:36,038 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-04-29 11:16:36,041 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2025-04-29 11:16:36,146 INFO L325 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-04-29 11:16:36,146 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-04-29 11:16:36,151 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-04-29 11:16:36,202 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-04-29 11:16:36,204 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-04-29 11:16:36,220 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:36,220 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:16:36,220 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 11:16:36,220 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1156249399] [2025-04-29 11:16:36,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1156249399] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:16:36,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:16:36,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-29 11:16:36,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516494472] [2025-04-29 11:16:36,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:16:36,221 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-29 11:16:36,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 11:16:36,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-29 11:16:36,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-04-29 11:16:37,574 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 83 [2025-04-29 11:16:37,575 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 82 transitions, 515 flow. Second operand has 15 states, 15 states have (on average 32.4) internal successors, (486), 15 states have internal predecessors, (486), 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:37,575 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:16:37,575 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 83 [2025-04-29 11:16:37,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:16:38,414 INFO L116 PetriNetUnfolderBase]: 193/559 cut-off events. [2025-04-29 11:16:38,414 INFO L117 PetriNetUnfolderBase]: For 792/792 co-relation queries the response was YES. [2025-04-29 11:16:38,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1726 conditions, 559 events. 193/559 cut-off events. For 792/792 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3103 event pairs, 44 based on Foata normal form. 7/541 useless extension candidates. Maximal degree in co-relation 1699. Up to 160 conditions per place. [2025-04-29 11:16:38,416 INFO L140 encePairwiseOnDemand]: 70/83 looper letters, 70 selfloop transitions, 31 changer transitions 0/113 dead transitions. [2025-04-29 11:16:38,416 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 113 transitions, 820 flow [2025-04-29 11:16:38,417 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-29 11:16:38,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-29 11:16:38,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 483 transitions. [2025-04-29 11:16:38,418 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.44763670064874883 [2025-04-29 11:16:38,418 INFO L175 Difference]: Start difference. First operand has 103 places, 82 transitions, 515 flow. Second operand 13 states and 483 transitions. [2025-04-29 11:16:38,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 113 transitions, 820 flow [2025-04-29 11:16:38,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 113 transitions, 797 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-04-29 11:16:38,422 INFO L231 Difference]: Finished difference. Result has 110 places, 84 transitions, 580 flow [2025-04-29 11:16:38,422 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=492, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=580, PETRI_PLACES=110, PETRI_TRANSITIONS=84} [2025-04-29 11:16:38,422 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 24 predicate places. [2025-04-29 11:16:38,422 INFO L485 AbstractCegarLoop]: Abstraction has has 110 places, 84 transitions, 580 flow [2025-04-29 11:16:38,422 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 32.4) internal successors, (486), 15 states have internal predecessors, (486), 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:38,422 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:16:38,423 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:16:38,432 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-04-29 11:16:38,623 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:16:38,623 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2025-04-29 11:16:38,624 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:38,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1791339718, now seen corresponding path program 1 times [2025-04-29 11:16:38,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 11:16:38,624 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [569481134] [2025-04-29 11:16:38,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:38,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:16:38,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:16:38,626 INFO L229 MonitoredProcess]: Starting monitored process 17 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:38,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-04-29 11:16:38,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-29 11:16:38,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-29 11:16:38,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:38,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:38,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-04-29 11:16:38,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:16:38,783 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-29 11:16:38,790 INFO L325 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-04-29 11:16:38,791 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 13 [2025-04-29 11:16:38,810 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-04-29 11:16:38,823 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-04-29 11:16:38,829 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-29 11:16:38,867 INFO L325 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-04-29 11:16:38,868 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2025-04-29 11:16:38,929 INFO L325 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2025-04-29 11:16:38,929 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2025-04-29 11:16:38,982 INFO L325 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2025-04-29 11:16:38,982 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 28 [2025-04-29 11:16:38,990 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:39,129 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-04-29 11:16:39,134 INFO L325 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2025-04-29 11:16:39,134 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 31 [2025-04-29 11:16:39,220 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-04-29 11:16:39,234 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:39,234 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:16:39,234 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 11:16:39,234 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [569481134] [2025-04-29 11:16:39,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [569481134] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:16:39,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:16:39,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-29 11:16:39,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715089833] [2025-04-29 11:16:39,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:16:39,235 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-29 11:16:39,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 11:16:39,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-29 11:16:39,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-04-29 11:16:40,609 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 83 [2025-04-29 11:16:40,609 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 84 transitions, 580 flow. Second operand has 13 states, 13 states have (on average 43.53846153846154) internal successors, (566), 13 states have internal predecessors, (566), 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:40,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:16:40,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 83 [2025-04-29 11:16:40,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:16:41,665 INFO L116 PetriNetUnfolderBase]: 176/522 cut-off events. [2025-04-29 11:16:41,666 INFO L117 PetriNetUnfolderBase]: For 1147/1152 co-relation queries the response was YES. [2025-04-29 11:16:41,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1704 conditions, 522 events. 176/522 cut-off events. For 1147/1152 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2835 event pairs, 56 based on Foata normal form. 29/547 useless extension candidates. Maximal degree in co-relation 1674. Up to 174 conditions per place. [2025-04-29 11:16:41,669 INFO L140 encePairwiseOnDemand]: 66/83 looper letters, 60 selfloop transitions, 46 changer transitions 3/121 dead transitions. [2025-04-29 11:16:41,669 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 121 transitions, 992 flow [2025-04-29 11:16:41,669 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-29 11:16:41,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-04-29 11:16:41,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 797 transitions. [2025-04-29 11:16:41,671 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5648476257973069 [2025-04-29 11:16:41,671 INFO L175 Difference]: Start difference. First operand has 110 places, 84 transitions, 580 flow. Second operand 17 states and 797 transitions. [2025-04-29 11:16:41,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 121 transitions, 992 flow [2025-04-29 11:16:41,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 121 transitions, 897 flow, removed 6 selfloop flow, removed 13 redundant places. [2025-04-29 11:16:41,675 INFO L231 Difference]: Finished difference. Result has 110 places, 91 transitions, 664 flow [2025-04-29 11:16:41,675 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=490, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=664, PETRI_PLACES=110, PETRI_TRANSITIONS=91} [2025-04-29 11:16:41,675 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 24 predicate places. [2025-04-29 11:16:41,675 INFO L485 AbstractCegarLoop]: Abstraction has has 110 places, 91 transitions, 664 flow [2025-04-29 11:16:41,676 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 43.53846153846154) internal successors, (566), 13 states have internal predecessors, (566), 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:41,676 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:16:41,676 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:16:41,684 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-04-29 11:16:41,876 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:16:41,876 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2025-04-29 11:16:41,877 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:41,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1791339719, now seen corresponding path program 1 times [2025-04-29 11:16:41,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 11:16:41,877 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [194061702] [2025-04-29 11:16:41,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:41,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:16:41,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:16:41,879 INFO L229 MonitoredProcess]: Starting monitored process 18 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:41,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-04-29 11:16:41,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-29 11:16:41,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-29 11:16:41,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:41,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:41,997 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-29 11:16:41,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:16:42,020 INFO L325 Elim1Store]: treesize reduction 15, result has 42.3 percent of original size [2025-04-29 11:16:42,021 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 17 [2025-04-29 11:16:42,045 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-04-29 11:16:42,072 INFO L325 Elim1Store]: treesize reduction 82, result has 29.9 percent of original size [2025-04-29 11:16:42,072 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 34 treesize of output 48 [2025-04-29 11:16:42,109 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2025-04-29 11:16:42,151 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2025-04-29 11:16:42,189 INFO L325 Elim1Store]: treesize reduction 100, result has 31.5 percent of original size [2025-04-29 11:16:42,189 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 39 treesize of output 71 [2025-04-29 11:16:42,276 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 33 [2025-04-29 11:16:42,300 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 33 [2025-04-29 11:16:42,361 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 31 [2025-04-29 11:16:42,678 INFO L325 Elim1Store]: treesize reduction 36, result has 29.4 percent of original size [2025-04-29 11:16:42,678 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 93 treesize of output 91 [2025-04-29 11:16:42,688 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 25 [2025-04-29 11:16:42,818 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 19 [2025-04-29 11:16:42,863 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:42,863 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:16:42,863 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 11:16:42,864 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [194061702] [2025-04-29 11:16:42,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [194061702] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:16:42,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:16:42,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-29 11:16:42,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013103430] [2025-04-29 11:16:42,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:16:42,865 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-29 11:16:42,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 11:16:42,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-29 11:16:42,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-04-29 11:16:43,959 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 83 [2025-04-29 11:16:43,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 91 transitions, 664 flow. Second operand has 14 states, 14 states have (on average 30.428571428571427) internal successors, (426), 14 states have internal predecessors, (426), 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:43,960 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:16:43,960 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 83 [2025-04-29 11:16:43,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:16:48,583 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-29 11:16:49,773 INFO L116 PetriNetUnfolderBase]: 201/539 cut-off events. [2025-04-29 11:16:49,773 INFO L117 PetriNetUnfolderBase]: For 1158/1158 co-relation queries the response was YES. [2025-04-29 11:16:49,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1859 conditions, 539 events. 201/539 cut-off events. For 1158/1158 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2808 event pairs, 20 based on Foata normal form. 40/576 useless extension candidates. Maximal degree in co-relation 1832. Up to 99 conditions per place. [2025-04-29 11:16:49,776 INFO L140 encePairwiseOnDemand]: 64/83 looper letters, 84 selfloop transitions, 42 changer transitions 17/152 dead transitions. [2025-04-29 11:16:49,776 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 152 transitions, 1207 flow [2025-04-29 11:16:49,776 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-29 11:16:49,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-04-29 11:16:49,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 735 transitions. [2025-04-29 11:16:49,777 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.42168674698795183 [2025-04-29 11:16:49,777 INFO L175 Difference]: Start difference. First operand has 110 places, 91 transitions, 664 flow. Second operand 21 states and 735 transitions. [2025-04-29 11:16:49,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 152 transitions, 1207 flow [2025-04-29 11:16:49,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 152 transitions, 1176 flow, removed 0 selfloop flow, removed 10 redundant places. [2025-04-29 11:16:49,781 INFO L231 Difference]: Finished difference. Result has 125 places, 86 transitions, 709 flow [2025-04-29 11:16:49,782 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=629, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=709, PETRI_PLACES=125, PETRI_TRANSITIONS=86} [2025-04-29 11:16:49,783 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 39 predicate places. [2025-04-29 11:16:49,783 INFO L485 AbstractCegarLoop]: Abstraction has has 125 places, 86 transitions, 709 flow [2025-04-29 11:16:49,783 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 30.428571428571427) internal successors, (426), 14 states have internal predecessors, (426), 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:49,783 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:16:49,783 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:16:49,790 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-04-29 11:16:49,984 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:16:49,984 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2025-04-29 11:16:49,984 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:49,984 INFO L85 PathProgramCache]: Analyzing trace with hash 43631794, now seen corresponding path program 1 times [2025-04-29 11:16:49,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 11:16:49,984 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [313839834] [2025-04-29 11:16:49,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:49,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:16:49,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:16:49,986 INFO L229 MonitoredProcess]: Starting monitored process 19 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:49,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-04-29 11:16:50,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-29 11:16:53,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-29 11:16:53,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:53,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:16:53,945 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-29 11:16:53,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. Killed by 15