./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix028_power.opt_pso.opt_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc 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/mix028_power.opt_pso.opt_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 a86612b573a63cde2c4106f45bf8b3ea66989a894eb80420a80ff8b17f8f03d1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 04:20:43,098 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 04:20:43,145 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 04:20:43,149 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 04:20:43,149 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 04:20:43,174 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 04:20:43,175 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 04:20:43,175 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 04:20:43,176 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 04:20:43,176 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 04:20:43,176 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 04:20:43,176 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 04:20:43,176 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 04:20:43,176 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 04:20:43,176 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 04:20:43,177 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 04:20:43,177 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 04:20:43,177 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 04:20:43,177 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 04:20:43,177 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 04:20:43,177 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 04:20:43,177 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 04:20:43,177 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 04:20:43,177 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 04:20:43,178 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 04:20:43,178 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 04:20:43,178 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 04:20:43,178 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 04:20:43,178 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 04:20:43,178 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 04:20:43,178 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 04:20:43,178 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 04:20:43,178 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:20:43,178 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 04:20:43,178 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 04:20:43,179 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 04:20:43,179 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 04:20:43,179 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 04:20:43,179 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 04:20:43,179 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 04:20:43,179 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 04:20:43,179 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 04:20:43,179 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 04:20:43,179 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 -> a86612b573a63cde2c4106f45bf8b3ea66989a894eb80420a80ff8b17f8f03d1 [2025-02-06 04:20:43,401 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 04:20:43,409 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 04:20:43,410 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 04:20:43,411 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 04:20:43,411 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 04:20:43,412 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix028_power.opt_pso.opt_rmo.opt.i [2025-02-06 04:20:44,525 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/16c2b6f77/463dccbe0bfb471d89f6aed303f7761f/FLAG1ba89a59e [2025-02-06 04:20:44,853 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 04:20:44,855 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix028_power.opt_pso.opt_rmo.opt.i [2025-02-06 04:20:44,870 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/16c2b6f77/463dccbe0bfb471d89f6aed303f7761f/FLAG1ba89a59e [2025-02-06 04:20:45,093 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/16c2b6f77/463dccbe0bfb471d89f6aed303f7761f [2025-02-06 04:20:45,096 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 04:20:45,097 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 04:20:45,099 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 04:20:45,099 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 04:20:45,103 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 04:20:45,104 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:20:45" (1/1) ... [2025-02-06 04:20:45,105 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a9b86c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:20:45, skipping insertion in model container [2025-02-06 04:20:45,106 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:20:45" (1/1) ... [2025-02-06 04:20:45,137 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 04:20:45,258 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/mix028_power.opt_pso.opt_rmo.opt.i[966,979] [2025-02-06 04:20:45,357 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:20:45,368 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 04:20:45,375 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/mix028_power.opt_pso.opt_rmo.opt.i[966,979] [2025-02-06 04:20:45,408 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:20:45,434 INFO L204 MainTranslator]: Completed translation [2025-02-06 04:20:45,435 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:20:45 WrapperNode [2025-02-06 04:20:45,436 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 04:20:45,437 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 04:20:45,437 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 04:20:45,437 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 04:20:45,441 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:20:45" (1/1) ... [2025-02-06 04:20:45,450 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:20:45" (1/1) ... [2025-02-06 04:20:45,467 INFO L138 Inliner]: procedures = 175, calls = 44, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 134 [2025-02-06 04:20:45,468 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 04:20:45,468 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 04:20:45,468 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 04:20:45,475 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 04:20:45,482 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:20:45" (1/1) ... [2025-02-06 04:20:45,482 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:20:45" (1/1) ... [2025-02-06 04:20:45,484 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:20:45" (1/1) ... [2025-02-06 04:20:45,496 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-06 04:20:45,497 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:20:45" (1/1) ... [2025-02-06 04:20:45,497 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:20:45" (1/1) ... [2025-02-06 04:20:45,502 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:20:45" (1/1) ... [2025-02-06 04:20:45,503 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:20:45" (1/1) ... [2025-02-06 04:20:45,504 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:20:45" (1/1) ... [2025-02-06 04:20:45,504 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:20:45" (1/1) ... [2025-02-06 04:20:45,506 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 04:20:45,507 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 04:20:45,507 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 04:20:45,507 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 04:20:45,512 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:20:45" (1/1) ... [2025-02-06 04:20:45,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:20:45,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:20:45,536 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 04:20:45,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 04:20:45,552 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-06 04:20:45,552 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 04:20:45,552 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-02-06 04:20:45,552 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-02-06 04:20:45,552 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-02-06 04:20:45,552 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-02-06 04:20:45,552 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-02-06 04:20:45,552 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-02-06 04:20:45,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 04:20:45,553 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-06 04:20:45,553 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 04:20:45,553 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 04:20:45,554 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 04:20:45,626 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 04:20:45,628 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 04:20:45,837 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 04:20:45,838 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 04:20:46,008 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 04:20:46,012 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 04:20:46,013 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:20:46 BoogieIcfgContainer [2025-02-06 04:20:46,013 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 04:20:46,015 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 04:20:46,015 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 04:20:46,020 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 04:20:46,021 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 04:20:45" (1/3) ... [2025-02-06 04:20:46,021 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7aef976f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:20:46, skipping insertion in model container [2025-02-06 04:20:46,021 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:20:45" (2/3) ... [2025-02-06 04:20:46,021 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7aef976f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:20:46, skipping insertion in model container [2025-02-06 04:20:46,022 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:20:46" (3/3) ... [2025-02-06 04:20:46,023 INFO L128 eAbstractionObserver]: Analyzing ICFG mix028_power.opt_pso.opt_rmo.opt.i [2025-02-06 04:20:46,035 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 04:20:46,037 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix028_power.opt_pso.opt_rmo.opt.i that has 4 procedures, 40 locations, 1 initial locations, 0 loop locations, and 2 error locations. [2025-02-06 04:20:46,037 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 04:20:46,124 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 04:20:46,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 40 transitions, 92 flow [2025-02-06 04:20:46,192 INFO L124 PetriNetUnfolderBase]: 1/37 cut-off events. [2025-02-06 04:20:46,195 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 04:20:46,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 37 events. 1/37 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 69 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 39. Up to 2 conditions per place. [2025-02-06 04:20:46,199 INFO L82 GeneralOperation]: Start removeDead. Operand has 49 places, 40 transitions, 92 flow [2025-02-06 04:20:46,201 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 37 transitions, 83 flow [2025-02-06 04:20:46,210 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 04:20:46,222 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;@4c944e04, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 04:20:46,222 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-02-06 04:20:46,230 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 04:20:46,238 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2025-02-06 04:20:46,238 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 04:20:46,238 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:20:46,239 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 04:20:46,239 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 04:20:46,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:20:46,247 INFO L85 PathProgramCache]: Analyzing trace with hash 2124052363, now seen corresponding path program 1 times [2025-02-06 04:20:46,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:20:46,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891817967] [2025-02-06 04:20:46,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:20:46,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:20:46,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 04:20:46,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 04:20:46,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:20:46,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:20:46,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:20:46,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:20:46,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891817967] [2025-02-06 04:20:46,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891817967] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:20:46,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:20:46,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 04:20:46,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860977686] [2025-02-06 04:20:46,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:20:46,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 04:20:46,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:20:46,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 04:20:46,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 04:20:46,626 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2025-02-06 04:20:46,628 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 37 transitions, 83 flow. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:20:46,629 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:20:46,629 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2025-02-06 04:20:46,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:20:47,538 INFO L124 PetriNetUnfolderBase]: 4967/7164 cut-off events. [2025-02-06 04:20:47,539 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2025-02-06 04:20:47,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14323 conditions, 7164 events. 4967/7164 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 280. Compared 39206 event pairs, 547 based on Foata normal form. 246/7369 useless extension candidates. Maximal degree in co-relation 14312. Up to 6161 conditions per place. [2025-02-06 04:20:47,580 INFO L140 encePairwiseOnDemand]: 36/40 looper letters, 45 selfloop transitions, 2 changer transitions 2/55 dead transitions. [2025-02-06 04:20:47,581 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 55 transitions, 220 flow [2025-02-06 04:20:47,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 04:20:47,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 04:20:47,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 79 transitions. [2025-02-06 04:20:47,591 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6583333333333333 [2025-02-06 04:20:47,593 INFO L175 Difference]: Start difference. First operand has 46 places, 37 transitions, 83 flow. Second operand 3 states and 79 transitions. [2025-02-06 04:20:47,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 55 transitions, 220 flow [2025-02-06 04:20:47,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 55 transitions, 216 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 04:20:47,601 INFO L231 Difference]: Finished difference. Result has 44 places, 34 transitions, 78 flow [2025-02-06 04:20:47,603 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=44, PETRI_TRANSITIONS=34} [2025-02-06 04:20:47,607 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, -2 predicate places. [2025-02-06 04:20:47,608 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 78 flow [2025-02-06 04:20:47,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:20:47,608 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:20:47,608 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:20:47,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 04:20:47,610 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 04:20:47,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:20:47,610 INFO L85 PathProgramCache]: Analyzing trace with hash 2105398702, now seen corresponding path program 1 times [2025-02-06 04:20:47,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:20:47,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126446194] [2025-02-06 04:20:47,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:20:47,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:20:47,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 04:20:47,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 04:20:47,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:20:47,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:20:47,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:20:47,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:20:47,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126446194] [2025-02-06 04:20:47,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126446194] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:20:47,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:20:47,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 04:20:47,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377123232] [2025-02-06 04:20:47,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:20:47,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:20:47,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:20:47,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:20:47,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:20:47,998 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-02-06 04:20:47,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 78 flow. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:20:47,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:20:47,999 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-02-06 04:20:47,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:20:48,887 INFO L124 PetriNetUnfolderBase]: 6563/9573 cut-off events. [2025-02-06 04:20:48,888 INFO L125 PetriNetUnfolderBase]: For 468/468 co-relation queries the response was YES. [2025-02-06 04:20:48,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19515 conditions, 9573 events. 6563/9573 cut-off events. For 468/468 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 52412 event pairs, 1271 based on Foata normal form. 0/9381 useless extension candidates. Maximal degree in co-relation 19505. Up to 4993 conditions per place. [2025-02-06 04:20:48,919 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 41 selfloop transitions, 2 changer transitions 72/119 dead transitions. [2025-02-06 04:20:48,920 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 119 transitions, 490 flow [2025-02-06 04:20:48,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 04:20:48,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 04:20:48,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 173 transitions. [2025-02-06 04:20:48,922 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.540625 [2025-02-06 04:20:48,923 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 78 flow. Second operand 8 states and 173 transitions. [2025-02-06 04:20:48,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 119 transitions, 490 flow [2025-02-06 04:20:48,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 119 transitions, 474 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 04:20:48,928 INFO L231 Difference]: Finished difference. Result has 53 places, 33 transitions, 88 flow [2025-02-06 04:20:48,928 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=88, PETRI_PLACES=53, PETRI_TRANSITIONS=33} [2025-02-06 04:20:48,928 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 7 predicate places. [2025-02-06 04:20:48,928 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 33 transitions, 88 flow [2025-02-06 04:20:48,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:20:48,929 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:20:48,929 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:20:48,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 04:20:48,929 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 04:20:48,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:20:48,931 INFO L85 PathProgramCache]: Analyzing trace with hash -904632449, now seen corresponding path program 1 times [2025-02-06 04:20:48,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:20:48,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260173485] [2025-02-06 04:20:48,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:20:48,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:20:48,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 04:20:48,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 04:20:48,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:20:48,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:20:49,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:20:49,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:20:49,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260173485] [2025-02-06 04:20:49,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260173485] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:20:49,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:20:49,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 04:20:49,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832915584] [2025-02-06 04:20:49,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:20:49,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:20:49,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:20:49,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:20:49,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:20:49,336 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-02-06 04:20:49,336 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 33 transitions, 88 flow. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:20:49,336 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:20:49,336 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-02-06 04:20:49,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:20:50,102 INFO L124 PetriNetUnfolderBase]: 5025/7415 cut-off events. [2025-02-06 04:20:50,102 INFO L125 PetriNetUnfolderBase]: For 1436/1436 co-relation queries the response was YES. [2025-02-06 04:20:50,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16330 conditions, 7415 events. 5025/7415 cut-off events. For 1436/1436 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 41120 event pairs, 1411 based on Foata normal form. 180/7592 useless extension candidates. Maximal degree in co-relation 16315. Up to 5998 conditions per place. [2025-02-06 04:20:50,139 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 43 selfloop transitions, 3 changer transitions 45/95 dead transitions. [2025-02-06 04:20:50,140 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 95 transitions, 411 flow [2025-02-06 04:20:50,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 04:20:50,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-06 04:20:50,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 142 transitions. [2025-02-06 04:20:50,143 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5071428571428571 [2025-02-06 04:20:50,143 INFO L175 Difference]: Start difference. First operand has 53 places, 33 transitions, 88 flow. Second operand 7 states and 142 transitions. [2025-02-06 04:20:50,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 95 transitions, 411 flow [2025-02-06 04:20:50,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 95 transitions, 389 flow, removed 8 selfloop flow, removed 6 redundant places. [2025-02-06 04:20:50,229 INFO L231 Difference]: Finished difference. Result has 52 places, 35 transitions, 111 flow [2025-02-06 04:20:50,229 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=111, PETRI_PLACES=52, PETRI_TRANSITIONS=35} [2025-02-06 04:20:50,230 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 6 predicate places. [2025-02-06 04:20:50,230 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 35 transitions, 111 flow [2025-02-06 04:20:50,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:20:50,230 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:20:50,230 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:20:50,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 04:20:50,230 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 04:20:50,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:20:50,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1625165457, now seen corresponding path program 1 times [2025-02-06 04:20:50,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:20:50,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726889106] [2025-02-06 04:20:50,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:20:50,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:20:50,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 04:20:50,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 04:20:50,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:20:50,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:20:50,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:20:50,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:20:50,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726889106] [2025-02-06 04:20:50,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726889106] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:20:50,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:20:50,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 04:20:50,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117117498] [2025-02-06 04:20:50,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:20:50,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 04:20:50,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:20:50,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 04:20:50,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 04:20:50,898 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-02-06 04:20:50,898 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 35 transitions, 111 flow. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:20:50,898 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:20:50,898 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-02-06 04:20:50,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:20:51,754 INFO L124 PetriNetUnfolderBase]: 5319/7805 cut-off events. [2025-02-06 04:20:51,755 INFO L125 PetriNetUnfolderBase]: For 4515/4515 co-relation queries the response was YES. [2025-02-06 04:20:51,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19089 conditions, 7805 events. 5319/7805 cut-off events. For 4515/4515 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 41443 event pairs, 2054 based on Foata normal form. 162/7964 useless extension candidates. Maximal degree in co-relation 19073. Up to 6033 conditions per place. [2025-02-06 04:20:51,783 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 64 selfloop transitions, 23 changer transitions 44/135 dead transitions. [2025-02-06 04:20:51,784 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 135 transitions, 653 flow [2025-02-06 04:20:51,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 04:20:51,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-06 04:20:51,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 201 transitions. [2025-02-06 04:20:51,787 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5025 [2025-02-06 04:20:51,787 INFO L175 Difference]: Start difference. First operand has 52 places, 35 transitions, 111 flow. Second operand 10 states and 201 transitions. [2025-02-06 04:20:51,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 135 transitions, 653 flow [2025-02-06 04:20:51,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 135 transitions, 640 flow, removed 4 selfloop flow, removed 3 redundant places. [2025-02-06 04:20:51,804 INFO L231 Difference]: Finished difference. Result has 62 places, 58 transitions, 299 flow [2025-02-06 04:20:51,804 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=299, PETRI_PLACES=62, PETRI_TRANSITIONS=58} [2025-02-06 04:20:51,805 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 16 predicate places. [2025-02-06 04:20:51,805 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 58 transitions, 299 flow [2025-02-06 04:20:51,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:20:51,805 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:20:51,805 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:20:51,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 04:20:51,806 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 04:20:51,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:20:51,806 INFO L85 PathProgramCache]: Analyzing trace with hash 47305693, now seen corresponding path program 2 times [2025-02-06 04:20:51,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:20:51,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769053625] [2025-02-06 04:20:51,807 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:20:51,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:20:51,816 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-02-06 04:20:51,836 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 04:20:51,837 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 04:20:51,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:20:51,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-02-06 04:20:51,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:20:51,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769053625] [2025-02-06 04:20:51,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769053625] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:20:51,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:20:51,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 04:20:51,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450643369] [2025-02-06 04:20:51,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:20:51,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:20:51,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:20:51,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:20:51,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 04:20:51,966 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2025-02-06 04:20:51,966 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 58 transitions, 299 flow. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:20:51,966 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:20:51,967 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2025-02-06 04:20:51,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:20:52,361 INFO L124 PetriNetUnfolderBase]: 3619/5560 cut-off events. [2025-02-06 04:20:52,362 INFO L125 PetriNetUnfolderBase]: For 10816/10819 co-relation queries the response was YES. [2025-02-06 04:20:52,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17818 conditions, 5560 events. 3619/5560 cut-off events. For 10816/10819 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 30519 event pairs, 637 based on Foata normal form. 272/5823 useless extension candidates. Maximal degree in co-relation 17795. Up to 2609 conditions per place. [2025-02-06 04:20:52,394 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 81 selfloop transitions, 5 changer transitions 1/92 dead transitions. [2025-02-06 04:20:52,395 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 92 transitions, 628 flow [2025-02-06 04:20:52,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 04:20:52,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 04:20:52,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 101 transitions. [2025-02-06 04:20:52,397 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.63125 [2025-02-06 04:20:52,397 INFO L175 Difference]: Start difference. First operand has 62 places, 58 transitions, 299 flow. Second operand 4 states and 101 transitions. [2025-02-06 04:20:52,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 92 transitions, 628 flow [2025-02-06 04:20:52,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 92 transitions, 612 flow, removed 8 selfloop flow, removed 2 redundant places. [2025-02-06 04:20:52,424 INFO L231 Difference]: Finished difference. Result has 61 places, 56 transitions, 288 flow [2025-02-06 04:20:52,425 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=288, PETRI_PLACES=61, PETRI_TRANSITIONS=56} [2025-02-06 04:20:52,425 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 15 predicate places. [2025-02-06 04:20:52,425 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 56 transitions, 288 flow [2025-02-06 04:20:52,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:20:52,428 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:20:52,429 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:20:52,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 04:20:52,429 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 04:20:52,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:20:52,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1295300624, now seen corresponding path program 1 times [2025-02-06 04:20:52,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:20:52,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753442516] [2025-02-06 04:20:52,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:20:52,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:20:52,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 04:20:52,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 04:20:52,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:20:52,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:20:52,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-02-06 04:20:52,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:20:52,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753442516] [2025-02-06 04:20:52,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753442516] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:20:52,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:20:52,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 04:20:52,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104833196] [2025-02-06 04:20:52,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:20:52,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 04:20:52,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:20:52,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 04:20:52,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-06 04:20:52,970 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-02-06 04:20:52,970 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 56 transitions, 288 flow. Second operand has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:20:52,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:20:52,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-02-06 04:20:52,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:20:53,706 INFO L124 PetriNetUnfolderBase]: 3664/5510 cut-off events. [2025-02-06 04:20:53,706 INFO L125 PetriNetUnfolderBase]: For 10874/10874 co-relation queries the response was YES. [2025-02-06 04:20:53,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18726 conditions, 5510 events. 3664/5510 cut-off events. For 10874/10874 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 28047 event pairs, 1013 based on Foata normal form. 92/5599 useless extension candidates. Maximal degree in co-relation 18701. Up to 4373 conditions per place. [2025-02-06 04:20:53,740 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 81 selfloop transitions, 9 changer transitions 53/147 dead transitions. [2025-02-06 04:20:53,740 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 147 transitions, 1020 flow [2025-02-06 04:20:53,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 04:20:53,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-06 04:20:53,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 190 transitions. [2025-02-06 04:20:53,742 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.475 [2025-02-06 04:20:53,742 INFO L175 Difference]: Start difference. First operand has 61 places, 56 transitions, 288 flow. Second operand 10 states and 190 transitions. [2025-02-06 04:20:53,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 147 transitions, 1020 flow [2025-02-06 04:20:53,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 147 transitions, 988 flow, removed 9 selfloop flow, removed 2 redundant places. [2025-02-06 04:20:53,753 INFO L231 Difference]: Finished difference. Result has 76 places, 59 transitions, 343 flow [2025-02-06 04:20:53,754 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=343, PETRI_PLACES=76, PETRI_TRANSITIONS=59} [2025-02-06 04:20:53,755 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 30 predicate places. [2025-02-06 04:20:53,755 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 59 transitions, 343 flow [2025-02-06 04:20:53,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:20:53,756 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:20:53,756 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:20:53,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 04:20:53,756 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 04:20:53,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:20:53,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1562003034, now seen corresponding path program 1 times [2025-02-06 04:20:53,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:20:53,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564048485] [2025-02-06 04:20:53,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:20:53,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:20:53,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 04:20:53,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 04:20:53,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:20:53,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:20:53,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:20:53,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:20:53,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564048485] [2025-02-06 04:20:53,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564048485] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:20:53,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:20:53,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:20:53,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123049687] [2025-02-06 04:20:53,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:20:53,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:20:53,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:20:53,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:20:53,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:20:53,916 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-02-06 04:20:53,917 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 59 transitions, 343 flow. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:20:53,917 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:20:53,917 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-02-06 04:20:53,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:20:54,573 INFO L124 PetriNetUnfolderBase]: 5456/8153 cut-off events. [2025-02-06 04:20:54,573 INFO L125 PetriNetUnfolderBase]: For 23224/23227 co-relation queries the response was YES. [2025-02-06 04:20:54,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29731 conditions, 8153 events. 5456/8153 cut-off events. For 23224/23227 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 45110 event pairs, 1976 based on Foata normal form. 96/8242 useless extension candidates. Maximal degree in co-relation 29698. Up to 4224 conditions per place. [2025-02-06 04:20:54,635 INFO L140 encePairwiseOnDemand]: 35/40 looper letters, 78 selfloop transitions, 4 changer transitions 37/123 dead transitions. [2025-02-06 04:20:54,635 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 123 transitions, 933 flow [2025-02-06 04:20:54,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:20:54,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 04:20:54,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 113 transitions. [2025-02-06 04:20:54,636 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.565 [2025-02-06 04:20:54,636 INFO L175 Difference]: Start difference. First operand has 76 places, 59 transitions, 343 flow. Second operand 5 states and 113 transitions. [2025-02-06 04:20:54,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 123 transitions, 933 flow [2025-02-06 04:20:54,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 123 transitions, 888 flow, removed 20 selfloop flow, removed 7 redundant places. [2025-02-06 04:20:54,681 INFO L231 Difference]: Finished difference. Result has 70 places, 62 transitions, 357 flow [2025-02-06 04:20:54,682 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=357, PETRI_PLACES=70, PETRI_TRANSITIONS=62} [2025-02-06 04:20:54,682 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 24 predicate places. [2025-02-06 04:20:54,682 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 62 transitions, 357 flow [2025-02-06 04:20:54,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:20:54,683 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:20:54,683 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:20:54,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 04:20:54,683 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 04:20:54,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:20:54,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1873938520, now seen corresponding path program 2 times [2025-02-06 04:20:54,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:20:54,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511600665] [2025-02-06 04:20:54,684 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:20:54,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:20:54,690 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 1 equivalence classes. [2025-02-06 04:20:54,721 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 04:20:54,722 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 04:20:54,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:20:54,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:20:54,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:20:54,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511600665] [2025-02-06 04:20:54,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511600665] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:20:54,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:20:54,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 04:20:54,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678198285] [2025-02-06 04:20:54,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:20:54,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:20:54,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:20:54,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:20:54,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:20:54,828 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2025-02-06 04:20:54,829 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 62 transitions, 357 flow. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:20:54,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:20:54,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2025-02-06 04:20:54,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:20:55,222 INFO L124 PetriNetUnfolderBase]: 3296/5115 cut-off events. [2025-02-06 04:20:55,223 INFO L125 PetriNetUnfolderBase]: For 10234/10243 co-relation queries the response was YES. [2025-02-06 04:20:55,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16904 conditions, 5115 events. 3296/5115 cut-off events. For 10234/10243 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 27433 event pairs, 524 based on Foata normal form. 294/5402 useless extension candidates. Maximal degree in co-relation 16874. Up to 1719 conditions per place. [2025-02-06 04:20:55,248 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 105 selfloop transitions, 8 changer transitions 2/120 dead transitions. [2025-02-06 04:20:55,248 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 120 transitions, 899 flow [2025-02-06 04:20:55,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:20:55,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 04:20:55,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 129 transitions. [2025-02-06 04:20:55,250 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.645 [2025-02-06 04:20:55,250 INFO L175 Difference]: Start difference. First operand has 70 places, 62 transitions, 357 flow. Second operand 5 states and 129 transitions. [2025-02-06 04:20:55,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 120 transitions, 899 flow [2025-02-06 04:20:55,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 120 transitions, 885 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-02-06 04:20:55,264 INFO L231 Difference]: Finished difference. Result has 71 places, 65 transitions, 397 flow [2025-02-06 04:20:55,264 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=349, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=397, PETRI_PLACES=71, PETRI_TRANSITIONS=65} [2025-02-06 04:20:55,266 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 25 predicate places. [2025-02-06 04:20:55,266 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 65 transitions, 397 flow [2025-02-06 04:20:55,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:20:55,267 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:20:55,267 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] [2025-02-06 04:20:55,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 04:20:55,267 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 04:20:55,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:20:55,268 INFO L85 PathProgramCache]: Analyzing trace with hash 159124926, now seen corresponding path program 1 times [2025-02-06 04:20:55,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:20:55,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332248295] [2025-02-06 04:20:55,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:20:55,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:20:55,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-06 04:20:55,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 04:20:55,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:20:55,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:20:55,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:20:55,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:20:55,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332248295] [2025-02-06 04:20:55,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332248295] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:20:55,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:20:55,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:20:55,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636041378] [2025-02-06 04:20:55,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:20:55,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 04:20:55,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:20:55,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 04:20:55,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-06 04:20:55,442 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2025-02-06 04:20:55,442 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 65 transitions, 397 flow. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:20:55,442 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:20:55,442 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2025-02-06 04:20:55,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:20:55,770 INFO L124 PetriNetUnfolderBase]: 2153/3298 cut-off events. [2025-02-06 04:20:55,770 INFO L125 PetriNetUnfolderBase]: For 7689/7698 co-relation queries the response was YES. [2025-02-06 04:20:55,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11751 conditions, 3298 events. 2153/3298 cut-off events. For 7689/7698 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 16202 event pairs, 441 based on Foata normal form. 112/3403 useless extension candidates. Maximal degree in co-relation 11720. Up to 1178 conditions per place. [2025-02-06 04:20:55,782 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 70 selfloop transitions, 11 changer transitions 23/109 dead transitions. [2025-02-06 04:20:55,782 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 109 transitions, 821 flow [2025-02-06 04:20:55,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 04:20:55,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 04:20:55,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 129 transitions. [2025-02-06 04:20:55,783 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5375 [2025-02-06 04:20:55,783 INFO L175 Difference]: Start difference. First operand has 71 places, 65 transitions, 397 flow. Second operand 6 states and 129 transitions. [2025-02-06 04:20:55,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 109 transitions, 821 flow [2025-02-06 04:20:55,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 109 transitions, 740 flow, removed 23 selfloop flow, removed 8 redundant places. [2025-02-06 04:20:55,795 INFO L231 Difference]: Finished difference. Result has 70 places, 50 transitions, 278 flow [2025-02-06 04:20:55,795 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=278, PETRI_PLACES=70, PETRI_TRANSITIONS=50} [2025-02-06 04:20:55,796 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 24 predicate places. [2025-02-06 04:20:55,796 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 50 transitions, 278 flow [2025-02-06 04:20:55,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:20:55,796 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:20:55,796 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:20:55,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 04:20:55,797 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 04:20:55,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:20:55,797 INFO L85 PathProgramCache]: Analyzing trace with hash -2065680755, now seen corresponding path program 1 times [2025-02-06 04:20:55,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:20:55,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865449787] [2025-02-06 04:20:55,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:20:55,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:20:55,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 04:20:55,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 04:20:55,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:20:55,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:20:56,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:20:56,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:20:56,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865449787] [2025-02-06 04:20:56,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865449787] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:20:56,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:20:56,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 04:20:56,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590424279] [2025-02-06 04:20:56,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:20:56,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 04:20:56,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:20:56,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 04:20:56,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 04:20:56,110 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-02-06 04:20:56,111 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 50 transitions, 278 flow. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:20:56,111 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:20:56,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-02-06 04:20:56,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:20:56,507 INFO L124 PetriNetUnfolderBase]: 1274/1999 cut-off events. [2025-02-06 04:20:56,507 INFO L125 PetriNetUnfolderBase]: For 3295/3295 co-relation queries the response was YES. [2025-02-06 04:20:56,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6786 conditions, 1999 events. 1274/1999 cut-off events. For 3295/3295 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 8348 event pairs, 239 based on Foata normal form. 8/2005 useless extension candidates. Maximal degree in co-relation 6758. Up to 1169 conditions per place. [2025-02-06 04:20:56,515 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 48 selfloop transitions, 6 changer transitions 62/120 dead transitions. [2025-02-06 04:20:56,515 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 120 transitions, 862 flow [2025-02-06 04:20:56,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 04:20:56,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 04:20:56,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 142 transitions. [2025-02-06 04:20:56,517 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44375 [2025-02-06 04:20:56,517 INFO L175 Difference]: Start difference. First operand has 70 places, 50 transitions, 278 flow. Second operand 8 states and 142 transitions. [2025-02-06 04:20:56,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 120 transitions, 862 flow [2025-02-06 04:20:56,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 120 transitions, 680 flow, removed 35 selfloop flow, removed 15 redundant places. [2025-02-06 04:20:56,525 INFO L231 Difference]: Finished difference. Result has 67 places, 44 transitions, 191 flow [2025-02-06 04:20:56,525 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=191, PETRI_PLACES=67, PETRI_TRANSITIONS=44} [2025-02-06 04:20:56,526 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 21 predicate places. [2025-02-06 04:20:56,526 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 44 transitions, 191 flow [2025-02-06 04:20:56,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:20:56,526 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:20:56,526 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:20:56,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 04:20:56,526 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 04:20:56,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:20:56,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1040793445, now seen corresponding path program 2 times [2025-02-06 04:20:56,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:20:56,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450709331] [2025-02-06 04:20:56,527 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:20:56,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:20:56,533 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 1 equivalence classes. [2025-02-06 04:20:56,559 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 04:20:56,559 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 04:20:56,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:20:57,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:20:57,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:20:57,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450709331] [2025-02-06 04:20:57,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450709331] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:20:57,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:20:57,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 04:20:57,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940729976] [2025-02-06 04:20:57,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:20:57,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 04:20:57,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:20:57,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 04:20:57,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-02-06 04:20:57,472 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-02-06 04:20:57,473 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 44 transitions, 191 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:20:57,473 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:20:57,473 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-02-06 04:20:57,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:20:57,821 INFO L124 PetriNetUnfolderBase]: 1013/1635 cut-off events. [2025-02-06 04:20:57,821 INFO L125 PetriNetUnfolderBase]: For 1430/1430 co-relation queries the response was YES. [2025-02-06 04:20:57,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4639 conditions, 1635 events. 1013/1635 cut-off events. For 1430/1430 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 7048 event pairs, 196 based on Foata normal form. 8/1643 useless extension candidates. Maximal degree in co-relation 4617. Up to 824 conditions per place. [2025-02-06 04:20:57,826 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 60 selfloop transitions, 7 changer transitions 21/92 dead transitions. [2025-02-06 04:20:57,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 92 transitions, 542 flow [2025-02-06 04:20:57,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 04:20:57,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 04:20:57,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 127 transitions. [2025-02-06 04:20:57,828 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.396875 [2025-02-06 04:20:57,828 INFO L175 Difference]: Start difference. First operand has 67 places, 44 transitions, 191 flow. Second operand 8 states and 127 transitions. [2025-02-06 04:20:57,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 92 transitions, 542 flow [2025-02-06 04:20:57,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 92 transitions, 524 flow, removed 7 selfloop flow, removed 5 redundant places. [2025-02-06 04:20:57,830 INFO L231 Difference]: Finished difference. Result has 67 places, 46 transitions, 220 flow [2025-02-06 04:20:57,830 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=179, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=220, PETRI_PLACES=67, PETRI_TRANSITIONS=46} [2025-02-06 04:20:57,830 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 21 predicate places. [2025-02-06 04:20:57,830 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 46 transitions, 220 flow [2025-02-06 04:20:57,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:20:57,830 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:20:57,830 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:20:57,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 04:20:57,831 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-02-06 04:20:57,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:20:57,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1391498805, now seen corresponding path program 3 times [2025-02-06 04:20:57,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:20:57,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076005863] [2025-02-06 04:20:57,831 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 04:20:57,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:20:57,838 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 1 equivalence classes. [2025-02-06 04:20:57,862 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 04:20:57,862 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 04:20:57,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:20:58,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:20:58,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:20:58,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076005863] [2025-02-06 04:20:58,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076005863] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:20:58,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:20:58,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 04:20:58,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748436711] [2025-02-06 04:20:58,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:20:58,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 04:20:58,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:20:58,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 04:20:58,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-02-06 04:20:58,616 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-02-06 04:20:58,616 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 46 transitions, 220 flow. Second operand has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:20:58,616 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:20:58,617 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-02-06 04:20:58,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:20:59,007 INFO L124 PetriNetUnfolderBase]: 1163/1881 cut-off events. [2025-02-06 04:20:59,007 INFO L125 PetriNetUnfolderBase]: For 2278/2278 co-relation queries the response was YES. [2025-02-06 04:20:59,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5450 conditions, 1881 events. 1163/1881 cut-off events. For 2278/2278 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 8329 event pairs, 334 based on Foata normal form. 8/1889 useless extension candidates. Maximal degree in co-relation 5427. Up to 1023 conditions per place. [2025-02-06 04:20:59,018 INFO L140 encePairwiseOnDemand]: 33/40 looper letters, 46 selfloop transitions, 3 changer transitions 28/81 dead transitions. [2025-02-06 04:20:59,018 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 81 transitions, 499 flow [2025-02-06 04:20:59,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 04:20:59,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-06 04:20:59,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 109 transitions. [2025-02-06 04:20:59,019 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3892857142857143 [2025-02-06 04:20:59,020 INFO L175 Difference]: Start difference. First operand has 67 places, 46 transitions, 220 flow. Second operand 7 states and 109 transitions. [2025-02-06 04:20:59,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 81 transitions, 499 flow [2025-02-06 04:20:59,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 81 transitions, 482 flow, removed 5 selfloop flow, removed 5 redundant places. [2025-02-06 04:20:59,024 INFO L231 Difference]: Finished difference. Result has 69 places, 41 transitions, 180 flow [2025-02-06 04:20:59,024 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=180, PETRI_PLACES=69, PETRI_TRANSITIONS=41} [2025-02-06 04:20:59,025 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 23 predicate places. [2025-02-06 04:20:59,026 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 41 transitions, 180 flow [2025-02-06 04:20:59,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:20:59,026 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:20:59,026 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:20:59,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 04:20:59,026 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 04:20:59,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:20:59,027 INFO L85 PathProgramCache]: Analyzing trace with hash 38506391, now seen corresponding path program 4 times [2025-02-06 04:20:59,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:20:59,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072099827] [2025-02-06 04:20:59,027 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 04:20:59,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:20:59,035 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-02-06 04:20:59,086 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 04:20:59,087 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 04:20:59,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 04:20:59,087 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 04:20:59,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 04:20:59,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 04:20:59,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:20:59,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 04:20:59,138 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 04:20:59,138 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 04:20:59,139 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2025-02-06 04:20:59,140 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2025-02-06 04:20:59,140 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2025-02-06 04:20:59,140 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2025-02-06 04:20:59,140 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2025-02-06 04:20:59,141 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-02-06 04:20:59,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 04:20:59,141 INFO L422 BasicCegarLoop]: Path program histogram: [4, 2, 2, 1, 1, 1, 1, 1] [2025-02-06 04:20:59,182 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-06 04:20:59,182 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 04:20:59,185 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 04:20:59 BasicIcfg [2025-02-06 04:20:59,186 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 04:20:59,186 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 04:20:59,186 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 04:20:59,186 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 04:20:59,187 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:20:46" (3/4) ... [2025-02-06 04:20:59,187 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-02-06 04:20:59,255 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 9. [2025-02-06 04:20:59,321 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 04:20:59,321 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 04:20:59,322 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 04:20:59,322 INFO L158 Benchmark]: Toolchain (without parser) took 14225.44ms. Allocated memory was 167.8MB in the beginning and 1.2GB in the end (delta: 989.9MB). Free memory was 123.2MB in the beginning and 747.9MB in the end (delta: -624.7MB). Peak memory consumption was 361.2MB. Max. memory is 16.1GB. [2025-02-06 04:20:59,322 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 201.3MB. Free memory is still 117.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 04:20:59,323 INFO L158 Benchmark]: CACSL2BoogieTranslator took 337.29ms. Allocated memory is still 167.8MB. Free memory was 123.2MB in the beginning and 99.8MB in the end (delta: 23.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-06 04:20:59,324 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.95ms. Allocated memory is still 167.8MB. Free memory was 99.8MB in the beginning and 97.0MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 04:20:59,326 INFO L158 Benchmark]: Boogie Preprocessor took 37.89ms. Allocated memory is still 167.8MB. Free memory was 97.0MB in the beginning and 94.3MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 04:20:59,326 INFO L158 Benchmark]: IcfgBuilder took 506.39ms. Allocated memory is still 167.8MB. Free memory was 94.3MB in the beginning and 42.9MB in the end (delta: 51.5MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-02-06 04:20:59,326 INFO L158 Benchmark]: TraceAbstraction took 13170.76ms. Allocated memory was 167.8MB in the beginning and 1.2GB in the end (delta: 989.9MB). Free memory was 42.0MB in the beginning and 764.7MB in the end (delta: -722.7MB). Peak memory consumption was 260.6MB. Max. memory is 16.1GB. [2025-02-06 04:20:59,326 INFO L158 Benchmark]: Witness Printer took 135.45ms. Allocated memory is still 1.2GB. Free memory was 764.7MB in the beginning and 747.9MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 04:20:59,327 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.12ms. Allocated memory is still 201.3MB. Free memory is still 117.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 337.29ms. Allocated memory is still 167.8MB. Free memory was 123.2MB in the beginning and 99.8MB in the end (delta: 23.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.95ms. Allocated memory is still 167.8MB. Free memory was 99.8MB in the beginning and 97.0MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 37.89ms. Allocated memory is still 167.8MB. Free memory was 97.0MB in the beginning and 94.3MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 506.39ms. Allocated memory is still 167.8MB. Free memory was 94.3MB in the beginning and 42.9MB in the end (delta: 51.5MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * TraceAbstraction took 13170.76ms. Allocated memory was 167.8MB in the beginning and 1.2GB in the end (delta: 989.9MB). Free memory was 42.0MB in the beginning and 764.7MB in the end (delta: -722.7MB). Peak memory consumption was 260.6MB. Max. memory is 16.1GB. * Witness Printer took 135.45ms. Allocated memory is still 1.2GB. Free memory was 764.7MB in the beginning and 747.9MB 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: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L718] 0 _Bool x$flush_delayed; [L719] 0 int x$mem_tmp; [L720] 0 _Bool x$r_buff0_thd0; [L721] 0 _Bool x$r_buff0_thd1; [L722] 0 _Bool x$r_buff0_thd2; [L723] 0 _Bool x$r_buff0_thd3; [L724] 0 _Bool x$r_buff1_thd0; [L725] 0 _Bool x$r_buff1_thd1; [L726] 0 _Bool x$r_buff1_thd2; [L727] 0 _Bool x$r_buff1_thd3; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L737] 0 int z = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L823] 0 pthread_t t748; [L824] FCALL, FORK 0 pthread_create(&t748, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t748=-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, z=0] [L825] 0 pthread_t t749; [L826] FCALL, FORK 0 pthread_create(&t749, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t748=-1, t749=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, z=0] [L827] 0 pthread_t t750; [L828] FCALL, FORK 0 pthread_create(&t750, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t748=-1, t749=0, t750=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, z=0] [L763] 2 x$w_buff1 = x$w_buff0 [L764] 2 x$w_buff0 = 2 [L765] 2 x$w_buff1_used = x$w_buff0_used [L766] 2 x$w_buff0_used = (_Bool)1 [L767] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L767] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L768] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L769] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L770] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L771] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L772] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L775] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L792] 3 y = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2, z=0] [L795] 3 __unbuffered_p2_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2, z=0] [L798] 3 __unbuffered_p2_EBX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2, z=0] [L743] 1 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=2, __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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2, z=1] [L746] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=2, __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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2, z=1] [L749] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L750] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L751] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L752] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L753] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=2, __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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2, z=1] [L778] 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) [L779] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L780] 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 [L781] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L782] 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_p2_EAX=2, __unbuffered_p2_EBX=0, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2, z=1] [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2, z=1] [L801] 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) [L802] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L803] 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 [L804] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L805] 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=1, __unbuffered_p2_EAX=2, __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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2, z=1] [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=2, __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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2, z=1] [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2, z=1] [L830] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t748=-1, t749=0, t750=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=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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2, z=1] [L832] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L832] RET 0 assume_abort_if_not(main$tmp_guard0) [L834] 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) [L835] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L836] 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 [L837] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L838] 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_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t748=-1, t749=0, t750=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=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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2, z=1] [L841] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L842] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L843] 0 x$flush_delayed = weak$$choice2 [L844] 0 x$mem_tmp = x [L845] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L846] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L847] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L848] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L849] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L850] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L851] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L852] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) [L853] 0 x = x$flush_delayed ? x$mem_tmp : x [L854] 0 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t748=-1, t749=0, t750=1, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2, z=1] [L856] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2, z=1] [L18] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2, z=1] - UnprovableResult [Line: 18]: 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: 824]: 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: 826]: 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: 828]: 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: 13.0s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 7.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 865 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 858 mSDsluCounter, 72 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 62 mSDsCounter, 98 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2322 IncrementalHoareTripleChecker+Invalid, 2420 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 98 mSolverCounterUnsat, 10 mSDtfsCounter, 2322 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 101 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=397occurred in iteration=8, InterpolantAutomatonStates: 81, 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.4s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 286 NumberOfCodeBlocks, 286 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 244 ConstructedInterpolants, 0 QuantifiedInterpolants, 2211 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-02-06 04:20:59,345 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE