./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d 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/pthread-wmm/safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -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 40c6d23f476fb49e658cd83073483dddc1740bbd5f458e601d84fe47899d7237 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 01:03:53,515 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 01:03:53,552 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-08 01:03:53,556 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 01:03:53,556 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 01:03:53,570 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 01:03:53,571 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 01:03:53,571 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 01:03:53,571 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 01:03:53,571 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 01:03:53,571 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 01:03:53,571 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 01:03:53,572 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 01:03:53,572 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 01:03:53,572 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 01:03:53,572 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 01:03:53,572 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 01:03:53,572 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 01:03:53,572 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 01:03:53,572 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 01:03:53,572 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 01:03:53,572 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 01:03:53,573 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 01:03:53,573 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 01:03:53,573 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 01:03:53,573 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 01:03:53,573 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 01:03:53,573 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 01:03:53,573 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 01:03:53,573 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 01:03:53,573 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 01:03:53,573 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 01:03:53,573 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 01:03:53,573 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 01:03:53,574 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 01:03:53,574 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 01:03:53,574 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 01:03:53,574 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 01:03:53,574 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 01:03:53,574 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 01:03:53,574 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 01:03:53,574 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 01:03:53,574 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 01:03:53,574 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 -> 40c6d23f476fb49e658cd83073483dddc1740bbd5f458e601d84fe47899d7237 [2025-02-08 01:03:53,772 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 01:03:53,780 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 01:03:53,782 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 01:03:53,783 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 01:03:53,783 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 01:03:53,784 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2025-02-08 01:03:54,975 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0ed89e02c/765b0652972e49fcaf9340ce78bf0d1f/FLAGee70604cb [2025-02-08 01:03:55,314 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 01:03:55,314 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2025-02-08 01:03:55,326 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0ed89e02c/765b0652972e49fcaf9340ce78bf0d1f/FLAGee70604cb [2025-02-08 01:03:55,562 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0ed89e02c/765b0652972e49fcaf9340ce78bf0d1f [2025-02-08 01:03:55,564 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 01:03:55,565 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 01:03:55,567 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 01:03:55,568 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 01:03:55,571 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 01:03:55,571 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:03:55" (1/1) ... [2025-02-08 01:03:55,572 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43e35fb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:03:55, skipping insertion in model container [2025-02-08 01:03:55,573 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:03:55" (1/1) ... [2025-02-08 01:03:55,601 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 01:03:55,764 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/pthread-wmm/safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2025-02-08 01:03:55,924 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 01:03:55,935 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 01:03:55,944 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/pthread-wmm/safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2025-02-08 01:03:55,997 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 01:03:56,030 INFO L204 MainTranslator]: Completed translation [2025-02-08 01:03:56,031 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:03:56 WrapperNode [2025-02-08 01:03:56,031 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 01:03:56,033 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 01:03:56,033 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 01:03:56,033 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 01:03:56,037 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:03:56" (1/1) ... [2025-02-08 01:03:56,051 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:03:56" (1/1) ... [2025-02-08 01:03:56,067 INFO L138 Inliner]: procedures = 175, calls = 44, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 115 [2025-02-08 01:03:56,068 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 01:03:56,069 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 01:03:56,069 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 01:03:56,069 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 01:03:56,075 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:03:56" (1/1) ... [2025-02-08 01:03:56,075 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:03:56" (1/1) ... [2025-02-08 01:03:56,077 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:03:56" (1/1) ... [2025-02-08 01:03:56,092 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-08 01:03:56,096 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:03:56" (1/1) ... [2025-02-08 01:03:56,096 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:03:56" (1/1) ... [2025-02-08 01:03:56,103 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:03:56" (1/1) ... [2025-02-08 01:03:56,104 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:03:56" (1/1) ... [2025-02-08 01:03:56,105 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:03:56" (1/1) ... [2025-02-08 01:03:56,106 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:03:56" (1/1) ... [2025-02-08 01:03:56,107 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 01:03:56,108 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 01:03:56,108 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 01:03:56,108 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 01:03:56,109 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:03:56" (1/1) ... [2025-02-08 01:03:56,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 01:03:56,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:03:56,138 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-02-08 01:03:56,142 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-02-08 01:03:56,157 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-08 01:03:56,157 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 01:03:56,157 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-02-08 01:03:56,157 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-02-08 01:03:56,157 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-02-08 01:03:56,157 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-02-08 01:03:56,157 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-02-08 01:03:56,157 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-02-08 01:03:56,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 01:03:56,157 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-08 01:03:56,158 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 01:03:56,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 01:03:56,159 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 01:03:56,256 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 01:03:56,257 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 01:03:56,539 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 01:03:56,539 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 01:03:56,749 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 01:03:56,750 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 01:03:56,750 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:03:56 BoogieIcfgContainer [2025-02-08 01:03:56,751 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 01:03:56,753 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 01:03:56,753 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 01:03:56,756 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 01:03:56,757 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 01:03:55" (1/3) ... [2025-02-08 01:03:56,758 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d8ab8a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:03:56, skipping insertion in model container [2025-02-08 01:03:56,758 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:03:56" (2/3) ... [2025-02-08 01:03:56,758 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d8ab8a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:03:56, skipping insertion in model container [2025-02-08 01:03:56,758 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:03:56" (3/3) ... [2025-02-08 01:03:56,759 INFO L128 eAbstractionObserver]: Analyzing ICFG safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2025-02-08 01:03:56,770 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 01:03:56,772 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i that has 4 procedures, 40 locations, 1 initial locations, 0 loop locations, and 2 error locations. [2025-02-08 01:03:56,773 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 01:03:56,819 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 01:03:56,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 40 transitions, 92 flow [2025-02-08 01:03:56,870 INFO L124 PetriNetUnfolderBase]: 1/37 cut-off events. [2025-02-08 01:03:56,871 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 01:03:56,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 37 events. 1/37 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 73 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 39. Up to 2 conditions per place. [2025-02-08 01:03:56,875 INFO L82 GeneralOperation]: Start removeDead. Operand has 49 places, 40 transitions, 92 flow [2025-02-08 01:03:56,878 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 37 transitions, 83 flow [2025-02-08 01:03:56,887 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 01:03:56,897 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;@63fc9129, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 01:03:56,897 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-02-08 01:03:56,904 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 01:03:56,904 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2025-02-08 01:03:56,905 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 01:03:56,905 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:03:56,905 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 01:03:56,905 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-08 01:03:56,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:03:56,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1687869519, now seen corresponding path program 1 times [2025-02-08 01:03:56,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:03:56,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497643183] [2025-02-08 01:03:56,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:03:56,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:03:56,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 01:03:57,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 01:03:57,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:03:57,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:03:57,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:03:57,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:03:57,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497643183] [2025-02-08 01:03:57,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497643183] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:03:57,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:03:57,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 01:03:57,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009933551] [2025-02-08 01:03:57,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:03:57,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 01:03:57,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:03:57,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 01:03:57,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 01:03:57,297 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2025-02-08 01:03:57,299 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 37 transitions, 83 flow. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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-02-08 01:03:57,299 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:03:57,299 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2025-02-08 01:03:57,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:03:58,209 INFO L124 PetriNetUnfolderBase]: 4991/7239 cut-off events. [2025-02-08 01:03:58,210 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2025-02-08 01:03:58,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14450 conditions, 7239 events. 4991/7239 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 284. Compared 40022 event pairs, 551 based on Foata normal form. 252/7447 useless extension candidates. Maximal degree in co-relation 14439. Up to 6191 conditions per place. [2025-02-08 01:03:58,257 INFO L140 encePairwiseOnDemand]: 36/40 looper letters, 45 selfloop transitions, 2 changer transitions 2/55 dead transitions. [2025-02-08 01:03:58,257 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 55 transitions, 220 flow [2025-02-08 01:03:58,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 01:03:58,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 01:03:58,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 79 transitions. [2025-02-08 01:03:58,269 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6583333333333333 [2025-02-08 01:03:58,270 INFO L175 Difference]: Start difference. First operand has 46 places, 37 transitions, 83 flow. Second operand 3 states and 79 transitions. [2025-02-08 01:03:58,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 55 transitions, 220 flow [2025-02-08 01:03:58,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 55 transitions, 216 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 01:03:58,278 INFO L231 Difference]: Finished difference. Result has 44 places, 34 transitions, 78 flow [2025-02-08 01:03:58,280 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=44, PETRI_TRANSITIONS=34} [2025-02-08 01:03:58,283 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, -2 predicate places. [2025-02-08 01:03:58,285 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 78 flow [2025-02-08 01:03:58,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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-02-08 01:03:58,285 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:03:58,285 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:03:58,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 01:03:58,286 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-08 01:03:58,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:03:58,287 INFO L85 PathProgramCache]: Analyzing trace with hash 743258046, now seen corresponding path program 1 times [2025-02-08 01:03:58,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:03:58,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055236318] [2025-02-08 01:03:58,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:03:58,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:03:58,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 01:03:58,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 01:03:58,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:03:58,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:03:58,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:03:58,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:03:58,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055236318] [2025-02-08 01:03:58,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055236318] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:03:58,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:03:58,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 01:03:58,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130919476] [2025-02-08 01:03:58,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:03:58,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 01:03:58,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:03:58,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 01:03:58,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 01:03:58,605 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-02-08 01:03:58,606 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 78 flow. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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-02-08 01:03:58,606 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:03:58,606 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-02-08 01:03:58,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:04:00,541 INFO L124 PetriNetUnfolderBase]: 12675/18376 cut-off events. [2025-02-08 01:04:00,542 INFO L125 PetriNetUnfolderBase]: For 854/854 co-relation queries the response was YES. [2025-02-08 01:04:00,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37532 conditions, 18376 events. 12675/18376 cut-off events. For 854/854 co-relation queries the response was YES. Maximal size of possible extension queue 676. Compared 111728 event pairs, 2879 based on Foata normal form. 0/17955 useless extension candidates. Maximal degree in co-relation 37522. Up to 6462 conditions per place. [2025-02-08 01:04:00,615 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 48 selfloop transitions, 6 changer transitions 99/157 dead transitions. [2025-02-08 01:04:00,615 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 157 transitions, 648 flow [2025-02-08 01:04:00,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 01:04:00,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-08 01:04:00,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 218 transitions. [2025-02-08 01:04:00,619 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6055555555555555 [2025-02-08 01:04:00,620 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 78 flow. Second operand 9 states and 218 transitions. [2025-02-08 01:04:00,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 157 transitions, 648 flow [2025-02-08 01:04:00,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 157 transitions, 630 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 01:04:00,625 INFO L231 Difference]: Finished difference. Result has 57 places, 37 transitions, 146 flow [2025-02-08 01:04:00,626 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=146, PETRI_PLACES=57, PETRI_TRANSITIONS=37} [2025-02-08 01:04:00,626 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 11 predicate places. [2025-02-08 01:04:00,626 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 37 transitions, 146 flow [2025-02-08 01:04:00,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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-02-08 01:04:00,627 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:04:00,627 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:04:00,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 01:04:00,627 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-08 01:04:00,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:04:00,629 INFO L85 PathProgramCache]: Analyzing trace with hash -84082987, now seen corresponding path program 1 times [2025-02-08 01:04:00,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:04:00,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995425872] [2025-02-08 01:04:00,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:04:00,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:04:00,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-08 01:04:00,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 01:04:00,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:04:00,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:04:00,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:04:00,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:04:00,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995425872] [2025-02-08 01:04:00,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995425872] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:04:00,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:04:00,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 01:04:00,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912564081] [2025-02-08 01:04:00,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:04:00,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 01:04:00,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:04:00,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 01:04:00,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 01:04:00,828 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-02-08 01:04:00,828 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 37 transitions, 146 flow. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 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-02-08 01:04:00,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:04:00,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-02-08 01:04:00,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:04:01,918 INFO L124 PetriNetUnfolderBase]: 8649/12695 cut-off events. [2025-02-08 01:04:01,919 INFO L125 PetriNetUnfolderBase]: For 14305/14313 co-relation queries the response was YES. [2025-02-08 01:04:01,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33987 conditions, 12695 events. 8649/12695 cut-off events. For 14305/14313 co-relation queries the response was YES. Maximal size of possible extension queue 422. Compared 72197 event pairs, 2057 based on Foata normal form. 372/13063 useless extension candidates. Maximal degree in co-relation 33969. Up to 3889 conditions per place. [2025-02-08 01:04:01,962 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 56 selfloop transitions, 6 changer transitions 89/155 dead transitions. [2025-02-08 01:04:01,962 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 155 transitions, 862 flow [2025-02-08 01:04:01,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 01:04:01,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-08 01:04:01,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 212 transitions. [2025-02-08 01:04:01,964 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.53 [2025-02-08 01:04:01,964 INFO L175 Difference]: Start difference. First operand has 57 places, 37 transitions, 146 flow. Second operand 10 states and 212 transitions. [2025-02-08 01:04:01,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 155 transitions, 862 flow [2025-02-08 01:04:02,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 155 transitions, 788 flow, removed 16 selfloop flow, removed 4 redundant places. [2025-02-08 01:04:02,010 INFO L231 Difference]: Finished difference. Result has 64 places, 39 transitions, 180 flow [2025-02-08 01:04:02,011 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=180, PETRI_PLACES=64, PETRI_TRANSITIONS=39} [2025-02-08 01:04:02,011 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 18 predicate places. [2025-02-08 01:04:02,012 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 39 transitions, 180 flow [2025-02-08 01:04:02,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 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-02-08 01:04:02,012 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:04:02,012 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:04:02,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 01:04:02,012 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-08 01:04:02,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:04:02,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1958634936, now seen corresponding path program 1 times [2025-02-08 01:04:02,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:04:02,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914574965] [2025-02-08 01:04:02,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:04:02,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:04:02,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 01:04:02,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 01:04:02,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:04:02,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:04:02,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:04:02,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:04:02,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914574965] [2025-02-08 01:04:02,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914574965] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:04:02,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:04:02,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 01:04:02,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025979376] [2025-02-08 01:04:02,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:04:02,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 01:04:02,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:04:02,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 01:04:02,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 01:04:02,186 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-02-08 01:04:02,187 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 39 transitions, 180 flow. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 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-02-08 01:04:02,187 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:04:02,187 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-02-08 01:04:02,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:04:03,447 INFO L124 PetriNetUnfolderBase]: 11530/16845 cut-off events. [2025-02-08 01:04:03,448 INFO L125 PetriNetUnfolderBase]: For 22561/22567 co-relation queries the response was YES. [2025-02-08 01:04:03,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45525 conditions, 16845 events. 11530/16845 cut-off events. For 22561/22567 co-relation queries the response was YES. Maximal size of possible extension queue 606. Compared 100160 event pairs, 2555 based on Foata normal form. 240/17085 useless extension candidates. Maximal degree in co-relation 45500. Up to 7188 conditions per place. [2025-02-08 01:04:03,510 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 63 selfloop transitions, 10 changer transitions 49/126 dead transitions. [2025-02-08 01:04:03,510 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 126 transitions, 754 flow [2025-02-08 01:04:03,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 01:04:03,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 01:04:03,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 162 transitions. [2025-02-08 01:04:03,511 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5785714285714286 [2025-02-08 01:04:03,511 INFO L175 Difference]: Start difference. First operand has 64 places, 39 transitions, 180 flow. Second operand 7 states and 162 transitions. [2025-02-08 01:04:03,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 126 transitions, 754 flow [2025-02-08 01:04:03,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 126 transitions, 708 flow, removed 20 selfloop flow, removed 5 redundant places. [2025-02-08 01:04:03,639 INFO L231 Difference]: Finished difference. Result has 63 places, 42 transitions, 218 flow [2025-02-08 01:04:03,640 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=218, PETRI_PLACES=63, PETRI_TRANSITIONS=42} [2025-02-08 01:04:03,640 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 17 predicate places. [2025-02-08 01:04:03,641 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 42 transitions, 218 flow [2025-02-08 01:04:03,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 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-02-08 01:04:03,641 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:04:03,641 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-02-08 01:04:03,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 01:04:03,641 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-08 01:04:03,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:04:03,642 INFO L85 PathProgramCache]: Analyzing trace with hash -246762201, now seen corresponding path program 1 times [2025-02-08 01:04:03,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:04:03,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033885436] [2025-02-08 01:04:03,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:04:03,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:04:03,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-08 01:04:03,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-08 01:04:03,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:04:03,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:04:03,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:04:03,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:04:03,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033885436] [2025-02-08 01:04:03,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033885436] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:04:03,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:04:03,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 01:04:03,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762076163] [2025-02-08 01:04:03,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:04:03,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 01:04:03,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:04:03,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 01:04:03,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 01:04:03,854 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-02-08 01:04:03,854 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 42 transitions, 218 flow. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 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-02-08 01:04:03,854 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:04:03,854 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-02-08 01:04:03,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:04:05,352 INFO L124 PetriNetUnfolderBase]: 11271/16646 cut-off events. [2025-02-08 01:04:05,353 INFO L125 PetriNetUnfolderBase]: For 13572/13578 co-relation queries the response was YES. [2025-02-08 01:04:05,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42133 conditions, 16646 events. 11271/16646 cut-off events. For 13572/13578 co-relation queries the response was YES. Maximal size of possible extension queue 581. Compared 99558 event pairs, 3387 based on Foata normal form. 224/16870 useless extension candidates. Maximal degree in co-relation 42107. Up to 4395 conditions per place. [2025-02-08 01:04:05,433 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 52 selfloop transitions, 4 changer transitions 81/141 dead transitions. [2025-02-08 01:04:05,433 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 141 transitions, 777 flow [2025-02-08 01:04:05,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 01:04:05,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-08 01:04:05,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 196 transitions. [2025-02-08 01:04:05,434 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5444444444444444 [2025-02-08 01:04:05,434 INFO L175 Difference]: Start difference. First operand has 63 places, 42 transitions, 218 flow. Second operand 9 states and 196 transitions. [2025-02-08 01:04:05,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 141 transitions, 777 flow [2025-02-08 01:04:05,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 141 transitions, 719 flow, removed 27 selfloop flow, removed 7 redundant places. [2025-02-08 01:04:05,487 INFO L231 Difference]: Finished difference. Result has 69 places, 38 transitions, 175 flow [2025-02-08 01:04:05,487 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=175, PETRI_PLACES=69, PETRI_TRANSITIONS=38} [2025-02-08 01:04:05,487 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 23 predicate places. [2025-02-08 01:04:05,487 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 38 transitions, 175 flow [2025-02-08 01:04:05,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 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-02-08 01:04:05,488 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:04:05,488 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:04:05,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 01:04:05,488 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-08 01:04:05,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:04:05,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1481017152, now seen corresponding path program 1 times [2025-02-08 01:04:05,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:04:05,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038350817] [2025-02-08 01:04:05,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:04:05,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:04:05,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-08 01:04:05,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 01:04:05,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:04:05,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:04:05,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:04:05,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:04:05,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038350817] [2025-02-08 01:04:05,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038350817] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:04:05,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:04:05,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 01:04:05,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318622845] [2025-02-08 01:04:05,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:04:05,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 01:04:05,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:04:05,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 01:04:05,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 01:04:05,592 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2025-02-08 01:04:05,592 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 38 transitions, 175 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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-02-08 01:04:05,592 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:04:05,592 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2025-02-08 01:04:05,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:04:05,998 INFO L124 PetriNetUnfolderBase]: 4359/6891 cut-off events. [2025-02-08 01:04:05,998 INFO L125 PetriNetUnfolderBase]: For 6473/6474 co-relation queries the response was YES. [2025-02-08 01:04:06,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17354 conditions, 6891 events. 4359/6891 cut-off events. For 6473/6474 co-relation queries the response was YES. Maximal size of possible extension queue 257. Compared 40138 event pairs, 687 based on Foata normal form. 354/7242 useless extension candidates. Maximal degree in co-relation 17327. Up to 3475 conditions per place. [2025-02-08 01:04:06,027 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 58 selfloop transitions, 5 changer transitions 11/79 dead transitions. [2025-02-08 01:04:06,027 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 79 transitions, 517 flow [2025-02-08 01:04:06,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 01:04:06,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 01:04:06,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 101 transitions. [2025-02-08 01:04:06,028 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.63125 [2025-02-08 01:04:06,028 INFO L175 Difference]: Start difference. First operand has 69 places, 38 transitions, 175 flow. Second operand 4 states and 101 transitions. [2025-02-08 01:04:06,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 79 transitions, 517 flow [2025-02-08 01:04:06,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 79 transitions, 438 flow, removed 12 selfloop flow, removed 13 redundant places. [2025-02-08 01:04:06,045 INFO L231 Difference]: Finished difference. Result has 55 places, 41 transitions, 170 flow [2025-02-08 01:04:06,045 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=170, PETRI_PLACES=55, PETRI_TRANSITIONS=41} [2025-02-08 01:04:06,046 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 9 predicate places. [2025-02-08 01:04:06,046 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 41 transitions, 170 flow [2025-02-08 01:04:06,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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-02-08 01:04:06,046 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:04:06,046 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:04:06,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 01:04:06,047 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-08 01:04:06,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:04:06,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1609768689, now seen corresponding path program 1 times [2025-02-08 01:04:06,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:04:06,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256899183] [2025-02-08 01:04:06,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:04:06,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:04:06,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 01:04:06,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 01:04:06,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:04:06,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:04:06,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:04:06,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:04:06,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256899183] [2025-02-08 01:04:06,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256899183] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:04:06,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:04:06,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 01:04:06,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790861972] [2025-02-08 01:04:06,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:04:06,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 01:04:06,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:04:06,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 01:04:06,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 01:04:06,267 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2025-02-08 01:04:06,267 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 41 transitions, 170 flow. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 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-02-08 01:04:06,267 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:04:06,267 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2025-02-08 01:04:06,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:04:06,580 INFO L124 PetriNetUnfolderBase]: 2879/4629 cut-off events. [2025-02-08 01:04:06,581 INFO L125 PetriNetUnfolderBase]: For 2894/2895 co-relation queries the response was YES. [2025-02-08 01:04:06,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12178 conditions, 4629 events. 2879/4629 cut-off events. For 2894/2895 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 24887 event pairs, 387 based on Foata normal form. 272/4898 useless extension candidates. Maximal degree in co-relation 12159. Up to 1501 conditions per place. [2025-02-08 01:04:06,597 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 67 selfloop transitions, 8 changer transitions 13/93 dead transitions. [2025-02-08 01:04:06,597 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 93 transitions, 551 flow [2025-02-08 01:04:06,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 01:04:06,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 01:04:06,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 125 transitions. [2025-02-08 01:04:06,599 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.625 [2025-02-08 01:04:06,599 INFO L175 Difference]: Start difference. First operand has 55 places, 41 transitions, 170 flow. Second operand 5 states and 125 transitions. [2025-02-08 01:04:06,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 93 transitions, 551 flow [2025-02-08 01:04:06,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 93 transitions, 541 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-02-08 01:04:06,604 INFO L231 Difference]: Finished difference. Result has 59 places, 44 transitions, 210 flow [2025-02-08 01:04:06,604 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=210, PETRI_PLACES=59, PETRI_TRANSITIONS=44} [2025-02-08 01:04:06,606 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 13 predicate places. [2025-02-08 01:04:06,606 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 44 transitions, 210 flow [2025-02-08 01:04:06,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 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-02-08 01:04:06,606 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:04:06,606 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:04:06,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 01:04:06,607 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-08 01:04:06,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:04:06,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1600593444, now seen corresponding path program 1 times [2025-02-08 01:04:06,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:04:06,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255069688] [2025-02-08 01:04:06,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:04:06,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:04:06,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 01:04:06,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 01:04:06,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:04:06,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:04:06,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:04:06,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:04:06,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255069688] [2025-02-08 01:04:06,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255069688] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:04:06,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:04:06,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 01:04:06,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631882211] [2025-02-08 01:04:06,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:04:06,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 01:04:06,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:04:06,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 01:04:06,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-08 01:04:06,863 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2025-02-08 01:04:06,864 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 44 transitions, 210 flow. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 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-02-08 01:04:06,864 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:04:06,864 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2025-02-08 01:04:06,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:04:07,160 INFO L124 PetriNetUnfolderBase]: 1793/2871 cut-off events. [2025-02-08 01:04:07,161 INFO L125 PetriNetUnfolderBase]: For 3270/3271 co-relation queries the response was YES. [2025-02-08 01:04:07,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8218 conditions, 2871 events. 1793/2871 cut-off events. For 3270/3271 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 13855 event pairs, 327 based on Foata normal form. 124/2992 useless extension candidates. Maximal degree in co-relation 8197. Up to 916 conditions per place. [2025-02-08 01:04:07,170 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 58 selfloop transitions, 11 changer transitions 11/85 dead transitions. [2025-02-08 01:04:07,170 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 85 transitions, 519 flow [2025-02-08 01:04:07,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 01:04:07,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 01:04:07,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 127 transitions. [2025-02-08 01:04:07,172 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5291666666666667 [2025-02-08 01:04:07,172 INFO L175 Difference]: Start difference. First operand has 59 places, 44 transitions, 210 flow. Second operand 6 states and 127 transitions. [2025-02-08 01:04:07,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 85 transitions, 519 flow [2025-02-08 01:04:07,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 85 transitions, 472 flow, removed 13 selfloop flow, removed 7 redundant places. [2025-02-08 01:04:07,181 INFO L231 Difference]: Finished difference. Result has 59 places, 44 transitions, 212 flow [2025-02-08 01:04:07,182 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=212, PETRI_PLACES=59, PETRI_TRANSITIONS=44} [2025-02-08 01:04:07,183 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 13 predicate places. [2025-02-08 01:04:07,183 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 44 transitions, 212 flow [2025-02-08 01:04:07,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 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-02-08 01:04:07,184 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:04:07,184 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:04:07,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 01:04:07,184 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-08 01:04:07,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:04:07,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1720039234, now seen corresponding path program 1 times [2025-02-08 01:04:07,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:04:07,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456724902] [2025-02-08 01:04:07,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:04:07,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:04:07,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 01:04:07,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 01:04:07,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:04:07,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:04:07,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:04:07,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:04:07,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456724902] [2025-02-08 01:04:07,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456724902] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:04:07,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:04:07,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 01:04:07,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229692835] [2025-02-08 01:04:07,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:04:07,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 01:04:07,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:04:07,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 01:04:07,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 01:04:07,501 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-02-08 01:04:07,501 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 44 transitions, 212 flow. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 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-02-08 01:04:07,501 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:04:07,501 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-02-08 01:04:07,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:04:07,846 INFO L124 PetriNetUnfolderBase]: 1593/2524 cut-off events. [2025-02-08 01:04:07,846 INFO L125 PetriNetUnfolderBase]: For 2872/2873 co-relation queries the response was YES. [2025-02-08 01:04:07,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7217 conditions, 2524 events. 1593/2524 cut-off events. For 2872/2873 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 11711 event pairs, 525 based on Foata normal form. 9/2533 useless extension candidates. Maximal degree in co-relation 7198. Up to 1566 conditions per place. [2025-02-08 01:04:07,853 INFO L140 encePairwiseOnDemand]: 33/40 looper letters, 44 selfloop transitions, 3 changer transitions 33/84 dead transitions. [2025-02-08 01:04:07,853 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 84 transitions, 538 flow [2025-02-08 01:04:07,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 01:04:07,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 01:04:07,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 110 transitions. [2025-02-08 01:04:07,854 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2025-02-08 01:04:07,854 INFO L175 Difference]: Start difference. First operand has 59 places, 44 transitions, 212 flow. Second operand 6 states and 110 transitions. [2025-02-08 01:04:07,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 84 transitions, 538 flow [2025-02-08 01:04:07,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 84 transitions, 425 flow, removed 20 selfloop flow, removed 8 redundant places. [2025-02-08 01:04:07,860 INFO L231 Difference]: Finished difference. Result has 59 places, 39 transitions, 140 flow [2025-02-08 01:04:07,860 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=140, PETRI_PLACES=59, PETRI_TRANSITIONS=39} [2025-02-08 01:04:07,860 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 13 predicate places. [2025-02-08 01:04:07,860 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 39 transitions, 140 flow [2025-02-08 01:04:07,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 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-02-08 01:04:07,860 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:04:07,863 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:04:07,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 01:04:07,864 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-08 01:04:07,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:04:07,864 INFO L85 PathProgramCache]: Analyzing trace with hash -60030616, now seen corresponding path program 2 times [2025-02-08 01:04:07,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:04:07,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206861751] [2025-02-08 01:04:07,864 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:04:07,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:04:07,871 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 1 equivalence classes. [2025-02-08 01:04:07,881 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 01:04:07,881 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 01:04:07,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:04:08,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:04:08,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:04:08,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206861751] [2025-02-08 01:04:08,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206861751] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:04:08,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:04:08,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 01:04:08,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820050587] [2025-02-08 01:04:08,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:04:08,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 01:04:08,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:04:08,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 01:04:08,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-08 01:04:08,416 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-02-08 01:04:08,416 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 39 transitions, 140 flow. Second operand has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 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-02-08 01:04:08,416 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:04:08,416 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-02-08 01:04:08,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:04:08,793 INFO L124 PetriNetUnfolderBase]: 741/1195 cut-off events. [2025-02-08 01:04:08,793 INFO L125 PetriNetUnfolderBase]: For 496/496 co-relation queries the response was YES. [2025-02-08 01:04:08,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2893 conditions, 1195 events. 741/1195 cut-off events. For 496/496 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 4739 event pairs, 108 based on Foata normal form. 8/1203 useless extension candidates. Maximal degree in co-relation 2875. Up to 580 conditions per place. [2025-02-08 01:04:08,796 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 46 selfloop transitions, 4 changer transitions 36/90 dead transitions. [2025-02-08 01:04:08,796 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 90 transitions, 469 flow [2025-02-08 01:04:08,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 01:04:08,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-08 01:04:08,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 136 transitions. [2025-02-08 01:04:08,797 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.37777777777777777 [2025-02-08 01:04:08,797 INFO L175 Difference]: Start difference. First operand has 59 places, 39 transitions, 140 flow. Second operand 9 states and 136 transitions. [2025-02-08 01:04:08,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 90 transitions, 469 flow [2025-02-08 01:04:08,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 90 transitions, 418 flow, removed 15 selfloop flow, removed 10 redundant places. [2025-02-08 01:04:08,799 INFO L231 Difference]: Finished difference. Result has 59 places, 39 transitions, 127 flow [2025-02-08 01:04:08,799 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=127, PETRI_PLACES=59, PETRI_TRANSITIONS=39} [2025-02-08 01:04:08,799 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 13 predicate places. [2025-02-08 01:04:08,799 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 39 transitions, 127 flow [2025-02-08 01:04:08,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 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-02-08 01:04:08,799 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:04:08,799 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:04:08,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 01:04:08,800 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-08 01:04:08,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:04:08,800 INFO L85 PathProgramCache]: Analyzing trace with hash 125760040, now seen corresponding path program 3 times [2025-02-08 01:04:08,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:04:08,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993131985] [2025-02-08 01:04:08,800 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 01:04:08,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:04:08,808 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 1 equivalence classes. [2025-02-08 01:04:08,832 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 01:04:08,832 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 01:04:08,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 01:04:08,833 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 01:04:08,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 01:04:08,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 01:04:08,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:04:08,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 01:04:08,886 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 01:04:08,886 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 01:04:08,886 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2025-02-08 01:04:08,887 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2025-02-08 01:04:08,888 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2025-02-08 01:04:08,888 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2025-02-08 01:04:08,888 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2025-02-08 01:04:08,888 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-02-08 01:04:08,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 01:04:08,888 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:04:08,963 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 01:04:08,963 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 01:04:08,966 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 01:04:08 BasicIcfg [2025-02-08 01:04:08,970 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 01:04:08,971 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 01:04:08,971 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 01:04:08,971 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 01:04:08,972 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:03:56" (3/4) ... [2025-02-08 01:04:08,972 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-02-08 01:04:09,051 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 9. [2025-02-08 01:04:09,091 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 01:04:09,091 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 01:04:09,091 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 01:04:09,093 INFO L158 Benchmark]: Toolchain (without parser) took 13526.26ms. Allocated memory was 142.6MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 104.4MB in the beginning and 1.2GB in the end (delta: -1.0GB). Peak memory consumption was 486.2MB. Max. memory is 16.1GB. [2025-02-08 01:04:09,093 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 115.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 01:04:09,093 INFO L158 Benchmark]: CACSL2BoogieTranslator took 464.62ms. Allocated memory is still 142.6MB. Free memory was 104.4MB in the beginning and 81.1MB in the end (delta: 23.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-08 01:04:09,093 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.81ms. Allocated memory is still 142.6MB. Free memory was 81.1MB in the beginning and 79.2MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 01:04:09,093 INFO L158 Benchmark]: Boogie Preprocessor took 38.55ms. Allocated memory is still 142.6MB. Free memory was 79.2MB in the beginning and 76.5MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 01:04:09,093 INFO L158 Benchmark]: IcfgBuilder took 642.91ms. Allocated memory is still 142.6MB. Free memory was 76.5MB in the beginning and 93.6MB in the end (delta: -17.1MB). Peak memory consumption was 47.9MB. Max. memory is 16.1GB. [2025-02-08 01:04:09,093 INFO L158 Benchmark]: TraceAbstraction took 12217.21ms. Allocated memory was 142.6MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 92.9MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 463.4MB. Max. memory is 16.1GB. [2025-02-08 01:04:09,093 INFO L158 Benchmark]: Witness Printer took 119.91ms. Allocated memory is still 1.7GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 01:04:09,095 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.13ms. Allocated memory is still 201.3MB. Free memory is still 115.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 464.62ms. Allocated memory is still 142.6MB. Free memory was 104.4MB in the beginning and 81.1MB in the end (delta: 23.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.81ms. Allocated memory is still 142.6MB. Free memory was 81.1MB in the beginning and 79.2MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 38.55ms. Allocated memory is still 142.6MB. Free memory was 79.2MB in the beginning and 76.5MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 642.91ms. Allocated memory is still 142.6MB. Free memory was 76.5MB in the beginning and 93.6MB in the end (delta: -17.1MB). Peak memory consumption was 47.9MB. Max. memory is 16.1GB. * TraceAbstraction took 12217.21ms. Allocated memory was 142.6MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 92.9MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 463.4MB. Max. memory is 16.1GB. * Witness Printer took 119.91ms. Allocated memory is still 1.7GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L721] 0 _Bool x$flush_delayed; [L722] 0 int x$mem_tmp; [L723] 0 _Bool x$r_buff0_thd0; [L724] 0 _Bool x$r_buff0_thd1; [L725] 0 _Bool x$r_buff0_thd2; [L726] 0 _Bool x$r_buff0_thd3; [L727] 0 _Bool x$r_buff1_thd0; [L728] 0 _Bool x$r_buff1_thd1; [L729] 0 _Bool x$r_buff1_thd2; [L730] 0 _Bool x$r_buff1_thd3; [L731] 0 _Bool x$read_delayed; [L732] 0 int *x$read_delayed_var; [L733] 0 int x$w_buff0; [L734] 0 _Bool x$w_buff0_used; [L735] 0 int x$w_buff1; [L736] 0 _Bool x$w_buff1_used; [L738] 0 int y = 0; [L739] 0 _Bool weak$$choice0; [L740] 0 _Bool weak$$choice2; [L831] 0 pthread_t t1897; [L832] FCALL, FORK 0 pthread_create(&t1897, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1897=-3, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L833] 0 pthread_t t1898; [L834] FCALL, FORK 0 pthread_create(&t1898, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1897=-3, t1898=-2, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L835] 0 pthread_t t1899; [L836] FCALL, FORK 0 pthread_create(&t1899, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1897=-3, t1898=-2, t1899=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 1 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L783] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L786] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L803] 3 __unbuffered_p2_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L806] 3 __unbuffered_p2_EBX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L744] 1 y = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L809] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L810] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L811] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L812] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L813] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L749] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L750] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L751] 1 x$flush_delayed = weak$$choice2 [L752] 1 x$mem_tmp = x [L753] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L754] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L755] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L756] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L757] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L759] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 1 __unbuffered_p0_EAX = x [L761] 1 x = x$flush_delayed ? x$mem_tmp : x [L762] 1 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L789] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L790] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L791] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L792] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L793] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L796] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L816] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L838] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1897=-3, t1898=-2, t1899=-1, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L840] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L840] RET 0 assume_abort_if_not(main$tmp_guard0) [L842] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L843] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L844] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L845] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L846] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1897=-3, t1898=-2, t1899=-1, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L849] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1897=-3, t1898=-2, t1899=-1, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L851] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L19] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 832]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 836]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 834]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 66 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 12.0s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 9.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 756 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 752 mSDsluCounter, 58 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 49 mSDsCounter, 45 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1839 IncrementalHoareTripleChecker+Invalid, 1884 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 45 mSolverCounterUnsat, 9 mSDtfsCounter, 1839 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 78 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=218occurred in iteration=4, InterpolantAutomatonStates: 68, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 238 NumberOfCodeBlocks, 238 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 198 ConstructedInterpolants, 0 QuantifiedInterpolants, 1041 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-02-08 01:04:09,116 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE