./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/popl20-min-max-inc.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 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-min-max-inc.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 341ac5a9697f243416924cef7ae19a5e9bc693a5982154ab196fb2faacf237d5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:12:33,562 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:12:33,618 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 10:12:33,621 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:12:33,621 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:12:33,638 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:12:33,638 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:12:33,639 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:12:33,639 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:12:33,639 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:12:33,639 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:12:33,639 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:12:33,639 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:12:33,639 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:12:33,639 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:12:33,640 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:12:33,641 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:12:33,641 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:12:33,641 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:12:33,641 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:12:33,641 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 10:12:33,641 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 10:12:33,642 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 10:12:33,642 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:12:33,642 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 10:12:33,642 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:12:33,642 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:12:33,642 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:12:33,642 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:12:33,642 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:12:33,643 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:12:33,643 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:12:33,643 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:12:33,643 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:12:33,643 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:12:33,643 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:12:33,643 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:12:33,643 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:12:33,643 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:12:33,643 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:12:33,643 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:12:33,643 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:12:33,644 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 -> 341ac5a9697f243416924cef7ae19a5e9bc693a5982154ab196fb2faacf237d5 [2025-03-04 10:12:33,858 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:12:33,866 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:12:33,868 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:12:33,869 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:12:33,869 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:12:33,870 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-min-max-inc.wvr.c [2025-03-04 10:12:35,000 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d271a0a2d/c7596f02247a4a3ca59e1d9dc71c30e1/FLAG86c6d452f [2025-03-04 10:12:35,218 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:12:35,219 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-min-max-inc.wvr.c [2025-03-04 10:12:35,229 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d271a0a2d/c7596f02247a4a3ca59e1d9dc71c30e1/FLAG86c6d452f [2025-03-04 10:12:35,548 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d271a0a2d/c7596f02247a4a3ca59e1d9dc71c30e1 [2025-03-04 10:12:35,550 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:12:35,551 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:12:35,552 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:12:35,552 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:12:35,554 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:12:35,555 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:12:35" (1/1) ... [2025-03-04 10:12:35,555 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ef3eaba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:12:35, skipping insertion in model container [2025-03-04 10:12:35,555 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:12:35" (1/1) ... [2025-03-04 10:12:35,568 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:12:35,703 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-04 10:12:35,705 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:12:35,713 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:12:35,733 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:12:35,750 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:12:35,750 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:12:35 WrapperNode [2025-03-04 10:12:35,751 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:12:35,751 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:12:35,751 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:12:35,751 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:12:35,756 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:12:35" (1/1) ... [2025-03-04 10:12:35,763 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:12:35" (1/1) ... [2025-03-04 10:12:35,783 INFO L138 Inliner]: procedures = 23, calls = 26, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 114 [2025-03-04 10:12:35,784 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:12:35,785 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:12:35,785 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:12:35,785 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:12:35,791 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:12:35" (1/1) ... [2025-03-04 10:12:35,791 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:12:35" (1/1) ... [2025-03-04 10:12:35,793 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:12:35" (1/1) ... [2025-03-04 10:12:35,815 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 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-04 10:12:35,815 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:12:35" (1/1) ... [2025-03-04 10:12:35,815 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:12:35" (1/1) ... [2025-03-04 10:12:35,821 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:12:35" (1/1) ... [2025-03-04 10:12:35,825 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:12:35" (1/1) ... [2025-03-04 10:12:35,826 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:12:35" (1/1) ... [2025-03-04 10:12:35,827 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:12:35" (1/1) ... [2025-03-04 10:12:35,828 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:12:35,832 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:12:35,832 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:12:35,832 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:12:35,833 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:12:35" (1/1) ... [2025-03-04 10:12:35,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:12:35,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:12:35,857 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-04 10:12:35,859 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-04 10:12:35,876 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:12:35,876 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 10:12:35,876 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 10:12:35,877 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 10:12:35,877 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 10:12:35,877 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-04 10:12:35,877 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-04 10:12:35,877 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-03-04 10:12:35,877 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-03-04 10:12:35,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 10:12:35,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 10:12:35,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 10:12:35,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 10:12:35,877 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 10:12:35,877 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:12:35,878 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:12:35,878 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 10:12:35,878 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 10:12:35,879 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 10:12:35,947 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:12:35,948 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:12:36,192 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 10:12:36,192 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:12:36,316 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:12:36,316 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:12:36,317 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:12:36 BoogieIcfgContainer [2025-03-04 10:12:36,317 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:12:36,320 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:12:36,320 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:12:36,326 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:12:36,326 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:12:35" (1/3) ... [2025-03-04 10:12:36,327 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@618e901 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:12:36, skipping insertion in model container [2025-03-04 10:12:36,328 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:12:35" (2/3) ... [2025-03-04 10:12:36,328 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@618e901 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:12:36, skipping insertion in model container [2025-03-04 10:12:36,328 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:12:36" (3/3) ... [2025-03-04 10:12:36,329 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-min-max-inc.wvr.c [2025-03-04 10:12:36,340 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:12:36,341 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-min-max-inc.wvr.c that has 5 procedures, 76 locations, 1 initial locations, 4 loop locations, and 18 error locations. [2025-03-04 10:12:36,342 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 10:12:36,407 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-04 10:12:36,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 88 places, 81 transitions, 190 flow [2025-03-04 10:12:36,497 INFO L124 PetriNetUnfolderBase]: 6/77 cut-off events. [2025-03-04 10:12:36,498 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-04 10:12:36,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94 conditions, 77 events. 6/77 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 218 event pairs, 0 based on Foata normal form. 0/53 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2025-03-04 10:12:36,506 INFO L82 GeneralOperation]: Start removeDead. Operand has 88 places, 81 transitions, 190 flow [2025-03-04 10:12:36,509 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 83 places, 76 transitions, 176 flow [2025-03-04 10:12:36,515 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:12:36,525 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;@41d063f1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:12:36,525 INFO L334 AbstractCegarLoop]: Starting to check reachability of 36 error locations. [2025-03-04 10:12:36,530 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 10:12:36,530 INFO L124 PetriNetUnfolderBase]: 1/6 cut-off events. [2025-03-04 10:12:36,530 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 10:12:36,530 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:12:36,531 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 10:12:36,531 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-03-04 10:12:36,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:12:36,538 INFO L85 PathProgramCache]: Analyzing trace with hash 469830543, now seen corresponding path program 1 times [2025-03-04 10:12:36,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:12:36,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638405408] [2025-03-04 10:12:36,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:12:36,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:12:36,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:12:36,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:12:36,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:12:36,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:12:36,717 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-04 10:12:36,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:12:36,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638405408] [2025-03-04 10:12:36,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638405408] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:12:36,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:12:36,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:12:36,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100659305] [2025-03-04 10:12:36,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:12:36,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:12:36,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:12:36,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:12:36,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:12:36,756 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 81 [2025-03-04 10:12:36,759 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 76 transitions, 176 flow. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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-04 10:12:36,759 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:12:36,759 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 81 [2025-03-04 10:12:36,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:12:41,237 INFO L124 PetriNetUnfolderBase]: 59772/81480 cut-off events. [2025-03-04 10:12:41,238 INFO L125 PetriNetUnfolderBase]: For 2716/2716 co-relation queries the response was YES. [2025-03-04 10:12:41,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160834 conditions, 81480 events. 59772/81480 cut-off events. For 2716/2716 co-relation queries the response was YES. Maximal size of possible extension queue 2985. Compared 551113 event pairs, 45477 based on Foata normal form. 1/57191 useless extension candidates. Maximal degree in co-relation 155907. Up to 75629 conditions per place. [2025-03-04 10:12:41,852 INFO L140 encePairwiseOnDemand]: 75/81 looper letters, 54 selfloop transitions, 2 changer transitions 0/71 dead transitions. [2025-03-04 10:12:41,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 71 transitions, 278 flow [2025-03-04 10:12:41,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:12:41,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:12:41,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 120 transitions. [2025-03-04 10:12:41,868 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49382716049382713 [2025-03-04 10:12:41,869 INFO L175 Difference]: Start difference. First operand has 83 places, 76 transitions, 176 flow. Second operand 3 states and 120 transitions. [2025-03-04 10:12:41,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 71 transitions, 278 flow [2025-03-04 10:12:42,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 71 transitions, 262 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-03-04 10:12:42,061 INFO L231 Difference]: Finished difference. Result has 72 places, 71 transitions, 154 flow [2025-03-04 10:12:42,063 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=154, PETRI_PLACES=72, PETRI_TRANSITIONS=71} [2025-03-04 10:12:42,066 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, -11 predicate places. [2025-03-04 10:12:42,068 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 71 transitions, 154 flow [2025-03-04 10:12:42,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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-04 10:12:42,068 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:12:42,068 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 10:12:42,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:12:42,069 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-03-04 10:12:42,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:12:42,070 INFO L85 PathProgramCache]: Analyzing trace with hash 469830544, now seen corresponding path program 1 times [2025-03-04 10:12:42,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:12:42,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262797514] [2025-03-04 10:12:42,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:12:42,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:12:42,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:12:42,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:12:42,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:12:42,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:12:42,358 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-04 10:12:42,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:12:42,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262797514] [2025-03-04 10:12:42,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262797514] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:12:42,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:12:42,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:12:42,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268577513] [2025-03-04 10:12:42,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:12:42,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:12:42,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:12:42,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:12:42,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:12:42,383 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 81 [2025-03-04 10:12:42,384 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 71 transitions, 154 flow. Second operand has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 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-04 10:12:42,385 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:12:42,385 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 81 [2025-03-04 10:12:42,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:12:45,343 INFO L124 PetriNetUnfolderBase]: 59773/81483 cut-off events. [2025-03-04 10:12:45,343 INFO L125 PetriNetUnfolderBase]: For 420/420 co-relation queries the response was YES. [2025-03-04 10:12:45,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158720 conditions, 81483 events. 59773/81483 cut-off events. For 420/420 co-relation queries the response was YES. Maximal size of possible extension queue 2985. Compared 551101 event pairs, 45477 based on Foata normal form. 0/57193 useless extension candidates. Maximal degree in co-relation 158694. Up to 75631 conditions per place. [2025-03-04 10:12:45,708 INFO L140 encePairwiseOnDemand]: 76/81 looper letters, 56 selfloop transitions, 4 changer transitions 0/74 dead transitions. [2025-03-04 10:12:45,708 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 74 transitions, 282 flow [2025-03-04 10:12:45,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:12:45,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:12:45,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 161 transitions. [2025-03-04 10:12:45,710 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39753086419753086 [2025-03-04 10:12:45,710 INFO L175 Difference]: Start difference. First operand has 72 places, 71 transitions, 154 flow. Second operand 5 states and 161 transitions. [2025-03-04 10:12:45,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 74 transitions, 282 flow [2025-03-04 10:12:45,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 74 transitions, 276 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:12:45,714 INFO L231 Difference]: Finished difference. Result has 75 places, 73 transitions, 171 flow [2025-03-04 10:12:45,714 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=171, PETRI_PLACES=75, PETRI_TRANSITIONS=73} [2025-03-04 10:12:45,715 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, -8 predicate places. [2025-03-04 10:12:45,715 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 73 transitions, 171 flow [2025-03-04 10:12:45,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 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-04 10:12:45,716 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:12:45,716 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2025-03-04 10:12:45,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:12:45,716 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-03-04 10:12:45,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:12:45,718 INFO L85 PathProgramCache]: Analyzing trace with hash 535600685, now seen corresponding path program 1 times [2025-03-04 10:12:45,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:12:45,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759875245] [2025-03-04 10:12:45,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:12:45,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:12:45,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 10:12:45,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 10:12:45,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:12:45,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:12:45,989 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-04 10:12:45,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:12:45,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759875245] [2025-03-04 10:12:45,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759875245] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:12:45,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1242942959] [2025-03-04 10:12:45,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:12:45,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:12:45,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:12:45,995 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-04 10:12:45,996 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-04 10:12:46,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 10:12:46,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 10:12:46,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:12:46,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:12:46,055 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 10:12:46,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:12:46,104 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-04 10:12:46,287 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:12:46,288 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:12:46,515 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-04 10:12:46,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1242942959] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:12:46,515 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:12:46,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2025-03-04 10:12:46,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932679040] [2025-03-04 10:12:46,516 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:12:46,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 10:12:46,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:12:46,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 10:12:46,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2025-03-04 10:12:46,602 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 81 [2025-03-04 10:12:46,604 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 73 transitions, 171 flow. Second operand has 15 states, 15 states have (on average 21.266666666666666) internal successors, (319), 15 states have internal predecessors, (319), 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-04 10:12:46,604 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:12:46,604 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 81 [2025-03-04 10:12:46,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:12:49,915 INFO L124 PetriNetUnfolderBase]: 59773/81482 cut-off events. [2025-03-04 10:12:49,916 INFO L125 PetriNetUnfolderBase]: For 421/421 co-relation queries the response was YES. [2025-03-04 10:12:50,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158724 conditions, 81482 events. 59773/81482 cut-off events. For 421/421 co-relation queries the response was YES. Maximal size of possible extension queue 2985. Compared 551232 event pairs, 45477 based on Foata normal form. 0/57193 useless extension candidates. Maximal degree in co-relation 158694. Up to 75627 conditions per place. [2025-03-04 10:12:50,247 INFO L140 encePairwiseOnDemand]: 75/81 looper letters, 52 selfloop transitions, 7 changer transitions 0/73 dead transitions. [2025-03-04 10:12:50,247 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 73 transitions, 287 flow [2025-03-04 10:12:50,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:12:50,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 10:12:50,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 200 transitions. [2025-03-04 10:12:50,249 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3527336860670194 [2025-03-04 10:12:50,249 INFO L175 Difference]: Start difference. First operand has 75 places, 73 transitions, 171 flow. Second operand 7 states and 200 transitions. [2025-03-04 10:12:50,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 73 transitions, 287 flow [2025-03-04 10:12:50,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 73 transitions, 284 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:12:50,250 INFO L231 Difference]: Finished difference. Result has 79 places, 73 transitions, 186 flow [2025-03-04 10:12:50,251 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=186, PETRI_PLACES=79, PETRI_TRANSITIONS=73} [2025-03-04 10:12:50,251 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, -4 predicate places. [2025-03-04 10:12:50,251 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 73 transitions, 186 flow [2025-03-04 10:12:50,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 21.266666666666666) internal successors, (319), 15 states have internal predecessors, (319), 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-04 10:12:50,252 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:12:50,252 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:12:50,258 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-04 10:12:50,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:12:50,453 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-03-04 10:12:50,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:12:50,453 INFO L85 PathProgramCache]: Analyzing trace with hash 535697076, now seen corresponding path program 1 times [2025-03-04 10:12:50,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:12:50,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80409277] [2025-03-04 10:12:50,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:12:50,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:12:50,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 10:12:50,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 10:12:50,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:12:50,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:12:50,506 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-04 10:12:50,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:12:50,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80409277] [2025-03-04 10:12:50,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80409277] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:12:50,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:12:50,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:12:50,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40193973] [2025-03-04 10:12:50,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:12:50,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:12:50,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:12:50,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:12:50,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:12:50,516 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 81 [2025-03-04 10:12:50,517 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 73 transitions, 186 flow. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 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-04 10:12:50,517 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:12:50,517 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 81 [2025-03-04 10:12:50,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:12:52,687 INFO L124 PetriNetUnfolderBase]: 33250/46213 cut-off events. [2025-03-04 10:12:52,687 INFO L125 PetriNetUnfolderBase]: For 282/282 co-relation queries the response was YES. [2025-03-04 10:12:52,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89398 conditions, 46213 events. 33250/46213 cut-off events. For 282/282 co-relation queries the response was YES. Maximal size of possible extension queue 1643. Compared 301575 event pairs, 25168 based on Foata normal form. 0/36924 useless extension candidates. Maximal degree in co-relation 89372. Up to 42245 conditions per place. [2025-03-04 10:12:52,862 INFO L140 encePairwiseOnDemand]: 73/81 looper letters, 50 selfloop transitions, 3 changer transitions 0/67 dead transitions. [2025-03-04 10:12:52,862 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 67 transitions, 280 flow [2025-03-04 10:12:52,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:12:52,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:12:52,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 136 transitions. [2025-03-04 10:12:52,863 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41975308641975306 [2025-03-04 10:12:52,863 INFO L175 Difference]: Start difference. First operand has 79 places, 73 transitions, 186 flow. Second operand 4 states and 136 transitions. [2025-03-04 10:12:52,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 67 transitions, 280 flow [2025-03-04 10:12:52,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 67 transitions, 267 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-03-04 10:12:52,865 INFO L231 Difference]: Finished difference. Result has 72 places, 67 transitions, 167 flow [2025-03-04 10:12:52,865 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=167, PETRI_PLACES=72, PETRI_TRANSITIONS=67} [2025-03-04 10:12:52,865 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, -11 predicate places. [2025-03-04 10:12:52,865 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 67 transitions, 167 flow [2025-03-04 10:12:52,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 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-04 10:12:52,865 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:12:52,865 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:12:52,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 10:12:52,867 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-03-04 10:12:52,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:12:52,868 INFO L85 PathProgramCache]: Analyzing trace with hash 535697077, now seen corresponding path program 1 times [2025-03-04 10:12:52,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:12:52,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648112975] [2025-03-04 10:12:52,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:12:52,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:12:52,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 10:12:52,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 10:12:52,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:12:52,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:12:52,907 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-04 10:12:52,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:12:52,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648112975] [2025-03-04 10:12:52,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648112975] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:12:52,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:12:52,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:12:52,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107915362] [2025-03-04 10:12:52,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:12:52,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:12:52,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:12:52,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:12:52,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:12:52,916 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 81 [2025-03-04 10:12:52,917 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 67 transitions, 167 flow. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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-04 10:12:52,917 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:12:52,917 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 81 [2025-03-04 10:12:52,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:12:54,961 INFO L124 PetriNetUnfolderBase]: 33249/46212 cut-off events. [2025-03-04 10:12:54,962 INFO L125 PetriNetUnfolderBase]: For 280/280 co-relation queries the response was YES. [2025-03-04 10:12:55,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89389 conditions, 46212 events. 33249/46212 cut-off events. For 280/280 co-relation queries the response was YES. Maximal size of possible extension queue 1643. Compared 301512 event pairs, 25168 based on Foata normal form. 1/36924 useless extension candidates. Maximal degree in co-relation 89370. Up to 42250 conditions per place. [2025-03-04 10:12:55,189 INFO L140 encePairwiseOnDemand]: 78/81 looper letters, 50 selfloop transitions, 2 changer transitions 0/66 dead transitions. [2025-03-04 10:12:55,189 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 66 transitions, 264 flow [2025-03-04 10:12:55,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:12:55,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:12:55,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2025-03-04 10:12:55,190 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4773662551440329 [2025-03-04 10:12:55,190 INFO L175 Difference]: Start difference. First operand has 72 places, 67 transitions, 167 flow. Second operand 3 states and 116 transitions. [2025-03-04 10:12:55,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 66 transitions, 264 flow [2025-03-04 10:12:55,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 66 transitions, 261 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:12:55,191 INFO L231 Difference]: Finished difference. Result has 72 places, 66 transitions, 161 flow [2025-03-04 10:12:55,191 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=161, PETRI_PLACES=72, PETRI_TRANSITIONS=66} [2025-03-04 10:12:55,192 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, -11 predicate places. [2025-03-04 10:12:55,192 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 66 transitions, 161 flow [2025-03-04 10:12:55,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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-04 10:12:55,192 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:12:55,192 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:12:55,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 10:12:55,192 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-03-04 10:12:55,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:12:55,192 INFO L85 PathProgramCache]: Analyzing trace with hash -683706862, now seen corresponding path program 1 times [2025-03-04 10:12:55,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:12:55,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456964490] [2025-03-04 10:12:55,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:12:55,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:12:55,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 10:12:55,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 10:12:55,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:12:55,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:12:55,333 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-04 10:12:55,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:12:55,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456964490] [2025-03-04 10:12:55,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456964490] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:12:55,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1057709066] [2025-03-04 10:12:55,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:12:55,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:12:55,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:12:55,336 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-04 10:12:55,337 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-04 10:12:55,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 10:12:55,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 10:12:55,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:12:55,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:12:55,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 10:12:55,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:12:55,438 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-04 10:12:55,438 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:12:55,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2025-03-04 10:12:55,465 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-04 10:12:55,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1057709066] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:12:55,466 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:12:55,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-04 10:12:55,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310644518] [2025-03-04 10:12:55,466 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:12:55,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 10:12:55,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:12:55,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 10:12:55,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:12:55,486 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 81 [2025-03-04 10:12:55,487 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 66 transitions, 161 flow. Second operand has 8 states, 8 states have (on average 22.75) internal successors, (182), 8 states have internal predecessors, (182), 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-04 10:12:55,487 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:12:55,487 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 81 [2025-03-04 10:12:55,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:12:57,275 INFO L124 PetriNetUnfolderBase]: 27695/38616 cut-off events. [2025-03-04 10:12:57,275 INFO L125 PetriNetUnfolderBase]: For 254/254 co-relation queries the response was YES. [2025-03-04 10:12:57,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74458 conditions, 38616 events. 27695/38616 cut-off events. For 254/254 co-relation queries the response was YES. Maximal size of possible extension queue 1439. Compared 248754 event pairs, 20452 based on Foata normal form. 0/31968 useless extension candidates. Maximal degree in co-relation 74438. Up to 35077 conditions per place. [2025-03-04 10:12:57,439 INFO L140 encePairwiseOnDemand]: 76/81 looper letters, 47 selfloop transitions, 3 changer transitions 0/64 dead transitions. [2025-03-04 10:12:57,439 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 64 transitions, 257 flow [2025-03-04 10:12:57,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:12:57,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:12:57,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 157 transitions. [2025-03-04 10:12:57,440 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38765432098765434 [2025-03-04 10:12:57,440 INFO L175 Difference]: Start difference. First operand has 72 places, 66 transitions, 161 flow. Second operand 5 states and 157 transitions. [2025-03-04 10:12:57,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 64 transitions, 257 flow [2025-03-04 10:12:57,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 64 transitions, 253 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:12:57,441 INFO L231 Difference]: Finished difference. Result has 72 places, 64 transitions, 159 flow [2025-03-04 10:12:57,441 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=159, PETRI_PLACES=72, PETRI_TRANSITIONS=64} [2025-03-04 10:12:57,442 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, -11 predicate places. [2025-03-04 10:12:57,442 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 64 transitions, 159 flow [2025-03-04 10:12:57,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 22.75) internal successors, (182), 8 states have internal predecessors, (182), 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-04 10:12:57,442 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:12:57,442 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:12:57,448 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-04 10:12:57,642 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,SelfDestructingSolverStorable5 [2025-03-04 10:12:57,643 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-03-04 10:12:57,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:12:57,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1680021552, now seen corresponding path program 1 times [2025-03-04 10:12:57,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:12:57,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350945566] [2025-03-04 10:12:57,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:12:57,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:12:57,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 10:12:57,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 10:12:57,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:12:57,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:12:57,822 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-04 10:12:57,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:12:57,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350945566] [2025-03-04 10:12:57,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350945566] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:12:57,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1764129252] [2025-03-04 10:12:57,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:12:57,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:12:57,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:12:57,828 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-04 10:12:57,841 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-04 10:12:57,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 10:12:57,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 10:12:57,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:12:57,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:12:57,914 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 10:12:57,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:12:58,001 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-04 10:12:58,002 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:12:58,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2025-03-04 10:12:58,069 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-04 10:12:58,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1764129252] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:12:58,070 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:12:58,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-04 10:12:58,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628744231] [2025-03-04 10:12:58,070 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:12:58,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:12:58,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:12:58,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:12:58,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:12:58,112 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 81 [2025-03-04 10:12:58,113 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 64 transitions, 159 flow. Second operand has 11 states, 11 states have (on average 23.363636363636363) internal successors, (257), 11 states have internal predecessors, (257), 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-04 10:12:58,113 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:12:58,113 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 81 [2025-03-04 10:12:58,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:13:00,877 INFO L124 PetriNetUnfolderBase]: 42328/56369 cut-off events. [2025-03-04 10:13:00,877 INFO L125 PetriNetUnfolderBase]: For 425/425 co-relation queries the response was YES. [2025-03-04 10:13:00,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110825 conditions, 56369 events. 42328/56369 cut-off events. For 425/425 co-relation queries the response was YES. Maximal size of possible extension queue 1834. Compared 342001 event pairs, 10550 based on Foata normal form. 0/50181 useless extension candidates. Maximal degree in co-relation 110805. Up to 19730 conditions per place. [2025-03-04 10:13:01,138 INFO L140 encePairwiseOnDemand]: 72/81 looper letters, 98 selfloop transitions, 8 changer transitions 0/120 dead transitions. [2025-03-04 10:13:01,139 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 120 transitions, 489 flow [2025-03-04 10:13:01,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:13:01,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 10:13:01,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 256 transitions. [2025-03-04 10:13:01,140 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4514991181657848 [2025-03-04 10:13:01,140 INFO L175 Difference]: Start difference. First operand has 72 places, 64 transitions, 159 flow. Second operand 7 states and 256 transitions. [2025-03-04 10:13:01,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 120 transitions, 489 flow [2025-03-04 10:13:01,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 120 transitions, 484 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 10:13:01,143 INFO L231 Difference]: Finished difference. Result has 76 places, 66 transitions, 189 flow [2025-03-04 10:13:01,143 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=189, PETRI_PLACES=76, PETRI_TRANSITIONS=66} [2025-03-04 10:13:01,143 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, -7 predicate places. [2025-03-04 10:13:01,143 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 66 transitions, 189 flow [2025-03-04 10:13:01,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 23.363636363636363) internal successors, (257), 11 states have internal predecessors, (257), 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-04 10:13:01,143 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:01,143 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:13:01,149 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-04 10:13:01,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:13:01,344 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-03-04 10:13:01,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:01,344 INFO L85 PathProgramCache]: Analyzing trace with hash -2032657448, now seen corresponding path program 1 times [2025-03-04 10:13:01,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:01,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668214146] [2025-03-04 10:13:01,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:01,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:01,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 10:13:01,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:13:01,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:01,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:01,478 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-04 10:13:01,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:01,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668214146] [2025-03-04 10:13:01,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668214146] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:13:01,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [474687241] [2025-03-04 10:13:01,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:01,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:13:01,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:13:01,483 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-04 10:13:01,491 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-04 10:13:01,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 10:13:01,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:13:01,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:01,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:01,548 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:13:01,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:13:01,597 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:13:01,597 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:13:01,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [474687241] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:13:01,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:13:01,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-04 10:13:01,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170880157] [2025-03-04 10:13:01,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:13:01,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:13:01,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:01,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:13:01,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:13:01,606 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 81 [2025-03-04 10:13:01,607 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 66 transitions, 189 flow. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 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-04 10:13:01,607 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:01,607 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 81 [2025-03-04 10:13:01,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:13:05,109 INFO L124 PetriNetUnfolderBase]: 48800/71302 cut-off events. [2025-03-04 10:13:05,109 INFO L125 PetriNetUnfolderBase]: For 18495/18495 co-relation queries the response was YES. [2025-03-04 10:13:05,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148268 conditions, 71302 events. 48800/71302 cut-off events. For 18495/18495 co-relation queries the response was YES. Maximal size of possible extension queue 1982. Compared 513698 event pairs, 6747 based on Foata normal form. 0/64934 useless extension candidates. Maximal degree in co-relation 148246. Up to 44274 conditions per place. [2025-03-04 10:13:05,447 INFO L140 encePairwiseOnDemand]: 75/81 looper letters, 104 selfloop transitions, 5 changer transitions 0/122 dead transitions. [2025-03-04 10:13:05,447 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 122 transitions, 573 flow [2025-03-04 10:13:05,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:13:05,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:13:05,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 179 transitions. [2025-03-04 10:13:05,448 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5524691358024691 [2025-03-04 10:13:05,448 INFO L175 Difference]: Start difference. First operand has 76 places, 66 transitions, 189 flow. Second operand 4 states and 179 transitions. [2025-03-04 10:13:05,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 122 transitions, 573 flow [2025-03-04 10:13:05,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 122 transitions, 568 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 10:13:05,458 INFO L231 Difference]: Finished difference. Result has 78 places, 70 transitions, 217 flow [2025-03-04 10:13:05,458 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=217, PETRI_PLACES=78, PETRI_TRANSITIONS=70} [2025-03-04 10:13:05,458 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, -5 predicate places. [2025-03-04 10:13:05,458 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 70 transitions, 217 flow [2025-03-04 10:13:05,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 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-04 10:13:05,459 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:05,459 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:13:05,464 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-04 10:13:05,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:13:05,663 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-03-04 10:13:05,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:05,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1010710044, now seen corresponding path program 1 times [2025-03-04 10:13:05,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:05,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244784096] [2025-03-04 10:13:05,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:05,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:05,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 10:13:05,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 10:13:05,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:05,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:05,782 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-04 10:13:05,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:05,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244784096] [2025-03-04 10:13:05,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244784096] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:13:05,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1528993355] [2025-03-04 10:13:05,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:05,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:13:05,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:13:05,786 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-04 10:13:05,787 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-04 10:13:05,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 10:13:05,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 10:13:05,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:05,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:05,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:13:05,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:13:05,874 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:13:05,874 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:13:05,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1528993355] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:13:05,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:13:05,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-04 10:13:05,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831908620] [2025-03-04 10:13:05,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:13:05,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:13:05,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:05,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:13:05,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:13:05,879 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 81 [2025-03-04 10:13:05,880 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 70 transitions, 217 flow. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 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-04 10:13:05,880 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:05,880 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 81 [2025-03-04 10:13:05,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand