./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix040.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/mix040.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 9adb0e975425d9a1b173bce1a766592f39d0541cd50cefd6e228e1140c2f9f3e --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 02:07:31,945 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 02:07:31,998 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 02:07:32,002 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 02:07:32,002 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 02:07:32,017 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 02:07:32,018 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 02:07:32,018 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 02:07:32,019 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 02:07:32,019 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 02:07:32,019 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 02:07:32,019 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 02:07:32,020 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 02:07:32,020 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 02:07:32,020 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 02:07:32,020 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 02:07:32,020 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 02:07:32,020 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 02:07:32,020 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 02:07:32,020 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 02:07:32,020 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 02:07:32,020 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 02:07:32,020 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 02:07:32,020 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 02:07:32,020 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 02:07:32,020 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 02:07:32,020 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 02:07:32,020 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 02:07:32,020 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 02:07:32,020 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 02:07:32,020 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 02:07:32,020 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 02:07:32,021 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:07:32,021 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 02:07:32,021 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 02:07:32,021 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 02:07:32,021 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 02:07:32,021 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 02:07:32,021 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 02:07:32,021 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 02:07:32,021 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 02:07:32,021 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 02:07:32,021 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 02:07:32,021 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/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 -> 9adb0e975425d9a1b173bce1a766592f39d0541cd50cefd6e228e1140c2f9f3e [2025-03-04 02:07:32,241 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 02:07:32,248 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 02:07:32,250 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 02:07:32,251 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 02:07:32,252 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 02:07:32,252 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix040.opt.i [2025-03-04 02:07:33,458 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3bd554090/9ee8fc54c6e141169481df2f67f99a4b/FLAG63293af65 [2025-03-04 02:07:33,768 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 02:07:33,769 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix040.opt.i [2025-03-04 02:07:33,789 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3bd554090/9ee8fc54c6e141169481df2f67f99a4b/FLAG63293af65 [2025-03-04 02:07:34,020 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3bd554090/9ee8fc54c6e141169481df2f67f99a4b [2025-03-04 02:07:34,022 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 02:07:34,023 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 02:07:34,024 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 02:07:34,024 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 02:07:34,027 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 02:07:34,027 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:07:34" (1/1) ... [2025-03-04 02:07:34,028 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f23a3b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:07:34, skipping insertion in model container [2025-03-04 02:07:34,030 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:07:34" (1/1) ... [2025-03-04 02:07:34,059 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 02:07:34,173 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix040.opt.i[944,957] [2025-03-04 02:07:34,288 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:07:34,298 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 02:07:34,309 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix040.opt.i[944,957] [2025-03-04 02:07:34,350 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:07:34,374 INFO L204 MainTranslator]: Completed translation [2025-03-04 02:07:34,374 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:07:34 WrapperNode [2025-03-04 02:07:34,375 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 02:07:34,375 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 02:07:34,375 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 02:07:34,375 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 02:07:34,380 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:07:34" (1/1) ... [2025-03-04 02:07:34,389 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:07:34" (1/1) ... [2025-03-04 02:07:34,412 INFO L138 Inliner]: procedures = 176, calls = 55, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 134 [2025-03-04 02:07:34,413 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 02:07:34,413 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 02:07:34,413 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 02:07:34,413 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 02:07:34,420 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:07:34" (1/1) ... [2025-03-04 02:07:34,420 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:07:34" (1/1) ... [2025-03-04 02:07:34,422 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:07:34" (1/1) ... [2025-03-04 02:07:34,438 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-03-04 02:07:34,439 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:07:34" (1/1) ... [2025-03-04 02:07:34,439 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:07:34" (1/1) ... [2025-03-04 02:07:34,443 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:07:34" (1/1) ... [2025-03-04 02:07:34,444 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:07:34" (1/1) ... [2025-03-04 02:07:34,445 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:07:34" (1/1) ... [2025-03-04 02:07:34,446 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:07:34" (1/1) ... [2025-03-04 02:07:34,448 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 02:07:34,448 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 02:07:34,448 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 02:07:34,448 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 02:07:34,449 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:07:34" (1/1) ... [2025-03-04 02:07:34,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:07:34,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:07:34,483 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 02:07:34,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 02:07:34,505 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 02:07:34,505 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 02:07:34,505 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-03-04 02:07:34,505 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-03-04 02:07:34,505 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-03-04 02:07:34,506 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-03-04 02:07:34,506 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-03-04 02:07:34,506 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-03-04 02:07:34,506 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2025-03-04 02:07:34,506 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2025-03-04 02:07:34,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 02:07:34,507 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 02:07:34,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 02:07:34,507 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 02:07:34,508 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 02:07:34,624 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 02:07:34,626 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 02:07:34,860 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 02:07:34,860 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 02:07:34,984 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 02:07:34,984 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 02:07:34,984 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:07:34 BoogieIcfgContainer [2025-03-04 02:07:34,984 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 02:07:34,986 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 02:07:34,986 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 02:07:34,990 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 02:07:34,991 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:07:34" (1/3) ... [2025-03-04 02:07:34,991 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34987124 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:07:34, skipping insertion in model container [2025-03-04 02:07:34,992 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:07:34" (2/3) ... [2025-03-04 02:07:34,992 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34987124 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:07:34, skipping insertion in model container [2025-03-04 02:07:34,992 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:07:34" (3/3) ... [2025-03-04 02:07:34,993 INFO L128 eAbstractionObserver]: Analyzing ICFG mix040.opt.i [2025-03-04 02:07:35,005 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 02:07:35,008 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix040.opt.i that has 5 procedures, 50 locations, 1 initial locations, 0 loop locations, and 2 error locations. [2025-03-04 02:07:35,008 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 02:07:35,064 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 02:07:35,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 50 transitions, 116 flow [2025-03-04 02:07:35,123 INFO L124 PetriNetUnfolderBase]: 1/46 cut-off events. [2025-03-04 02:07:35,126 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 02:07:35,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 46 events. 1/46 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 99 event pairs, 0 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 50. Up to 2 conditions per place. [2025-03-04 02:07:35,132 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 50 transitions, 116 flow [2025-03-04 02:07:35,135 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 46 transitions, 104 flow [2025-03-04 02:07:35,145 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:07:35,158 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;@1fceac4f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:07:35,158 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-04 02:07:35,172 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 02:07:35,172 INFO L124 PetriNetUnfolderBase]: 0/27 cut-off events. [2025-03-04 02:07:35,172 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 02:07:35,172 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:07:35,173 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:07:35,173 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 02:07:35,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:07:35,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1859448620, now seen corresponding path program 1 times [2025-03-04 02:07:35,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:07:35,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779337995] [2025-03-04 02:07:35,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:07:35,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:07:35,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 02:07:35,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 02:07:35,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:07:35,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:07:35,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:07:35,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:07:35,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779337995] [2025-03-04 02:07:35,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779337995] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:07:35,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:07:35,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 02:07:35,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40732042] [2025-03-04 02:07:35,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:07:35,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:07:35,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:07:35,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:07:35,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:07:35,648 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 50 [2025-03-04 02:07:35,649 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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-03-04 02:07:35,649 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:07:35,650 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 50 [2025-03-04 02:07:35,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:07:39,319 INFO L124 PetriNetUnfolderBase]: 46139/61177 cut-off events. [2025-03-04 02:07:39,319 INFO L125 PetriNetUnfolderBase]: For 228/228 co-relation queries the response was YES. [2025-03-04 02:07:39,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122181 conditions, 61177 events. 46139/61177 cut-off events. For 228/228 co-relation queries the response was YES. Maximal size of possible extension queue 1796. Compared 351487 event pairs, 5315 based on Foata normal form. 1728/62605 useless extension candidates. Maximal degree in co-relation 122169. Up to 52921 conditions per place. [2025-03-04 02:07:39,599 INFO L140 encePairwiseOnDemand]: 46/50 looper letters, 55 selfloop transitions, 2 changer transitions 2/66 dead transitions. [2025-03-04 02:07:39,599 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 66 transitions, 262 flow [2025-03-04 02:07:39,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:07:39,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:07:39,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2025-03-04 02:07:39,612 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6333333333333333 [2025-03-04 02:07:39,613 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 104 flow. Second operand 3 states and 95 transitions. [2025-03-04 02:07:39,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 66 transitions, 262 flow [2025-03-04 02:07:39,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 66 transitions, 258 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 02:07:39,626 INFO L231 Difference]: Finished difference. Result has 55 places, 43 transitions, 98 flow [2025-03-04 02:07:39,629 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=55, PETRI_TRANSITIONS=43} [2025-03-04 02:07:39,632 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, -3 predicate places. [2025-03-04 02:07:39,633 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 43 transitions, 98 flow [2025-03-04 02:07:39,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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-03-04 02:07:39,634 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:07:39,634 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:07:39,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 02:07:39,635 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 02:07:39,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:07:39,636 INFO L85 PathProgramCache]: Analyzing trace with hash 393302342, now seen corresponding path program 1 times [2025-03-04 02:07:39,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:07:39,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128940884] [2025-03-04 02:07:39,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:07:39,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:07:39,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 02:07:39,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 02:07:39,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:07:39,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:07:39,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:07:39,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:07:39,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128940884] [2025-03-04 02:07:39,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128940884] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:07:39,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:07:39,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:07:39,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282640813] [2025-03-04 02:07:39,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:07:39,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:07:39,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:07:39,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:07:39,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:07:39,836 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 50 [2025-03-04 02:07:39,836 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 43 transitions, 98 flow. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 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-03-04 02:07:39,836 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:07:39,836 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 50 [2025-03-04 02:07:39,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:07:42,493 INFO L124 PetriNetUnfolderBase]: 37115/53609 cut-off events. [2025-03-04 02:07:42,493 INFO L125 PetriNetUnfolderBase]: For 1408/1408 co-relation queries the response was YES. [2025-03-04 02:07:42,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105075 conditions, 53609 events. 37115/53609 cut-off events. For 1408/1408 co-relation queries the response was YES. Maximal size of possible extension queue 1745. Compared 370107 event pairs, 5075 based on Foata normal form. 1728/53937 useless extension candidates. Maximal degree in co-relation 105065. Up to 28201 conditions per place. [2025-03-04 02:07:42,754 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 77 selfloop transitions, 6 changer transitions 1/91 dead transitions. [2025-03-04 02:07:42,754 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 91 transitions, 372 flow [2025-03-04 02:07:42,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 02:07:42,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 02:07:42,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 130 transitions. [2025-03-04 02:07:42,755 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.65 [2025-03-04 02:07:42,755 INFO L175 Difference]: Start difference. First operand has 55 places, 43 transitions, 98 flow. Second operand 4 states and 130 transitions. [2025-03-04 02:07:42,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 91 transitions, 372 flow [2025-03-04 02:07:42,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 91 transitions, 364 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 02:07:42,768 INFO L231 Difference]: Finished difference. Result has 57 places, 47 transitions, 136 flow [2025-03-04 02:07:42,768 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=136, PETRI_PLACES=57, PETRI_TRANSITIONS=47} [2025-03-04 02:07:42,769 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, -1 predicate places. [2025-03-04 02:07:42,769 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 47 transitions, 136 flow [2025-03-04 02:07:42,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 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-03-04 02:07:42,769 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:07:42,769 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-03-04 02:07:42,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 02:07:42,770 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 02:07:42,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:07:42,772 INFO L85 PathProgramCache]: Analyzing trace with hash -70527447, now seen corresponding path program 1 times [2025-03-04 02:07:42,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:07:42,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654561073] [2025-03-04 02:07:42,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:07:42,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:07:42,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 02:07:42,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 02:07:42,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:07:42,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:07:42,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:07:42,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:07:42,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654561073] [2025-03-04 02:07:42,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654561073] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:07:42,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:07:42,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:07:42,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144632225] [2025-03-04 02:07:42,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:07:42,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:07:42,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:07:42,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:07:42,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:07:42,943 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 50 [2025-03-04 02:07:42,943 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 47 transitions, 136 flow. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 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-03-04 02:07:42,943 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:07:42,943 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 50 [2025-03-04 02:07:42,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:07:44,670 INFO L124 PetriNetUnfolderBase]: 23963/34441 cut-off events. [2025-03-04 02:07:44,671 INFO L125 PetriNetUnfolderBase]: For 6790/6790 co-relation queries the response was YES. [2025-03-04 02:07:44,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76601 conditions, 34441 events. 23963/34441 cut-off events. For 6790/6790 co-relation queries the response was YES. Maximal size of possible extension queue 912. Compared 217985 event pairs, 2975 based on Foata normal form. 1344/35089 useless extension candidates. Maximal degree in co-relation 76589. Up to 12361 conditions per place. [2025-03-04 02:07:44,792 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 100 selfloop transitions, 10 changer transitions 1/118 dead transitions. [2025-03-04 02:07:44,792 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 118 transitions, 529 flow [2025-03-04 02:07:44,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:07:44,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:07:44,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 168 transitions. [2025-03-04 02:07:44,793 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.672 [2025-03-04 02:07:44,793 INFO L175 Difference]: Start difference. First operand has 57 places, 47 transitions, 136 flow. Second operand 5 states and 168 transitions. [2025-03-04 02:07:44,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 118 transitions, 529 flow [2025-03-04 02:07:44,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 118 transitions, 518 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-04 02:07:44,805 INFO L231 Difference]: Finished difference. Result has 61 places, 51 transitions, 188 flow [2025-03-04 02:07:44,805 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=188, PETRI_PLACES=61, PETRI_TRANSITIONS=51} [2025-03-04 02:07:44,806 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 3 predicate places. [2025-03-04 02:07:44,807 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 51 transitions, 188 flow [2025-03-04 02:07:44,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 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-03-04 02:07:44,807 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:07:44,807 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-03-04 02:07:44,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 02:07:44,807 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 02:07:44,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:07:44,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1935866008, now seen corresponding path program 1 times [2025-03-04 02:07:44,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:07:44,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291643141] [2025-03-04 02:07:44,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:07:44,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:07:44,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 02:07:44,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 02:07:44,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:07:44,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:07:44,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:07:44,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:07:44,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291643141] [2025-03-04 02:07:44,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291643141] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:07:44,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:07:44,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:07:44,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102770729] [2025-03-04 02:07:44,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:07:44,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:07:44,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:07:44,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:07:44,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-04 02:07:44,975 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 50 [2025-03-04 02:07:44,975 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 51 transitions, 188 flow. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 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-03-04 02:07:44,975 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:07:44,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 50 [2025-03-04 02:07:44,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:07:46,068 INFO L124 PetriNetUnfolderBase]: 14779/20713 cut-off events. [2025-03-04 02:07:46,068 INFO L125 PetriNetUnfolderBase]: For 12838/12838 co-relation queries the response was YES. [2025-03-04 02:07:46,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50693 conditions, 20713 events. 14779/20713 cut-off events. For 12838/12838 co-relation queries the response was YES. Maximal size of possible extension queue 536. Compared 114482 event pairs, 2591 based on Foata normal form. 640/21137 useless extension candidates. Maximal degree in co-relation 50679. Up to 6144 conditions per place. [2025-03-04 02:07:46,171 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 121 selfloop transitions, 14 changer transitions 1/143 dead transitions. [2025-03-04 02:07:46,172 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 143 transitions, 692 flow [2025-03-04 02:07:46,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:07:46,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 02:07:46,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 204 transitions. [2025-03-04 02:07:46,175 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.68 [2025-03-04 02:07:46,175 INFO L175 Difference]: Start difference. First operand has 61 places, 51 transitions, 188 flow. Second operand 6 states and 204 transitions. [2025-03-04 02:07:46,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 143 transitions, 692 flow [2025-03-04 02:07:46,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 143 transitions, 662 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-03-04 02:07:46,323 INFO L231 Difference]: Finished difference. Result has 64 places, 55 transitions, 238 flow [2025-03-04 02:07:46,323 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=238, PETRI_PLACES=64, PETRI_TRANSITIONS=55} [2025-03-04 02:07:46,324 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 6 predicate places. [2025-03-04 02:07:46,324 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 55 transitions, 238 flow [2025-03-04 02:07:46,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 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-03-04 02:07:46,324 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:07:46,324 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:07:46,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 02:07:46,324 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 02:07:46,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:07:46,325 INFO L85 PathProgramCache]: Analyzing trace with hash -2003092549, now seen corresponding path program 1 times [2025-03-04 02:07:46,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:07:46,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706612829] [2025-03-04 02:07:46,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:07:46,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:07:46,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 02:07:46,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 02:07:46,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:07:46,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:07:46,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:07:46,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:07:46,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706612829] [2025-03-04 02:07:46,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706612829] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:07:46,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:07:46,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 02:07:46,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544893634] [2025-03-04 02:07:46,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:07:46,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 02:07:46,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:07:46,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 02:07:46,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 02:07:46,546 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 50 [2025-03-04 02:07:46,546 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 55 transitions, 238 flow. Second operand has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 7 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:07:46,546 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:07:46,546 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 50 [2025-03-04 02:07:46,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:07:47,607 INFO L124 PetriNetUnfolderBase]: 11683/15985 cut-off events. [2025-03-04 02:07:47,608 INFO L125 PetriNetUnfolderBase]: For 12446/12446 co-relation queries the response was YES. [2025-03-04 02:07:47,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40550 conditions, 15985 events. 11683/15985 cut-off events. For 12446/12446 co-relation queries the response was YES. Maximal size of possible extension queue 503. Compared 83395 event pairs, 2399 based on Foata normal form. 160/16073 useless extension candidates. Maximal degree in co-relation 40535. Up to 6144 conditions per place. [2025-03-04 02:07:47,718 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 104 selfloop transitions, 18 changer transitions 1/130 dead transitions. [2025-03-04 02:07:47,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 130 transitions, 650 flow [2025-03-04 02:07:47,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 02:07:47,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 02:07:47,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 202 transitions. [2025-03-04 02:07:47,721 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5771428571428572 [2025-03-04 02:07:47,721 INFO L175 Difference]: Start difference. First operand has 64 places, 55 transitions, 238 flow. Second operand 7 states and 202 transitions. [2025-03-04 02:07:47,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 130 transitions, 650 flow [2025-03-04 02:07:47,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 130 transitions, 604 flow, removed 9 selfloop flow, removed 5 redundant places. [2025-03-04 02:07:47,951 INFO L231 Difference]: Finished difference. Result has 67 places, 55 transitions, 248 flow [2025-03-04 02:07:47,951 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=248, PETRI_PLACES=67, PETRI_TRANSITIONS=55} [2025-03-04 02:07:47,952 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 9 predicate places. [2025-03-04 02:07:47,952 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 55 transitions, 248 flow [2025-03-04 02:07:47,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 7 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:07:47,952 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:07:47,952 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:07:47,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 02:07:47,952 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 02:07:47,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:07:47,953 INFO L85 PathProgramCache]: Analyzing trace with hash 841947721, now seen corresponding path program 1 times [2025-03-04 02:07:47,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:07:47,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322396922] [2025-03-04 02:07:47,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:07:47,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:07:47,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-04 02:07:48,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 02:07:48,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:07:48,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:07:48,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:07:48,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:07:48,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322396922] [2025-03-04 02:07:48,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322396922] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:07:48,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:07:48,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 02:07:48,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216273019] [2025-03-04 02:07:48,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:07:48,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:07:48,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:07:48,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:07:48,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 02:07:48,217 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 50 [2025-03-04 02:07:48,217 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 55 transitions, 248 flow. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:07:48,217 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:07:48,217 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 50 [2025-03-04 02:07:48,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:07:49,887 INFO L124 PetriNetUnfolderBase]: 23753/32573 cut-off events. [2025-03-04 02:07:49,887 INFO L125 PetriNetUnfolderBase]: For 26080/26080 co-relation queries the response was YES. [2025-03-04 02:07:50,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83515 conditions, 32573 events. 23753/32573 cut-off events. For 26080/26080 co-relation queries the response was YES. Maximal size of possible extension queue 970. Compared 188221 event pairs, 4435 based on Foata normal form. 32/32508 useless extension candidates. Maximal degree in co-relation 83499. Up to 14103 conditions per place. [2025-03-04 02:07:50,101 INFO L140 encePairwiseOnDemand]: 39/50 looper letters, 100 selfloop transitions, 9 changer transitions 42/157 dead transitions. [2025-03-04 02:07:50,101 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 157 transitions, 1014 flow [2025-03-04 02:07:50,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 02:07:50,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 02:07:50,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 197 transitions. [2025-03-04 02:07:50,102 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4925 [2025-03-04 02:07:50,102 INFO L175 Difference]: Start difference. First operand has 67 places, 55 transitions, 248 flow. Second operand 8 states and 197 transitions. [2025-03-04 02:07:50,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 157 transitions, 1014 flow [2025-03-04 02:07:50,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 157 transitions, 732 flow, removed 51 selfloop flow, removed 10 redundant places. [2025-03-04 02:07:50,662 INFO L231 Difference]: Finished difference. Result has 71 places, 61 transitions, 222 flow [2025-03-04 02:07:50,662 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=222, PETRI_PLACES=71, PETRI_TRANSITIONS=61} [2025-03-04 02:07:50,663 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 13 predicate places. [2025-03-04 02:07:50,663 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 61 transitions, 222 flow [2025-03-04 02:07:50,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:07:50,663 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:07:50,663 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:07:50,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 02:07:50,663 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 02:07:50,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:07:50,664 INFO L85 PathProgramCache]: Analyzing trace with hash -548708979, now seen corresponding path program 2 times [2025-03-04 02:07:50,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:07:50,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933053834] [2025-03-04 02:07:50,664 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:07:50,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:07:50,675 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 1 equivalence classes. [2025-03-04 02:07:50,722 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 02:07:50,722 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:07:50,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:07:50,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:07:50,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:07:50,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933053834] [2025-03-04 02:07:50,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933053834] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:07:50,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:07:50,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 02:07:50,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429235564] [2025-03-04 02:07:50,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:07:50,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:07:50,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:07:50,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:07:50,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 02:07:50,935 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 50 [2025-03-04 02:07:50,936 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 61 transitions, 222 flow. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:07:50,936 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:07:50,936 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 50 [2025-03-04 02:07:50,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:07:52,190 INFO L124 PetriNetUnfolderBase]: 16697/23190 cut-off events. [2025-03-04 02:07:52,190 INFO L125 PetriNetUnfolderBase]: For 8891/8892 co-relation queries the response was YES. [2025-03-04 02:07:52,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57726 conditions, 23190 events. 16697/23190 cut-off events. For 8891/8892 co-relation queries the response was YES. Maximal size of possible extension queue 648. Compared 126332 event pairs, 3439 based on Foata normal form. 16/23200 useless extension candidates. Maximal degree in co-relation 57708. Up to 14748 conditions per place. [2025-03-04 02:07:52,327 INFO L140 encePairwiseOnDemand]: 45/50 looper letters, 66 selfloop transitions, 1 changer transitions 67/140 dead transitions. [2025-03-04 02:07:52,328 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 140 transitions, 767 flow [2025-03-04 02:07:52,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:07:52,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 02:07:52,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 153 transitions. [2025-03-04 02:07:52,329 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.51 [2025-03-04 02:07:52,329 INFO L175 Difference]: Start difference. First operand has 71 places, 61 transitions, 222 flow. Second operand 6 states and 153 transitions. [2025-03-04 02:07:52,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 140 transitions, 767 flow [2025-03-04 02:07:52,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 140 transitions, 743 flow, removed 8 selfloop flow, removed 5 redundant places. [2025-03-04 02:07:52,335 INFO L231 Difference]: Finished difference. Result has 71 places, 60 transitions, 214 flow [2025-03-04 02:07:52,335 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=214, PETRI_PLACES=71, PETRI_TRANSITIONS=60} [2025-03-04 02:07:52,336 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 13 predicate places. [2025-03-04 02:07:52,336 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 60 transitions, 214 flow [2025-03-04 02:07:52,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:07:52,336 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:07:52,336 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:07:52,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 02:07:52,336 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 02:07:52,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:07:52,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1857966229, now seen corresponding path program 3 times [2025-03-04 02:07:52,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:07:52,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137496155] [2025-03-04 02:07:52,337 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:07:52,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:07:52,346 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 1 equivalence classes. [2025-03-04 02:07:52,381 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 02:07:52,381 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 02:07:52,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:07:52,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:07:52,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:07:52,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137496155] [2025-03-04 02:07:52,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137496155] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:07:52,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:07:52,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 02:07:52,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628895806] [2025-03-04 02:07:52,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:07:52,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:07:52,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:07:52,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:07:52,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 02:07:52,584 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 50 [2025-03-04 02:07:52,584 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 60 transitions, 214 flow. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:07:52,584 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:07:52,584 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 50 [2025-03-04 02:07:52,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:07:53,660 INFO L124 PetriNetUnfolderBase]: 16487/23085 cut-off events. [2025-03-04 02:07:53,660 INFO L125 PetriNetUnfolderBase]: For 9318/9320 co-relation queries the response was YES. [2025-03-04 02:07:53,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56695 conditions, 23085 events. 16487/23085 cut-off events. For 9318/9320 co-relation queries the response was YES. Maximal size of possible extension queue 701. Compared 129602 event pairs, 3395 based on Foata normal form. 16/23082 useless extension candidates. Maximal degree in co-relation 56677. Up to 12540 conditions per place. [2025-03-04 02:07:53,793 INFO L140 encePairwiseOnDemand]: 40/50 looper letters, 68 selfloop transitions, 6 changer transitions 60/140 dead transitions. [2025-03-04 02:07:53,793 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 140 transitions, 743 flow [2025-03-04 02:07:53,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:07:53,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 02:07:53,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 159 transitions. [2025-03-04 02:07:53,794 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.53 [2025-03-04 02:07:53,794 INFO L175 Difference]: Start difference. First operand has 71 places, 60 transitions, 214 flow. Second operand 6 states and 159 transitions. [2025-03-04 02:07:53,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 140 transitions, 743 flow [2025-03-04 02:07:53,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 140 transitions, 731 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-03-04 02:07:53,800 INFO L231 Difference]: Finished difference. Result has 73 places, 55 transitions, 210 flow [2025-03-04 02:07:53,800 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=210, PETRI_PLACES=73, PETRI_TRANSITIONS=55} [2025-03-04 02:07:53,801 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 15 predicate places. [2025-03-04 02:07:53,801 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 55 transitions, 210 flow [2025-03-04 02:07:53,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:07:53,801 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:07:53,801 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:07:53,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 02:07:53,801 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 02:07:53,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:07:53,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1148497623, now seen corresponding path program 4 times [2025-03-04 02:07:53,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:07:53,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561225820] [2025-03-04 02:07:53,802 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:07:53,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:07:53,811 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 38 statements into 2 equivalence classes. [2025-03-04 02:07:53,840 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 02:07:53,841 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:07:53,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 02:07:53,841 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 02:07:53,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-04 02:07:53,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 02:07:53,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:07:53,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 02:07:53,895 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 02:07:53,895 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 02:07:53,896 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2025-03-04 02:07:53,897 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2025-03-04 02:07:53,898 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2025-03-04 02:07:53,898 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2025-03-04 02:07:53,898 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2025-03-04 02:07:53,898 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2025-03-04 02:07:53,898 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2025-03-04 02:07:53,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 02:07:53,898 INFO L422 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2025-03-04 02:07:53,988 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 02:07:53,988 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 02:07:53,995 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 02:07:53 BasicIcfg [2025-03-04 02:07:53,995 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 02:07:53,996 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 02:07:53,996 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 02:07:53,996 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 02:07:53,996 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:07:34" (3/4) ... [2025-03-04 02:07:53,997 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-04 02:07:54,072 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 9. [2025-03-04 02:07:54,111 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 02:07:54,112 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 02:07:54,113 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 02:07:54,114 INFO L158 Benchmark]: Toolchain (without parser) took 20090.77ms. Allocated memory was 201.3MB in the beginning and 3.9GB in the end (delta: 3.7GB). Free memory was 153.4MB in the beginning and 1.5GB in the end (delta: -1.3GB). Peak memory consumption was 2.3GB. Max. memory is 16.1GB. [2025-03-04 02:07:54,114 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 117.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 02:07:54,114 INFO L158 Benchmark]: CACSL2BoogieTranslator took 351.29ms. Allocated memory is still 201.3MB. Free memory was 153.4MB in the beginning and 130.2MB in the end (delta: 23.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-04 02:07:54,114 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.29ms. Allocated memory is still 201.3MB. Free memory was 130.2MB in the beginning and 128.0MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 02:07:54,115 INFO L158 Benchmark]: Boogie Preprocessor took 34.76ms. Allocated memory is still 201.3MB. Free memory was 128.0MB in the beginning and 125.4MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 02:07:54,115 INFO L158 Benchmark]: IcfgBuilder took 535.88ms. Allocated memory is still 201.3MB. Free memory was 125.4MB in the beginning and 74.4MB in the end (delta: 50.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-04 02:07:54,116 INFO L158 Benchmark]: TraceAbstraction took 19009.12ms. Allocated memory was 201.3MB in the beginning and 3.9GB in the end (delta: 3.7GB). Free memory was 73.8MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 2.2GB. Max. memory is 16.1GB. [2025-03-04 02:07:54,116 INFO L158 Benchmark]: Witness Printer took 117.17ms. Allocated memory is still 3.9GB. Free memory was 1.5GB in the beginning and 1.5GB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-04 02:07:54,117 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.23ms. Allocated memory is still 201.3MB. Free memory is still 117.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 351.29ms. Allocated memory is still 201.3MB. Free memory was 153.4MB in the beginning and 130.2MB in the end (delta: 23.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.29ms. Allocated memory is still 201.3MB. Free memory was 130.2MB in the beginning and 128.0MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 34.76ms. Allocated memory is still 201.3MB. Free memory was 128.0MB in the beginning and 125.4MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 535.88ms. Allocated memory is still 201.3MB. Free memory was 125.4MB in the beginning and 74.4MB in the end (delta: 50.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 19009.12ms. Allocated memory was 201.3MB in the beginning and 3.9GB in the end (delta: 3.7GB). Free memory was 73.8MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 2.2GB. Max. memory is 16.1GB. * Witness Printer took 117.17ms. Allocated memory is still 3.9GB. Free memory was 1.5GB in the beginning and 1.5GB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p2_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L720] 0 int b = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L728] 0 int z = 0; [L729] 0 _Bool z$flush_delayed; [L730] 0 int z$mem_tmp; [L731] 0 _Bool z$r_buff0_thd0; [L732] 0 _Bool z$r_buff0_thd1; [L733] 0 _Bool z$r_buff0_thd2; [L734] 0 _Bool z$r_buff0_thd3; [L735] 0 _Bool z$r_buff0_thd4; [L736] 0 _Bool z$r_buff1_thd0; [L737] 0 _Bool z$r_buff1_thd1; [L738] 0 _Bool z$r_buff1_thd2; [L739] 0 _Bool z$r_buff1_thd3; [L740] 0 _Bool z$r_buff1_thd4; [L741] 0 _Bool z$read_delayed; [L742] 0 int *z$read_delayed_var; [L743] 0 int z$w_buff0; [L744] 0 _Bool z$w_buff0_used; [L745] 0 int z$w_buff1; [L746] 0 _Bool z$w_buff1_used; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L854] 0 pthread_t t1061; [L855] FCALL, FORK 0 pthread_create(&t1061, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1061=-2, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L856] 0 pthread_t t1062; [L857] FCALL, FORK 0 pthread_create(&t1062, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1061=-2, t1062=-1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L858] 0 pthread_t t1063; [L859] FCALL, FORK 0 pthread_create(&t1063, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1061=-2, t1062=-1, t1063=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L860] 0 pthread_t t1064; [L861] FCALL, FORK 0 pthread_create(&t1064, ((void *)0), P3, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1061=-2, t1062=-1, t1063=0, t1064=1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L810] 4 z$w_buff1 = z$w_buff0 [L811] 4 z$w_buff0 = 1 [L812] 4 z$w_buff1_used = z$w_buff0_used [L813] 4 z$w_buff0_used = (_Bool)1 [L814] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L814] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L815] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L816] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L817] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L818] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L819] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L820] 4 z$r_buff0_thd4 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L823] 4 a = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L826] 4 __unbuffered_p3_EAX = a VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L829] 4 __unbuffered_p3_EBX = b VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L752] 1 b = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L755] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L767] 2 x = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L770] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L782] 3 y = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L785] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L786] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L787] 3 z$flush_delayed = weak$$choice2 [L788] 3 z$mem_tmp = z [L789] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L790] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L791] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L792] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L793] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L794] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L795] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L796] 3 __unbuffered_p2_EAX = z [L797] 3 z = z$flush_delayed ? z$mem_tmp : z [L798] 3 z$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L832] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L833] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L834] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L835] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L836] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L839] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L863] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1061=-2, t1062=-1, t1063=0, t1064=1, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L865] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L865] RET 0 assume_abort_if_not(main$tmp_guard0) [L867] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L868] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L869] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L870] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L871] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1061=-2, t1062=-1, t1063=0, t1064=1, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L874] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1061=-2, t1062=-1, t1063=0, t1064=1, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L876] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L18] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 857]: 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: 861]: 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: 859]: 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: 855]: 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 9 procedures, 85 locations, 7 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: 18.8s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 16.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 801 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 794 mSDsluCounter, 40 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 30 mSDsCounter, 32 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1529 IncrementalHoareTripleChecker+Invalid, 1561 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 32 mSolverCounterUnsat, 10 mSDtfsCounter, 1529 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=248occurred in iteration=5, InterpolantAutomatonStates: 45, 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, 1.5s InterpolantComputationTime, 256 NumberOfCodeBlocks, 256 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 210 ConstructedInterpolants, 0 QuantifiedInterpolants, 870 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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-03-04 02:07:54,135 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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