./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-bad-counter-queue.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-bad-counter-queue.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 387879bf92b16ead997b40b3e249348f8a6b399496756f9bc3c41b6dc3c21353 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:42:52,356 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:42:52,428 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 16:42:52,440 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:42:52,440 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:42:52,472 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:42:52,473 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:42:52,473 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:42:52,473 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:42:52,473 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:42:52,473 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:42:52,474 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:42:52,475 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:42:52,475 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:42:52,476 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:42:52,476 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:42:52,477 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:42:52,477 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:42:52,477 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 16:42:52,477 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:42:52,478 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:42:52,478 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:42:52,478 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:42:52,478 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:42:52,478 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:42:52,478 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:42:52,478 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:42:52,478 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:42:52,479 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:42:52,479 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:42:52,479 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:42:52,479 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:42:52,479 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:42:52,480 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:42:52,480 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:42:52,480 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:42:52,480 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:42:52,480 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:42:52,480 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:42:52,480 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:42:52,480 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:42:52,480 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:42:52,480 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 16:42:52,480 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 16:42:52,480 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:42:52,480 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:42:52,480 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:42:52,480 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:42:52,481 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-jdk21/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 ! call(reach_error())) ) 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 -> 387879bf92b16ead997b40b3e249348f8a6b399496756f9bc3c41b6dc3c21353 [2025-01-09 16:42:52,798 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:42:52,810 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:42:52,812 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:42:52,813 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:42:52,813 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:42:52,817 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-bad-counter-queue.wvr.c [2025-01-09 16:42:54,146 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3299e185b/d6dde97dd3ed4db2bd7cb3fa2ba8445e/FLAG80605ad43 [2025-01-09 16:42:54,396 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:42:54,397 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-counter-queue.wvr.c [2025-01-09 16:42:54,404 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3299e185b/d6dde97dd3ed4db2bd7cb3fa2ba8445e/FLAG80605ad43 [2025-01-09 16:42:54,415 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3299e185b/d6dde97dd3ed4db2bd7cb3fa2ba8445e [2025-01-09 16:42:54,419 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:42:54,420 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:42:54,422 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:42:54,422 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:42:54,426 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:42:54,427 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:42:54" (1/1) ... [2025-01-09 16:42:54,427 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c442006 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:54, skipping insertion in model container [2025-01-09 16:42:54,428 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:42:54" (1/1) ... [2025-01-09 16:42:54,445 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:42:54,593 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-counter-queue.wvr.c[2142,2155] [2025-01-09 16:42:54,603 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:42:54,611 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:42:54,627 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-counter-queue.wvr.c[2142,2155] [2025-01-09 16:42:54,631 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:42:54,652 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:42:54,653 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:54 WrapperNode [2025-01-09 16:42:54,653 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:42:54,654 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:42:54,654 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:42:54,654 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:42:54,661 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:54" (1/1) ... [2025-01-09 16:42:54,669 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:54" (1/1) ... [2025-01-09 16:42:54,691 INFO L138 Inliner]: procedures = 23, calls = 22, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 125 [2025-01-09 16:42:54,691 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:42:54,692 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:42:54,692 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:42:54,692 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:42:54,702 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:54" (1/1) ... [2025-01-09 16:42:54,702 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:54" (1/1) ... [2025-01-09 16:42:54,704 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:54" (1/1) ... [2025-01-09 16:42:54,725 INFO L175 MemorySlicer]: Split 5 memory accesses to 2 slices as follows [2, 3]. 60 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-01-09 16:42:54,725 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:54" (1/1) ... [2025-01-09 16:42:54,725 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:54" (1/1) ... [2025-01-09 16:42:54,732 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:54" (1/1) ... [2025-01-09 16:42:54,734 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:54" (1/1) ... [2025-01-09 16:42:54,737 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:54" (1/1) ... [2025-01-09 16:42:54,738 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:54" (1/1) ... [2025-01-09 16:42:54,739 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:54" (1/1) ... [2025-01-09 16:42:54,740 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:42:54,741 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:42:54,741 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:42:54,741 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:42:54,742 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:54" (1/1) ... [2025-01-09 16:42:54,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:42:54,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:42:54,777 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 16:42:54,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 16:42:54,798 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:42:54,798 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 16:42:54,798 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 16:42:54,798 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-09 16:42:54,798 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-09 16:42:54,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 16:42:54,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 16:42:54,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 16:42:54,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 16:42:54,799 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 16:42:54,799 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:42:54,799 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:42:54,799 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 16:42:54,799 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 16:42:54,800 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 16:42:54,881 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:42:54,883 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:42:55,122 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 16:42:55,122 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:42:55,342 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:42:55,342 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 16:42:55,343 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:42:55 BoogieIcfgContainer [2025-01-09 16:42:55,344 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:42:55,346 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:42:55,346 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:42:55,350 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:42:55,350 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:42:54" (1/3) ... [2025-01-09 16:42:55,351 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@101ac937 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:42:55, skipping insertion in model container [2025-01-09 16:42:55,351 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:54" (2/3) ... [2025-01-09 16:42:55,351 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@101ac937 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:42:55, skipping insertion in model container [2025-01-09 16:42:55,352 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:42:55" (3/3) ... [2025-01-09 16:42:55,353 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-bad-counter-queue.wvr.c [2025-01-09 16:42:55,367 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:42:55,368 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-bad-counter-queue.wvr.c that has 3 procedures, 22 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-01-09 16:42:55,368 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 16:42:55,424 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-09 16:42:55,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 24 transitions, 62 flow [2025-01-09 16:42:55,493 INFO L124 PetriNetUnfolderBase]: 3/22 cut-off events. [2025-01-09 16:42:55,495 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 16:42:55,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31 conditions, 22 events. 3/22 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 20 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 15. Up to 2 conditions per place. [2025-01-09 16:42:55,501 INFO L82 GeneralOperation]: Start removeDead. Operand has 28 places, 24 transitions, 62 flow [2025-01-09 16:42:55,505 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 25 places, 21 transitions, 54 flow [2025-01-09 16:42:55,517 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:42:55,531 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=LoopHeads, 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;@18adf9ff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:42:55,531 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-01-09 16:42:55,546 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:42:55,546 INFO L124 PetriNetUnfolderBase]: 3/20 cut-off events. [2025-01-09 16:42:55,546 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 16:42:55,546 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:42:55,547 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:42:55,548 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:42:55,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:42:55,554 INFO L85 PathProgramCache]: Analyzing trace with hash -351142198, now seen corresponding path program 1 times [2025-01-09 16:42:55,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:42:55,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501332735] [2025-01-09 16:42:55,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:42:55,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:42:55,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 16:42:55,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 16:42:55,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:42:55,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:42:55,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:42:55,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:42:55,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501332735] [2025-01-09 16:42:55,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501332735] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:42:55,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:42:55,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 16:42:55,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575381623] [2025-01-09 16:42:55,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:42:55,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:42:55,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:42:55,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:42:55,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:42:55,893 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 24 [2025-01-09 16:42:55,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 21 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-01-09 16:42:55,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:42:55,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 24 [2025-01-09 16:42:55,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:42:56,035 INFO L124 PetriNetUnfolderBase]: 147/258 cut-off events. [2025-01-09 16:42:56,035 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-01-09 16:42:56,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 548 conditions, 258 events. 147/258 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 822 event pairs, 42 based on Foata normal form. 1/216 useless extension candidates. Maximal degree in co-relation 480. Up to 168 conditions per place. [2025-01-09 16:42:56,042 INFO L140 encePairwiseOnDemand]: 20/24 looper letters, 29 selfloop transitions, 3 changer transitions 1/34 dead transitions. [2025-01-09 16:42:56,042 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 34 transitions, 155 flow [2025-01-09 16:42:56,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:42:56,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:42:56,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2025-01-09 16:42:56,055 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5972222222222222 [2025-01-09 16:42:56,057 INFO L175 Difference]: Start difference. First operand has 25 places, 21 transitions, 54 flow. Second operand 3 states and 43 transitions. [2025-01-09 16:42:56,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 34 transitions, 155 flow [2025-01-09 16:42:56,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 34 transitions, 141 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-09 16:42:56,067 INFO L231 Difference]: Finished difference. Result has 24 places, 23 transitions, 65 flow [2025-01-09 16:42:56,069 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=65, PETRI_PLACES=24, PETRI_TRANSITIONS=23} [2025-01-09 16:42:56,074 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, -1 predicate places. [2025-01-09 16:42:56,074 INFO L471 AbstractCegarLoop]: Abstraction has has 24 places, 23 transitions, 65 flow [2025-01-09 16:42:56,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-01-09 16:42:56,075 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:42:56,075 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:42:56,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 16:42:56,075 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:42:56,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:42:56,077 INFO L85 PathProgramCache]: Analyzing trace with hash 630330745, now seen corresponding path program 1 times [2025-01-09 16:42:56,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:42:56,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372933216] [2025-01-09 16:42:56,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:42:56,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:42:56,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-09 16:42:56,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 16:42:56,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:42:56,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:42:56,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:42:56,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:42:56,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372933216] [2025-01-09 16:42:56,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372933216] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:42:56,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:42:56,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:42:56,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308243048] [2025-01-09 16:42:56,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:42:56,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:42:56,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:42:56,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:42:56,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:42:56,290 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-01-09 16:42:56,291 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 23 transitions, 65 flow. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 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-01-09 16:42:56,292 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:42:56,292 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-01-09 16:42:56,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:42:56,446 INFO L124 PetriNetUnfolderBase]: 185/365 cut-off events. [2025-01-09 16:42:56,446 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-09 16:42:56,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 765 conditions, 365 events. 185/365 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1517 event pairs, 126 based on Foata normal form. 0/306 useless extension candidates. Maximal degree in co-relation 326. Up to 203 conditions per place. [2025-01-09 16:42:56,450 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 34 selfloop transitions, 5 changer transitions 0/44 dead transitions. [2025-01-09 16:42:56,450 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 44 transitions, 192 flow [2025-01-09 16:42:56,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:42:56,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:42:56,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2025-01-09 16:42:56,452 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2025-01-09 16:42:56,453 INFO L175 Difference]: Start difference. First operand has 24 places, 23 transitions, 65 flow. Second operand 5 states and 65 transitions. [2025-01-09 16:42:56,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 44 transitions, 192 flow [2025-01-09 16:42:56,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 44 transitions, 189 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 16:42:56,455 INFO L231 Difference]: Finished difference. Result has 30 places, 27 transitions, 98 flow [2025-01-09 16:42:56,456 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=98, PETRI_PLACES=30, PETRI_TRANSITIONS=27} [2025-01-09 16:42:56,457 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 5 predicate places. [2025-01-09 16:42:56,458 INFO L471 AbstractCegarLoop]: Abstraction has has 30 places, 27 transitions, 98 flow [2025-01-09 16:42:56,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 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-01-09 16:42:56,459 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:42:56,459 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:42:56,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 16:42:56,460 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:42:56,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:42:56,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1743254830, now seen corresponding path program 1 times [2025-01-09 16:42:56,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:42:56,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199975613] [2025-01-09 16:42:56,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:42:56,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:42:56,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-09 16:42:56,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 16:42:56,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:42:56,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:42:56,677 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:42:56,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:42:56,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199975613] [2025-01-09 16:42:56,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199975613] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:42:56,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:42:56,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:42:56,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018134947] [2025-01-09 16:42:56,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:42:56,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:42:56,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:42:56,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:42:56,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:42:56,679 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-01-09 16:42:56,679 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 27 transitions, 98 flow. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 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-01-09 16:42:56,679 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:42:56,679 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-01-09 16:42:56,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:42:56,807 INFO L124 PetriNetUnfolderBase]: 144/283 cut-off events. [2025-01-09 16:42:56,807 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2025-01-09 16:42:56,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 677 conditions, 283 events. 144/283 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1038 event pairs, 100 based on Foata normal form. 0/240 useless extension candidates. Maximal degree in co-relation 526. Up to 203 conditions per place. [2025-01-09 16:42:56,813 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 17 selfloop transitions, 2 changer transitions 16/40 dead transitions. [2025-01-09 16:42:56,813 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 40 transitions, 207 flow [2025-01-09 16:42:56,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:42:56,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:42:56,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2025-01-09 16:42:56,816 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5083333333333333 [2025-01-09 16:42:56,817 INFO L175 Difference]: Start difference. First operand has 30 places, 27 transitions, 98 flow. Second operand 5 states and 61 transitions. [2025-01-09 16:42:56,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 40 transitions, 207 flow [2025-01-09 16:42:56,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 40 transitions, 203 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-01-09 16:42:56,819 INFO L231 Difference]: Finished difference. Result has 35 places, 24 transitions, 86 flow [2025-01-09 16:42:56,819 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=86, PETRI_PLACES=35, PETRI_TRANSITIONS=24} [2025-01-09 16:42:56,820 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 10 predicate places. [2025-01-09 16:42:56,820 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 24 transitions, 86 flow [2025-01-09 16:42:56,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 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-01-09 16:42:56,822 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:42:56,822 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:42:56,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 16:42:56,823 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:42:56,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:42:56,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1041609040, now seen corresponding path program 1 times [2025-01-09 16:42:56,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:42:56,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985356238] [2025-01-09 16:42:56,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:42:56,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:42:56,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-09 16:42:56,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-09 16:42:56,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:42:56,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:42:56,972 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:42:56,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:42:56,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985356238] [2025-01-09 16:42:56,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985356238] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:42:56,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [867556776] [2025-01-09 16:42:56,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:42:56,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:42:56,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:42:56,976 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:42:56,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 16:42:57,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-09 16:42:57,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-09 16:42:57,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:42:57,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:42:57,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 16:42:57,068 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:42:57,150 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:42:57,152 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:42:57,211 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:42:57,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [867556776] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 16:42:57,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 16:42:57,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2025-01-09 16:42:57,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056985032] [2025-01-09 16:42:57,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:42:57,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:42:57,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:42:57,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:42:57,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-01-09 16:42:57,214 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-01-09 16:42:57,214 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 24 transitions, 86 flow. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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-01-09 16:42:57,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:42:57,215 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-01-09 16:42:57,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:42:57,321 INFO L124 PetriNetUnfolderBase]: 118/226 cut-off events. [2025-01-09 16:42:57,321 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2025-01-09 16:42:57,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 583 conditions, 226 events. 118/226 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 768 event pairs, 42 based on Foata normal form. 0/193 useless extension candidates. Maximal degree in co-relation 566. Up to 103 conditions per place. [2025-01-09 16:42:57,324 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 21 selfloop transitions, 5 changer transitions 0/31 dead transitions. [2025-01-09 16:42:57,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 31 transitions, 161 flow [2025-01-09 16:42:57,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:42:57,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:42:57,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 52 transitions. [2025-01-09 16:42:57,327 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43333333333333335 [2025-01-09 16:42:57,327 INFO L175 Difference]: Start difference. First operand has 35 places, 24 transitions, 86 flow. Second operand 5 states and 52 transitions. [2025-01-09 16:42:57,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 31 transitions, 161 flow [2025-01-09 16:42:57,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 31 transitions, 135 flow, removed 11 selfloop flow, removed 6 redundant places. [2025-01-09 16:42:57,330 INFO L231 Difference]: Finished difference. Result has 31 places, 25 transitions, 91 flow [2025-01-09 16:42:57,330 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=91, PETRI_PLACES=31, PETRI_TRANSITIONS=25} [2025-01-09 16:42:57,331 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 6 predicate places. [2025-01-09 16:42:57,331 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 25 transitions, 91 flow [2025-01-09 16:42:57,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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-01-09 16:42:57,331 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:42:57,331 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:42:57,340 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 16:42:57,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:42:57,532 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:42:57,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:42:57,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1120134275, now seen corresponding path program 1 times [2025-01-09 16:42:57,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:42:57,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388828524] [2025-01-09 16:42:57,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:42:57,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:42:57,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-09 16:42:57,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-09 16:42:57,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:42:57,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:42:57,680 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:42:57,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:42:57,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388828524] [2025-01-09 16:42:57,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388828524] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:42:57,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1790401584] [2025-01-09 16:42:57,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:42:57,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:42:57,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:42:57,683 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:42:57,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 16:42:57,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-09 16:42:57,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-09 16:42:57,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:42:57,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:42:57,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 16:42:57,764 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:42:57,815 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:42:57,815 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:42:57,858 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:42:57,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1790401584] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 16:42:57,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 16:42:57,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2025-01-09 16:42:57,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975462138] [2025-01-09 16:42:57,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:42:57,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:42:57,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:42:57,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:42:57,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-01-09 16:42:57,860 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-01-09 16:42:57,860 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 25 transitions, 91 flow. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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-01-09 16:42:57,860 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:42:57,860 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-01-09 16:42:57,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:42:57,939 INFO L124 PetriNetUnfolderBase]: 117/220 cut-off events. [2025-01-09 16:42:57,939 INFO L125 PetriNetUnfolderBase]: For 116/116 co-relation queries the response was YES. [2025-01-09 16:42:57,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 571 conditions, 220 events. 117/220 cut-off events. For 116/116 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 730 event pairs, 36 based on Foata normal form. 0/205 useless extension candidates. Maximal degree in co-relation 550. Up to 96 conditions per place. [2025-01-09 16:42:57,941 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 24 selfloop transitions, 5 changer transitions 0/34 dead transitions. [2025-01-09 16:42:57,941 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 34 transitions, 184 flow [2025-01-09 16:42:57,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:42:57,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:42:57,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2025-01-09 16:42:57,945 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44166666666666665 [2025-01-09 16:42:57,945 INFO L175 Difference]: Start difference. First operand has 31 places, 25 transitions, 91 flow. Second operand 5 states and 53 transitions. [2025-01-09 16:42:57,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 34 transitions, 184 flow [2025-01-09 16:42:57,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 34 transitions, 175 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-09 16:42:57,947 INFO L231 Difference]: Finished difference. Result has 34 places, 26 transitions, 108 flow [2025-01-09 16:42:57,947 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=108, PETRI_PLACES=34, PETRI_TRANSITIONS=26} [2025-01-09 16:42:57,950 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 9 predicate places. [2025-01-09 16:42:57,950 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 26 transitions, 108 flow [2025-01-09 16:42:57,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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-01-09 16:42:57,950 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:42:57,950 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:42:57,958 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 16:42:58,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:42:58,151 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:42:58,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:42:58,152 INFO L85 PathProgramCache]: Analyzing trace with hash 529405651, now seen corresponding path program 1 times [2025-01-09 16:42:58,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:42:58,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968684497] [2025-01-09 16:42:58,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:42:58,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:42:58,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-09 16:42:58,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-09 16:42:58,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:42:58,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:42:58,188 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 16:42:58,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-09 16:42:58,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-09 16:42:58,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:42:58,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:42:58,245 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 16:42:58,245 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 16:42:58,246 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-01-09 16:42:58,248 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-01-09 16:42:58,249 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-01-09 16:42:58,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 16:42:58,249 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-01-09 16:42:58,307 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-09 16:42:58,307 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 16:42:58,312 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 04:42:58 BasicIcfg [2025-01-09 16:42:58,312 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 16:42:58,313 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 16:42:58,313 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 16:42:58,313 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 16:42:58,315 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:42:55" (3/4) ... [2025-01-09 16:42:58,316 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-01-09 16:42:58,389 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 34. [2025-01-09 16:42:58,449 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 16:42:58,450 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 16:42:58,450 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 16:42:58,450 INFO L158 Benchmark]: Toolchain (without parser) took 4030.09ms. Allocated memory is still 142.6MB. Free memory was 112.6MB in the beginning and 48.6MB in the end (delta: 64.0MB). Peak memory consumption was 61.2MB. Max. memory is 16.1GB. [2025-01-09 16:42:58,451 INFO L158 Benchmark]: CDTParser took 0.62ms. Allocated memory is still 201.3MB. Free memory is still 123.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:42:58,451 INFO L158 Benchmark]: CACSL2BoogieTranslator took 232.00ms. Allocated memory is still 142.6MB. Free memory was 112.1MB in the beginning and 100.6MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 16:42:58,451 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.12ms. Allocated memory is still 142.6MB. Free memory was 100.1MB in the beginning and 98.6MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:42:58,451 INFO L158 Benchmark]: Boogie Preprocessor took 48.73ms. Allocated memory is still 142.6MB. Free memory was 98.6MB in the beginning and 96.8MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 16:42:58,453 INFO L158 Benchmark]: RCFGBuilder took 602.87ms. Allocated memory is still 142.6MB. Free memory was 96.8MB in the beginning and 56.9MB in the end (delta: 40.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-01-09 16:42:58,454 INFO L158 Benchmark]: TraceAbstraction took 2966.59ms. Allocated memory is still 142.6MB. Free memory was 56.4MB in the beginning and 58.0MB in the end (delta: -1.7MB). Peak memory consumption was 2.5MB. Max. memory is 16.1GB. [2025-01-09 16:42:58,454 INFO L158 Benchmark]: Witness Printer took 136.47ms. Allocated memory is still 142.6MB. Free memory was 58.0MB in the beginning and 48.6MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 16:42:58,455 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.62ms. Allocated memory is still 201.3MB. Free memory is still 123.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 232.00ms. Allocated memory is still 142.6MB. Free memory was 112.1MB in the beginning and 100.6MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.12ms. Allocated memory is still 142.6MB. Free memory was 100.1MB in the beginning and 98.6MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 48.73ms. Allocated memory is still 142.6MB. Free memory was 98.6MB in the beginning and 96.8MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 602.87ms. Allocated memory is still 142.6MB. Free memory was 96.8MB in the beginning and 56.9MB in the end (delta: 40.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 2966.59ms. Allocated memory is still 142.6MB. Free memory was 56.4MB in the beginning and 58.0MB in the end (delta: -1.7MB). Peak memory consumption was 2.5MB. Max. memory is 16.1GB. * Witness Printer took 136.47ms. Allocated memory is still 142.6MB. Free memory was 58.0MB in the beginning and 48.6MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 78]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L39] 0 int* A; [L40] 0 _Atomic int counter; [L41] 0 int N; [L66] 0 pthread_t t1, t2; [L68] 0 N = __VERIFIER_nondet_int() [L69] CALL, EXPR 0 create_fresh_int_array(N) [L84] CALL 0 assume_abort_if_not(size >= 0) [L36] COND FALSE 0 !(!cond) [L84] RET 0 assume_abort_if_not(size >= 0) [L85] CALL 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L36] COND FALSE 0 !(!cond) [L85] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L87] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L88] 0 int i = 0; VAL [A={0:0}, N=1, \old(size)=1, arr={-2:0}, counter=0, i=0, size=1] [L88] COND TRUE 0 i < size [L89] 0 arr[i] = __VERIFIER_nondet_int() [L88] 0 i++ VAL [A={0:0}, N=1, \old(size)=1, arr={-2:0}, counter=0, i=1, size=1] [L88] COND FALSE 0 !(i < size) [L91] 0 return arr; [L69] RET, EXPR 0 create_fresh_int_array(N) [L69] 0 A = create_fresh_int_array(N) [L72] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [A={-2:0}, N=1, counter=0, t1=-1] [L73] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [A={-2:0}, N=1, counter=0, t1=-1, t2=0] [L57] 2 int i=0; VAL [A={-2:0}, N=1, \old(_argptr)={0:0}, _argptr={0:0}, counter=0, i=0] [L57] COND TRUE 2 i= b - 2147483648) [L36] COND FALSE 2 !(!cond) [L95] RET 2 assume_abort_if_not(b <= 0 || a >= b - 2147483648) [L96] CALL 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L36] COND FALSE 2 !(!cond) [L96] RET 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L97] 2 return a - b; [L58] RET, EXPR 2 minus(counter, A[i]) [L58] 2 int tmp = minus(counter, A[i]); [L48] 1 int i=0; VAL [A={-2:0}, N=1, \old(_argptr)={0:0}, _argptr={0:0}, counter=0, i=0] [L48] COND TRUE 1 i= 0 || a >= -2147483648 - b) [L36] COND FALSE 1 !(!cond) [L101] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L102] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L36] COND FALSE 1 !(!cond) [L102] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L103] 1 return a + b; [L49] RET, EXPR 1 plus(counter, A[i]) [L49] 1 int tmp = plus(counter, A[i]); [L50] 1 counter = tmp VAL [A={-2:0}, N=1, \old(_argptr)={0:0}, _argptr={0:0}, counter=3, i=0, tmp=3] [L59] 2 counter = tmp VAL [A={-2:0}, N=1, \old(_argptr)={0:0}, _argptr={0:0}, counter=-3, i=0, tmp=-3] [L57] 2 i++ VAL [A={-2:0}, N=1, \old(_argptr)={0:0}, _argptr={0:0}, counter=-3, i=1] [L48] 1 i++ VAL [A={-2:0}, N=1, \old(_argptr)={0:0}, _argptr={0:0}, counter=-3, i=1] [L48] COND FALSE 1 !(i