./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/safe030_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 6e0191a7c0154db5e6d5798f5b20e5814ce0ff555e18a7acf1f1e5e323a36576 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 01:06:04,064 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 01:06:04,123 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-08 01:06:04,127 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 01:06:04,127 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 01:06:04,141 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 01:06:04,142 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 01:06:04,142 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 01:06:04,142 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 01:06:04,142 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 01:06:04,143 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 01:06:04,143 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 01:06:04,143 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 01:06:04,143 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 01:06:04,143 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 01:06:04,143 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 01:06:04,143 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 01:06:04,143 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 01:06:04,143 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 01:06:04,144 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 01:06:04,144 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 01:06:04,144 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 01:06:04,144 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 01:06:04,144 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 01:06:04,144 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 01:06:04,144 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 01:06:04,144 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 01:06:04,144 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 01:06:04,144 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 01:06:04,144 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 01:06:04,144 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 01:06:04,144 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 01:06:04,145 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 01:06:04,145 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 01:06:04,145 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 01:06:04,145 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 01:06:04,145 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 01:06:04,145 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 01:06:04,145 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 01:06:04,145 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 01:06:04,145 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 01:06:04,145 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 01:06:04,145 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 01:06:04,145 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 -> 6e0191a7c0154db5e6d5798f5b20e5814ce0ff555e18a7acf1f1e5e323a36576 [2025-02-08 01:06:04,378 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 01:06:04,386 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 01:06:04,388 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 01:06:04,389 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 01:06:04,389 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 01:06:04,390 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i [2025-02-08 01:06:05,603 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3a5baac03/fa78bbbe63af473e91dbe19592a66dcd/FLAGb4c427bbb [2025-02-08 01:06:05,891 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 01:06:05,892 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i [2025-02-08 01:06:05,904 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3a5baac03/fa78bbbe63af473e91dbe19592a66dcd/FLAGb4c427bbb [2025-02-08 01:06:05,916 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3a5baac03/fa78bbbe63af473e91dbe19592a66dcd [2025-02-08 01:06:05,918 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 01:06:05,919 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 01:06:05,920 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 01:06:05,921 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 01:06:05,927 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 01:06:05,928 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:06:05" (1/1) ... [2025-02-08 01:06:05,929 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9c66e20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:06:05, skipping insertion in model container [2025-02-08 01:06:05,929 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:06:05" (1/1) ... [2025-02-08 01:06:05,958 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 01:06:06,091 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/safe030_power.opt_pso.opt_rmo.opt.i[967,980] [2025-02-08 01:06:06,290 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 01:06:06,302 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 01:06:06,316 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/safe030_power.opt_pso.opt_rmo.opt.i[967,980] [2025-02-08 01:06:06,377 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 01:06:06,407 INFO L204 MainTranslator]: Completed translation [2025-02-08 01:06:06,408 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:06:06 WrapperNode [2025-02-08 01:06:06,409 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 01:06:06,409 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 01:06:06,410 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 01:06:06,410 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 01:06:06,418 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:06:06" (1/1) ... [2025-02-08 01:06:06,429 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:06:06" (1/1) ... [2025-02-08 01:06:06,457 INFO L138 Inliner]: procedures = 175, calls = 42, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 132 [2025-02-08 01:06:06,458 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 01:06:06,458 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 01:06:06,458 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 01:06:06,458 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 01:06:06,464 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:06:06" (1/1) ... [2025-02-08 01:06:06,465 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:06:06" (1/1) ... [2025-02-08 01:06:06,467 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:06:06" (1/1) ... [2025-02-08 01:06:06,484 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-08 01:06:06,484 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:06:06" (1/1) ... [2025-02-08 01:06:06,484 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:06:06" (1/1) ... [2025-02-08 01:06:06,492 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:06:06" (1/1) ... [2025-02-08 01:06:06,493 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:06:06" (1/1) ... [2025-02-08 01:06:06,497 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:06:06" (1/1) ... [2025-02-08 01:06:06,498 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:06:06" (1/1) ... [2025-02-08 01:06:06,500 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 01:06:06,501 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 01:06:06,501 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 01:06:06,501 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 01:06:06,502 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:06:06" (1/1) ... [2025-02-08 01:06:06,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 01:06:06,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:06:06,531 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 01:06:06,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 01:06:06,550 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-08 01:06:06,550 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 01:06:06,550 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-02-08 01:06:06,550 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-02-08 01:06:06,550 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-02-08 01:06:06,550 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-02-08 01:06:06,550 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-02-08 01:06:06,550 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-02-08 01:06:06,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 01:06:06,550 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-08 01:06:06,550 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 01:06:06,550 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 01:06:06,551 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 01:06:06,647 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 01:06:06,648 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 01:06:06,903 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 01:06:06,903 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 01:06:07,068 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 01:06:07,069 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 01:06:07,069 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:06:07 BoogieIcfgContainer [2025-02-08 01:06:07,070 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 01:06:07,072 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 01:06:07,072 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 01:06:07,076 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 01:06:07,077 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 01:06:05" (1/3) ... [2025-02-08 01:06:07,077 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f5acc77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:06:07, skipping insertion in model container [2025-02-08 01:06:07,077 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:06:06" (2/3) ... [2025-02-08 01:06:07,078 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f5acc77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:06:07, skipping insertion in model container [2025-02-08 01:06:07,078 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:06:07" (3/3) ... [2025-02-08 01:06:07,079 INFO L128 eAbstractionObserver]: Analyzing ICFG safe030_power.opt_pso.opt_rmo.opt.i [2025-02-08 01:06:07,091 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 01:06:07,094 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe030_power.opt_pso.opt_rmo.opt.i that has 4 procedures, 39 locations, 1 initial locations, 0 loop locations, and 2 error locations. [2025-02-08 01:06:07,094 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 01:06:07,145 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 01:06:07,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 39 transitions, 90 flow [2025-02-08 01:06:07,227 INFO L124 PetriNetUnfolderBase]: 1/36 cut-off events. [2025-02-08 01:06:07,231 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 01:06:07,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 36 events. 1/36 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 63 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 38. Up to 2 conditions per place. [2025-02-08 01:06:07,234 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 39 transitions, 90 flow [2025-02-08 01:06:07,237 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 36 transitions, 81 flow [2025-02-08 01:06:07,245 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 01:06:07,256 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;@160961f4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 01:06:07,258 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-02-08 01:06:07,264 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 01:06:07,264 INFO L124 PetriNetUnfolderBase]: 0/16 cut-off events. [2025-02-08 01:06:07,264 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 01:06:07,264 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:06:07,265 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:06:07,265 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-08 01:06:07,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:06:07,270 INFO L85 PathProgramCache]: Analyzing trace with hash 816272772, now seen corresponding path program 1 times [2025-02-08 01:06:07,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:06:07,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184296105] [2025-02-08 01:06:07,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:06:07,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:06:07,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 01:06:07,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 01:06:07,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:06:07,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:06:07,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:06:07,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:06:07,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184296105] [2025-02-08 01:06:07,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184296105] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:06:07,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:06:07,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 01:06:07,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404237882] [2025-02-08 01:06:07,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:06:07,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 01:06:07,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:06:07,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 01:06:07,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 01:06:07,699 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2025-02-08 01:06:07,701 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 36 transitions, 81 flow. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:06:07,701 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:06:07,701 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2025-02-08 01:06:07,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:06:08,463 INFO L124 PetriNetUnfolderBase]: 4235/6165 cut-off events. [2025-02-08 01:06:08,463 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2025-02-08 01:06:08,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12304 conditions, 6165 events. 4235/6165 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 32186 event pairs, 575 based on Foata normal form. 216/6334 useless extension candidates. Maximal degree in co-relation 12293. Up to 5101 conditions per place. [2025-02-08 01:06:08,505 INFO L140 encePairwiseOnDemand]: 35/39 looper letters, 41 selfloop transitions, 2 changer transitions 2/51 dead transitions. [2025-02-08 01:06:08,506 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 51 transitions, 201 flow [2025-02-08 01:06:08,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 01:06:08,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 01:06:08,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2025-02-08 01:06:08,517 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6410256410256411 [2025-02-08 01:06:08,519 INFO L175 Difference]: Start difference. First operand has 45 places, 36 transitions, 81 flow. Second operand 3 states and 75 transitions. [2025-02-08 01:06:08,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 51 transitions, 201 flow [2025-02-08 01:06:08,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 51 transitions, 198 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 01:06:08,526 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 76 flow [2025-02-08 01:06:08,529 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, 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=3, PETRI_FLOW=76, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2025-02-08 01:06:08,534 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, -2 predicate places. [2025-02-08 01:06:08,534 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 76 flow [2025-02-08 01:06:08,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:06:08,535 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:06:08,535 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:06:08,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 01:06:08,535 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-08 01:06:08,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:06:08,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1313782582, now seen corresponding path program 1 times [2025-02-08 01:06:08,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:06:08,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837343449] [2025-02-08 01:06:08,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:06:08,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:06:08,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 01:06:08,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 01:06:08,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:06:08,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:06:08,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:06:08,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:06:08,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837343449] [2025-02-08 01:06:08,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837343449] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:06:08,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:06:08,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 01:06:08,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519342707] [2025-02-08 01:06:08,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:06:08,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 01:06:08,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:06:08,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 01:06:08,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 01:06:08,891 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 39 [2025-02-08 01:06:08,891 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 76 flow. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:06:08,891 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:06:08,891 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 39 [2025-02-08 01:06:08,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:06:09,700 INFO L124 PetriNetUnfolderBase]: 6055/8892 cut-off events. [2025-02-08 01:06:09,701 INFO L125 PetriNetUnfolderBase]: For 408/408 co-relation queries the response was YES. [2025-02-08 01:06:09,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18074 conditions, 8892 events. 6055/8892 cut-off events. For 408/408 co-relation queries the response was YES. Maximal size of possible extension queue 355. Compared 50628 event pairs, 1501 based on Foata normal form. 0/8684 useless extension candidates. Maximal degree in co-relation 18064. Up to 5757 conditions per place. [2025-02-08 01:06:09,795 INFO L140 encePairwiseOnDemand]: 32/39 looper letters, 41 selfloop transitions, 3 changer transitions 67/115 dead transitions. [2025-02-08 01:06:09,796 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 115 transitions, 478 flow [2025-02-08 01:06:09,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:06:09,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 01:06:09,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 169 transitions. [2025-02-08 01:06:09,800 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2025-02-08 01:06:09,800 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 76 flow. Second operand 8 states and 169 transitions. [2025-02-08 01:06:09,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 115 transitions, 478 flow [2025-02-08 01:06:09,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 115 transitions, 462 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 01:06:09,806 INFO L231 Difference]: Finished difference. Result has 52 places, 34 transitions, 105 flow [2025-02-08 01:06:09,806 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=40, 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=8, PETRI_FLOW=105, PETRI_PLACES=52, PETRI_TRANSITIONS=34} [2025-02-08 01:06:09,807 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 7 predicate places. [2025-02-08 01:06:09,807 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 34 transitions, 105 flow [2025-02-08 01:06:09,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:06:09,808 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:06:09,808 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:06:09,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 01:06:09,808 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-08 01:06:09,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:06:09,808 INFO L85 PathProgramCache]: Analyzing trace with hash 209192695, now seen corresponding path program 1 times [2025-02-08 01:06:09,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:06:09,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828368841] [2025-02-08 01:06:09,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:06:09,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:06:09,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-08 01:06:09,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 01:06:09,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:06:09,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:06:10,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:06:10,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:06:10,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828368841] [2025-02-08 01:06:10,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828368841] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:06:10,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:06:10,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 01:06:10,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634829671] [2025-02-08 01:06:10,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:06:10,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 01:06:10,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:06:10,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 01:06:10,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 01:06:10,438 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 39 [2025-02-08 01:06:10,439 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 34 transitions, 105 flow. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:06:10,439 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:06:10,439 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 39 [2025-02-08 01:06:10,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:06:11,742 INFO L124 PetriNetUnfolderBase]: 8087/11898 cut-off events. [2025-02-08 01:06:11,742 INFO L125 PetriNetUnfolderBase]: For 6851/6851 co-relation queries the response was YES. [2025-02-08 01:06:11,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28654 conditions, 11898 events. 8087/11898 cut-off events. For 6851/6851 co-relation queries the response was YES. Maximal size of possible extension queue 437. Compared 69923 event pairs, 614 based on Foata normal form. 350/12243 useless extension candidates. Maximal degree in co-relation 28639. Up to 5927 conditions per place. [2025-02-08 01:06:11,806 INFO L140 encePairwiseOnDemand]: 27/39 looper letters, 59 selfloop transitions, 12 changer transitions 81/156 dead transitions. [2025-02-08 01:06:11,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 156 transitions, 785 flow [2025-02-08 01:06:11,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 01:06:11,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-08 01:06:11,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 221 transitions. [2025-02-08 01:06:11,811 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5666666666666667 [2025-02-08 01:06:11,811 INFO L175 Difference]: Start difference. First operand has 52 places, 34 transitions, 105 flow. Second operand 10 states and 221 transitions. [2025-02-08 01:06:11,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 156 transitions, 785 flow [2025-02-08 01:06:11,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 156 transitions, 766 flow, removed 7 selfloop flow, removed 3 redundant places. [2025-02-08 01:06:11,858 INFO L231 Difference]: Finished difference. Result has 61 places, 45 transitions, 236 flow [2025-02-08 01:06:11,859 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=236, PETRI_PLACES=61, PETRI_TRANSITIONS=45} [2025-02-08 01:06:11,859 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 16 predicate places. [2025-02-08 01:06:11,860 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 45 transitions, 236 flow [2025-02-08 01:06:11,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:06:11,860 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:06:11,860 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:06:11,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 01:06:11,860 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-08 01:06:11,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:06:11,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1196909537, now seen corresponding path program 1 times [2025-02-08 01:06:11,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:06:11,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276853223] [2025-02-08 01:06:11,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:06:11,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:06:11,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 01:06:11,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 01:06:11,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:06:11,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:06:12,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:06:12,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:06:12,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276853223] [2025-02-08 01:06:12,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276853223] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:06:12,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:06:12,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 01:06:12,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943587922] [2025-02-08 01:06:12,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:06:12,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 01:06:12,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:06:12,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 01:06:12,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 01:06:12,332 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 39 [2025-02-08 01:06:12,332 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 45 transitions, 236 flow. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:06:12,333 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:06:12,333 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 39 [2025-02-08 01:06:12,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:06:13,662 INFO L124 PetriNetUnfolderBase]: 9842/14497 cut-off events. [2025-02-08 01:06:13,662 INFO L125 PetriNetUnfolderBase]: For 30337/30337 co-relation queries the response was YES. [2025-02-08 01:06:13,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47256 conditions, 14497 events. 9842/14497 cut-off events. For 30337/30337 co-relation queries the response was YES. Maximal size of possible extension queue 538. Compared 87125 event pairs, 2166 based on Foata normal form. 308/14802 useless extension candidates. Maximal degree in co-relation 47233. Up to 6613 conditions per place. [2025-02-08 01:06:13,739 INFO L140 encePairwiseOnDemand]: 27/39 looper letters, 68 selfloop transitions, 21 changer transitions 76/169 dead transitions. [2025-02-08 01:06:13,740 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 169 transitions, 1130 flow [2025-02-08 01:06:13,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 01:06:13,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-08 01:06:13,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 216 transitions. [2025-02-08 01:06:13,741 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5538461538461539 [2025-02-08 01:06:13,741 INFO L175 Difference]: Start difference. First operand has 61 places, 45 transitions, 236 flow. Second operand 10 states and 216 transitions. [2025-02-08 01:06:13,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 169 transitions, 1130 flow [2025-02-08 01:06:13,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 169 transitions, 1086 flow, removed 22 selfloop flow, removed 4 redundant places. [2025-02-08 01:06:13,787 INFO L231 Difference]: Finished difference. Result has 69 places, 57 transitions, 446 flow [2025-02-08 01:06:13,787 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=446, PETRI_PLACES=69, PETRI_TRANSITIONS=57} [2025-02-08 01:06:13,788 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 24 predicate places. [2025-02-08 01:06:13,788 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 57 transitions, 446 flow [2025-02-08 01:06:13,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:06:13,788 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:06:13,788 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:06:13,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 01:06:13,789 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-08 01:06:13,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:06:13,789 INFO L85 PathProgramCache]: Analyzing trace with hash 736164724, now seen corresponding path program 1 times [2025-02-08 01:06:13,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:06:13,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999506784] [2025-02-08 01:06:13,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:06:13,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:06:13,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-08 01:06:13,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-08 01:06:13,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:06:13,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:06:14,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:06:14,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:06:14,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999506784] [2025-02-08 01:06:14,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999506784] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:06:14,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:06:14,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 01:06:14,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275887013] [2025-02-08 01:06:14,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:06:14,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 01:06:14,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:06:14,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 01:06:14,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 01:06:14,114 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 39 [2025-02-08 01:06:14,114 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 57 transitions, 446 flow. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:06:14,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:06:14,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 39 [2025-02-08 01:06:14,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:06:15,433 INFO L124 PetriNetUnfolderBase]: 9888/14907 cut-off events. [2025-02-08 01:06:15,433 INFO L125 PetriNetUnfolderBase]: For 54648/54648 co-relation queries the response was YES. [2025-02-08 01:06:15,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55158 conditions, 14907 events. 9888/14907 cut-off events. For 54648/54648 co-relation queries the response was YES. Maximal size of possible extension queue 533. Compared 91116 event pairs, 3386 based on Foata normal form. 389/15287 useless extension candidates. Maximal degree in co-relation 55128. Up to 11977 conditions per place. [2025-02-08 01:06:15,535 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 68 selfloop transitions, 5 changer transitions 60/137 dead transitions. [2025-02-08 01:06:15,535 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 137 transitions, 1250 flow [2025-02-08 01:06:15,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 01:06:15,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 01:06:15,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 134 transitions. [2025-02-08 01:06:15,537 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4908424908424908 [2025-02-08 01:06:15,537 INFO L175 Difference]: Start difference. First operand has 69 places, 57 transitions, 446 flow. Second operand 7 states and 134 transitions. [2025-02-08 01:06:15,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 137 transitions, 1250 flow [2025-02-08 01:06:15,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 137 transitions, 1222 flow, removed 14 selfloop flow, removed 4 redundant places. [2025-02-08 01:06:15,700 INFO L231 Difference]: Finished difference. Result has 70 places, 60 transitions, 495 flow [2025-02-08 01:06:15,700 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=434, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=495, PETRI_PLACES=70, PETRI_TRANSITIONS=60} [2025-02-08 01:06:15,700 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 25 predicate places. [2025-02-08 01:06:15,700 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 60 transitions, 495 flow [2025-02-08 01:06:15,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:06:15,701 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:06:15,701 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:06:15,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 01:06:15,701 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-08 01:06:15,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:06:15,701 INFO L85 PathProgramCache]: Analyzing trace with hash -634134306, now seen corresponding path program 1 times [2025-02-08 01:06:15,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:06:15,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826422073] [2025-02-08 01:06:15,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:06:15,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:06:15,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 01:06:15,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 01:06:15,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:06:15,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:06:15,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:06:15,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:06:15,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826422073] [2025-02-08 01:06:15,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826422073] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:06:15,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:06:15,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 01:06:15,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665402686] [2025-02-08 01:06:15,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:06:15,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 01:06:15,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:06:15,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 01:06:15,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 01:06:15,974 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 39 [2025-02-08 01:06:15,974 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 60 transitions, 495 flow. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:06:15,975 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:06:15,975 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 39 [2025-02-08 01:06:15,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:06:16,995 INFO L124 PetriNetUnfolderBase]: 9621/14299 cut-off events. [2025-02-08 01:06:16,996 INFO L125 PetriNetUnfolderBase]: For 56380/56380 co-relation queries the response was YES. [2025-02-08 01:06:17,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56892 conditions, 14299 events. 9621/14299 cut-off events. For 56380/56380 co-relation queries the response was YES. Maximal size of possible extension queue 510. Compared 85133 event pairs, 1402 based on Foata normal form. 319/14609 useless extension candidates. Maximal degree in co-relation 56859. Up to 10713 conditions per place. [2025-02-08 01:06:17,104 INFO L140 encePairwiseOnDemand]: 31/39 looper letters, 81 selfloop transitions, 10 changer transitions 63/158 dead transitions. [2025-02-08 01:06:17,105 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 158 transitions, 1499 flow [2025-02-08 01:06:17,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:06:17,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 01:06:17,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 157 transitions. [2025-02-08 01:06:17,106 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5032051282051282 [2025-02-08 01:06:17,106 INFO L175 Difference]: Start difference. First operand has 70 places, 60 transitions, 495 flow. Second operand 8 states and 157 transitions. [2025-02-08 01:06:17,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 158 transitions, 1499 flow [2025-02-08 01:06:17,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 158 transitions, 1474 flow, removed 10 selfloop flow, removed 3 redundant places. [2025-02-08 01:06:17,206 INFO L231 Difference]: Finished difference. Result has 75 places, 63 transitions, 550 flow [2025-02-08 01:06:17,207 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=478, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=550, PETRI_PLACES=75, PETRI_TRANSITIONS=63} [2025-02-08 01:06:17,207 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 30 predicate places. [2025-02-08 01:06:17,207 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 63 transitions, 550 flow [2025-02-08 01:06:17,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:06:17,207 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:06:17,208 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:06:17,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 01:06:17,208 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-08 01:06:17,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:06:17,208 INFO L85 PathProgramCache]: Analyzing trace with hash -135432966, now seen corresponding path program 2 times [2025-02-08 01:06:17,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:06:17,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975994589] [2025-02-08 01:06:17,208 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:06:17,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:06:17,216 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-02-08 01:06:17,228 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 01:06:17,229 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 01:06:17,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:06:17,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:06:17,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:06:17,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975994589] [2025-02-08 01:06:17,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975994589] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:06:17,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:06:17,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 01:06:17,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893762658] [2025-02-08 01:06:17,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:06:17,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 01:06:17,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:06:17,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 01:06:17,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 01:06:17,488 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 39 [2025-02-08 01:06:17,488 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 63 transitions, 550 flow. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:06:17,488 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:06:17,488 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 39 [2025-02-08 01:06:17,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:06:18,550 INFO L124 PetriNetUnfolderBase]: 9066/13675 cut-off events. [2025-02-08 01:06:18,550 INFO L125 PetriNetUnfolderBase]: For 65093/65093 co-relation queries the response was YES. [2025-02-08 01:06:18,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55716 conditions, 13675 events. 9066/13675 cut-off events. For 65093/65093 co-relation queries the response was YES. Maximal size of possible extension queue 455. Compared 81327 event pairs, 1822 based on Foata normal form. 319/13985 useless extension candidates. Maximal degree in co-relation 55679. Up to 10456 conditions per place. [2025-02-08 01:06:18,661 INFO L140 encePairwiseOnDemand]: 31/39 looper letters, 76 selfloop transitions, 9 changer transitions 63/152 dead transitions. [2025-02-08 01:06:18,661 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 152 transitions, 1482 flow [2025-02-08 01:06:18,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:06:18,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 01:06:18,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 154 transitions. [2025-02-08 01:06:18,662 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4935897435897436 [2025-02-08 01:06:18,662 INFO L175 Difference]: Start difference. First operand has 75 places, 63 transitions, 550 flow. Second operand 8 states and 154 transitions. [2025-02-08 01:06:18,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 152 transitions, 1482 flow [2025-02-08 01:06:18,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 152 transitions, 1429 flow, removed 21 selfloop flow, removed 5 redundant places. [2025-02-08 01:06:18,828 INFO L231 Difference]: Finished difference. Result has 78 places, 62 transitions, 542 flow [2025-02-08 01:06:18,828 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=517, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=542, PETRI_PLACES=78, PETRI_TRANSITIONS=62} [2025-02-08 01:06:18,829 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 33 predicate places. [2025-02-08 01:06:18,829 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 62 transitions, 542 flow [2025-02-08 01:06:18,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:06:18,829 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:06:18,829 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:06:18,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 01:06:18,830 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-08 01:06:18,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:06:18,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1169024542, now seen corresponding path program 1 times [2025-02-08 01:06:18,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:06:18,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922800517] [2025-02-08 01:06:18,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:06:18,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:06:18,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 01:06:18,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 01:06:18,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:06:18,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:06:19,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:06:19,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:06:19,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922800517] [2025-02-08 01:06:19,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922800517] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:06:19,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:06:19,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 01:06:19,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031468123] [2025-02-08 01:06:19,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:06:19,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 01:06:19,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:06:19,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 01:06:19,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 01:06:19,208 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 39 [2025-02-08 01:06:19,208 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 62 transitions, 542 flow. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:06:19,208 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:06:19,209 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 39 [2025-02-08 01:06:19,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:06:20,917 INFO L124 PetriNetUnfolderBase]: 13831/20641 cut-off events. [2025-02-08 01:06:20,917 INFO L125 PetriNetUnfolderBase]: For 92335/92335 co-relation queries the response was YES. [2025-02-08 01:06:21,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80118 conditions, 20641 events. 13831/20641 cut-off events. For 92335/92335 co-relation queries the response was YES. Maximal size of possible extension queue 680. Compared 131167 event pairs, 1838 based on Foata normal form. 444/21077 useless extension candidates. Maximal degree in co-relation 80079. Up to 8214 conditions per place. [2025-02-08 01:06:21,078 INFO L140 encePairwiseOnDemand]: 27/39 looper letters, 75 selfloop transitions, 20 changer transitions 81/180 dead transitions. [2025-02-08 01:06:21,079 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 180 transitions, 1602 flow [2025-02-08 01:06:21,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 01:06:21,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-08 01:06:21,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 214 transitions. [2025-02-08 01:06:21,084 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5487179487179488 [2025-02-08 01:06:21,084 INFO L175 Difference]: Start difference. First operand has 78 places, 62 transitions, 542 flow. Second operand 10 states and 214 transitions. [2025-02-08 01:06:21,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 180 transitions, 1602 flow [2025-02-08 01:06:21,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 180 transitions, 1534 flow, removed 24 selfloop flow, removed 7 redundant places. [2025-02-08 01:06:21,345 INFO L231 Difference]: Finished difference. Result has 85 places, 65 transitions, 654 flow [2025-02-08 01:06:21,345 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=508, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=654, PETRI_PLACES=85, PETRI_TRANSITIONS=65} [2025-02-08 01:06:21,345 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 40 predicate places. [2025-02-08 01:06:21,346 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 65 transitions, 654 flow [2025-02-08 01:06:21,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:06:21,346 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:06:21,346 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:06:21,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 01:06:21,346 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-08 01:06:21,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:06:21,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1905073522, now seen corresponding path program 1 times [2025-02-08 01:06:21,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:06:21,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001616234] [2025-02-08 01:06:21,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:06:21,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:06:21,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 01:06:21,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 01:06:21,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:06:21,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:06:21,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:06:21,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:06:21,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001616234] [2025-02-08 01:06:21,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001616234] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:06:21,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:06:21,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 01:06:21,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258134454] [2025-02-08 01:06:21,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:06:21,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 01:06:21,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:06:21,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 01:06:21,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-08 01:06:21,682 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 39 [2025-02-08 01:06:21,683 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 65 transitions, 654 flow. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:06:21,683 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:06:21,683 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 39 [2025-02-08 01:06:21,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:06:23,287 INFO L124 PetriNetUnfolderBase]: 13262/20256 cut-off events. [2025-02-08 01:06:23,287 INFO L125 PetriNetUnfolderBase]: For 128372/128372 co-relation queries the response was YES. [2025-02-08 01:06:23,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82967 conditions, 20256 events. 13262/20256 cut-off events. For 128372/128372 co-relation queries the response was YES. Maximal size of possible extension queue 687. Compared 132300 event pairs, 5126 based on Foata normal form. 576/20823 useless extension candidates. Maximal degree in co-relation 82923. Up to 15492 conditions per place. [2025-02-08 01:06:23,382 INFO L140 encePairwiseOnDemand]: 32/39 looper letters, 87 selfloop transitions, 10 changer transitions 79/180 dead transitions. [2025-02-08 01:06:23,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 180 transitions, 2164 flow [2025-02-08 01:06:23,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:06:23,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 01:06:23,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 154 transitions. [2025-02-08 01:06:23,383 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4935897435897436 [2025-02-08 01:06:23,383 INFO L175 Difference]: Start difference. First operand has 85 places, 65 transitions, 654 flow. Second operand 8 states and 154 transitions. [2025-02-08 01:06:23,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 180 transitions, 2164 flow [2025-02-08 01:06:23,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 180 transitions, 2068 flow, removed 48 selfloop flow, removed 4 redundant places. [2025-02-08 01:06:23,607 INFO L231 Difference]: Finished difference. Result has 87 places, 69 transitions, 734 flow [2025-02-08 01:06:23,607 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=622, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=734, PETRI_PLACES=87, PETRI_TRANSITIONS=69} [2025-02-08 01:06:23,607 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 42 predicate places. [2025-02-08 01:06:23,607 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 69 transitions, 734 flow [2025-02-08 01:06:23,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:06:23,608 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:06:23,608 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:06:23,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 01:06:23,608 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-08 01:06:23,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:06:23,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1222359968, now seen corresponding path program 1 times [2025-02-08 01:06:23,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:06:23,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899568742] [2025-02-08 01:06:23,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:06:23,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:06:23,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-08 01:06:23,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-08 01:06:23,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:06:23,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:06:23,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:06:23,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:06:23,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899568742] [2025-02-08 01:06:23,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899568742] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:06:23,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:06:23,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 01:06:23,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951285896] [2025-02-08 01:06:23,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:06:23,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 01:06:23,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:06:23,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 01:06:23,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 01:06:23,699 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2025-02-08 01:06:23,700 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 69 transitions, 734 flow. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:06:23,700 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:06:23,700 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2025-02-08 01:06:23,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:06:24,896 INFO L124 PetriNetUnfolderBase]: 8699/13852 cut-off events. [2025-02-08 01:06:24,896 INFO L125 PetriNetUnfolderBase]: For 90145/90145 co-relation queries the response was YES. [2025-02-08 01:06:24,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56622 conditions, 13852 events. 8699/13852 cut-off events. For 90145/90145 co-relation queries the response was YES. Maximal size of possible extension queue 548. Compared 91845 event pairs, 1432 based on Foata normal form. 708/14551 useless extension candidates. Maximal degree in co-relation 56575. Up to 7081 conditions per place. [2025-02-08 01:06:24,980 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 114 selfloop transitions, 5 changer transitions 26/150 dead transitions. [2025-02-08 01:06:24,980 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 150 transitions, 1940 flow [2025-02-08 01:06:24,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 01:06:24,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 01:06:24,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 98 transitions. [2025-02-08 01:06:24,981 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6282051282051282 [2025-02-08 01:06:24,981 INFO L175 Difference]: Start difference. First operand has 87 places, 69 transitions, 734 flow. Second operand 4 states and 98 transitions. [2025-02-08 01:06:24,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 150 transitions, 1940 flow [2025-02-08 01:06:25,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 150 transitions, 1878 flow, removed 17 selfloop flow, removed 4 redundant places. [2025-02-08 01:06:25,103 INFO L231 Difference]: Finished difference. Result has 84 places, 68 transitions, 686 flow [2025-02-08 01:06:25,104 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=686, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=686, PETRI_PLACES=84, PETRI_TRANSITIONS=68} [2025-02-08 01:06:25,105 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 39 predicate places. [2025-02-08 01:06:25,105 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 68 transitions, 686 flow [2025-02-08 01:06:25,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:06:25,105 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:06:25,105 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] [2025-02-08 01:06:25,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 01:06:25,105 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-08 01:06:25,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:06:25,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1789858411, now seen corresponding path program 1 times [2025-02-08 01:06:25,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:06:25,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766519678] [2025-02-08 01:06:25,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:06:25,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:06:25,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 01:06:25,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 01:06:25,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:06:25,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:06:26,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:06:26,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:06:26,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766519678] [2025-02-08 01:06:26,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766519678] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:06:26,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:06:26,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 01:06:26,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196501370] [2025-02-08 01:06:26,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:06:26,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 01:06:26,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:06:26,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 01:06:26,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-08 01:06:26,166 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 39 [2025-02-08 01:06:26,166 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 68 transitions, 686 flow. Second operand has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 9 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:06:26,166 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:06:26,166 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 39 [2025-02-08 01:06:26,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:06:28,208 INFO L124 PetriNetUnfolderBase]: 13456/20741 cut-off events. [2025-02-08 01:06:28,208 INFO L125 PetriNetUnfolderBase]: For 111760/111760 co-relation queries the response was YES. [2025-02-08 01:06:28,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86749 conditions, 20741 events. 13456/20741 cut-off events. For 111760/111760 co-relation queries the response was YES. Maximal size of possible extension queue 794. Compared 140113 event pairs, 2157 based on Foata normal form. 204/20937 useless extension candidates. Maximal degree in co-relation 86702. Up to 7196 conditions per place. [2025-02-08 01:06:28,421 INFO L140 encePairwiseOnDemand]: 27/39 looper letters, 103 selfloop transitions, 45 changer transitions 98/250 dead transitions. [2025-02-08 01:06:28,421 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 250 transitions, 2714 flow [2025-02-08 01:06:28,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-08 01:06:28,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-02-08 01:06:28,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 255 transitions. [2025-02-08 01:06:28,423 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5029585798816568 [2025-02-08 01:06:28,423 INFO L175 Difference]: Start difference. First operand has 84 places, 68 transitions, 686 flow. Second operand 13 states and 255 transitions. [2025-02-08 01:06:28,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 250 transitions, 2714 flow [2025-02-08 01:06:28,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 250 transitions, 2599 flow, removed 20 selfloop flow, removed 5 redundant places. [2025-02-08 01:06:28,633 INFO L231 Difference]: Finished difference. Result has 101 places, 92 transitions, 1120 flow [2025-02-08 01:06:28,633 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=650, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1120, PETRI_PLACES=101, PETRI_TRANSITIONS=92} [2025-02-08 01:06:28,633 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 56 predicate places. [2025-02-08 01:06:28,633 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 92 transitions, 1120 flow [2025-02-08 01:06:28,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 9 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:06:28,634 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:06:28,634 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] [2025-02-08 01:06:28,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 01:06:28,634 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-08 01:06:28,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:06:28,634 INFO L85 PathProgramCache]: Analyzing trace with hash 922109373, now seen corresponding path program 2 times [2025-02-08 01:06:28,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:06:28,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535374071] [2025-02-08 01:06:28,634 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:06:28,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:06:28,639 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 1 equivalence classes. [2025-02-08 01:06:28,653 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 01:06:28,653 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 01:06:28,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:06:28,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:06:28,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:06:28,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535374071] [2025-02-08 01:06:28,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535374071] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:06:28,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:06:28,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 01:06:28,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729718320] [2025-02-08 01:06:28,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:06:28,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 01:06:28,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:06:28,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 01:06:28,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 01:06:28,730 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2025-02-08 01:06:28,730 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 92 transitions, 1120 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-08 01:06:28,730 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:06:28,730 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2025-02-08 01:06:28,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:06:29,514 INFO L124 PetriNetUnfolderBase]: 6851/11084 cut-off events. [2025-02-08 01:06:29,515 INFO L125 PetriNetUnfolderBase]: For 52569/52569 co-relation queries the response was YES. [2025-02-08 01:06:29,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40938 conditions, 11084 events. 6851/11084 cut-off events. For 52569/52569 co-relation queries the response was YES. Maximal size of possible extension queue 498. Compared 72998 event pairs, 733 based on Foata normal form. 790/11865 useless extension candidates. Maximal degree in co-relation 40884. Up to 3504 conditions per place. [2025-02-08 01:06:29,567 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 124 selfloop transitions, 8 changer transitions 40/177 dead transitions. [2025-02-08 01:06:29,567 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 177 transitions, 2426 flow [2025-02-08 01:06:29,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 01:06:29,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 01:06:29,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 125 transitions. [2025-02-08 01:06:29,568 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6410256410256411 [2025-02-08 01:06:29,568 INFO L175 Difference]: Start difference. First operand has 101 places, 92 transitions, 1120 flow. Second operand 5 states and 125 transitions. [2025-02-08 01:06:29,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 177 transitions, 2426 flow [2025-02-08 01:06:29,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 177 transitions, 2293 flow, removed 62 selfloop flow, removed 8 redundant places. [2025-02-08 01:06:29,635 INFO L231 Difference]: Finished difference. Result has 93 places, 79 transitions, 865 flow [2025-02-08 01:06:29,635 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=944, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=865, PETRI_PLACES=93, PETRI_TRANSITIONS=79} [2025-02-08 01:06:29,635 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 48 predicate places. [2025-02-08 01:06:29,636 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 79 transitions, 865 flow [2025-02-08 01:06:29,636 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-08 01:06:29,636 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:06:29,636 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:06:29,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 01:06:29,636 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-08 01:06:29,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:06:29,637 INFO L85 PathProgramCache]: Analyzing trace with hash -688764256, now seen corresponding path program 1 times [2025-02-08 01:06:29,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:06:29,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624752088] [2025-02-08 01:06:29,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:06:29,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:06:29,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 01:06:29,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 01:06:29,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:06:29,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:06:30,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:06:30,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:06:30,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624752088] [2025-02-08 01:06:30,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624752088] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:06:30,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:06:30,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 01:06:30,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747420808] [2025-02-08 01:06:30,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:06:30,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 01:06:30,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:06:30,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 01:06:30,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-08 01:06:30,141 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 39 [2025-02-08 01:06:30,142 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 79 transitions, 865 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:06:30,142 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:06:30,143 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 39 [2025-02-08 01:06:30,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:06:30,808 INFO L124 PetriNetUnfolderBase]: 4084/6663 cut-off events. [2025-02-08 01:06:30,808 INFO L125 PetriNetUnfolderBase]: For 27633/27633 co-relation queries the response was YES. [2025-02-08 01:06:30,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27136 conditions, 6663 events. 4084/6663 cut-off events. For 27633/27633 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 39254 event pairs, 1881 based on Foata normal form. 20/6674 useless extension candidates. Maximal degree in co-relation 27103. Up to 5892 conditions per place. [2025-02-08 01:06:30,847 INFO L140 encePairwiseOnDemand]: 31/39 looper letters, 83 selfloop transitions, 11 changer transitions 34/132 dead transitions. [2025-02-08 01:06:30,847 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 132 transitions, 1566 flow [2025-02-08 01:06:30,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 01:06:30,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 01:06:30,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 125 transitions. [2025-02-08 01:06:30,848 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45787545787545786 [2025-02-08 01:06:30,848 INFO L175 Difference]: Start difference. First operand has 93 places, 79 transitions, 865 flow. Second operand 7 states and 125 transitions. [2025-02-08 01:06:30,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 132 transitions, 1566 flow [2025-02-08 01:06:30,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 132 transitions, 1465 flow, removed 16 selfloop flow, removed 6 redundant places. [2025-02-08 01:06:30,897 INFO L231 Difference]: Finished difference. Result has 96 places, 82 transitions, 882 flow [2025-02-08 01:06:30,897 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=808, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=882, PETRI_PLACES=96, PETRI_TRANSITIONS=82} [2025-02-08 01:06:30,898 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 51 predicate places. [2025-02-08 01:06:30,898 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 82 transitions, 882 flow [2025-02-08 01:06:30,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:06:30,898 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:06:30,898 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:06:30,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 01:06:30,898 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-08 01:06:30,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:06:30,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1595504282, now seen corresponding path program 2 times [2025-02-08 01:06:30,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:06:30,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131500574] [2025-02-08 01:06:30,899 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:06:30,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:06:30,903 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 1 equivalence classes. [2025-02-08 01:06:30,919 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 01:06:30,919 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 01:06:30,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:06:30,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:06:30,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:06:30,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131500574] [2025-02-08 01:06:30,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131500574] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:06:30,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:06:30,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 01:06:30,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39201389] [2025-02-08 01:06:30,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:06:30,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 01:06:30,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:06:30,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 01:06:30,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-08 01:06:30,998 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2025-02-08 01:06:30,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 82 transitions, 882 flow. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:06:30,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:06:30,999 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2025-02-08 01:06:30,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:06:31,429 INFO L124 PetriNetUnfolderBase]: 2912/4791 cut-off events. [2025-02-08 01:06:31,429 INFO L125 PetriNetUnfolderBase]: For 18757/18757 co-relation queries the response was YES. [2025-02-08 01:06:31,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18006 conditions, 4791 events. 2912/4791 cut-off events. For 18757/18757 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 27988 event pairs, 378 based on Foata normal form. 244/5026 useless extension candidates. Maximal degree in co-relation 17972. Up to 1660 conditions per place. [2025-02-08 01:06:31,456 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 58 selfloop transitions, 11 changer transitions 70/144 dead transitions. [2025-02-08 01:06:31,457 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 144 transitions, 1744 flow [2025-02-08 01:06:31,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 01:06:31,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 01:06:31,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 125 transitions. [2025-02-08 01:06:31,457 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5341880341880342 [2025-02-08 01:06:31,457 INFO L175 Difference]: Start difference. First operand has 96 places, 82 transitions, 882 flow. Second operand 6 states and 125 transitions. [2025-02-08 01:06:31,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 144 transitions, 1744 flow [2025-02-08 01:06:31,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 144 transitions, 1574 flow, removed 57 selfloop flow, removed 10 redundant places. [2025-02-08 01:06:31,479 INFO L231 Difference]: Finished difference. Result has 91 places, 45 transitions, 343 flow [2025-02-08 01:06:31,479 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=721, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=343, PETRI_PLACES=91, PETRI_TRANSITIONS=45} [2025-02-08 01:06:31,480 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 46 predicate places. [2025-02-08 01:06:31,480 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 45 transitions, 343 flow [2025-02-08 01:06:31,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:06:31,480 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:06:31,480 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] [2025-02-08 01:06:31,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 01:06:31,480 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-08 01:06:31,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:06:31,481 INFO L85 PathProgramCache]: Analyzing trace with hash 583891564, now seen corresponding path program 1 times [2025-02-08 01:06:31,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:06:31,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41467589] [2025-02-08 01:06:31,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:06:31,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:06:31,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 01:06:31,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 01:06:31,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:06:31,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:06:32,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:06:32,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:06:32,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41467589] [2025-02-08 01:06:32,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41467589] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:06:32,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:06:32,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 01:06:32,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94083130] [2025-02-08 01:06:32,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:06:32,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 01:06:32,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:06:32,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 01:06:32,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-02-08 01:06:32,329 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 39 [2025-02-08 01:06:32,330 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 45 transitions, 343 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:06:32,330 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:06:32,330 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 39 [2025-02-08 01:06:32,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:06:32,683 INFO L124 PetriNetUnfolderBase]: 713/1149 cut-off events. [2025-02-08 01:06:32,683 INFO L125 PetriNetUnfolderBase]: For 3232/3232 co-relation queries the response was YES. [2025-02-08 01:06:32,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4333 conditions, 1149 events. 713/1149 cut-off events. For 3232/3232 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 4475 event pairs, 192 based on Foata normal form. 8/1156 useless extension candidates. Maximal degree in co-relation 4305. Up to 640 conditions per place. [2025-02-08 01:06:32,688 INFO L140 encePairwiseOnDemand]: 31/39 looper letters, 41 selfloop transitions, 3 changer transitions 42/90 dead transitions. [2025-02-08 01:06:32,688 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 90 transitions, 774 flow [2025-02-08 01:06:32,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 01:06:32,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-08 01:06:32,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 130 transitions. [2025-02-08 01:06:32,689 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.37037037037037035 [2025-02-08 01:06:32,689 INFO L175 Difference]: Start difference. First operand has 91 places, 45 transitions, 343 flow. Second operand 9 states and 130 transitions. [2025-02-08 01:06:32,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 90 transitions, 774 flow [2025-02-08 01:06:32,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 90 transitions, 492 flow, removed 53 selfloop flow, removed 28 redundant places. [2025-02-08 01:06:32,695 INFO L231 Difference]: Finished difference. Result has 70 places, 38 transitions, 151 flow [2025-02-08 01:06:32,695 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=151, PETRI_PLACES=70, PETRI_TRANSITIONS=38} [2025-02-08 01:06:32,695 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 25 predicate places. [2025-02-08 01:06:32,695 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 38 transitions, 151 flow [2025-02-08 01:06:32,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:06:32,695 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:06:32,696 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] [2025-02-08 01:06:32,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 01:06:32,696 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-08 01:06:32,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:06:32,696 INFO L85 PathProgramCache]: Analyzing trace with hash 571851676, now seen corresponding path program 2 times [2025-02-08 01:06:32,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:06:32,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532010952] [2025-02-08 01:06:32,696 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:06:32,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:06:32,703 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 1 equivalence classes. [2025-02-08 01:06:32,728 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 01:06:32,728 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 01:06:32,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 01:06:32,728 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 01:06:32,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 01:06:32,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 01:06:32,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:06:32,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 01:06:32,799 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 01:06:32,800 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 01:06:32,801 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2025-02-08 01:06:32,803 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2025-02-08 01:06:32,803 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2025-02-08 01:06:32,803 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2025-02-08 01:06:32,803 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2025-02-08 01:06:32,803 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-02-08 01:06:32,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 01:06:32,804 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:06:32,860 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 01:06:32,860 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 01:06:32,863 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 01:06:32 BasicIcfg [2025-02-08 01:06:32,864 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 01:06:32,864 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 01:06:32,864 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 01:06:32,865 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 01:06:32,865 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:06:07" (3/4) ... [2025-02-08 01:06:32,866 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-02-08 01:06:32,938 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 9. [2025-02-08 01:06:32,971 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 01:06:32,971 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 01:06:32,971 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 01:06:32,972 INFO L158 Benchmark]: Toolchain (without parser) took 27052.55ms. Allocated memory was 167.8MB in the beginning and 2.4GB in the end (delta: 2.2GB). Free memory was 124.2MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 872.1MB. Max. memory is 16.1GB. [2025-02-08 01:06:32,972 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 117.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 01:06:32,972 INFO L158 Benchmark]: CACSL2BoogieTranslator took 488.41ms. Allocated memory is still 167.8MB. Free memory was 124.2MB in the beginning and 101.3MB in the end (delta: 23.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-08 01:06:32,972 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.25ms. Allocated memory is still 167.8MB. Free memory was 101.3MB in the beginning and 98.4MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 01:06:32,972 INFO L158 Benchmark]: Boogie Preprocessor took 41.88ms. Allocated memory is still 167.8MB. Free memory was 98.4MB in the beginning and 95.6MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 01:06:32,974 INFO L158 Benchmark]: IcfgBuilder took 569.09ms. Allocated memory is still 167.8MB. Free memory was 95.6MB in the beginning and 45.2MB in the end (delta: 50.3MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-02-08 01:06:32,975 INFO L158 Benchmark]: TraceAbstraction took 25792.14ms. Allocated memory was 167.8MB in the beginning and 2.4GB in the end (delta: 2.2GB). Free memory was 45.2MB in the beginning and 1.5GB in the end (delta: -1.5GB). Peak memory consumption was 779.9MB. Max. memory is 16.1GB. [2025-02-08 01:06:32,976 INFO L158 Benchmark]: Witness Printer took 106.94ms. Allocated memory is still 2.4GB. Free memory was 1.5GB in the beginning and 1.5GB in the end (delta: 20.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 01:06:32,978 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.18ms. Allocated memory is still 201.3MB. Free memory is still 117.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 488.41ms. Allocated memory is still 167.8MB. Free memory was 124.2MB in the beginning and 101.3MB in the end (delta: 23.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.25ms. Allocated memory is still 167.8MB. Free memory was 101.3MB in the beginning and 98.4MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 41.88ms. Allocated memory is still 167.8MB. Free memory was 98.4MB in the beginning and 95.6MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 569.09ms. Allocated memory is still 167.8MB. Free memory was 95.6MB in the beginning and 45.2MB in the end (delta: 50.3MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * TraceAbstraction took 25792.14ms. Allocated memory was 167.8MB in the beginning and 2.4GB in the end (delta: 2.2GB). Free memory was 45.2MB in the beginning and 1.5GB in the end (delta: -1.5GB). Peak memory consumption was 779.9MB. Max. memory is 16.1GB. * Witness Printer took 106.94ms. Allocated memory is still 2.4GB. Free memory was 1.5GB in the beginning and 1.5GB in the end (delta: 20.7MB). 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; [L710] 0 _Bool main$tmp_guard0; [L711] 0 _Bool main$tmp_guard1; [L713] 0 int x = 0; [L715] 0 int y = 0; [L716] 0 _Bool y$flush_delayed; [L717] 0 int y$mem_tmp; [L718] 0 _Bool y$r_buff0_thd0; [L719] 0 _Bool y$r_buff0_thd1; [L720] 0 _Bool y$r_buff0_thd2; [L721] 0 _Bool y$r_buff0_thd3; [L722] 0 _Bool y$r_buff1_thd0; [L723] 0 _Bool y$r_buff1_thd1; [L724] 0 _Bool y$r_buff1_thd2; [L725] 0 _Bool y$r_buff1_thd3; [L726] 0 _Bool y$read_delayed; [L727] 0 int *y$read_delayed_var; [L728] 0 int y$w_buff0; [L729] 0 _Bool y$w_buff0_used; [L730] 0 int y$w_buff1; [L731] 0 _Bool y$w_buff1_used; [L733] 0 int z = 0; [L734] 0 _Bool weak$$choice0; [L735] 0 _Bool weak$$choice2; [L811] 0 pthread_t t2492; [L812] FCALL, FORK 0 pthread_create(&t2492, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2492=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L813] 0 pthread_t t2493; [L814] FCALL, FORK 0 pthread_create(&t2493, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2492=0, t2493=1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L815] 0 pthread_t t2494; [L816] FCALL, FORK 0 pthread_create(&t2494, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2492=0, t2493=1, t2494=2, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L774] 3 y$w_buff1 = y$w_buff0 [L775] 3 y$w_buff0 = 2 [L776] 3 y$w_buff1_used = y$w_buff0_used [L777] 3 y$w_buff0_used = (_Bool)1 [L778] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L778] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L779] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L780] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L781] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L782] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L783] 3 y$r_buff0_thd3 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L786] 3 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L739] 1 z = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L742] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L754] 2 x = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L757] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L760] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L761] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L762] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L763] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L764] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L789] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L790] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L791] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L792] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L793] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L796] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L767] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2492=0, t2493=1, t2494=2, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L820] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L820] RET 0 assume_abort_if_not(main$tmp_guard0) [L822] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L823] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L824] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L825] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L826] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2492=0, t2493=1, t2494=2, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L829] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L830] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L831] 0 y$flush_delayed = weak$$choice2 [L832] 0 y$mem_tmp = y [L833] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L834] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L835] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L836] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L837] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L838] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L839] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) [L841] 0 y = y$flush_delayed ? y$mem_tmp : y [L842] 0 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2492=0, t2493=1, t2494=2, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L844] 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, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L18] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] - 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: 812]: 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: 816]: 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: 814]: 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, 64 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: 25.6s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 19.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1104 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1096 mSDsluCounter, 99 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 89 mSDsCounter, 92 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3462 IncrementalHoareTripleChecker+Invalid, 3554 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 92 mSolverCounterUnsat, 10 mSDtfsCounter, 3462 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 133 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1120occurred in iteration=11, InterpolantAutomatonStates: 116, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.6s InterpolantComputationTime, 327 NumberOfCodeBlocks, 327 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 283 ConstructedInterpolants, 0 QuantifiedInterpolants, 2611 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-02-08 01:06:32,997 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE