./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt3.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8fc3dc66 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 ../sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt3.wvr.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 fdebcc32a5907a5601109dc3fb4ac7750aa88ce6953c83cffe48f47befc15286 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 14:26:50,387 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 14:26:50,442 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-17 14:26:50,445 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 14:26:50,445 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 14:26:50,464 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 14:26:50,464 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 14:26:50,464 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 14:26:50,464 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 14:26:50,465 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 14:26:50,465 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 14:26:50,465 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 14:26:50,465 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 14:26:50,465 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 14:26:50,465 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 14:26:50,465 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 14:26:50,465 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 14:26:50,465 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 14:26:50,465 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 14:26:50,465 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 14:26:50,465 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 14:26:50,465 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 14:26:50,465 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 14:26:50,465 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 14:26:50,466 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 14:26:50,466 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 14:26:50,466 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 14:26:50,466 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 14:26:50,466 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 14:26:50,466 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 14:26:50,466 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 14:26:50,466 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 14:26:50,466 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 14:26:50,466 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:26:50,466 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 14:26:50,466 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 14:26:50,466 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 14:26:50,466 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 14:26:50,466 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 14:26:50,467 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 14:26:50,468 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 14:26:50,468 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 14:26:50,468 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 -> fdebcc32a5907a5601109dc3fb4ac7750aa88ce6953c83cffe48f47befc15286 [2025-03-17 14:26:50,692 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 14:26:50,699 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 14:26:50,700 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 14:26:50,705 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 14:26:50,705 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 14:26:50,706 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt3.wvr.c [2025-03-17 14:26:51,871 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be1e43b5e/fa66fdb7d95e4d63864af9773363ff83/FLAG360b335e8 [2025-03-17 14:26:52,101 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 14:26:52,102 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt3.wvr.c [2025-03-17 14:26:52,111 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be1e43b5e/fa66fdb7d95e4d63864af9773363ff83/FLAG360b335e8 [2025-03-17 14:26:52,463 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be1e43b5e/fa66fdb7d95e4d63864af9773363ff83 [2025-03-17 14:26:52,466 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 14:26:52,467 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 14:26:52,468 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 14:26:52,468 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 14:26:52,471 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 14:26:52,473 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:26:52" (1/1) ... [2025-03-17 14:26:52,475 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e05c42a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:26:52, skipping insertion in model container [2025-03-17 14:26:52,475 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:26:52" (1/1) ... [2025-03-17 14:26:52,489 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 14:26:52,620 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 14:26:52,625 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:26:52,633 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 14:26:52,658 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:26:52,672 INFO L204 MainTranslator]: Completed translation [2025-03-17 14:26:52,673 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:26:52 WrapperNode [2025-03-17 14:26:52,673 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 14:26:52,674 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 14:26:52,674 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 14:26:52,674 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 14:26:52,678 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:26:52" (1/1) ... [2025-03-17 14:26:52,689 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:26:52" (1/1) ... [2025-03-17 14:26:52,713 INFO L138 Inliner]: procedures = 25, calls = 60, calls flagged for inlining = 18, calls inlined = 22, statements flattened = 295 [2025-03-17 14:26:52,713 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 14:26:52,714 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 14:26:52,714 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 14:26:52,714 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 14:26:52,720 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:26:52" (1/1) ... [2025-03-17 14:26:52,720 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:26:52" (1/1) ... [2025-03-17 14:26:52,723 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:26:52" (1/1) ... [2025-03-17 14:26:52,733 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-03-17 14:26:52,737 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:26:52" (1/1) ... [2025-03-17 14:26:52,738 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:26:52" (1/1) ... [2025-03-17 14:26:52,746 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:26:52" (1/1) ... [2025-03-17 14:26:52,747 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:26:52" (1/1) ... [2025-03-17 14:26:52,748 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:26:52" (1/1) ... [2025-03-17 14:26:52,749 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:26:52" (1/1) ... [2025-03-17 14:26:52,751 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 14:26:52,751 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 14:26:52,751 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 14:26:52,752 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 14:26:52,752 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:26:52" (1/1) ... [2025-03-17 14:26:52,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:26:52,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:26:52,774 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-03-17 14:26:52,775 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-03-17 14:26:52,789 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 14:26:52,789 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-17 14:26:52,789 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-17 14:26:52,789 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-17 14:26:52,789 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-17 14:26:52,789 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-17 14:26:52,789 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-17 14:26:52,789 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-03-17 14:26:52,789 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-03-17 14:26:52,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 14:26:52,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 14:26:52,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 14:26:52,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 14:26:52,790 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-17 14:26:52,790 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-17 14:26:52,790 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 14:26:52,790 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 14:26:52,790 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 14:26:52,790 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 14:26:52,790 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 14:26:52,791 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 14:26:52,874 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 14:26:52,876 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 14:26:53,237 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 14:26:53,237 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 14:26:53,464 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 14:26:53,464 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 14:26:53,465 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:26:53 BoogieIcfgContainer [2025-03-17 14:26:53,465 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 14:26:53,467 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 14:26:53,467 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 14:26:53,470 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 14:26:53,471 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:26:52" (1/3) ... [2025-03-17 14:26:53,472 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46b6e5b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:26:53, skipping insertion in model container [2025-03-17 14:26:53,472 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:26:52" (2/3) ... [2025-03-17 14:26:53,472 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46b6e5b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:26:53, skipping insertion in model container [2025-03-17 14:26:53,472 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:26:53" (3/3) ... [2025-03-17 14:26:53,473 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-bad-buffer-mult-alt3.wvr.c [2025-03-17 14:26:53,484 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 14:26:53,485 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-bad-buffer-mult-alt3.wvr.c that has 5 procedures, 61 locations, 1 initial locations, 6 loop locations, and 14 error locations. [2025-03-17 14:26:53,486 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 14:26:53,542 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-17 14:26:53,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 66 transitions, 160 flow [2025-03-17 14:26:53,594 INFO L124 PetriNetUnfolderBase]: 6/62 cut-off events. [2025-03-17 14:26:53,595 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-17 14:26:53,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79 conditions, 62 events. 6/62 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 144 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 49. Up to 2 conditions per place. [2025-03-17 14:26:53,599 INFO L82 GeneralOperation]: Start removeDead. Operand has 73 places, 66 transitions, 160 flow [2025-03-17 14:26:53,602 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 68 places, 61 transitions, 146 flow [2025-03-17 14:26:53,611 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 14:26:53,623 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@8cce633, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 14:26:53,623 INFO L334 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2025-03-17 14:26:53,626 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 14:26:53,626 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-17 14:26:53,626 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:26:53,626 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:26:53,626 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-17 14:26:53,626 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-17 14:26:53,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:26:53,631 INFO L85 PathProgramCache]: Analyzing trace with hash 797547, now seen corresponding path program 1 times [2025-03-17 14:26:53,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:26:53,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864465202] [2025-03-17 14:26:53,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:26:53,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:26:53,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 14:26:53,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 14:26:53,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:26:53,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:26:53,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:26:53,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:26:53,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864465202] [2025-03-17 14:26:53,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864465202] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:26:53,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:26:53,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:26:53,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379871240] [2025-03-17 14:26:53,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:26:53,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:26:53,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:26:53,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:26:53,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:26:53,873 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 66 [2025-03-17 14:26:53,875 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 61 transitions, 146 flow. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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-03-17 14:26:53,876 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:26:53,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 66 [2025-03-17 14:26:53,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:26:55,405 INFO L124 PetriNetUnfolderBase]: 15159/20183 cut-off events. [2025-03-17 14:26:55,406 INFO L125 PetriNetUnfolderBase]: For 484/484 co-relation queries the response was YES. [2025-03-17 14:26:55,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40874 conditions, 20183 events. 15159/20183 cut-off events. For 484/484 co-relation queries the response was YES. Maximal size of possible extension queue 1085. Compared 116394 event pairs, 12544 based on Foata normal form. 1/14315 useless extension candidates. Maximal degree in co-relation 38292. Up to 19683 conditions per place. [2025-03-17 14:26:55,545 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 44 selfloop transitions, 2 changer transitions 0/57 dead transitions. [2025-03-17 14:26:55,546 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 57 transitions, 230 flow [2025-03-17 14:26:55,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:26:55,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:26:55,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions. [2025-03-17 14:26:55,556 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4898989898989899 [2025-03-17 14:26:55,557 INFO L175 Difference]: Start difference. First operand has 68 places, 61 transitions, 146 flow. Second operand 3 states and 97 transitions. [2025-03-17 14:26:55,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 57 transitions, 230 flow [2025-03-17 14:26:55,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 57 transitions, 214 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-03-17 14:26:55,665 INFO L231 Difference]: Finished difference. Result has 58 places, 57 transitions, 126 flow [2025-03-17 14:26:55,666 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=58, PETRI_TRANSITIONS=57} [2025-03-17 14:26:55,669 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -10 predicate places. [2025-03-17 14:26:55,669 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 57 transitions, 126 flow [2025-03-17 14:26:55,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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-03-17 14:26:55,669 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:26:55,669 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-17 14:26:55,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 14:26:55,669 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-17 14:26:55,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:26:55,670 INFO L85 PathProgramCache]: Analyzing trace with hash 797548, now seen corresponding path program 1 times [2025-03-17 14:26:55,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:26:55,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487005723] [2025-03-17 14:26:55,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:26:55,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:26:55,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 14:26:55,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 14:26:55,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:26:55,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:26:55,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:26:55,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:26:55,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487005723] [2025-03-17 14:26:55,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487005723] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:26:55,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:26:55,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:26:55,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894867734] [2025-03-17 14:26:55,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:26:55,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:26:55,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:26:55,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:26:55,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:26:55,948 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 66 [2025-03-17 14:26:55,949 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 57 transitions, 126 flow. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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-03-17 14:26:55,949 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:26:55,949 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 66 [2025-03-17 14:26:55,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:26:57,293 INFO L124 PetriNetUnfolderBase]: 15160/20186 cut-off events. [2025-03-17 14:26:57,293 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2025-03-17 14:26:57,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40235 conditions, 20186 events. 15160/20186 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 1085. Compared 116323 event pairs, 12544 based on Foata normal form. 0/14315 useless extension candidates. Maximal degree in co-relation 40206. Up to 19692 conditions per place. [2025-03-17 14:26:57,365 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 47 selfloop transitions, 4 changer transitions 0/60 dead transitions. [2025-03-17 14:26:57,366 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 60 transitions, 234 flow [2025-03-17 14:26:57,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:26:57,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:26:57,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 116 transitions. [2025-03-17 14:26:57,367 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4393939393939394 [2025-03-17 14:26:57,367 INFO L175 Difference]: Start difference. First operand has 58 places, 57 transitions, 126 flow. Second operand 4 states and 116 transitions. [2025-03-17 14:26:57,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 60 transitions, 234 flow [2025-03-17 14:26:57,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 60 transitions, 230 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:26:57,369 INFO L231 Difference]: Finished difference. Result has 61 places, 60 transitions, 149 flow [2025-03-17 14:26:57,369 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=149, PETRI_PLACES=61, PETRI_TRANSITIONS=60} [2025-03-17 14:26:57,369 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -7 predicate places. [2025-03-17 14:26:57,369 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 60 transitions, 149 flow [2025-03-17 14:26:57,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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-03-17 14:26:57,369 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:26:57,370 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-17 14:26:57,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 14:26:57,370 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-17 14:26:57,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:26:57,370 INFO L85 PathProgramCache]: Analyzing trace with hash 24725220, now seen corresponding path program 1 times [2025-03-17 14:26:57,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:26:57,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399245479] [2025-03-17 14:26:57,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:26:57,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:26:57,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 14:26:57,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 14:26:57,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:26:57,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:26:57,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:26:57,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:26:57,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399245479] [2025-03-17 14:26:57,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399245479] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:26:57,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:26:57,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:26:57,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663103230] [2025-03-17 14:26:57,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:26:57,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:26:57,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:26:57,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:26:57,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:26:57,590 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 66 [2025-03-17 14:26:57,591 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 60 transitions, 149 flow. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 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-03-17 14:26:57,591 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:26:57,591 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 66 [2025-03-17 14:26:57,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:26:58,701 INFO L124 PetriNetUnfolderBase]: 15161/20189 cut-off events. [2025-03-17 14:26:58,701 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2025-03-17 14:26:58,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40252 conditions, 20189 events. 15161/20189 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 1085. Compared 116307 event pairs, 12544 based on Foata normal form. 0/14317 useless extension candidates. Maximal degree in co-relation 40227. Up to 19691 conditions per place. [2025-03-17 14:26:58,824 INFO L140 encePairwiseOnDemand]: 58/66 looper letters, 47 selfloop transitions, 7 changer transitions 0/63 dead transitions. [2025-03-17 14:26:58,824 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 63 transitions, 263 flow [2025-03-17 14:26:58,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:26:58,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:26:58,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 135 transitions. [2025-03-17 14:26:58,828 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4090909090909091 [2025-03-17 14:26:58,829 INFO L175 Difference]: Start difference. First operand has 61 places, 60 transitions, 149 flow. Second operand 5 states and 135 transitions. [2025-03-17 14:26:58,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 63 transitions, 263 flow [2025-03-17 14:26:58,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 63 transitions, 260 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:26:58,831 INFO L231 Difference]: Finished difference. Result has 66 places, 63 transitions, 183 flow [2025-03-17 14:26:58,831 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=183, PETRI_PLACES=66, PETRI_TRANSITIONS=63} [2025-03-17 14:26:58,831 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -2 predicate places. [2025-03-17 14:26:58,831 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 63 transitions, 183 flow [2025-03-17 14:26:58,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 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-03-17 14:26:58,832 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:26:58,832 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-03-17 14:26:58,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 14:26:58,832 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-17 14:26:58,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:26:58,833 INFO L85 PathProgramCache]: Analyzing trace with hash 766469493, now seen corresponding path program 1 times [2025-03-17 14:26:58,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:26:58,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818896187] [2025-03-17 14:26:58,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:26:58,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:26:58,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 14:26:58,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 14:26:58,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:26:58,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:26:59,077 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:26:59,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:26:59,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818896187] [2025-03-17 14:26:59,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818896187] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:26:59,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1314473649] [2025-03-17 14:26:59,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:26:59,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:26:59,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:26:59,082 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-03-17 14:26:59,083 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-03-17 14:26:59,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 14:26:59,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 14:26:59,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:26:59,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:26:59,151 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 14:26:59,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:26:59,201 INFO L378 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 10 treesize of output 9 [2025-03-17 14:26:59,375 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:26:59,376 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:26:59,466 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:26:59,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1314473649] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:26:59,467 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:26:59,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-03-17 14:26:59,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547311726] [2025-03-17 14:26:59,467 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:26:59,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 14:26:59,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:26:59,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 14:26:59,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-17 14:26:59,518 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 66 [2025-03-17 14:26:59,518 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 63 transitions, 183 flow. Second operand has 11 states, 11 states have (on average 17.363636363636363) internal successors, (191), 11 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-03-17 14:26:59,518 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:26:59,519 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 66 [2025-03-17 14:26:59,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:27:00,907 INFO L124 PetriNetUnfolderBase]: 15162/20191 cut-off events. [2025-03-17 14:27:00,907 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-03-17 14:27:00,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40275 conditions, 20191 events. 15162/20191 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 1085. Compared 116423 event pairs, 12544 based on Foata normal form. 0/14322 useless extension candidates. Maximal degree in co-relation 40237. Up to 19692 conditions per place. [2025-03-17 14:27:01,000 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 46 selfloop transitions, 10 changer transitions 0/65 dead transitions. [2025-03-17 14:27:01,000 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 65 transitions, 306 flow [2025-03-17 14:27:01,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 14:27:01,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-17 14:27:01,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 183 transitions. [2025-03-17 14:27:01,002 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3465909090909091 [2025-03-17 14:27:01,002 INFO L175 Difference]: Start difference. First operand has 66 places, 63 transitions, 183 flow. Second operand 8 states and 183 transitions. [2025-03-17 14:27:01,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 65 transitions, 306 flow [2025-03-17 14:27:01,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 65 transitions, 305 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:27:01,003 INFO L231 Difference]: Finished difference. Result has 71 places, 65 transitions, 213 flow [2025-03-17 14:27:01,003 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=213, PETRI_PLACES=71, PETRI_TRANSITIONS=65} [2025-03-17 14:27:01,004 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 3 predicate places. [2025-03-17 14:27:01,004 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 65 transitions, 213 flow [2025-03-17 14:27:01,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 17.363636363636363) internal successors, (191), 11 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-03-17 14:27:01,004 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:27:01,004 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-03-17 14:27:01,012 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 14:27:01,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:27:01,205 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-17 14:27:01,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:27:01,206 INFO L85 PathProgramCache]: Analyzing trace with hash -2008842719, now seen corresponding path program 1 times [2025-03-17 14:27:01,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:27:01,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392348288] [2025-03-17 14:27:01,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:27:01,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:27:01,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 14:27:01,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 14:27:01,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:27:01,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:27:01,389 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:27:01,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:27:01,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392348288] [2025-03-17 14:27:01,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392348288] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:27:01,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1413091747] [2025-03-17 14:27:01,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:27:01,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:27:01,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:27:01,393 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-03-17 14:27:01,394 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-03-17 14:27:01,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 14:27:01,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 14:27:01,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:27:01,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:27:01,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 14:27:01,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:27:01,480 INFO L378 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 10 treesize of output 9 [2025-03-17 14:27:01,610 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:27:01,610 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:27:01,737 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:27:01,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1413091747] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:27:01,737 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:27:01,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2025-03-17 14:27:01,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994304433] [2025-03-17 14:27:01,738 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:27:01,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 14:27:01,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:27:01,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 14:27:01,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-03-17 14:27:01,798 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 66 [2025-03-17 14:27:01,798 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 65 transitions, 213 flow. Second operand has 13 states, 13 states have (on average 17.307692307692307) internal successors, (225), 13 states have internal predecessors, (225), 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-03-17 14:27:01,798 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:27:01,798 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 66 [2025-03-17 14:27:01,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:27:02,888 INFO L124 PetriNetUnfolderBase]: 15163/20193 cut-off events. [2025-03-17 14:27:02,889 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-03-17 14:27:02,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40291 conditions, 20193 events. 15163/20193 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 1085. Compared 116193 event pairs, 12544 based on Foata normal form. 0/14324 useless extension candidates. Maximal degree in co-relation 40245. Up to 19684 conditions per place. [2025-03-17 14:27:03,014 INFO L140 encePairwiseOnDemand]: 58/66 looper letters, 40 selfloop transitions, 18 changer transitions 0/67 dead transitions. [2025-03-17 14:27:03,014 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 67 transitions, 337 flow [2025-03-17 14:27:03,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 14:27:03,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-17 14:27:03,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 204 transitions. [2025-03-17 14:27:03,015 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3434343434343434 [2025-03-17 14:27:03,015 INFO L175 Difference]: Start difference. First operand has 71 places, 65 transitions, 213 flow. Second operand 9 states and 204 transitions. [2025-03-17 14:27:03,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 67 transitions, 337 flow [2025-03-17 14:27:03,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 67 transitions, 290 flow, removed 6 selfloop flow, removed 8 redundant places. [2025-03-17 14:27:03,017 INFO L231 Difference]: Finished difference. Result has 70 places, 67 transitions, 210 flow [2025-03-17 14:27:03,017 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=210, PETRI_PLACES=70, PETRI_TRANSITIONS=67} [2025-03-17 14:27:03,017 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 2 predicate places. [2025-03-17 14:27:03,017 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 67 transitions, 210 flow [2025-03-17 14:27:03,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 17.307692307692307) internal successors, (225), 13 states have internal predecessors, (225), 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-03-17 14:27:03,018 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:27:03,018 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:27:03,024 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 14:27:03,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:27:03,218 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-17 14:27:03,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:27:03,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1950010661, now seen corresponding path program 1 times [2025-03-17 14:27:03,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:27:03,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229067279] [2025-03-17 14:27:03,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:27:03,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:27:03,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 14:27:03,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 14:27:03,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:27:03,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:27:03,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:27:03,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:27:03,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229067279] [2025-03-17 14:27:03,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229067279] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:27:03,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:27:03,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:27:03,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384908176] [2025-03-17 14:27:03,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:27:03,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:27:03,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:27:03,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:27:03,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:27:03,290 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 66 [2025-03-17 14:27:03,290 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 67 transitions, 210 flow. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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-03-17 14:27:03,290 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:27:03,290 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 66 [2025-03-17 14:27:03,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:27:04,210 INFO L124 PetriNetUnfolderBase]: 18048/24276 cut-off events. [2025-03-17 14:27:04,210 INFO L125 PetriNetUnfolderBase]: For 67/67 co-relation queries the response was YES. [2025-03-17 14:27:04,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48447 conditions, 24276 events. 18048/24276 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 1234. Compared 144751 event pairs, 15126 based on Foata normal form. 630/18612 useless extension candidates. Maximal degree in co-relation 40230. Up to 19698 conditions per place. [2025-03-17 14:27:04,307 INFO L140 encePairwiseOnDemand]: 55/66 looper letters, 92 selfloop transitions, 5 changer transitions 0/106 dead transitions. [2025-03-17 14:27:04,307 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 106 transitions, 528 flow [2025-03-17 14:27:04,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:27:04,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:27:04,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 181 transitions. [2025-03-17 14:27:04,308 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5484848484848485 [2025-03-17 14:27:04,308 INFO L175 Difference]: Start difference. First operand has 70 places, 67 transitions, 210 flow. Second operand 5 states and 181 transitions. [2025-03-17 14:27:04,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 106 transitions, 528 flow [2025-03-17 14:27:04,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 106 transitions, 475 flow, removed 12 selfloop flow, removed 5 redundant places. [2025-03-17 14:27:04,311 INFO L231 Difference]: Finished difference. Result has 71 places, 69 transitions, 216 flow [2025-03-17 14:27:04,311 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=216, PETRI_PLACES=71, PETRI_TRANSITIONS=69} [2025-03-17 14:27:04,312 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 3 predicate places. [2025-03-17 14:27:04,312 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 69 transitions, 216 flow [2025-03-17 14:27:04,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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-03-17 14:27:04,312 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:27:04,312 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:27:04,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 14:27:04,312 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-17 14:27:04,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:27:04,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1953617522, now seen corresponding path program 1 times [2025-03-17 14:27:04,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:27:04,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236339740] [2025-03-17 14:27:04,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:27:04,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:27:04,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 14:27:04,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 14:27:04,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:27:04,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:27:04,405 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 14:27:04,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:27:04,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236339740] [2025-03-17 14:27:04,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236339740] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:27:04,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:27:04,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:27:04,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744625833] [2025-03-17 14:27:04,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:27:04,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:27:04,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:27:04,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:27:04,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:27:04,415 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 66 [2025-03-17 14:27:04,415 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 69 transitions, 216 flow. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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-03-17 14:27:04,415 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:27:04,415 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 66 [2025-03-17 14:27:04,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:27:05,511 INFO L124 PetriNetUnfolderBase]: 13848/18644 cut-off events. [2025-03-17 14:27:05,512 INFO L125 PetriNetUnfolderBase]: For 1190/1190 co-relation queries the response was YES. [2025-03-17 14:27:05,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39550 conditions, 18644 events. 13848/18644 cut-off events. For 1190/1190 co-relation queries the response was YES. Maximal size of possible extension queue 889. Compared 106939 event pairs, 11474 based on Foata normal form. 0/14510 useless extension candidates. Maximal degree in co-relation 31373. Up to 18212 conditions per place. [2025-03-17 14:27:05,628 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 50 selfloop transitions, 8 changer transitions 0/67 dead transitions. [2025-03-17 14:27:05,628 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 67 transitions, 324 flow [2025-03-17 14:27:05,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:27:05,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:27:05,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 126 transitions. [2025-03-17 14:27:05,629 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38181818181818183 [2025-03-17 14:27:05,629 INFO L175 Difference]: Start difference. First operand has 71 places, 69 transitions, 216 flow. Second operand 5 states and 126 transitions. [2025-03-17 14:27:05,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 67 transitions, 324 flow [2025-03-17 14:27:05,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 67 transitions, 319 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:27:05,632 INFO L231 Difference]: Finished difference. Result has 71 places, 67 transitions, 219 flow [2025-03-17 14:27:05,632 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=203, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=219, PETRI_PLACES=71, PETRI_TRANSITIONS=67} [2025-03-17 14:27:05,633 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 3 predicate places. [2025-03-17 14:27:05,633 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 67 transitions, 219 flow [2025-03-17 14:27:05,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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-03-17 14:27:05,633 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:27:05,633 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:27:05,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 14:27:05,633 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-17 14:27:05,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:27:05,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1866818639, now seen corresponding path program 1 times [2025-03-17 14:27:05,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:27:05,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900278915] [2025-03-17 14:27:05,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:27:05,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:27:05,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 14:27:05,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 14:27:05,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:27:05,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:27:05,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:27:05,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:27:05,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900278915] [2025-03-17 14:27:05,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900278915] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:27:05,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:27:05,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:27:05,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307903147] [2025-03-17 14:27:05,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:27:05,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:27:05,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:27:05,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:27:05,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:27:05,696 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 66 [2025-03-17 14:27:05,696 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 67 transitions, 219 flow. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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-03-17 14:27:05,696 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:27:05,697 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 66 [2025-03-17 14:27:05,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:27:06,584 INFO L124 PetriNetUnfolderBase]: 10167/13757 cut-off events. [2025-03-17 14:27:06,585 INFO L125 PetriNetUnfolderBase]: For 883/883 co-relation queries the response was YES. [2025-03-17 14:27:06,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29202 conditions, 13757 events. 10167/13757 cut-off events. For 883/883 co-relation queries the response was YES. Maximal size of possible extension queue 637. Compared 76161 event pairs, 8266 based on Foata normal form. 0/11403 useless extension candidates. Maximal degree in co-relation 23092. Up to 13393 conditions per place. [2025-03-17 14:27:06,665 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 51 selfloop transitions, 5 changer transitions 0/65 dead transitions. [2025-03-17 14:27:06,666 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 65 transitions, 327 flow [2025-03-17 14:27:06,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:27:06,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:27:06,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2025-03-17 14:27:06,667 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4090909090909091 [2025-03-17 14:27:06,667 INFO L175 Difference]: Start difference. First operand has 71 places, 67 transitions, 219 flow. Second operand 4 states and 108 transitions. [2025-03-17 14:27:06,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 65 transitions, 327 flow [2025-03-17 14:27:06,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 65 transitions, 315 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-17 14:27:06,669 INFO L231 Difference]: Finished difference. Result has 69 places, 65 transitions, 213 flow [2025-03-17 14:27:06,670 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=203, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=213, PETRI_PLACES=69, PETRI_TRANSITIONS=65} [2025-03-17 14:27:06,670 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 1 predicate places. [2025-03-17 14:27:06,670 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 65 transitions, 213 flow [2025-03-17 14:27:06,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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-03-17 14:27:06,670 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:27:06,671 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:27:06,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 14:27:06,671 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-17 14:27:06,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:27:06,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1866818638, now seen corresponding path program 1 times [2025-03-17 14:27:06,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:27:06,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494301504] [2025-03-17 14:27:06,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:27:06,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:27:06,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 14:27:06,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 14:27:06,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:27:06,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:27:06,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:27:06,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:27:06,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494301504] [2025-03-17 14:27:06,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494301504] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:27:06,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:27:06,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:27:06,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483168466] [2025-03-17 14:27:06,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:27:06,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:27:06,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:27:06,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:27:06,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:27:06,736 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 66 [2025-03-17 14:27:06,736 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 65 transitions, 213 flow. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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-03-17 14:27:06,736 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:27:06,736 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 66 [2025-03-17 14:27:06,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:27:07,604 INFO L124 PetriNetUnfolderBase]: 12936/17848 cut-off events. [2025-03-17 14:27:07,604 INFO L125 PetriNetUnfolderBase]: For 1190/1190 co-relation queries the response was YES. [2025-03-17 14:27:07,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37904 conditions, 17848 events. 12936/17848 cut-off events. For 1190/1190 co-relation queries the response was YES. Maximal size of possible extension queue 786. Compared 105365 event pairs, 10753 based on Foata normal form. 500/16041 useless extension candidates. Maximal degree in co-relation 23114. Up to 13409 conditions per place. [2025-03-17 14:27:07,677 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 77 selfloop transitions, 7 changer transitions 0/93 dead transitions. [2025-03-17 14:27:07,677 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 93 transitions, 453 flow [2025-03-17 14:27:07,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:27:07,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:27:07,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 149 transitions. [2025-03-17 14:27:07,678 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5643939393939394 [2025-03-17 14:27:07,678 INFO L175 Difference]: Start difference. First operand has 69 places, 65 transitions, 213 flow. Second operand 4 states and 149 transitions. [2025-03-17 14:27:07,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 93 transitions, 453 flow [2025-03-17 14:27:07,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 93 transitions, 447 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:27:07,681 INFO L231 Difference]: Finished difference. Result has 71 places, 65 transitions, 231 flow [2025-03-17 14:27:07,681 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=231, PETRI_PLACES=71, PETRI_TRANSITIONS=65} [2025-03-17 14:27:07,682 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 3 predicate places. [2025-03-17 14:27:07,682 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 65 transitions, 231 flow [2025-03-17 14:27:07,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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-03-17 14:27:07,682 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:27:07,682 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:27:07,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 14:27:07,682 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-17 14:27:07,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:27:07,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1953617523, now seen corresponding path program 1 times [2025-03-17 14:27:07,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:27:07,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496815717] [2025-03-17 14:27:07,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:27:07,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:27:07,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 14:27:07,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 14:27:07,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:27:07,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:27:07,828 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:27:07,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:27:07,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496815717] [2025-03-17 14:27:07,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496815717] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:27:07,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [382788172] [2025-03-17 14:27:07,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:27:07,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:27:07,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:27:07,831 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-03-17 14:27:07,832 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-03-17 14:27:07,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 14:27:07,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 14:27:07,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:27:07,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:27:07,900 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-17 14:27:07,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:27:07,908 INFO L378 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-03-17 14:27:07,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 14:27:07,949 INFO L378 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 18 treesize of output 13 [2025-03-17 14:27:07,961 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 14:27:07,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 14:27:07,989 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:27:07,989 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:27:07,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [382788172] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:27:07,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 14:27:07,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 6 [2025-03-17 14:27:07,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041794888] [2025-03-17 14:27:07,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:27:07,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:27:07,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:27:07,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:27:07,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-17 14:27:08,000 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 66 [2025-03-17 14:27:08,001 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 65 transitions, 231 flow. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 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-03-17 14:27:08,001 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:27:08,001 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 66 [2025-03-17 14:27:08,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:27:08,534 INFO L124 PetriNetUnfolderBase]: 9642/13381 cut-off events. [2025-03-17 14:27:08,534 INFO L125 PetriNetUnfolderBase]: For 1789/1789 co-relation queries the response was YES. [2025-03-17 14:27:08,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29299 conditions, 13381 events. 9642/13381 cut-off events. For 1789/1789 co-relation queries the response was YES. Maximal size of possible extension queue 581. Compared 76332 event pairs, 7905 based on Foata normal form. 0/12180 useless extension candidates. Maximal degree in co-relation 16340. Up to 12970 conditions per place. [2025-03-17 14:27:08,602 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 50 selfloop transitions, 4 changer transitions 0/63 dead transitions. [2025-03-17 14:27:08,602 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 63 transitions, 331 flow [2025-03-17 14:27:08,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:27:08,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:27:08,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 106 transitions. [2025-03-17 14:27:08,603 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4015151515151515 [2025-03-17 14:27:08,603 INFO L175 Difference]: Start difference. First operand has 71 places, 65 transitions, 231 flow. Second operand 4 states and 106 transitions. [2025-03-17 14:27:08,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 63 transitions, 331 flow [2025-03-17 14:27:08,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 63 transitions, 326 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:27:08,606 INFO L231 Difference]: Finished difference. Result has 71 places, 63 transitions, 226 flow [2025-03-17 14:27:08,606 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=226, PETRI_PLACES=71, PETRI_TRANSITIONS=63} [2025-03-17 14:27:08,607 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 3 predicate places. [2025-03-17 14:27:08,607 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 63 transitions, 226 flow [2025-03-17 14:27:08,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 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-03-17 14:27:08,607 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:27:08,607 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:27:08,614 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 14:27:08,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:27:08,810 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-17 14:27:08,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:27:08,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1771811119, now seen corresponding path program 1 times [2025-03-17 14:27:08,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:27:08,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307900357] [2025-03-17 14:27:08,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:27:08,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:27:08,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 14:27:08,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 14:27:08,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:27:08,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:27:08,931 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:27:08,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:27:08,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307900357] [2025-03-17 14:27:08,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307900357] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:27:08,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [764953947] [2025-03-17 14:27:08,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:27:08,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:27:08,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:27:08,935 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-03-17 14:27:08,937 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-03-17 14:27:08,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 14:27:08,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 14:27:08,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:27:08,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:27:08,999 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-17 14:27:09,000 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:27:09,060 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:27:09,060 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:27:09,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [764953947] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:27:09,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 14:27:09,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2025-03-17 14:27:09,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644564095] [2025-03-17 14:27:09,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:27:09,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:27:09,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:27:09,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:27:09,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-17 14:27:09,073 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 66 [2025-03-17 14:27:09,074 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 63 transitions, 226 flow. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 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-03-17 14:27:09,074 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:27:09,074 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 66 [2025-03-17 14:27:09,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:27:09,494 INFO L124 PetriNetUnfolderBase]: 7325/10281 cut-off events. [2025-03-17 14:27:09,494 INFO L125 PetriNetUnfolderBase]: For 1452/1452 co-relation queries the response was YES. [2025-03-17 14:27:09,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21975 conditions, 10281 events. 7325/10281 cut-off events. For 1452/1452 co-relation queries the response was YES. Maximal size of possible extension queue 446. Compared 57537 event pairs, 5929 based on Foata normal form. 0/9935 useless extension candidates. Maximal degree in co-relation 15705. Up to 9905 conditions per place. [2025-03-17 14:27:09,547 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 45 selfloop transitions, 7 changer transitions 0/61 dead transitions. [2025-03-17 14:27:09,547 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 61 transitions, 322 flow [2025-03-17 14:27:09,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:27:09,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:27:09,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 112 transitions. [2025-03-17 14:27:09,548 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42424242424242425 [2025-03-17 14:27:09,548 INFO L175 Difference]: Start difference. First operand has 71 places, 63 transitions, 226 flow. Second operand 4 states and 112 transitions. [2025-03-17 14:27:09,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 61 transitions, 322 flow [2025-03-17 14:27:09,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 61 transitions, 317 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:27:09,551 INFO L231 Difference]: Finished difference. Result has 70 places, 61 transitions, 227 flow [2025-03-17 14:27:09,551 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=213, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=227, PETRI_PLACES=70, PETRI_TRANSITIONS=61} [2025-03-17 14:27:09,551 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 2 predicate places. [2025-03-17 14:27:09,551 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 61 transitions, 227 flow [2025-03-17 14:27:09,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 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-03-17 14:27:09,552 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:27:09,552 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, 1, 1, 1] [2025-03-17 14:27:09,558 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 14:27:09,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:27:09,752 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-17 14:27:09,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:27:09,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1817132925, now seen corresponding path program 1 times [2025-03-17 14:27:09,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:27:09,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110740040] [2025-03-17 14:27:09,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:27:09,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:27:09,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 14:27:09,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 14:27:09,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:27:09,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:27:09,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:27:09,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:27:09,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110740040] [2025-03-17 14:27:09,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110740040] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:27:09,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:27:09,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:27:09,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454699861] [2025-03-17 14:27:09,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:27:09,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:27:09,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:27:09,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:27:09,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:27:09,868 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 66 [2025-03-17 14:27:09,868 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 61 transitions, 227 flow. Second operand has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 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-03-17 14:27:09,868 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:27:09,869 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 66 [2025-03-17 14:27:09,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:27:10,414 INFO L124 PetriNetUnfolderBase]: 7384/10919 cut-off events. [2025-03-17 14:27:10,414 INFO L125 PetriNetUnfolderBase]: For 1699/1699 co-relation queries the response was YES. [2025-03-17 14:27:10,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23022 conditions, 10919 events. 7384/10919 cut-off events. For 1699/1699 co-relation queries the response was YES. Maximal size of possible extension queue 436. Compared 66395 event pairs, 881 based on Foata normal form. 558/11387 useless extension candidates. Maximal degree in co-relation 19284. Up to 6046 conditions per place. [2025-03-17 14:27:10,454 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 84 selfloop transitions, 6 changer transitions 3/102 dead transitions. [2025-03-17 14:27:10,455 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 102 transitions, 515 flow [2025-03-17 14:27:10,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:27:10,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:27:10,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 170 transitions. [2025-03-17 14:27:10,455 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5151515151515151 [2025-03-17 14:27:10,455 INFO L175 Difference]: Start difference. First operand has 70 places, 61 transitions, 227 flow. Second operand 5 states and 170 transitions. [2025-03-17 14:27:10,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 102 transitions, 515 flow [2025-03-17 14:27:10,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 102 transitions, 505 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:27:10,458 INFO L231 Difference]: Finished difference. Result has 73 places, 59 transitions, 210 flow [2025-03-17 14:27:10,458 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=217, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=210, PETRI_PLACES=73, PETRI_TRANSITIONS=59} [2025-03-17 14:27:10,458 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 5 predicate places. [2025-03-17 14:27:10,458 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 59 transitions, 210 flow [2025-03-17 14:27:10,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 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-03-17 14:27:10,458 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:27:10,459 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:27:10,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 14:27:10,459 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-17 14:27:10,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:27:10,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1271179927, now seen corresponding path program 1 times [2025-03-17 14:27:10,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:27:10,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075188013] [2025-03-17 14:27:10,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:27:10,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:27:10,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-17 14:27:10,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 14:27:10,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:27:10,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:27:10,613 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 14:27:10,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:27:10,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075188013] [2025-03-17 14:27:10,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075188013] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:27:10,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:27:10,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:27:10,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646978497] [2025-03-17 14:27:10,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:27:10,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:27:10,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:27:10,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:27:10,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:27:10,617 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 66 [2025-03-17 14:27:10,617 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 59 transitions, 210 flow. Second operand has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 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-03-17 14:27:10,617 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:27:10,617 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 66 [2025-03-17 14:27:10,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:27:11,292 INFO L124 PetriNetUnfolderBase]: 9312/13223 cut-off events. [2025-03-17 14:27:11,293 INFO L125 PetriNetUnfolderBase]: For 5722/5722 co-relation queries the response was YES. [2025-03-17 14:27:11,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30956 conditions, 13223 events. 9312/13223 cut-off events. For 5722/5722 co-relation queries the response was YES. Maximal size of possible extension queue 549. Compared 76197 event pairs, 1032 based on Foata normal form. 480/13671 useless extension candidates. Maximal degree in co-relation 30917. Up to 8170 conditions per place. [2025-03-17 14:27:11,369 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 97 selfloop transitions, 9 changer transitions 0/115 dead transitions. [2025-03-17 14:27:11,369 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 115 transitions, 587 flow [2025-03-17 14:27:11,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:27:11,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 14:27:11,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 203 transitions. [2025-03-17 14:27:11,370 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5126262626262627 [2025-03-17 14:27:11,370 INFO L175 Difference]: Start difference. First operand has 73 places, 59 transitions, 210 flow. Second operand 6 states and 203 transitions. [2025-03-17 14:27:11,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 115 transitions, 587 flow [2025-03-17 14:27:11,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 115 transitions, 567 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-03-17 14:27:11,374 INFO L231 Difference]: Finished difference. Result has 75 places, 64 transitions, 259 flow [2025-03-17 14:27:11,374 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=259, PETRI_PLACES=75, PETRI_TRANSITIONS=64} [2025-03-17 14:27:11,374 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 7 predicate places. [2025-03-17 14:27:11,374 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 64 transitions, 259 flow [2025-03-17 14:27:11,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 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-03-17 14:27:11,375 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:27:11,375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:27:11,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 14:27:11,375 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-17 14:27:11,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:27:11,375 INFO L85 PathProgramCache]: Analyzing trace with hash 437782925, now seen corresponding path program 2 times [2025-03-17 14:27:11,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:27:11,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58758285] [2025-03-17 14:27:11,375 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:27:11,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:27:11,383 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-03-17 14:27:11,394 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 14:27:11,394 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:27:11,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:27:11,488 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 14:27:11,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:27:11,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58758285] [2025-03-17 14:27:11,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58758285] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:27:11,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:27:11,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 14:27:11,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368296184] [2025-03-17 14:27:11,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:27:11,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:27:11,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:27:11,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:27:11,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:27:11,491 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 66 [2025-03-17 14:27:11,492 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 64 transitions, 259 flow. Second operand has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 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-03-17 14:27:11,492 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:27:11,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 66 [2025-03-17 14:27:11,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:27:12,809 INFO L124 PetriNetUnfolderBase]: 17120/23916 cut-off events. [2025-03-17 14:27:12,809 INFO L125 PetriNetUnfolderBase]: For 18711/18711 co-relation queries the response was YES. [2025-03-17 14:27:12,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62911 conditions, 23916 events. 17120/23916 cut-off events. For 18711/18711 co-relation queries the response was YES. Maximal size of possible extension queue 933. Compared 146539 event pairs, 4861 based on Foata normal form. 332/24020 useless extension candidates. Maximal degree in co-relation 62870. Up to 10566 conditions per place. [2025-03-17 14:27:12,942 INFO L140 encePairwiseOnDemand]: 60/66 looper letters, 113 selfloop transitions, 11 changer transitions 0/133 dead transitions. [2025-03-17 14:27:12,942 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 133 transitions, 711 flow [2025-03-17 14:27:12,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:27:12,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 14:27:12,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 215 transitions. [2025-03-17 14:27:12,943 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5429292929292929 [2025-03-17 14:27:12,943 INFO L175 Difference]: Start difference. First operand has 75 places, 64 transitions, 259 flow. Second operand 6 states and 215 transitions. [2025-03-17 14:27:12,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 133 transitions, 711 flow [2025-03-17 14:27:12,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 133 transitions, 697 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-03-17 14:27:12,980 INFO L231 Difference]: Finished difference. Result has 82 places, 72 transitions, 335 flow [2025-03-17 14:27:12,980 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=335, PETRI_PLACES=82, PETRI_TRANSITIONS=72} [2025-03-17 14:27:12,980 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 14 predicate places. [2025-03-17 14:27:12,980 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 72 transitions, 335 flow [2025-03-17 14:27:12,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 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-03-17 14:27:12,981 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:27:12,981 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:27:12,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 14:27:12,981 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-17 14:27:12,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:27:12,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1957091481, now seen corresponding path program 3 times [2025-03-17 14:27:12,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:27:12,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959387651] [2025-03-17 14:27:12,981 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 14:27:12,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:27:12,987 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 35 statements into 2 equivalence classes. [2025-03-17 14:27:13,012 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 14:27:13,014 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-17 14:27:13,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 14:27:13,014 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 14:27:13,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-17 14:27:13,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 14:27:13,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:27:13,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 14:27:13,053 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 14:27:13,053 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 14:27:13,054 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (25 of 26 remaining) [2025-03-17 14:27:13,055 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 26 remaining) [2025-03-17 14:27:13,055 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 26 remaining) [2025-03-17 14:27:13,055 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 26 remaining) [2025-03-17 14:27:13,056 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 26 remaining) [2025-03-17 14:27:13,056 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 26 remaining) [2025-03-17 14:27:13,056 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 26 remaining) [2025-03-17 14:27:13,056 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 26 remaining) [2025-03-17 14:27:13,056 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 26 remaining) [2025-03-17 14:27:13,056 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 26 remaining) [2025-03-17 14:27:13,056 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 26 remaining) [2025-03-17 14:27:13,056 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (14 of 26 remaining) [2025-03-17 14:27:13,056 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 26 remaining) [2025-03-17 14:27:13,056 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 26 remaining) [2025-03-17 14:27:13,056 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 26 remaining) [2025-03-17 14:27:13,056 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 26 remaining) [2025-03-17 14:27:13,056 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 26 remaining) [2025-03-17 14:27:13,056 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 26 remaining) [2025-03-17 14:27:13,056 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 26 remaining) [2025-03-17 14:27:13,056 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 26 remaining) [2025-03-17 14:27:13,056 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 26 remaining) [2025-03-17 14:27:13,057 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 26 remaining) [2025-03-17 14:27:13,057 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 26 remaining) [2025-03-17 14:27:13,057 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 26 remaining) [2025-03-17 14:27:13,057 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 26 remaining) [2025-03-17 14:27:13,057 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 26 remaining) [2025-03-17 14:27:13,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 14:27:13,057 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:27:13,119 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-17 14:27:13,119 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 14:27:13,123 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 02:27:13 BasicIcfg [2025-03-17 14:27:13,124 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 14:27:13,124 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 14:27:13,124 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 14:27:13,124 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 14:27:13,125 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:26:53" (3/4) ... [2025-03-17 14:27:13,126 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 14:27:13,126 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 14:27:13,127 INFO L158 Benchmark]: Toolchain (without parser) took 20660.38ms. Allocated memory was 167.8MB in the beginning and 3.2GB in the end (delta: 3.0GB). Free memory was 121.0MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 880.2MB. Max. memory is 16.1GB. [2025-03-17 14:27:13,127 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 192.9MB. Free memory is still 112.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:27:13,128 INFO L158 Benchmark]: CACSL2BoogieTranslator took 205.48ms. Allocated memory is still 167.8MB. Free memory was 121.0MB in the beginning and 108.1MB in the end (delta: 12.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 14:27:13,128 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.01ms. Allocated memory is still 167.8MB. Free memory was 108.1MB in the beginning and 105.5MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:27:13,128 INFO L158 Benchmark]: Boogie Preprocessor took 36.82ms. Allocated memory is still 167.8MB. Free memory was 105.5MB in the beginning and 103.0MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:27:13,129 INFO L158 Benchmark]: IcfgBuilder took 713.43ms. Allocated memory is still 167.8MB. Free memory was 103.0MB in the beginning and 102.0MB in the end (delta: 991.4kB). Peak memory consumption was 82.6MB. Max. memory is 16.1GB. [2025-03-17 14:27:13,129 INFO L158 Benchmark]: TraceAbstraction took 19656.68ms. Allocated memory was 167.8MB in the beginning and 3.2GB in the end (delta: 3.0GB). Free memory was 102.0MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 856.4MB. Max. memory is 16.1GB. [2025-03-17 14:27:13,129 INFO L158 Benchmark]: Witness Printer took 2.39ms. Allocated memory is still 3.2GB. Free memory was 2.2GB in the beginning and 2.2GB in the end (delta: 4.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 14:27:13,130 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.16ms. Allocated memory is still 192.9MB. Free memory is still 112.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 205.48ms. Allocated memory is still 167.8MB. Free memory was 121.0MB in the beginning and 108.1MB in the end (delta: 12.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.01ms. Allocated memory is still 167.8MB. Free memory was 108.1MB in the beginning and 105.5MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 36.82ms. Allocated memory is still 167.8MB. Free memory was 105.5MB in the beginning and 103.0MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 713.43ms. Allocated memory is still 167.8MB. Free memory was 103.0MB in the beginning and 102.0MB in the end (delta: 991.4kB). Peak memory consumption was 82.6MB. Max. memory is 16.1GB. * TraceAbstraction took 19656.68ms. Allocated memory was 167.8MB in the beginning and 3.2GB in the end (delta: 3.0GB). Free memory was 102.0MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 856.4MB. Max. memory is 16.1GB. * Witness Printer took 2.39ms. Allocated memory is still 3.2GB. Free memory was 2.2GB in the beginning and 2.2GB in the end (delta: 4.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 21]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 21. Possible FailurePath: [L40] 0 int* q1; [L41] 0 int* q2; [L42] 0 int i, j, total, C, N, M, q1_front, q1_back, q2_front, q2_back, n1, n2; [L124] 0 pthread_t t1, t2, t3, t4; [L126] 0 C = __VERIFIER_nondet_int() [L127] 0 M = __VERIFIER_nondet_int() [L128] 0 N = __VERIFIER_nondet_int() [L130] 0 q1_front = __VERIFIER_nondet_int() [L131] 0 q1_back = __VERIFIER_nondet_int() [L132] 0 q2_front = __VERIFIER_nondet_int() [L133] 0 q2_back = __VERIFIER_nondet_int() [L135] 0 n1 = __VERIFIER_nondet_int() [L136] 0 n2 = __VERIFIER_nondet_int() [L137] CALL, EXPR 0 create_fresh_int_array(n1) [L160] CALL 0 assume_abort_if_not(size >= 0) [L37] COND FALSE 0 !(!cond) [L160] RET 0 assume_abort_if_not(size >= 0) [L161] CALL 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L37] COND FALSE 0 !(!cond) [L161] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L163] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L164] 0 int i = 0; VAL [C=3, M=0, N=1, \old(size)=1, arr={-1:0}, i=0, i=0, j=0, n1=1, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=1, total=0] [L164] COND TRUE 0 i < size [L165] 0 arr[i] = __VERIFIER_nondet_int() [L164] 0 i++ VAL [C=3, M=0, N=1, \old(size)=1, arr={-1:0}, i=0, i=1, j=0, n1=1, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=1, total=0] [L164] COND FALSE 0 !(i < size) [L167] 0 return arr; [L137] RET, EXPR 0 create_fresh_int_array(n1) [L137] 0 q1 = create_fresh_int_array(n1) [L138] CALL, EXPR 0 create_fresh_int_array(n2) [L160] CALL 0 assume_abort_if_not(size >= 0) [L37] COND FALSE 0 !(!cond) [L160] RET 0 assume_abort_if_not(size >= 0) [L161] CALL 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L37] COND FALSE 0 !(!cond) [L161] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L163] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L164] 0 int i = 0; VAL [C=3, M=0, N=1, \old(size)=0, arr={-3:0}, i=0, i=0, j=0, n1=1, n2=0, q1={-1:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=0, total=0] [L164] COND FALSE 0 !(i < size) [L167] 0 return arr; [L138] RET, EXPR 0 create_fresh_int_array(n2) [L138] 0 q2 = create_fresh_int_array(n2) [L140] CALL 0 assume_abort_if_not(C > -2147483648) [L37] COND FALSE 0 !(!cond) [L140] RET 0 assume_abort_if_not(C > -2147483648) [L141] CALL 0 assume_abort_if_not(N > M && M >= 0 && C > 0 && q1_front == q1_back && q2_front == q2_back) [L37] COND FALSE 0 !(!cond) [L141] RET 0 assume_abort_if_not(N > M && M >= 0 && C > 0 && q1_front == q1_back && q2_front == q2_back) [L144] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [C=3, M=0, N=1, i=0, j=0, n1=1, n2=0, q1={-1:0}, q1_back=0, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, t1=-2, total=0] [L49] 1 _Bool cond = i < N; VAL [C=3, M=0, N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=1, i=0, j=0, n1=1, n2=0, q1={-1:0}, q1_back=0, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, total=0] [L51] COND TRUE 1 \read(cond) VAL [C=3, M=0, N=1, i=0, j=0, n1=1, n2=0, q1={-1:0}, q1_back=0, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, total=0] [L53] EXPR 1 q1_back >= 0 && q1_back < n1 && q1[q1_back] == C [L53] EXPR 1 q1_back >= 0 && q1_back < n1 && q1[q1_back] == C [L53] EXPR 1 q1[q1_back] [L53] EXPR 1 q1_back >= 0 && q1_back < n1 && q1[q1_back] == C [L53] CALL 1 assume_abort_if_not(q1_back >= 0 && q1_back < n1 && q1[q1_back] == C) [L37] COND FALSE 1 !(!cond) [L53] RET 1 assume_abort_if_not(q1_back >= 0 && q1_back < n1 && q1[q1_back] == C) [L54] 1 i++ VAL [C=3, M=0, N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=1, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=0, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, total=0] [L145] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [C=3, M=0, N=1, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=0, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, t1=-2, t2=-1, total=0] [L69] 2 _Bool cond = j < M; VAL [C=3, M=0, N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=0, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=0, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, total=0] [L146] FCALL, FORK 0 pthread_create(&t3, 0, thread3, 0) VAL [C=3, M=0, N=1, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=0, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, t1=-2, t2=-1, t3=0, total=0] [L89] 3 _Bool cond = i < N || q1_front < q1_back; VAL [C=3, M=0, N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=0, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=0, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, total=0] [L71] COND FALSE 2 !(\read(cond)) [L84] 2 return 0; [L147] FCALL, FORK 0 pthread_create(&t4, 0, thread4, 0) VAL [C=3, M=0, N=1, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=0, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, t1=-2, t2=-1, t3=0, t4=1, total=0] [L107] 4 _Bool cond = j < M || q2_front < q2_back; VAL [C=3, M=0, N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=0, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=0, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, total=0] [L109] COND FALSE 4 !(\read(cond)) [L120] 4 return 0; [L91] COND FALSE 3 !(\read(cond)) [L102] 3 return 0; [L57] 1 q1_back++ VAL [C=3, M=0, N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=1, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=1, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, total=0] [L60] 1 cond = i < N VAL [C=3, M=0, N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=0, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=1, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, total=0] [L51] COND FALSE 1 !(\read(cond)) [L64] 1 return 0; [L148] FCALL, JOIN 1 pthread_join(t1, 0) VAL [C=3, M=0, N=1, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=1, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, t1=-2, t2=-1, t3=0, t4=1, total=0] [L149] FCALL, JOIN 2 pthread_join(t2, 0) VAL [C=3, M=0, N=1, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=1, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, t1=-2, t2=-1, t3=0, t4=1, total=0] [L150] FCALL, JOIN 3 pthread_join(t3, 0) VAL [C=3, M=0, N=1, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=1, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, t1=-2, t2=-1, t3=0, t4=1, total=0] [L151] FCALL, JOIN 4 pthread_join(t4, 0) VAL [C=3, M=0, N=1, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=1, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, t1=-2, t2=-1, t3=0, t4=1, total=0] [L153] CALL 0 assume_abort_if_not(total <= 0) [L37] COND FALSE 0 !(!cond) [L153] RET 0 assume_abort_if_not(total <= 0) [L154] CALL 0 reach_error() [L21] 0 __assert_fail("0", "popl20-bad-buffer-mult-alt.wvr.c", 21, __extension__ __PRETTY_FUNCTION__) VAL [C=3, M=0, N=1, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=1, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, total=0] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 123]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 144]: 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: 146]: 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: 145]: 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: 147]: 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 99 locations, 108 edges, 26 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: 19.5s, OverallIterations: 15, TraceHistogramMax: 2, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 15.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 701 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 628 mSDsluCounter, 42 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 26 mSDsCounter, 51 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2279 IncrementalHoareTripleChecker+Invalid, 2330 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 51 mSolverCounterUnsat, 16 mSDtfsCounter, 2279 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 102 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=335occurred in iteration=14, InterpolantAutomatonStates: 72, 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.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 248 NumberOfCodeBlocks, 248 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 204 ConstructedInterpolants, 3 QuantifiedInterpolants, 1955 SizeOfPredicates, 11 NumberOfNonLiveVariables, 501 ConjunctsInSsa, 68 ConjunctsInUnsatCore, 20 InterpolantComputations, 12 PerfectInterpolantSequences, 16/31 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-03-17 14:27:13,146 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally 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 ../sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt3.wvr.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 fdebcc32a5907a5601109dc3fb4ac7750aa88ce6953c83cffe48f47befc15286 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 14:27:15,266 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 14:27:15,343 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2025-03-17 14:27:15,352 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 14:27:15,355 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 14:27:15,378 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 14:27:15,379 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 14:27:15,379 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 14:27:15,379 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 14:27:15,379 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 14:27:15,380 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 14:27:15,380 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 14:27:15,380 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 14:27:15,380 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 14:27:15,381 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 14:27:15,381 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 14:27:15,381 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 14:27:15,381 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 14:27:15,381 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 14:27:15,382 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 14:27:15,382 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 14:27:15,382 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 14:27:15,382 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 14:27:15,382 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 14:27:15,382 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 14:27:15,382 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 14:27:15,382 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 14:27:15,382 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 14:27:15,382 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 14:27:15,382 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 14:27:15,382 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 14:27:15,383 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 14:27:15,383 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 14:27:15,383 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 14:27:15,383 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 14:27:15,383 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:27:15,384 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 14:27:15,384 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 14:27:15,384 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 14:27:15,384 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 14:27:15,384 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 14:27:15,384 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 14:27:15,384 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 14:27:15,384 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 14:27:15,384 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 -> fdebcc32a5907a5601109dc3fb4ac7750aa88ce6953c83cffe48f47befc15286 [2025-03-17 14:27:15,642 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 14:27:15,648 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 14:27:15,651 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 14:27:15,652 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 14:27:15,652 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 14:27:15,652 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt3.wvr.c [2025-03-17 14:27:17,464 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/124be56d3/60ce24f20ac84cbb9dea0601d740ab54/FLAGb59a8b509 [2025-03-17 14:27:17,655 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 14:27:17,656 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt3.wvr.c [2025-03-17 14:27:17,666 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/124be56d3/60ce24f20ac84cbb9dea0601d740ab54/FLAGb59a8b509 [2025-03-17 14:27:17,686 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/124be56d3/60ce24f20ac84cbb9dea0601d740ab54 [2025-03-17 14:27:17,688 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 14:27:17,689 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 14:27:17,690 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 14:27:17,690 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 14:27:17,693 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 14:27:17,694 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:27:17" (1/1) ... [2025-03-17 14:27:17,695 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7dc5ce80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:27:17, skipping insertion in model container [2025-03-17 14:27:17,695 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:27:17" (1/1) ... [2025-03-17 14:27:17,714 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 14:27:17,871 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 14:27:17,877 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:27:17,889 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 14:27:17,909 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:27:17,923 INFO L204 MainTranslator]: Completed translation [2025-03-17 14:27:17,925 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:27:17 WrapperNode [2025-03-17 14:27:17,926 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 14:27:17,927 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 14:27:17,927 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 14:27:17,927 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 14:27:17,931 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:27:17" (1/1) ... [2025-03-17 14:27:17,943 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:27:17" (1/1) ... [2025-03-17 14:27:17,972 INFO L138 Inliner]: procedures = 27, calls = 60, calls flagged for inlining = 18, calls inlined = 22, statements flattened = 282 [2025-03-17 14:27:17,974 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 14:27:17,974 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 14:27:17,975 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 14:27:17,975 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 14:27:17,981 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:27:17" (1/1) ... [2025-03-17 14:27:17,981 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:27:17" (1/1) ... [2025-03-17 14:27:17,986 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:27:17" (1/1) ... [2025-03-17 14:27:18,007 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-03-17 14:27:18,008 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:27:17" (1/1) ... [2025-03-17 14:27:18,008 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:27:17" (1/1) ... [2025-03-17 14:27:18,020 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:27:17" (1/1) ... [2025-03-17 14:27:18,024 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:27:17" (1/1) ... [2025-03-17 14:27:18,026 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:27:17" (1/1) ... [2025-03-17 14:27:18,026 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:27:17" (1/1) ... [2025-03-17 14:27:18,032 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 14:27:18,032 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 14:27:18,033 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 14:27:18,033 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 14:27:18,033 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:27:17" (1/1) ... [2025-03-17 14:27:18,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:27:18,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:27:18,069 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-03-17 14:27:18,073 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-03-17 14:27:18,093 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 14:27:18,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 14:27:18,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-17 14:27:18,094 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-17 14:27:18,094 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-17 14:27:18,094 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-17 14:27:18,094 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-17 14:27:18,094 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-17 14:27:18,094 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-17 14:27:18,094 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-17 14:27:18,094 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-17 14:27:18,094 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-03-17 14:27:18,094 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-03-17 14:27:18,094 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-17 14:27:18,094 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-17 14:27:18,095 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 14:27:18,095 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 14:27:18,095 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 14:27:18,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-17 14:27:18,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-17 14:27:18,096 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 14:27:18,205 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 14:27:18,206 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 14:27:18,728 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 14:27:18,728 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 14:27:19,034 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 14:27:19,035 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 14:27:19,036 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:27:19 BoogieIcfgContainer [2025-03-17 14:27:19,036 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 14:27:19,038 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 14:27:19,038 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 14:27:19,041 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 14:27:19,042 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:27:17" (1/3) ... [2025-03-17 14:27:19,042 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42e677c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:27:19, skipping insertion in model container [2025-03-17 14:27:19,042 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:27:17" (2/3) ... [2025-03-17 14:27:19,043 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42e677c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:27:19, skipping insertion in model container [2025-03-17 14:27:19,043 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:27:19" (3/3) ... [2025-03-17 14:27:19,044 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-bad-buffer-mult-alt3.wvr.c [2025-03-17 14:27:19,055 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 14:27:19,056 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-bad-buffer-mult-alt3.wvr.c that has 5 procedures, 61 locations, 1 initial locations, 6 loop locations, and 14 error locations. [2025-03-17 14:27:19,056 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 14:27:19,119 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-17 14:27:19,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 66 transitions, 160 flow [2025-03-17 14:27:19,178 INFO L124 PetriNetUnfolderBase]: 6/62 cut-off events. [2025-03-17 14:27:19,182 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-17 14:27:19,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79 conditions, 62 events. 6/62 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 144 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 49. Up to 2 conditions per place. [2025-03-17 14:27:19,185 INFO L82 GeneralOperation]: Start removeDead. Operand has 73 places, 66 transitions, 160 flow [2025-03-17 14:27:19,190 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 68 places, 61 transitions, 146 flow [2025-03-17 14:27:19,200 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 14:27:19,210 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@45662fcd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 14:27:19,210 INFO L334 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2025-03-17 14:27:19,214 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 14:27:19,215 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-17 14:27:19,215 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:27:19,215 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:27:19,215 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-17 14:27:19,216 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-17 14:27:19,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:27:19,221 INFO L85 PathProgramCache]: Analyzing trace with hash 768865, now seen corresponding path program 1 times [2025-03-17 14:27:19,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:27:19,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [39575758] [2025-03-17 14:27:19,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:27:19,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:27:19,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:27:19,233 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-03-17 14:27:19,235 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-03-17 14:27:19,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 14:27:19,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 14:27:19,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:27:19,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:27:19,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 14:27:19,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:27:19,361 INFO L378 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-03-17 14:27:19,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:27:19,374 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:27:19,374 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:27:19,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [39575758] [2025-03-17 14:27:19,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [39575758] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:27:19,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:27:19,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:27:19,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439477453] [2025-03-17 14:27:19,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:27:19,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:27:19,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:27:19,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:27:19,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:27:19,419 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 66 [2025-03-17 14:27:19,421 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 61 transitions, 146 flow. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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-03-17 14:27:19,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:27:19,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 66 [2025-03-17 14:27:19,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:27:21,274 INFO L124 PetriNetUnfolderBase]: 15159/20183 cut-off events. [2025-03-17 14:27:21,275 INFO L125 PetriNetUnfolderBase]: For 484/484 co-relation queries the response was YES. [2025-03-17 14:27:21,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40874 conditions, 20183 events. 15159/20183 cut-off events. For 484/484 co-relation queries the response was YES. Maximal size of possible extension queue 1085. Compared 116125 event pairs, 12544 based on Foata normal form. 1/14315 useless extension candidates. Maximal degree in co-relation 38292. Up to 19683 conditions per place. [2025-03-17 14:27:21,418 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 44 selfloop transitions, 2 changer transitions 0/57 dead transitions. [2025-03-17 14:27:21,418 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 57 transitions, 230 flow [2025-03-17 14:27:21,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:27:21,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:27:21,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions. [2025-03-17 14:27:21,431 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4898989898989899 [2025-03-17 14:27:21,432 INFO L175 Difference]: Start difference. First operand has 68 places, 61 transitions, 146 flow. Second operand 3 states and 97 transitions. [2025-03-17 14:27:21,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 57 transitions, 230 flow [2025-03-17 14:27:21,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 57 transitions, 214 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-03-17 14:27:21,570 INFO L231 Difference]: Finished difference. Result has 58 places, 57 transitions, 126 flow [2025-03-17 14:27:21,572 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=58, PETRI_TRANSITIONS=57} [2025-03-17 14:27:21,575 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -10 predicate places. [2025-03-17 14:27:21,575 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 57 transitions, 126 flow [2025-03-17 14:27:21,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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-03-17 14:27:21,576 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:27:21,576 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-17 14:27:21,582 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 14:27:21,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:27:21,777 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-17 14:27:21,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:27:21,778 INFO L85 PathProgramCache]: Analyzing trace with hash 768866, now seen corresponding path program 1 times [2025-03-17 14:27:21,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:27:21,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [576515702] [2025-03-17 14:27:21,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:27:21,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:27:21,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:27:21,780 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-03-17 14:27:21,781 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-03-17 14:27:21,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 14:27:21,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 14:27:21,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:27:21,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:27:21,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 14:27:21,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:27:21,862 INFO L378 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 8 treesize of output 7 [2025-03-17 14:27:21,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:27:21,932 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:27:21,932 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:27:21,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [576515702] [2025-03-17 14:27:21,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [576515702] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:27:21,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:27:21,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:27:21,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977024773] [2025-03-17 14:27:21,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:27:21,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:27:21,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:27:21,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:27:21,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:27:21,958 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 66 [2025-03-17 14:27:21,959 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 57 transitions, 126 flow. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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-03-17 14:27:21,959 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:27:21,959 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 66 [2025-03-17 14:27:21,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:27:23,385 INFO L124 PetriNetUnfolderBase]: 15161/20189 cut-off events. [2025-03-17 14:27:23,386 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2025-03-17 14:27:23,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40242 conditions, 20189 events. 15161/20189 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 1085. Compared 116359 event pairs, 12544 based on Foata normal form. 0/14318 useless extension candidates. Maximal degree in co-relation 40206. Up to 19692 conditions per place. [2025-03-17 14:27:23,484 INFO L140 encePairwiseOnDemand]: 57/66 looper letters, 47 selfloop transitions, 7 changer transitions 0/63 dead transitions. [2025-03-17 14:27:23,485 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 63 transitions, 248 flow [2025-03-17 14:27:23,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:27:23,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:27:23,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 120 transitions. [2025-03-17 14:27:23,486 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45454545454545453 [2025-03-17 14:27:23,486 INFO L175 Difference]: Start difference. First operand has 58 places, 57 transitions, 126 flow. Second operand 4 states and 120 transitions. [2025-03-17 14:27:23,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 63 transitions, 248 flow [2025-03-17 14:27:23,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 63 transitions, 242 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:27:23,488 INFO L231 Difference]: Finished difference. Result has 62 places, 63 transitions, 178 flow [2025-03-17 14:27:23,488 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=178, PETRI_PLACES=62, PETRI_TRANSITIONS=63} [2025-03-17 14:27:23,489 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -6 predicate places. [2025-03-17 14:27:23,489 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 63 transitions, 178 flow [2025-03-17 14:27:23,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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-03-17 14:27:23,489 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:27:23,489 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-03-17 14:27:23,495 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 14:27:23,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:27:23,690 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-17 14:27:23,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:27:23,691 INFO L85 PathProgramCache]: Analyzing trace with hash 738905278, now seen corresponding path program 1 times [2025-03-17 14:27:23,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:27:23,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1970573225] [2025-03-17 14:27:23,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:27:23,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:27:23,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:27:23,693 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-03-17 14:27:23,693 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-03-17 14:27:23,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 14:27:23,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 14:27:23,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:27:23,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:27:23,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 14:27:23,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:27:23,765 INFO L378 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 8 treesize of output 7 [2025-03-17 14:27:23,852 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:27:23,853 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:27:23,988 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:27:23,988 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:27:23,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1970573225] [2025-03-17 14:27:23,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1970573225] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:27:23,988 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 14:27:23,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2025-03-17 14:27:23,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309213691] [2025-03-17 14:27:23,988 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 14:27:23,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 14:27:23,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:27:23,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 14:27:23,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-17 14:27:24,027 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 66 [2025-03-17 14:27:24,027 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 63 transitions, 178 flow. Second operand has 8 states, 8 states have (on average 17.25) internal successors, (138), 8 states have internal predecessors, (138), 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-03-17 14:27:24,027 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:27:24,027 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 66 [2025-03-17 14:27:24,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:27:25,828 INFO L124 PetriNetUnfolderBase]: 15167/20207 cut-off events. [2025-03-17 14:27:25,829 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2025-03-17 14:27:25,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40320 conditions, 20207 events. 15167/20207 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 1085. Compared 116273 event pairs, 12544 based on Foata normal form. 0/14334 useless extension candidates. Maximal degree in co-relation 40217. Up to 19695 conditions per place. [2025-03-17 14:27:25,926 INFO L140 encePairwiseOnDemand]: 57/66 looper letters, 47 selfloop transitions, 25 changer transitions 0/81 dead transitions. [2025-03-17 14:27:25,927 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 81 transitions, 400 flow [2025-03-17 14:27:25,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 14:27:25,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-17 14:27:25,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 238 transitions. [2025-03-17 14:27:25,929 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3606060606060606 [2025-03-17 14:27:25,929 INFO L175 Difference]: Start difference. First operand has 62 places, 63 transitions, 178 flow. Second operand 10 states and 238 transitions. [2025-03-17 14:27:25,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 81 transitions, 400 flow [2025-03-17 14:27:25,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 81 transitions, 400 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 14:27:25,932 INFO L231 Difference]: Finished difference. Result has 74 places, 81 transitions, 340 flow [2025-03-17 14:27:25,933 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=340, PETRI_PLACES=74, PETRI_TRANSITIONS=81} [2025-03-17 14:27:25,933 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 6 predicate places. [2025-03-17 14:27:25,934 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 81 transitions, 340 flow [2025-03-17 14:27:25,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.25) internal successors, (138), 8 states have internal predecessors, (138), 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-03-17 14:27:25,934 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:27:25,934 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:27:25,941 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 14:27:26,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:27:26,135 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-17 14:27:26,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:27:26,136 INFO L85 PathProgramCache]: Analyzing trace with hash 973635390, now seen corresponding path program 1 times [2025-03-17 14:27:26,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:27:26,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1649627643] [2025-03-17 14:27:26,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:27:26,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:27:26,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:27:26,138 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-03-17 14:27:26,140 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-03-17 14:27:26,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 14:27:26,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 14:27:26,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:27:26,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:27:26,202 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 14:27:26,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:27:26,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:27:26,255 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:27:26,256 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:27:26,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1649627643] [2025-03-17 14:27:26,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1649627643] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:27:26,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:27:26,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:27:26,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300402892] [2025-03-17 14:27:26,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:27:26,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:27:26,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:27:26,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:27:26,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:27:26,274 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 66 [2025-03-17 14:27:26,274 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 81 transitions, 340 flow. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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-03-17 14:27:26,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:27:26,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 66 [2025-03-17 14:27:26,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:27:27,809 INFO L124 PetriNetUnfolderBase]: 18054/24297 cut-off events. [2025-03-17 14:27:27,809 INFO L125 PetriNetUnfolderBase]: For 97/97 co-relation queries the response was YES. [2025-03-17 14:27:27,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48562 conditions, 24297 events. 18054/24297 cut-off events. For 97/97 co-relation queries the response was YES. Maximal size of possible extension queue 1234. Compared 144959 event pairs, 15126 based on Foata normal form. 630/18635 useless extension candidates. Maximal degree in co-relation 48474. Up to 19710 conditions per place. [2025-03-17 14:27:27,911 INFO L140 encePairwiseOnDemand]: 57/66 looper letters, 112 selfloop transitions, 3 changer transitions 0/126 dead transitions. [2025-03-17 14:27:27,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 126 transitions, 740 flow [2025-03-17 14:27:27,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:27:27,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:27:27,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 160 transitions. [2025-03-17 14:27:27,915 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6060606060606061 [2025-03-17 14:27:27,915 INFO L175 Difference]: Start difference. First operand has 74 places, 81 transitions, 340 flow. Second operand 4 states and 160 transitions. [2025-03-17 14:27:27,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 126 transitions, 740 flow [2025-03-17 14:27:27,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 126 transitions, 646 flow, removed 29 selfloop flow, removed 4 redundant places. [2025-03-17 14:27:27,920 INFO L231 Difference]: Finished difference. Result has 74 places, 81 transitions, 295 flow [2025-03-17 14:27:27,920 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=295, PETRI_PLACES=74, PETRI_TRANSITIONS=81} [2025-03-17 14:27:27,921 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 6 predicate places. [2025-03-17 14:27:27,921 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 81 transitions, 295 flow [2025-03-17 14:27:27,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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-03-17 14:27:27,923 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:27:27,923 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:27:27,930 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 14:27:28,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:27:28,123 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-17 14:27:28,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:27:28,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1422518114, now seen corresponding path program 1 times [2025-03-17 14:27:28,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:27:28,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [418503722] [2025-03-17 14:27:28,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:27:28,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:27:28,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:27:28,127 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-03-17 14:27:28,127 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-03-17 14:27:28,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 14:27:28,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 14:27:28,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:27:28,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:27:28,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 14:27:28,185 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:27:28,210 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2025-03-17 14:27:28,211 INFO L378 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-03-17 14:27:28,230 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:27:28,230 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:27:28,230 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:27:28,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [418503722] [2025-03-17 14:27:28,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [418503722] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:27:28,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:27:28,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:27:28,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213988142] [2025-03-17 14:27:28,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:27:28,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:27:28,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:27:28,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:27:28,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:27:28,245 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 66 [2025-03-17 14:27:28,245 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 81 transitions, 295 flow. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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-03-17 14:27:28,245 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:27:28,245 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 66 [2025-03-17 14:27:28,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:27:29,179 INFO L124 PetriNetUnfolderBase]: 13854/18665 cut-off events. [2025-03-17 14:27:29,180 INFO L125 PetriNetUnfolderBase]: For 1208/1208 co-relation queries the response was YES. [2025-03-17 14:27:29,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39638 conditions, 18665 events. 13854/18665 cut-off events. For 1208/1208 co-relation queries the response was YES. Maximal size of possible extension queue 931. Compared 107839 event pairs, 11474 based on Foata normal form. 0/14505 useless extension candidates. Maximal degree in co-relation 39562. Up to 18216 conditions per place. [2025-03-17 14:27:29,250 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 57 selfloop transitions, 11 changer transitions 0/79 dead transitions. [2025-03-17 14:27:29,250 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 79 transitions, 423 flow [2025-03-17 14:27:29,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:27:29,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:27:29,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 126 transitions. [2025-03-17 14:27:29,251 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38181818181818183 [2025-03-17 14:27:29,251 INFO L175 Difference]: Start difference. First operand has 74 places, 81 transitions, 295 flow. Second operand 5 states and 126 transitions. [2025-03-17 14:27:29,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 79 transitions, 423 flow [2025-03-17 14:27:29,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 79 transitions, 419 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-17 14:27:29,254 INFO L231 Difference]: Finished difference. Result has 75 places, 79 transitions, 305 flow [2025-03-17 14:27:29,254 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=283, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=305, PETRI_PLACES=75, PETRI_TRANSITIONS=79} [2025-03-17 14:27:29,254 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 7 predicate places. [2025-03-17 14:27:29,254 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 79 transitions, 305 flow [2025-03-17 14:27:29,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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-03-17 14:27:29,255 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:27:29,255 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:27:29,261 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-17 14:27:29,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:27:29,455 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-17 14:27:29,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:27:29,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1422518115, now seen corresponding path program 1 times [2025-03-17 14:27:29,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:27:29,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1594329000] [2025-03-17 14:27:29,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:27:29,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:27:29,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:27:29,458 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-03-17 14:27:29,458 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-03-17 14:27:29,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 14:27:29,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 14:27:29,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:27:29,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:27:29,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-17 14:27:29,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:27:29,534 INFO L378 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-03-17 14:27:29,540 INFO L378 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 8 treesize of output 7 [2025-03-17 14:27:29,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 14:27:29,667 INFO L378 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 16 treesize of output 11 [2025-03-17 14:27:29,676 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-03-17 14:27:29,676 INFO L378 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-03-17 14:27:29,737 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:27:29,737 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:27:30,335 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:27:30,338 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:27:30,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1594329000] [2025-03-17 14:27:30,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1594329000] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:27:30,339 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 14:27:30,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2025-03-17 14:27:30,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659080611] [2025-03-17 14:27:30,339 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 14:27:30,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 14:27:30,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:27:30,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 14:27:30,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-17 14:27:30,469 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 66 [2025-03-17 14:27:30,470 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 79 transitions, 305 flow. Second operand has 10 states, 10 states have (on average 15.6) internal successors, (156), 10 states have internal predecessors, (156), 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-03-17 14:27:30,470 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:27:30,470 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 66 [2025-03-17 14:27:30,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:27:36,923 INFO L124 PetriNetUnfolderBase]: 28720/38505 cut-off events. [2025-03-17 14:27:36,924 INFO L125 PetriNetUnfolderBase]: For 3159/3159 co-relation queries the response was YES. [2025-03-17 14:27:36,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81177 conditions, 38505 events. 28720/38505 cut-off events. For 3159/3159 co-relation queries the response was YES. Maximal size of possible extension queue 1380. Compared 231700 event pairs, 23186 based on Foata normal form. 0/31839 useless extension candidates. Maximal degree in co-relation 72782. Up to 14255 conditions per place. [2025-03-17 14:27:37,156 INFO L140 encePairwiseOnDemand]: 57/66 looper letters, 131 selfloop transitions, 46 changer transitions 0/186 dead transitions. [2025-03-17 14:27:37,156 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 186 transitions, 1036 flow [2025-03-17 14:27:37,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 14:27:37,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-17 14:27:37,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 345 transitions. [2025-03-17 14:27:37,159 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.37337662337662336 [2025-03-17 14:27:37,159 INFO L175 Difference]: Start difference. First operand has 75 places, 79 transitions, 305 flow. Second operand 14 states and 345 transitions. [2025-03-17 14:27:37,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 186 transitions, 1036 flow [2025-03-17 14:27:37,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 186 transitions, 993 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-17 14:27:37,165 INFO L231 Difference]: Finished difference. Result has 91 places, 105 transitions, 588 flow [2025-03-17 14:27:37,165 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=588, PETRI_PLACES=91, PETRI_TRANSITIONS=105} [2025-03-17 14:27:37,166 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 23 predicate places. [2025-03-17 14:27:37,166 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 105 transitions, 588 flow [2025-03-17 14:27:37,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.6) internal successors, (156), 10 states have internal predecessors, (156), 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-03-17 14:27:37,166 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:27:37,166 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:27:37,174 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-17 14:27:37,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:27:37,367 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-17 14:27:37,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:27:37,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1237463497, now seen corresponding path program 1 times [2025-03-17 14:27:37,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:27:37,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1580230718] [2025-03-17 14:27:37,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:27:37,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:27:37,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:27:37,370 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-03-17 14:27:37,371 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-03-17 14:27:37,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 14:27:37,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 14:27:37,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:27:37,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:27:37,434 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 14:27:37,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:27:37,441 INFO L378 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-03-17 14:27:37,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:27:37,470 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:27:37,470 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:27:37,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1580230718] [2025-03-17 14:27:37,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1580230718] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:27:37,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:27:37,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:27:37,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256413603] [2025-03-17 14:27:37,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:27:37,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:27:37,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:27:37,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:27:37,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:27:37,489 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 66 [2025-03-17 14:27:37,489 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 105 transitions, 588 flow. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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-03-17 14:27:37,489 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:27:37,489 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 66 [2025-03-17 14:27:37,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:27:39,031 INFO L124 PetriNetUnfolderBase]: 21093/28358 cut-off events. [2025-03-17 14:27:39,031 INFO L125 PetriNetUnfolderBase]: For 7371/7371 co-relation queries the response was YES. [2025-03-17 14:27:39,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61676 conditions, 28358 events. 21093/28358 cut-off events. For 7371/7371 co-relation queries the response was YES. Maximal size of possible extension queue 1020. Compared 165193 event pairs, 16706 based on Foata normal form. 0/25270 useless extension candidates. Maximal degree in co-relation 61577. Up to 27633 conditions per place. [2025-03-17 14:27:39,190 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 82 selfloop transitions, 10 changer transitions 0/103 dead transitions. [2025-03-17 14:27:39,191 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 103 transitions, 768 flow [2025-03-17 14:27:39,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:27:39,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:27:39,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2025-03-17 14:27:39,192 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4090909090909091 [2025-03-17 14:27:39,192 INFO L175 Difference]: Start difference. First operand has 91 places, 105 transitions, 588 flow. Second operand 4 states and 108 transitions. [2025-03-17 14:27:39,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 103 transitions, 768 flow [2025-03-17 14:27:39,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 103 transitions, 765 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:27:39,201 INFO L231 Difference]: Finished difference. Result has 91 places, 103 transitions, 601 flow [2025-03-17 14:27:39,201 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=581, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=601, PETRI_PLACES=91, PETRI_TRANSITIONS=103} [2025-03-17 14:27:39,202 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 23 predicate places. [2025-03-17 14:27:39,202 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 103 transitions, 601 flow [2025-03-17 14:27:39,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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-03-17 14:27:39,202 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:27:39,202 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:27:39,209 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-17 14:27:39,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:27:39,406 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-17 14:27:39,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:27:39,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1237463496, now seen corresponding path program 1 times [2025-03-17 14:27:39,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:27:39,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1858876980] [2025-03-17 14:27:39,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:27:39,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:27:39,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:27:39,408 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-03-17 14:27:39,409 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-03-17 14:27:39,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 14:27:39,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 14:27:39,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:27:39,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:27:39,460 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 14:27:39,461 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:27:39,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:27:39,501 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:27:39,501 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:27:39,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1858876980] [2025-03-17 14:27:39,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1858876980] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:27:39,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:27:39,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:27:39,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500709641] [2025-03-17 14:27:39,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:27:39,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:27:39,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:27:39,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:27:39,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:27:39,515 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 66 [2025-03-17 14:27:39,515 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 103 transitions, 601 flow. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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-03-17 14:27:39,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:27:39,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 66 [2025-03-17 14:27:39,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:27:41,410 INFO L124 PetriNetUnfolderBase]: 26874/36803 cut-off events. [2025-03-17 14:27:41,411 INFO L125 PetriNetUnfolderBase]: For 9865/9865 co-relation queries the response was YES. [2025-03-17 14:27:41,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80112 conditions, 36803 events. 26874/36803 cut-off events. For 9865/9865 co-relation queries the response was YES. Maximal size of possible extension queue 1271. Compared 228453 event pairs, 21735 based on Foata normal form. 1016/35413 useless extension candidates. Maximal degree in co-relation 60144. Up to 27677 conditions per place. [2025-03-17 14:27:41,617 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 108 selfloop transitions, 12 changer transitions 0/131 dead transitions. [2025-03-17 14:27:41,618 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 131 transitions, 921 flow [2025-03-17 14:27:41,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:27:41,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:27:41,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 149 transitions. [2025-03-17 14:27:41,618 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5643939393939394 [2025-03-17 14:27:41,618 INFO L175 Difference]: Start difference. First operand has 91 places, 103 transitions, 601 flow. Second operand 4 states and 149 transitions. [2025-03-17 14:27:41,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 131 transitions, 921 flow [2025-03-17 14:27:41,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 131 transitions, 910 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:27:41,629 INFO L231 Difference]: Finished difference. Result has 93 places, 103 transitions, 625 flow [2025-03-17 14:27:41,630 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=590, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=625, PETRI_PLACES=93, PETRI_TRANSITIONS=103} [2025-03-17 14:27:41,630 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 25 predicate places. [2025-03-17 14:27:41,630 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 103 transitions, 625 flow [2025-03-17 14:27:41,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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-03-17 14:27:41,630 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:27:41,630 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1] [2025-03-17 14:27:41,636 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-17 14:27:41,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:27:41,831 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-17 14:27:41,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:27:41,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1693083950, now seen corresponding path program 2 times [2025-03-17 14:27:41,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:27:41,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [302889491] [2025-03-17 14:27:41,831 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:27:41,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:27:41,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:27:41,833 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-03-17 14:27:41,834 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-03-17 14:27:41,878 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-17 14:27:41,891 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 14:27:41,891 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:27:41,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:27:41,892 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 14:27:41,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:27:41,898 INFO L378 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 8 treesize of output 7 [2025-03-17 14:27:42,076 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:27:42,076 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:27:42,543 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:27:42,544 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:27:42,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [302889491] [2025-03-17 14:27:42,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [302889491] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:27:42,544 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 14:27:42,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2025-03-17 14:27:42,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072815360] [2025-03-17 14:27:42,544 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 14:27:42,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 14:27:42,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:27:42,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 14:27:42,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2025-03-17 14:27:42,779 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 66 [2025-03-17 14:27:42,779 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 103 transitions, 625 flow. Second operand has 14 states, 14 states have (on average 17.571428571428573) internal successors, (246), 14 states have internal predecessors, (246), 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-03-17 14:27:42,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:27:42,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 66 [2025-03-17 14:27:42,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:27:52,945 INFO L124 PetriNetUnfolderBase]: 26904/36893 cut-off events. [2025-03-17 14:27:52,945 INFO L125 PetriNetUnfolderBase]: For 12141/12141 co-relation queries the response was YES. [2025-03-17 14:27:53,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84852 conditions, 36893 events. 26904/36893 cut-off events. For 12141/12141 co-relation queries the response was YES. Maximal size of possible extension queue 1243. Compared 229288 event pairs, 21735 based on Foata normal form. 30/33677 useless extension candidates. Maximal degree in co-relation 64263. Up to 35723 conditions per place. [2025-03-17 14:27:53,207 INFO L140 encePairwiseOnDemand]: 57/66 looper letters, 47 selfloop transitions, 107 changer transitions 0/163 dead transitions. [2025-03-17 14:27:53,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 163 transitions, 1413 flow [2025-03-17 14:27:53,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-17 14:27:53,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-03-17 14:27:53,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 468 transitions. [2025-03-17 14:27:53,209 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.32231404958677684 [2025-03-17 14:27:53,210 INFO L175 Difference]: Start difference. First operand has 93 places, 103 transitions, 625 flow. Second operand 22 states and 468 transitions. [2025-03-17 14:27:53,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 163 transitions, 1413 flow [2025-03-17 14:27:53,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 163 transitions, 1398 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:27:53,250 INFO L231 Difference]: Finished difference. Result has 119 places, 163 transitions, 1394 flow [2025-03-17 14:27:53,250 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=616, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=1394, PETRI_PLACES=119, PETRI_TRANSITIONS=163} [2025-03-17 14:27:53,251 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 51 predicate places. [2025-03-17 14:27:53,251 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 163 transitions, 1394 flow [2025-03-17 14:27:53,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 17.571428571428573) internal successors, (246), 14 states have internal predecessors, (246), 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-03-17 14:27:53,251 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:27:53,251 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:27:53,259 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-17 14:27:53,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:27:53,452 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-17 14:27:53,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:27:53,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1839289269, now seen corresponding path program 1 times [2025-03-17 14:27:53,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:27:53,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [813618863] [2025-03-17 14:27:53,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:27:53,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:27:53,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:27:53,454 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-03-17 14:27:53,456 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-03-17 14:27:53,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 14:27:53,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 14:27:53,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:27:53,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:27:53,515 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-17 14:27:53,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:27:53,526 INFO L378 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 8 treesize of output 7 [2025-03-17 14:27:53,673 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:27:53,673 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:27:54,179 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:27:54,179 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:27:54,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [813618863] [2025-03-17 14:27:54,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [813618863] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:27:54,179 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 14:27:54,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2025-03-17 14:27:54,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587875192] [2025-03-17 14:27:54,179 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 14:27:54,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 14:27:54,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:27:54,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 14:27:54,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-17 14:27:54,367 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 66 [2025-03-17 14:27:54,367 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 163 transitions, 1394 flow. Second operand has 10 states, 10 states have (on average 17.9) internal successors, (179), 10 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-03-17 14:27:54,367 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:27:54,367 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 66 [2025-03-17 14:27:54,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:28:00,625 INFO L124 PetriNetUnfolderBase]: 56136/76369 cut-off events. [2025-03-17 14:28:00,625 INFO L125 PetriNetUnfolderBase]: For 25786/25786 co-relation queries the response was YES. [2025-03-17 14:28:00,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 174189 conditions, 76369 events. 56136/76369 cut-off events. For 25786/25786 co-relation queries the response was YES. Maximal size of possible extension queue 2241. Compared 499391 event pairs, 44295 based on Foata normal form. 0/73885 useless extension candidates. Maximal degree in co-relation 173946. Up to 27686 conditions per place. [2025-03-17 14:28:01,138 INFO L140 encePairwiseOnDemand]: 58/66 looper letters, 148 selfloop transitions, 100 changer transitions 0/257 dead transitions. [2025-03-17 14:28:01,138 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 257 transitions, 2158 flow [2025-03-17 14:28:01,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 14:28:01,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-17 14:28:01,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 313 transitions. [2025-03-17 14:28:01,140 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47424242424242424 [2025-03-17 14:28:01,140 INFO L175 Difference]: Start difference. First operand has 119 places, 163 transitions, 1394 flow. Second operand 10 states and 313 transitions. [2025-03-17 14:28:01,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 257 transitions, 2158 flow [2025-03-17 14:28:01,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 257 transitions, 1878 flow, removed 87 selfloop flow, removed 9 redundant places. [2025-03-17 14:28:01,215 INFO L231 Difference]: Finished difference. Result has 121 places, 163 transitions, 1327 flow [2025-03-17 14:28:01,216 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=1114, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=100, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1327, PETRI_PLACES=121, PETRI_TRANSITIONS=163} [2025-03-17 14:28:01,217 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 53 predicate places. [2025-03-17 14:28:01,217 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 163 transitions, 1327 flow [2025-03-17 14:28:01,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 17.9) internal successors, (179), 10 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-03-17 14:28:01,218 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:28:01,218 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:28:01,225 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-17 14:28:01,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:28:01,418 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-17 14:28:01,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:28:01,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1861334577, now seen corresponding path program 2 times [2025-03-17 14:28:01,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:28:01,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1863176817] [2025-03-17 14:28:01,419 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:28:01,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:28:01,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:28:01,421 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-03-17 14:28:01,421 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-03-17 14:28:01,462 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-17 14:28:01,481 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 16 statements. [2025-03-17 14:28:01,481 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:28:01,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:28:01,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-17 14:28:01,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:28:01,491 INFO L378 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-03-17 14:28:01,495 INFO L378 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 8 treesize of output 7 [2025-03-17 14:28:01,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 14:28:01,573 INFO L378 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 16 treesize of output 11 [2025-03-17 14:28:01,579 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-03-17 14:28:01,579 INFO L378 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-03-17 14:28:01,614 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-17 14:28:01,615 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:28:01,615 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:28:01,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1863176817] [2025-03-17 14:28:01,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1863176817] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:28:01,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:28:01,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:28:01,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101043791] [2025-03-17 14:28:01,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:28:01,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:28:01,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:28:01,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:28:01,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:28:01,636 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 66 [2025-03-17 14:28:01,637 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 163 transitions, 1327 flow. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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-03-17 14:28:01,637 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:28:01,637 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 66 [2025-03-17 14:28:01,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:28:06,817 INFO L124 PetriNetUnfolderBase]: 49262/67106 cut-off events. [2025-03-17 14:28:06,818 INFO L125 PetriNetUnfolderBase]: For 33495/33495 co-relation queries the response was YES. [2025-03-17 14:28:07,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151202 conditions, 67106 events. 49262/67106 cut-off events. For 33495/33495 co-relation queries the response was YES. Maximal size of possible extension queue 2014. Compared 434615 event pairs, 38491 based on Foata normal form. 1837/66335 useless extension candidates. Maximal degree in co-relation 150971. Up to 65238 conditions per place. [2025-03-17 14:28:07,300 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 138 selfloop transitions, 12 changer transitions 0/161 dead transitions. [2025-03-17 14:28:07,300 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 161 transitions, 1611 flow [2025-03-17 14:28:07,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:28:07,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:28:07,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 106 transitions. [2025-03-17 14:28:07,301 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4015151515151515 [2025-03-17 14:28:07,301 INFO L175 Difference]: Start difference. First operand has 121 places, 163 transitions, 1327 flow. Second operand 4 states and 106 transitions. [2025-03-17 14:28:07,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 161 transitions, 1611 flow [2025-03-17 14:28:07,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 161 transitions, 1543 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-17 14:28:07,334 INFO L231 Difference]: Finished difference. Result has 118 places, 161 transitions, 1267 flow [2025-03-17 14:28:07,334 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=1243, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1267, PETRI_PLACES=118, PETRI_TRANSITIONS=161} [2025-03-17 14:28:07,335 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 50 predicate places. [2025-03-17 14:28:07,335 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 161 transitions, 1267 flow [2025-03-17 14:28:07,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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-03-17 14:28:07,335 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:28:07,335 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:28:07,342 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-17 14:28:07,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:28:07,536 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-17 14:28:07,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:28:07,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1401594028, now seen corresponding path program 2 times [2025-03-17 14:28:07,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:28:07,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [932742094] [2025-03-17 14:28:07,536 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:28:07,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:28:07,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:28:07,538 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-03-17 14:28:07,540 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-03-17 14:28:07,587 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-17 14:28:07,612 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 10 of 18 statements. [2025-03-17 14:28:07,612 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:28:07,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:28:07,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-17 14:28:07,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:28:07,625 INFO L378 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 8 treesize of output 7 [2025-03-17 14:28:07,778 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-17 14:28:07,778 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:28:07,778 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:28:07,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [932742094] [2025-03-17 14:28:07,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [932742094] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:28:07,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:28:07,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:28:07,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444539253] [2025-03-17 14:28:07,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:28:07,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:28:07,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:28:07,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:28:07,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:28:07,811 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 66 [2025-03-17 14:28:07,812 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 161 transitions, 1267 flow. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 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-03-17 14:28:07,812 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:28:07,812 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 66 [2025-03-17 14:28:07,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:28:12,454 INFO L124 PetriNetUnfolderBase]: 43607/59614 cut-off events. [2025-03-17 14:28:12,455 INFO L125 PetriNetUnfolderBase]: For 19587/19587 co-relation queries the response was YES. [2025-03-17 14:28:12,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129654 conditions, 59614 events. 43607/59614 cut-off events. For 19587/19587 co-relation queries the response was YES. Maximal size of possible extension queue 1882. Compared 384208 event pairs, 33775 based on Foata normal form. 1291/58945 useless extension candidates. Maximal degree in co-relation 129426. Up to 57761 conditions per place. [2025-03-17 14:28:12,873 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 122 selfloop transitions, 26 changer transitions 0/159 dead transitions. [2025-03-17 14:28:12,873 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 159 transitions, 1547 flow [2025-03-17 14:28:12,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:28:12,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:28:12,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 112 transitions. [2025-03-17 14:28:12,874 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42424242424242425 [2025-03-17 14:28:12,874 INFO L175 Difference]: Start difference. First operand has 118 places, 161 transitions, 1267 flow. Second operand 4 states and 112 transitions. [2025-03-17 14:28:12,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 159 transitions, 1547 flow [2025-03-17 14:28:12,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 159 transitions, 1529 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-17 14:28:12,889 INFO L231 Difference]: Finished difference. Result has 115 places, 159 transitions, 1285 flow [2025-03-17 14:28:12,889 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=1233, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1285, PETRI_PLACES=115, PETRI_TRANSITIONS=159} [2025-03-17 14:28:12,889 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 47 predicate places. [2025-03-17 14:28:12,889 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 159 transitions, 1285 flow [2025-03-17 14:28:12,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 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-03-17 14:28:12,890 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:28:12,890 INFO L206 CegarLoopForPetriNet]: trace histogram [11, 10, 1, 1] [2025-03-17 14:28:12,896 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-17 14:28:13,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:28:13,090 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-17 14:28:13,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:28:13,091 INFO L85 PathProgramCache]: Analyzing trace with hash 482725370, now seen corresponding path program 3 times [2025-03-17 14:28:13,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:28:13,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1608032405] [2025-03-17 14:28:13,091 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 14:28:13,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:28:13,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:28:13,093 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-03-17 14:28:13,094 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-03-17 14:28:13,141 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 11 equivalence classes. [2025-03-17 14:28:13,438 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 14:28:13,438 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-17 14:28:13,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:28:13,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-17 14:28:13,444 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:28:13,451 INFO L378 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 8 treesize of output 7 [2025-03-17 14:28:13,975 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:28:13,976 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:28:15,611 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:28:15,611 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:28:15,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1608032405] [2025-03-17 14:28:15,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1608032405] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:28:15,611 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 14:28:15,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 24 [2025-03-17 14:28:15,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244969848] [2025-03-17 14:28:15,611 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 14:28:15,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-17 14:28:15,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:28:15,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-17 14:28:15,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=477, Unknown=0, NotChecked=0, Total=650 [2025-03-17 14:28:16,263 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 66 [2025-03-17 14:28:16,264 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 159 transitions, 1285 flow. Second operand has 26 states, 26 states have (on average 17.76923076923077) internal successors, (462), 26 states have internal predecessors, (462), 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-03-17 14:28:16,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:28:16,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 66 [2025-03-17 14:28:16,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand