./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 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/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-?-551b009-m [2025-01-09 16:29:40,175 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:29:40,223 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 16:29:40,229 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:29:40,232 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:29:40,252 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:29:40,252 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:29:40,252 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:29:40,253 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:29:40,253 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:29:40,253 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:29:40,253 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:29:40,253 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:29:40,253 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:29:40,253 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:29:40,253 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:29:40,253 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:29:40,253 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:29:40,253 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 16:29:40,253 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:29:40,254 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:29:40,254 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:29:40,254 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:29:40,254 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:29:40,254 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:29:40,254 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:29:40,254 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:29:40,254 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:29:40,254 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:29:40,254 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:29:40,254 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:29:40,254 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:29:40,254 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:29:40,254 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:29:40,254 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:29:40,254 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:29:40,254 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:29:40,254 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:29:40,254 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:29:40,255 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:29:40,255 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:29:40,255 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:29:40,255 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 16:29:40,255 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 16:29:40,255 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:29:40,255 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:29:40,255 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:29:40,255 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:29:40,255 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-01-09 16:29:40,468 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:29:40,474 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:29:40,476 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:29:40,477 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:29:40,477 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:29:40,480 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-01-09 16:29:41,575 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/df7a9653b/eda26dc4853f4f409d6c68c4f41f813d/FLAG8c945507f [2025-01-09 16:29:41,855 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:29:41,855 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-01-09 16:29:41,870 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/df7a9653b/eda26dc4853f4f409d6c68c4f41f813d/FLAG8c945507f [2025-01-09 16:29:41,886 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/df7a9653b/eda26dc4853f4f409d6c68c4f41f813d [2025-01-09 16:29:41,888 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:29:41,890 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:29:41,891 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:29:41,891 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:29:41,894 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:29:41,895 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:29:41" (1/1) ... [2025-01-09 16:29:41,895 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33ff858a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:29:41, skipping insertion in model container [2025-01-09 16:29:41,895 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:29:41" (1/1) ... [2025-01-09 16:29:41,926 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:29:42,032 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-01-09 16:29:42,137 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:29:42,145 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:29:42,152 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-01-09 16:29:42,208 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:29:42,234 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:29:42,235 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:29:42 WrapperNode [2025-01-09 16:29:42,235 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:29:42,236 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:29:42,236 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:29:42,236 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:29:42,240 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:29:42" (1/1) ... [2025-01-09 16:29:42,252 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:29:42" (1/1) ... [2025-01-09 16:29:42,273 INFO L138 Inliner]: procedures = 175, calls = 44, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 115 [2025-01-09 16:29:42,273 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:29:42,274 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:29:42,274 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:29:42,274 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:29:42,281 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:29:42" (1/1) ... [2025-01-09 16:29:42,281 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:29:42" (1/1) ... [2025-01-09 16:29:42,283 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:29:42" (1/1) ... [2025-01-09 16:29:42,295 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-01-09 16:29:42,295 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:29:42" (1/1) ... [2025-01-09 16:29:42,296 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:29:42" (1/1) ... [2025-01-09 16:29:42,301 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:29:42" (1/1) ... [2025-01-09 16:29:42,302 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:29:42" (1/1) ... [2025-01-09 16:29:42,306 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:29:42" (1/1) ... [2025-01-09 16:29:42,307 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:29:42" (1/1) ... [2025-01-09 16:29:42,308 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:29:42" (1/1) ... [2025-01-09 16:29:42,309 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:29:42,314 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:29:42,314 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:29:42,314 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:29:42,315 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:29:42" (1/1) ... [2025-01-09 16:29:42,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:29:42,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:29:42,343 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 16:29:42,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 16:29:42,364 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-09 16:29:42,364 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:29:42,364 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-01-09 16:29:42,364 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-01-09 16:29:42,364 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-01-09 16:29:42,365 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-01-09 16:29:42,365 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-01-09 16:29:42,365 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-01-09 16:29:42,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 16:29:42,365 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-09 16:29:42,365 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:29:42,365 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:29:42,366 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 16:29:42,481 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:29:42,483 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:29:42,736 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 16:29:42,736 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:29:42,912 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:29:42,913 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 16:29:42,913 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:29:42 BoogieIcfgContainer [2025-01-09 16:29:42,913 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:29:42,915 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:29:42,915 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:29:42,919 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:29:42,919 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:29:41" (1/3) ... [2025-01-09 16:29:42,919 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fa650d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:29:42, skipping insertion in model container [2025-01-09 16:29:42,919 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:29:42" (2/3) ... [2025-01-09 16:29:42,920 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fa650d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:29:42, skipping insertion in model container [2025-01-09 16:29:42,920 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:29:42" (3/3) ... [2025-01-09 16:29:42,921 INFO L128 eAbstractionObserver]: Analyzing ICFG safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2025-01-09 16:29:42,932 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:29:42,933 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-01-09 16:29:42,934 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 16:29:42,980 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 16:29:43,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 40 transitions, 92 flow [2025-01-09 16:29:43,053 INFO L124 PetriNetUnfolderBase]: 1/37 cut-off events. [2025-01-09 16:29:43,054 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 16:29:43,056 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 5. Compared 76 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-01-09 16:29:43,056 INFO L82 GeneralOperation]: Start removeDead. Operand has 49 places, 40 transitions, 92 flow [2025-01-09 16:29:43,059 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 37 transitions, 83 flow [2025-01-09 16:29:43,064 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:29:43,073 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;@4fe2ea06, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:29:43,073 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-01-09 16:29:43,078 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:29:43,080 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2025-01-09 16:29:43,080 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 16:29:43,080 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:29:43,080 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-09 16:29:43,081 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-01-09 16:29:43,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:29:43,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1756285544, now seen corresponding path program 1 times [2025-01-09 16:29:43,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:29:43,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121928790] [2025-01-09 16:29:43,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:29:43,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:29:43,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-09 16:29:43,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-09 16:29:43,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:29:43,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:29:43,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:29:43,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:29:43,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121928790] [2025-01-09 16:29:43,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121928790] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:29:43,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:29:43,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-09 16:29:43,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361227077] [2025-01-09 16:29:43,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:29:43,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:29:43,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:29:43,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:29:43,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:29:43,449 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 40 [2025-01-09 16:29:43,451 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 37 transitions, 83 flow. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:29:43,451 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:29:43,451 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 40 [2025-01-09 16:29:43,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:29:43,709 INFO L124 PetriNetUnfolderBase]: 453/885 cut-off events. [2025-01-09 16:29:43,709 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-01-09 16:29:43,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1622 conditions, 885 events. 453/885 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 5499 event pairs, 72 based on Foata normal form. 36/896 useless extension candidates. Maximal degree in co-relation 1611. Up to 562 conditions per place. [2025-01-09 16:29:43,719 INFO L140 encePairwiseOnDemand]: 36/40 looper letters, 25 selfloop transitions, 2 changer transitions 2/46 dead transitions. [2025-01-09 16:29:43,719 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 46 transitions, 162 flow [2025-01-09 16:29:43,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:29:43,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:29:43,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 92 transitions. [2025-01-09 16:29:43,729 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7666666666666667 [2025-01-09 16:29:43,730 INFO L175 Difference]: Start difference. First operand has 46 places, 37 transitions, 83 flow. Second operand 3 states and 92 transitions. [2025-01-09 16:29:43,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 46 transitions, 162 flow [2025-01-09 16:29:43,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 46 transitions, 158 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-09 16:29:43,735 INFO L231 Difference]: Finished difference. Result has 44 places, 34 transitions, 78 flow [2025-01-09 16:29:43,737 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-01-09 16:29:43,741 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, -2 predicate places. [2025-01-09 16:29:43,742 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 78 flow [2025-01-09 16:29:43,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:29:43,742 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:29:43,743 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:29:43,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 16:29:43,743 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-01-09 16:29:43,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:29:43,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1077292502, now seen corresponding path program 1 times [2025-01-09 16:29:43,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:29:43,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647501284] [2025-01-09 16:29:43,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:29:43,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:29:43,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 16:29:43,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 16:29:43,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:29:43,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:29:43,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:29:43,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:29:43,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647501284] [2025-01-09 16:29:43,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647501284] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:29:43,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:29:43,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:29:43,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667241304] [2025-01-09 16:29:43,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:29:43,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:29:43,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:29:43,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:29:43,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:29:43,979 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 40 [2025-01-09 16:29:43,980 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 78 flow. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:29:43,980 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:29:43,980 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 40 [2025-01-09 16:29:43,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:29:44,371 INFO L124 PetriNetUnfolderBase]: 1354/2345 cut-off events. [2025-01-09 16:29:44,371 INFO L125 PetriNetUnfolderBase]: For 128/128 co-relation queries the response was YES. [2025-01-09 16:29:44,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4566 conditions, 2345 events. 1354/2345 cut-off events. For 128/128 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 15734 event pairs, 352 based on Foata normal form. 0/2251 useless extension candidates. Maximal degree in co-relation 4556. Up to 1288 conditions per place. [2025-01-09 16:29:44,383 INFO L140 encePairwiseOnDemand]: 33/40 looper letters, 30 selfloop transitions, 3 changer transitions 43/88 dead transitions. [2025-01-09 16:29:44,384 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 88 transitions, 354 flow [2025-01-09 16:29:44,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 16:29:44,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-09 16:29:44,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 198 transitions. [2025-01-09 16:29:44,385 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.61875 [2025-01-09 16:29:44,385 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 78 flow. Second operand 8 states and 198 transitions. [2025-01-09 16:29:44,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 88 transitions, 354 flow [2025-01-09 16:29:44,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 88 transitions, 338 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 16:29:44,387 INFO L231 Difference]: Finished difference. Result has 53 places, 35 transitions, 107 flow [2025-01-09 16:29:44,387 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=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=107, PETRI_PLACES=53, PETRI_TRANSITIONS=35} [2025-01-09 16:29:44,387 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 7 predicate places. [2025-01-09 16:29:44,387 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 35 transitions, 107 flow [2025-01-09 16:29:44,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:29:44,390 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:29:44,390 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:29:44,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 16:29:44,390 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-01-09 16:29:44,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:29:44,391 INFO L85 PathProgramCache]: Analyzing trace with hash 710736299, now seen corresponding path program 1 times [2025-01-09 16:29:44,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:29:44,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98134421] [2025-01-09 16:29:44,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:29:44,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:29:44,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 16:29:44,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 16:29:44,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:29:44,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:29:44,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:29:44,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:29:44,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98134421] [2025-01-09 16:29:44,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98134421] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:29:44,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:29:44,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:29:44,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489161553] [2025-01-09 16:29:44,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:29:44,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:29:44,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:29:44,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:29:44,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:29:44,558 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 40 [2025-01-09 16:29:44,559 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 35 transitions, 107 flow. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:29:44,559 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:29:44,559 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 40 [2025-01-09 16:29:44,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:29:45,127 INFO L124 PetriNetUnfolderBase]: 2661/4500 cut-off events. [2025-01-09 16:29:45,128 INFO L125 PetriNetUnfolderBase]: For 2509/2509 co-relation queries the response was YES. [2025-01-09 16:29:45,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10518 conditions, 4500 events. 2661/4500 cut-off events. For 2509/2509 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 30542 event pairs, 251 based on Foata normal form. 142/4614 useless extension candidates. Maximal degree in co-relation 10503. Up to 1490 conditions per place. [2025-01-09 16:29:45,186 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 42 selfloop transitions, 7 changer transitions 61/120 dead transitions. [2025-01-09 16:29:45,186 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 120 transitions, 605 flow [2025-01-09 16:29:45,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 16:29:45,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-09 16:29:45,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 239 transitions. [2025-01-09 16:29:45,189 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5975 [2025-01-09 16:29:45,189 INFO L175 Difference]: Start difference. First operand has 53 places, 35 transitions, 107 flow. Second operand 10 states and 239 transitions. [2025-01-09 16:29:45,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 120 transitions, 605 flow [2025-01-09 16:29:45,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 120 transitions, 574 flow, removed 13 selfloop flow, removed 3 redundant places. [2025-01-09 16:29:45,214 INFO L231 Difference]: Finished difference. Result has 62 places, 40 transitions, 190 flow [2025-01-09 16:29:45,214 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=190, PETRI_PLACES=62, PETRI_TRANSITIONS=40} [2025-01-09 16:29:45,215 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 16 predicate places. [2025-01-09 16:29:45,215 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 40 transitions, 190 flow [2025-01-09 16:29:45,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:29:45,216 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:29:45,216 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:29:45,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 16:29:45,216 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-01-09 16:29:45,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:29:45,217 INFO L85 PathProgramCache]: Analyzing trace with hash -810813780, now seen corresponding path program 1 times [2025-01-09 16:29:45,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:29:45,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945161669] [2025-01-09 16:29:45,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:29:45,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:29:45,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-09 16:29:45,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-09 16:29:45,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:29:45,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:29:45,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:29:45,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:29:45,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945161669] [2025-01-09 16:29:45,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945161669] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:29:45,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:29:45,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 16:29:45,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148206422] [2025-01-09 16:29:45,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:29:45,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:29:45,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:29:45,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:29:45,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:29:45,380 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 40 [2025-01-09 16:29:45,381 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 40 transitions, 190 flow. Second operand has 7 states, 7 states have (on average 15.0) internal successors, (105), 7 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:29:45,381 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:29:45,381 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 40 [2025-01-09 16:29:45,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:29:46,128 INFO L124 PetriNetUnfolderBase]: 3304/5769 cut-off events. [2025-01-09 16:29:46,128 INFO L125 PetriNetUnfolderBase]: For 11226/11226 co-relation queries the response was YES. [2025-01-09 16:29:46,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16628 conditions, 5769 events. 3304/5769 cut-off events. For 11226/11226 co-relation queries the response was YES. Maximal size of possible extension queue 364. Compared 42755 event pairs, 417 based on Foata normal form. 114/5830 useless extension candidates. Maximal degree in co-relation 16605. Up to 1824 conditions per place. [2025-01-09 16:29:46,147 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 47 selfloop transitions, 8 changer transitions 40/105 dead transitions. [2025-01-09 16:29:46,148 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 105 transitions, 688 flow [2025-01-09 16:29:46,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:29:46,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-09 16:29:46,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 176 transitions. [2025-01-09 16:29:46,149 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6285714285714286 [2025-01-09 16:29:46,149 INFO L175 Difference]: Start difference. First operand has 62 places, 40 transitions, 190 flow. Second operand 7 states and 176 transitions. [2025-01-09 16:29:46,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 105 transitions, 688 flow [2025-01-09 16:29:46,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 105 transitions, 665 flow, removed 10 selfloop flow, removed 3 redundant places. [2025-01-09 16:29:46,161 INFO L231 Difference]: Finished difference. Result has 62 places, 39 transitions, 193 flow [2025-01-09 16:29:46,161 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=193, PETRI_PLACES=62, PETRI_TRANSITIONS=39} [2025-01-09 16:29:46,162 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 16 predicate places. [2025-01-09 16:29:46,162 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 39 transitions, 193 flow [2025-01-09 16:29:46,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.0) internal successors, (105), 7 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:29:46,162 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:29:46,162 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] [2025-01-09 16:29:46,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 16:29:46,163 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-01-09 16:29:46,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:29:46,163 INFO L85 PathProgramCache]: Analyzing trace with hash -340918197, now seen corresponding path program 1 times [2025-01-09 16:29:46,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:29:46,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428280989] [2025-01-09 16:29:46,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:29:46,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:29:46,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 16:29:46,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 16:29:46,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:29:46,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:29:46,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:29:46,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:29:46,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428280989] [2025-01-09 16:29:46,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428280989] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:29:46,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:29:46,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 16:29:46,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645643307] [2025-01-09 16:29:46,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:29:46,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:29:46,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:29:46,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:29:46,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:29:46,337 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 40 [2025-01-09 16:29:46,337 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 39 transitions, 193 flow. Second operand has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 7 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:29:46,338 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:29:46,338 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 40 [2025-01-09 16:29:46,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:29:47,083 INFO L124 PetriNetUnfolderBase]: 3560/6433 cut-off events. [2025-01-09 16:29:47,083 INFO L125 PetriNetUnfolderBase]: For 10428/10428 co-relation queries the response was YES. [2025-01-09 16:29:47,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17606 conditions, 6433 events. 3560/6433 cut-off events. For 10428/10428 co-relation queries the response was YES. Maximal size of possible extension queue 436. Compared 50914 event pairs, 643 based on Foata normal form. 118/6488 useless extension candidates. Maximal degree in co-relation 17581. Up to 1140 conditions per place. [2025-01-09 16:29:47,106 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 57 selfloop transitions, 8 changer transitions 67/142 dead transitions. [2025-01-09 16:29:47,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 142 transitions, 919 flow [2025-01-09 16:29:47,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 16:29:47,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-09 16:29:47,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 267 transitions. [2025-01-09 16:29:47,108 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6068181818181818 [2025-01-09 16:29:47,108 INFO L175 Difference]: Start difference. First operand has 62 places, 39 transitions, 193 flow. Second operand 11 states and 267 transitions. [2025-01-09 16:29:47,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 142 transitions, 919 flow [2025-01-09 16:29:47,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 142 transitions, 831 flow, removed 22 selfloop flow, removed 6 redundant places. [2025-01-09 16:29:47,122 INFO L231 Difference]: Finished difference. Result has 73 places, 39 transitions, 209 flow [2025-01-09 16:29:47,122 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=209, PETRI_PLACES=73, PETRI_TRANSITIONS=39} [2025-01-09 16:29:47,122 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 27 predicate places. [2025-01-09 16:29:47,123 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 39 transitions, 209 flow [2025-01-09 16:29:47,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 7 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:29:47,123 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:29:47,123 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:29:47,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 16:29:47,123 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-01-09 16:29:47,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:29:47,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1218522830, now seen corresponding path program 1 times [2025-01-09 16:29:47,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:29:47,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447288884] [2025-01-09 16:29:47,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:29:47,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:29:47,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-09 16:29:47,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-09 16:29:47,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:29:47,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:29:47,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:29:47,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:29:47,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447288884] [2025-01-09 16:29:47,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447288884] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:29:47,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:29:47,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:29:47,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886909987] [2025-01-09 16:29:47,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:29:47,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:29:47,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:29:47,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:29:47,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:29:47,237 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 40 [2025-01-09 16:29:47,238 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 39 transitions, 209 flow. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:29:47,238 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:29:47,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 40 [2025-01-09 16:29:47,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:29:47,635 INFO L124 PetriNetUnfolderBase]: 1456/2698 cut-off events. [2025-01-09 16:29:47,636 INFO L125 PetriNetUnfolderBase]: For 6625/6699 co-relation queries the response was YES. [2025-01-09 16:29:47,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7569 conditions, 2698 events. 1456/2698 cut-off events. For 6625/6699 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 19251 event pairs, 452 based on Foata normal form. 102/2694 useless extension candidates. Maximal degree in co-relation 7538. Up to 1582 conditions per place. [2025-01-09 16:29:47,647 INFO L140 encePairwiseOnDemand]: 35/40 looper letters, 25 selfloop transitions, 3 changer transitions 31/74 dead transitions. [2025-01-09 16:29:47,648 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 74 transitions, 503 flow [2025-01-09 16:29:47,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:29:47,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-09 16:29:47,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 166 transitions. [2025-01-09 16:29:47,649 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5928571428571429 [2025-01-09 16:29:47,649 INFO L175 Difference]: Start difference. First operand has 73 places, 39 transitions, 209 flow. Second operand 7 states and 166 transitions. [2025-01-09 16:29:47,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 74 transitions, 503 flow [2025-01-09 16:29:47,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 74 transitions, 443 flow, removed 27 selfloop flow, removed 10 redundant places. [2025-01-09 16:29:47,658 INFO L231 Difference]: Finished difference. Result has 68 places, 38 transitions, 182 flow [2025-01-09 16:29:47,658 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=182, PETRI_PLACES=68, PETRI_TRANSITIONS=38} [2025-01-09 16:29:47,659 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 22 predicate places. [2025-01-09 16:29:47,659 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 38 transitions, 182 flow [2025-01-09 16:29:47,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:29:47,659 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:29:47,659 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-01-09 16:29:47,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 16:29:47,659 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-01-09 16:29:47,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:29:47,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1015216882, now seen corresponding path program 1 times [2025-01-09 16:29:47,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:29:47,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165785397] [2025-01-09 16:29:47,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:29:47,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:29:47,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-09 16:29:47,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 16:29:47,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:29:47,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:29:47,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:29:47,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:29:47,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165785397] [2025-01-09 16:29:47,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165785397] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:29:47,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:29:47,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:29:47,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587885377] [2025-01-09 16:29:47,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:29:47,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:29:47,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:29:47,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:29:47,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:29:47,802 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 40 [2025-01-09 16:29:47,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 38 transitions, 182 flow. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:29:47,803 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:29:47,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 40 [2025-01-09 16:29:47,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:29:48,202 INFO L124 PetriNetUnfolderBase]: 2943/4871 cut-off events. [2025-01-09 16:29:48,202 INFO L125 PetriNetUnfolderBase]: For 4403/4542 co-relation queries the response was YES. [2025-01-09 16:29:48,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11820 conditions, 4871 events. 2943/4871 cut-off events. For 4403/4542 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 32817 event pairs, 412 based on Foata normal form. 336/5093 useless extension candidates. Maximal degree in co-relation 11792. Up to 2416 conditions per place. [2025-01-09 16:29:48,215 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 40 selfloop transitions, 5 changer transitions 5/65 dead transitions. [2025-01-09 16:29:48,215 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 65 transitions, 384 flow [2025-01-09 16:29:48,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:29:48,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 16:29:48,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 110 transitions. [2025-01-09 16:29:48,217 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6875 [2025-01-09 16:29:48,217 INFO L175 Difference]: Start difference. First operand has 68 places, 38 transitions, 182 flow. Second operand 4 states and 110 transitions. [2025-01-09 16:29:48,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 65 transitions, 384 flow [2025-01-09 16:29:48,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 65 transitions, 358 flow, removed 7 selfloop flow, removed 9 redundant places. [2025-01-09 16:29:48,227 INFO L231 Difference]: Finished difference. Result has 60 places, 41 transitions, 192 flow [2025-01-09 16:29:48,227 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=55, 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=192, PETRI_PLACES=60, PETRI_TRANSITIONS=41} [2025-01-09 16:29:48,227 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 14 predicate places. [2025-01-09 16:29:48,227 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 41 transitions, 192 flow [2025-01-09 16:29:48,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:29:48,227 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:29:48,227 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-01-09 16:29:48,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 16:29:48,228 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-01-09 16:29:48,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:29:48,228 INFO L85 PathProgramCache]: Analyzing trace with hash -668981893, now seen corresponding path program 1 times [2025-01-09 16:29:48,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:29:48,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53091607] [2025-01-09 16:29:48,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:29:48,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:29:48,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 16:29:48,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 16:29:48,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:29:48,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:29:48,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:29:48,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:29:48,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53091607] [2025-01-09 16:29:48,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53091607] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:29:48,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:29:48,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:29:48,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098857348] [2025-01-09 16:29:48,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:29:48,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:29:48,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:29:48,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:29:48,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:29:48,384 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 40 [2025-01-09 16:29:48,384 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 41 transitions, 192 flow. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:29:48,384 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:29:48,384 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 40 [2025-01-09 16:29:48,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:29:48,646 INFO L124 PetriNetUnfolderBase]: 2121/3576 cut-off events. [2025-01-09 16:29:48,646 INFO L125 PetriNetUnfolderBase]: For 3053/3103 co-relation queries the response was YES. [2025-01-09 16:29:48,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9547 conditions, 3576 events. 2121/3576 cut-off events. For 3053/3103 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 22053 event pairs, 171 based on Foata normal form. 270/3771 useless extension candidates. Maximal degree in co-relation 9524. Up to 1273 conditions per place. [2025-01-09 16:29:48,657 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 49 selfloop transitions, 8 changer transitions 6/78 dead transitions. [2025-01-09 16:29:48,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 78 transitions, 476 flow [2025-01-09 16:29:48,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:29:48,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:29:48,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 137 transitions. [2025-01-09 16:29:48,658 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.685 [2025-01-09 16:29:48,658 INFO L175 Difference]: Start difference. First operand has 60 places, 41 transitions, 192 flow. Second operand 5 states and 137 transitions. [2025-01-09 16:29:48,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 78 transitions, 476 flow [2025-01-09 16:29:48,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 78 transitions, 461 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-01-09 16:29:48,662 INFO L231 Difference]: Finished difference. Result has 63 places, 44 transitions, 227 flow [2025-01-09 16:29:48,662 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=179, PETRI_DIFFERENCE_MINUEND_PLACES=57, 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=227, PETRI_PLACES=63, PETRI_TRANSITIONS=44} [2025-01-09 16:29:48,662 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 17 predicate places. [2025-01-09 16:29:48,662 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 44 transitions, 227 flow [2025-01-09 16:29:48,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:29:48,662 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:29:48,663 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-01-09 16:29:48,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 16:29:48,663 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-01-09 16:29:48,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:29:48,663 INFO L85 PathProgramCache]: Analyzing trace with hash -297732342, now seen corresponding path program 1 times [2025-01-09 16:29:48,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:29:48,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400386059] [2025-01-09 16:29:48,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:29:48,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:29:48,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 16:29:48,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 16:29:48,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:29:48,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:29:48,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:29:48,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:29:48,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400386059] [2025-01-09 16:29:48,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400386059] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:29:48,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:29:48,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:29:48,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485742565] [2025-01-09 16:29:48,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:29:48,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:29:48,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:29:48,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:29:48,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:29:48,803 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 40 [2025-01-09 16:29:48,804 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 44 transitions, 227 flow. Second operand has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 6 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:29:48,804 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:29:48,804 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 40 [2025-01-09 16:29:48,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:29:49,010 INFO L124 PetriNetUnfolderBase]: 1322/2219 cut-off events. [2025-01-09 16:29:49,010 INFO L125 PetriNetUnfolderBase]: For 3285/3309 co-relation queries the response was YES. [2025-01-09 16:29:49,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6564 conditions, 2219 events. 1322/2219 cut-off events. For 3285/3309 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 12034 event pairs, 124 based on Foata normal form. 150/2305 useless extension candidates. Maximal degree in co-relation 6540. Up to 828 conditions per place. [2025-01-09 16:29:49,016 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 42 selfloop transitions, 11 changer transitions 6/74 dead transitions. [2025-01-09 16:29:49,016 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 74 transitions, 457 flow [2025-01-09 16:29:49,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:29:49,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 16:29:49,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 151 transitions. [2025-01-09 16:29:49,017 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6291666666666667 [2025-01-09 16:29:49,017 INFO L175 Difference]: Start difference. First operand has 63 places, 44 transitions, 227 flow. Second operand 6 states and 151 transitions. [2025-01-09 16:29:49,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 74 transitions, 457 flow [2025-01-09 16:29:49,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 74 transitions, 411 flow, removed 13 selfloop flow, removed 7 redundant places. [2025-01-09 16:29:49,023 INFO L231 Difference]: Finished difference. Result has 63 places, 44 transitions, 228 flow [2025-01-09 16:29:49,024 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=56, 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=228, PETRI_PLACES=63, PETRI_TRANSITIONS=44} [2025-01-09 16:29:49,024 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 17 predicate places. [2025-01-09 16:29:49,024 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 44 transitions, 228 flow [2025-01-09 16:29:49,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 6 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:29:49,024 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:29:49,024 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-01-09 16:29:49,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 16:29:49,025 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-01-09 16:29:49,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:29:49,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1373313618, now seen corresponding path program 1 times [2025-01-09 16:29:49,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:29:49,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620174759] [2025-01-09 16:29:49,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:29:49,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:29:49,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 16:29:49,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 16:29:49,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:29:49,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:29:49,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:29:49,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:29:49,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620174759] [2025-01-09 16:29:49,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620174759] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:29:49,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:29:49,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 16:29:49,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314631517] [2025-01-09 16:29:49,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:29:49,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:29:49,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:29:49,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:29:49,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:29:49,202 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 40 [2025-01-09 16:29:49,203 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 44 transitions, 228 flow. Second operand has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:29:49,203 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:29:49,203 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 40 [2025-01-09 16:29:49,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:29:49,391 INFO L124 PetriNetUnfolderBase]: 870/1695 cut-off events. [2025-01-09 16:29:49,391 INFO L125 PetriNetUnfolderBase]: For 1857/1891 co-relation queries the response was YES. [2025-01-09 16:29:49,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4602 conditions, 1695 events. 870/1695 cut-off events. For 1857/1891 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 10165 event pairs, 305 based on Foata normal form. 8/1636 useless extension candidates. Maximal degree in co-relation 4580. Up to 632 conditions per place. [2025-01-09 16:29:49,397 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 32 selfloop transitions, 5 changer transitions 22/75 dead transitions. [2025-01-09 16:29:49,397 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 75 transitions, 432 flow [2025-01-09 16:29:49,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:29:49,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 16:29:49,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 138 transitions. [2025-01-09 16:29:49,398 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.575 [2025-01-09 16:29:49,398 INFO L175 Difference]: Start difference. First operand has 63 places, 44 transitions, 228 flow. Second operand 6 states and 138 transitions. [2025-01-09 16:29:49,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 75 transitions, 432 flow [2025-01-09 16:29:49,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 75 transitions, 360 flow, removed 18 selfloop flow, removed 8 redundant places. [2025-01-09 16:29:49,403 INFO L231 Difference]: Finished difference. Result has 63 places, 41 transitions, 168 flow [2025-01-09 16:29:49,403 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=168, PETRI_PLACES=63, PETRI_TRANSITIONS=41} [2025-01-09 16:29:49,404 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 17 predicate places. [2025-01-09 16:29:49,404 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 41 transitions, 168 flow [2025-01-09 16:29:49,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:29:49,404 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:29:49,404 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-01-09 16:29:49,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 16:29:49,404 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-01-09 16:29:49,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:29:49,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1684037312, now seen corresponding path program 2 times [2025-01-09 16:29:49,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:29:49,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22327988] [2025-01-09 16:29:49,405 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:29:49,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:29:49,411 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 1 equivalence classes. [2025-01-09 16:29:49,433 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 16:29:49,433 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:29:49,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:29:50,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:29:50,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:29:50,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22327988] [2025-01-09 16:29:50,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22327988] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:29:50,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:29:50,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 16:29:50,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658616618] [2025-01-09 16:29:50,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:29:50,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 16:29:50,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:29:50,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 16:29:50,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 16:29:50,118 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 40 [2025-01-09 16:29:50,119 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 41 transitions, 168 flow. Second operand has 9 states, 9 states have (on average 18.77777777777778) internal successors, (169), 9 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:29:50,119 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:29:50,119 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 40 [2025-01-09 16:29:50,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:29:50,402 INFO L124 PetriNetUnfolderBase]: 541/1049 cut-off events. [2025-01-09 16:29:50,403 INFO L125 PetriNetUnfolderBase]: For 396/396 co-relation queries the response was YES. [2025-01-09 16:29:50,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2320 conditions, 1049 events. 541/1049 cut-off events. For 396/396 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 5704 event pairs, 190 based on Foata normal form. 8/970 useless extension candidates. Maximal degree in co-relation 2299. Up to 401 conditions per place. [2025-01-09 16:29:50,405 INFO L140 encePairwiseOnDemand]: 33/40 looper letters, 22 selfloop transitions, 4 changer transitions 24/71 dead transitions. [2025-01-09 16:29:50,405 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 71 transitions, 351 flow [2025-01-09 16:29:50,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 16:29:50,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-09 16:29:50,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 185 transitions. [2025-01-09 16:29:50,406 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.578125 [2025-01-09 16:29:50,407 INFO L175 Difference]: Start difference. First operand has 63 places, 41 transitions, 168 flow. Second operand 8 states and 185 transitions. [2025-01-09 16:29:50,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 71 transitions, 351 flow [2025-01-09 16:29:50,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 71 transitions, 308 flow, removed 8 selfloop flow, removed 10 redundant places. [2025-01-09 16:29:50,409 INFO L231 Difference]: Finished difference. Result has 62 places, 41 transitions, 154 flow [2025-01-09 16:29:50,409 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=154, PETRI_PLACES=62, PETRI_TRANSITIONS=41} [2025-01-09 16:29:50,410 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 16 predicate places. [2025-01-09 16:29:50,410 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 41 transitions, 154 flow [2025-01-09 16:29:50,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.77777777777778) internal successors, (169), 9 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:29:50,410 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:29:50,410 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-01-09 16:29:50,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 16:29:50,411 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-01-09 16:29:50,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:29:50,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1237577064, now seen corresponding path program 3 times [2025-01-09 16:29:50,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:29:50,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812687837] [2025-01-09 16:29:50,412 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:29:50,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:29:50,421 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 1 equivalence classes. [2025-01-09 16:29:50,466 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 16:29:50,466 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-09 16:29:50,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:29:50,466 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 16:29:50,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 16:29:50,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 16:29:50,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:29:50,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:29:50,537 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 16:29:50,537 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 16:29:50,538 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2025-01-09 16:29:50,539 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2025-01-09 16:29:50,539 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2025-01-09 16:29:50,539 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2025-01-09 16:29:50,539 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2025-01-09 16:29:50,539 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-01-09 16:29:50,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 16:29:50,540 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:29:50,594 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-09 16:29:50,594 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 16:29:50,599 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 04:29:50 BasicIcfg [2025-01-09 16:29:50,599 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 16:29:50,599 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 16:29:50,600 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 16:29:50,600 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 16:29:50,600 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:29:42" (3/4) ... [2025-01-09 16:29:50,601 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-01-09 16:29:50,675 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 9. [2025-01-09 16:29:50,710 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 16:29:50,711 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 16:29:50,711 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 16:29:50,713 INFO L158 Benchmark]: Toolchain (without parser) took 8822.23ms. Allocated memory was 167.8MB in the beginning and 729.8MB in the end (delta: 562.0MB). Free memory was 132.7MB in the beginning and 573.0MB in the end (delta: -440.3MB). Peak memory consumption was 117.7MB. Max. memory is 16.1GB. [2025-01-09 16:29:50,713 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 201.3MB. Free memory is still 125.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:29:50,713 INFO L158 Benchmark]: CACSL2BoogieTranslator took 344.49ms. Allocated memory is still 167.8MB. Free memory was 132.3MB in the beginning and 109.6MB in the end (delta: 22.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 16:29:50,714 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.55ms. Allocated memory is still 167.8MB. Free memory was 109.6MB in the beginning and 107.3MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:29:50,714 INFO L158 Benchmark]: Boogie Preprocessor took 35.71ms. Allocated memory is still 167.8MB. Free memory was 107.3MB in the beginning and 104.5MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:29:50,714 INFO L158 Benchmark]: RCFGBuilder took 599.39ms. Allocated memory is still 167.8MB. Free memory was 104.5MB in the beginning and 57.0MB in the end (delta: 47.5MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-01-09 16:29:50,715 INFO L158 Benchmark]: TraceAbstraction took 7684.11ms. Allocated memory was 167.8MB in the beginning and 729.8MB in the end (delta: 562.0MB). Free memory was 56.6MB in the beginning and 589.8MB in the end (delta: -533.2MB). Peak memory consumption was 25.5MB. Max. memory is 16.1GB. [2025-01-09 16:29:50,715 INFO L158 Benchmark]: Witness Printer took 111.60ms. Allocated memory is still 729.8MB. Free memory was 589.8MB in the beginning and 573.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 16:29:50,716 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.30ms. Allocated memory is still 201.3MB. Free memory is still 125.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 344.49ms. Allocated memory is still 167.8MB. Free memory was 132.3MB in the beginning and 109.6MB in the end (delta: 22.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.55ms. Allocated memory is still 167.8MB. Free memory was 109.6MB in the beginning and 107.3MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 35.71ms. Allocated memory is still 167.8MB. Free memory was 107.3MB in the beginning and 104.5MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 599.39ms. Allocated memory is still 167.8MB. Free memory was 104.5MB in the beginning and 57.0MB in the end (delta: 47.5MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * TraceAbstraction took 7684.11ms. Allocated memory was 167.8MB in the beginning and 729.8MB in the end (delta: 562.0MB). Free memory was 56.6MB in the beginning and 589.8MB in the end (delta: -533.2MB). Peak memory consumption was 25.5MB. Max. memory is 16.1GB. * Witness Printer took 111.60ms. Allocated memory is still 729.8MB. Free memory was 589.8MB in the beginning and 573.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. 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=-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] [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, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1897=-2, t1898=-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] [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, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1897=-2, t1898=-1, t1899=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=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}, 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}, 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}, 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}, 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=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] [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=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=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=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=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=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=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=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=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=-2, t1898=-1, t1899=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=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=-2, t1898=-1, t1899=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=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=-2, t1898=-1, t1899=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=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=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=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=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=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: 7.5s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 4.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 597 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 576 mSDsluCounter, 191 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 149 mSDsCounter, 59 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1410 IncrementalHoareTripleChecker+Invalid, 1469 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 59 mSolverCounterUnsat, 42 mSDtfsCounter, 1410 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 87 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=228occurred in iteration=9, InterpolantAutomatonStates: 75, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 257 NumberOfCodeBlocks, 257 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 216 ConstructedInterpolants, 0 QuantifiedInterpolants, 1009 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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-01-09 16:29:50,733 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE