/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/weaver/popl20-more-buffer-series3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-14 01:15:35,587 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 01:15:35,634 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-14 01:15:35,638 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 01:15:35,638 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 01:15:35,655 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 01:15:35,656 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 01:15:35,656 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 01:15:35,656 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-14 01:15:35,657 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-14 01:15:35,657 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 01:15:35,657 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 01:15:35,658 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 01:15:35,658 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 01:15:35,658 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 01:15:35,658 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 01:15:35,658 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 01:15:35,658 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 01:15:35,658 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 01:15:35,658 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 01:15:35,658 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 01:15:35,659 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 01:15:35,659 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 01:15:35,659 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 01:15:35,659 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 01:15:35,659 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 01:15:35,659 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 01:15:35,659 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 01:15:35,659 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 01:15:35,659 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 01:15:35,659 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 01:15:35,659 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 01:15:35,659 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 01:15:35,659 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 01:15:35,659 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 01:15:35,659 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 01:15:35,659 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 01:15:35,659 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 01:15:35,660 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 01:15:35,660 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 01:15:35,660 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 01:15:35,660 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 01:15:35,660 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 01:15:35,660 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 01:15:35,660 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-14 01:15:35,660 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-14 01:15:35,660 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 01:15:35,660 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-14 01:15:35,894 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 01:15:35,899 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 01:15:35,900 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 01:15:35,901 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 01:15:35,901 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 01:15:35,904 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-buffer-series3.wvr.c [2025-04-14 01:15:37,216 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7808ee04/384d22e4ea664a7e8c9a21bd28236f25/FLAG7fc14f999 [2025-04-14 01:15:37,415 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 01:15:37,416 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-buffer-series3.wvr.c [2025-04-14 01:15:37,422 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7808ee04/384d22e4ea664a7e8c9a21bd28236f25/FLAG7fc14f999 [2025-04-14 01:15:38,268 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7808ee04/384d22e4ea664a7e8c9a21bd28236f25 [2025-04-14 01:15:38,270 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 01:15:38,271 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 01:15:38,274 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 01:15:38,274 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 01:15:38,278 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 01:15:38,278 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 01:15:38" (1/1) ... [2025-04-14 01:15:38,279 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d727e33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:15:38, skipping insertion in model container [2025-04-14 01:15:38,279 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 01:15:38" (1/1) ... [2025-04-14 01:15:38,292 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 01:15:38,470 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-buffer-series3.wvr.c[4403,4416] [2025-04-14 01:15:38,481 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 01:15:38,488 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 01:15:38,522 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-buffer-series3.wvr.c[4403,4416] [2025-04-14 01:15:38,530 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 01:15:38,539 INFO L204 MainTranslator]: Completed translation [2025-04-14 01:15:38,540 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:15:38 WrapperNode [2025-04-14 01:15:38,540 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 01:15:38,541 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 01:15:38,541 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 01:15:38,541 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 01:15:38,545 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:15:38" (1/1) ... [2025-04-14 01:15:38,553 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:15:38" (1/1) ... [2025-04-14 01:15:38,572 INFO L138 Inliner]: procedures = 26, calls = 67, calls flagged for inlining = 22, calls inlined = 28, statements flattened = 319 [2025-04-14 01:15:38,573 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 01:15:38,573 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 01:15:38,573 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 01:15:38,573 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 01:15:38,579 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:15:38" (1/1) ... [2025-04-14 01:15:38,579 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:15:38" (1/1) ... [2025-04-14 01:15:38,582 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:15:38" (1/1) ... [2025-04-14 01:15:38,593 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2025-04-14 01:15:38,594 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:15:38" (1/1) ... [2025-04-14 01:15:38,594 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:15:38" (1/1) ... [2025-04-14 01:15:38,599 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:15:38" (1/1) ... [2025-04-14 01:15:38,600 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:15:38" (1/1) ... [2025-04-14 01:15:38,601 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:15:38" (1/1) ... [2025-04-14 01:15:38,602 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:15:38" (1/1) ... [2025-04-14 01:15:38,606 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 01:15:38,606 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 01:15:38,606 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 01:15:38,606 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 01:15:38,607 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:15:38" (1/1) ... [2025-04-14 01:15:38,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 01:15:38,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:15:38,633 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-04-14 01:15:38,635 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-04-14 01:15:38,651 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 01:15:38,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-14 01:15:38,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-14 01:15:38,651 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-14 01:15:38,651 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-14 01:15:38,651 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-14 01:15:38,651 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-14 01:15:38,651 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-14 01:15:38,651 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-14 01:15:38,651 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-14 01:15:38,651 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-14 01:15:38,651 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-14 01:15:38,651 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-14 01:15:38,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-14 01:15:38,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-14 01:15:38,652 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-14 01:15:38,652 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-14 01:15:38,652 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-14 01:15:38,652 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 01:15:38,652 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 01:15:38,653 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-14 01:15:38,751 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 01:15:38,753 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 01:15:39,148 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 01:15:39,148 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 01:15:39,148 INFO L318 CfgBuilder]: Performing block encoding [2025-04-14 01:15:39,486 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 01:15:39,486 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 01:15:39 BoogieIcfgContainer [2025-04-14 01:15:39,486 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 01:15:39,488 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 01:15:39,488 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 01:15:39,492 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 01:15:39,492 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 01:15:38" (1/3) ... [2025-04-14 01:15:39,492 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fb0995e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 01:15:39, skipping insertion in model container [2025-04-14 01:15:39,492 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:15:38" (2/3) ... [2025-04-14 01:15:39,493 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fb0995e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 01:15:39, skipping insertion in model container [2025-04-14 01:15:39,493 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 01:15:39" (3/3) ... [2025-04-14 01:15:39,493 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-buffer-series3.wvr.c [2025-04-14 01:15:39,505 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 01:15:39,506 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-buffer-series3.wvr.c that has 5 procedures, 45 locations, 47 edges, 1 initial locations, 7 loop locations, and 1 error locations. [2025-04-14 01:15:39,507 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 01:15:39,559 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-14 01:15:39,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 51 transitions, 130 flow [2025-04-14 01:15:39,635 INFO L116 PetriNetUnfolderBase]: 7/47 cut-off events. [2025-04-14 01:15:39,636 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-14 01:15:39,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 47 events. 7/47 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 71 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 39. Up to 2 conditions per place. [2025-04-14 01:15:39,640 INFO L82 GeneralOperation]: Start removeDead. Operand has 57 places, 51 transitions, 130 flow [2025-04-14 01:15:39,643 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 46 transitions, 116 flow [2025-04-14 01:15:39,652 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 01:15:39,662 INFO L340 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;@1abfd151, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 01:15:39,662 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-14 01:15:39,679 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 01:15:39,679 INFO L116 PetriNetUnfolderBase]: 7/45 cut-off events. [2025-04-14 01:15:39,679 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-14 01:15:39,679 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:15:39,680 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:15:39,680 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 01:15:39,684 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:15:39,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1899649722, now seen corresponding path program 1 times [2025-04-14 01:15:39,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:15:39,691 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958634085] [2025-04-14 01:15:39,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:15:39,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:15:39,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-14 01:15:39,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 01:15:39,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:15:39,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:15:39,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:15:39,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:15:39,956 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958634085] [2025-04-14 01:15:39,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958634085] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:15:39,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:15:39,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-14 01:15:39,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889941375] [2025-04-14 01:15:39,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:15:39,962 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 01:15:39,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:15:39,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 01:15:39,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 01:15:39,990 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 51 [2025-04-14 01:15:39,992 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 46 transitions, 116 flow. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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-04-14 01:15:39,992 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:15:39,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 51 [2025-04-14 01:15:39,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:15:40,702 INFO L116 PetriNetUnfolderBase]: 5629/7733 cut-off events. [2025-04-14 01:15:40,703 INFO L117 PetriNetUnfolderBase]: For 512/512 co-relation queries the response was YES. [2025-04-14 01:15:40,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15601 conditions, 7733 events. 5629/7733 cut-off events. For 512/512 co-relation queries the response was YES. Maximal size of possible extension queue 371. Compared 39099 event pairs, 1634 based on Foata normal form. 1/7609 useless extension candidates. Maximal degree in co-relation 14262. Up to 4718 conditions per place. [2025-04-14 01:15:40,758 INFO L140 encePairwiseOnDemand]: 47/51 looper letters, 57 selfloop transitions, 3 changer transitions 1/69 dead transitions. [2025-04-14 01:15:40,758 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 69 transitions, 299 flow [2025-04-14 01:15:40,759 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 01:15:40,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 01:15:40,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions. [2025-04-14 01:15:40,768 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6405228758169934 [2025-04-14 01:15:40,769 INFO L175 Difference]: Start difference. First operand has 52 places, 46 transitions, 116 flow. Second operand 3 states and 98 transitions. [2025-04-14 01:15:40,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 69 transitions, 299 flow [2025-04-14 01:15:40,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 69 transitions, 273 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-04-14 01:15:40,778 INFO L231 Difference]: Finished difference. Result has 47 places, 48 transitions, 119 flow [2025-04-14 01:15:40,782 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=119, PETRI_PLACES=47, PETRI_TRANSITIONS=48} [2025-04-14 01:15:40,785 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -5 predicate places. [2025-04-14 01:15:40,785 INFO L485 AbstractCegarLoop]: Abstraction has has 47 places, 48 transitions, 119 flow [2025-04-14 01:15:40,786 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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-04-14 01:15:40,786 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:15:40,786 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] [2025-04-14 01:15:40,786 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 01:15:40,786 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 01:15:40,787 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:15:40,787 INFO L85 PathProgramCache]: Analyzing trace with hash -722903222, now seen corresponding path program 1 times [2025-04-14 01:15:40,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:15:40,788 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628217332] [2025-04-14 01:15:40,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:15:40,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:15:40,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-14 01:15:40,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-14 01:15:40,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:15:40,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:15:41,024 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:15:41,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:15:41,024 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628217332] [2025-04-14 01:15:41,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628217332] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:15:41,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:15:41,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 01:15:41,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445785247] [2025-04-14 01:15:41,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:15:41,025 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 01:15:41,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:15:41,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 01:15:41,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 01:15:41,026 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 51 [2025-04-14 01:15:41,026 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 48 transitions, 119 flow. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:15:41,026 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:15:41,026 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 51 [2025-04-14 01:15:41,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:15:41,727 INFO L116 PetriNetUnfolderBase]: 7551/10535 cut-off events. [2025-04-14 01:15:41,727 INFO L117 PetriNetUnfolderBase]: For 1375/1375 co-relation queries the response was YES. [2025-04-14 01:15:41,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22193 conditions, 10535 events. 7551/10535 cut-off events. For 1375/1375 co-relation queries the response was YES. Maximal size of possible extension queue 456. Compared 58312 event pairs, 2860 based on Foata normal form. 300/10751 useless extension candidates. Maximal degree in co-relation 8943. Up to 6208 conditions per place. [2025-04-14 01:15:41,771 INFO L140 encePairwiseOnDemand]: 48/51 looper letters, 65 selfloop transitions, 2 changer transitions 0/75 dead transitions. [2025-04-14 01:15:41,771 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 75 transitions, 321 flow [2025-04-14 01:15:41,771 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 01:15:41,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 01:15:41,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2025-04-14 01:15:41,773 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6601307189542484 [2025-04-14 01:15:41,773 INFO L175 Difference]: Start difference. First operand has 47 places, 48 transitions, 119 flow. Second operand 3 states and 101 transitions. [2025-04-14 01:15:41,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 75 transitions, 321 flow [2025-04-14 01:15:41,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 75 transitions, 317 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 01:15:41,777 INFO L231 Difference]: Finished difference. Result has 49 places, 49 transitions, 130 flow [2025-04-14 01:15:41,777 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=49, PETRI_TRANSITIONS=49} [2025-04-14 01:15:41,778 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -3 predicate places. [2025-04-14 01:15:41,778 INFO L485 AbstractCegarLoop]: Abstraction has has 49 places, 49 transitions, 130 flow [2025-04-14 01:15:41,779 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:15:41,779 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:15:41,779 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] [2025-04-14 01:15:41,779 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 01:15:41,779 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 01:15:41,780 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:15:41,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1569300292, now seen corresponding path program 1 times [2025-04-14 01:15:41,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:15:41,780 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602224968] [2025-04-14 01:15:41,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:15:41,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:15:41,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-14 01:15:41,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-14 01:15:41,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:15:41,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:15:41,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:15:41,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:15:41,906 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602224968] [2025-04-14 01:15:41,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602224968] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:15:41,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:15:41,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 01:15:41,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190169380] [2025-04-14 01:15:41,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:15:41,907 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 01:15:41,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:15:41,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 01:15:41,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 01:15:41,908 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 51 [2025-04-14 01:15:41,908 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 49 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:15:41,908 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:15:41,908 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 51 [2025-04-14 01:15:41,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:15:42,804 INFO L116 PetriNetUnfolderBase]: 9987/14097 cut-off events. [2025-04-14 01:15:42,804 INFO L117 PetriNetUnfolderBase]: For 3472/3479 co-relation queries the response was YES. [2025-04-14 01:15:42,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30481 conditions, 14097 events. 9987/14097 cut-off events. For 3472/3479 co-relation queries the response was YES. Maximal size of possible extension queue 514. Compared 80674 event pairs, 3689 based on Foata normal form. 240/14289 useless extension candidates. Maximal degree in co-relation 14977. Up to 8300 conditions per place. [2025-04-14 01:15:42,869 INFO L140 encePairwiseOnDemand]: 48/51 looper letters, 65 selfloop transitions, 2 changer transitions 0/75 dead transitions. [2025-04-14 01:15:42,869 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 75 transitions, 337 flow [2025-04-14 01:15:42,869 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 01:15:42,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 01:15:42,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 99 transitions. [2025-04-14 01:15:42,873 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6470588235294118 [2025-04-14 01:15:42,873 INFO L175 Difference]: Start difference. First operand has 49 places, 49 transitions, 130 flow. Second operand 3 states and 99 transitions. [2025-04-14 01:15:42,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 75 transitions, 337 flow [2025-04-14 01:15:42,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 75 transitions, 334 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 01:15:42,875 INFO L231 Difference]: Finished difference. Result has 51 places, 50 transitions, 142 flow [2025-04-14 01:15:42,875 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=142, PETRI_PLACES=51, PETRI_TRANSITIONS=50} [2025-04-14 01:15:42,877 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -1 predicate places. [2025-04-14 01:15:42,877 INFO L485 AbstractCegarLoop]: Abstraction has has 51 places, 50 transitions, 142 flow [2025-04-14 01:15:42,878 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:15:42,878 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:15:42,878 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] [2025-04-14 01:15:42,878 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-14 01:15:42,878 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 01:15:42,879 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:15:42,879 INFO L85 PathProgramCache]: Analyzing trace with hash -983374219, now seen corresponding path program 1 times [2025-04-14 01:15:42,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:15:42,879 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46817533] [2025-04-14 01:15:42,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:15:42,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:15:42,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-14 01:15:42,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-14 01:15:42,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:15:42,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:15:43,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:15:43,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:15:43,072 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46817533] [2025-04-14 01:15:43,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46817533] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:15:43,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:15:43,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 01:15:43,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735354381] [2025-04-14 01:15:43,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:15:43,072 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 01:15:43,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:15:43,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 01:15:43,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 01:15:43,073 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 51 [2025-04-14 01:15:43,073 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 50 transitions, 142 flow. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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-04-14 01:15:43,073 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:15:43,073 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 51 [2025-04-14 01:15:43,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:15:44,057 INFO L116 PetriNetUnfolderBase]: 12500/17800 cut-off events. [2025-04-14 01:15:44,057 INFO L117 PetriNetUnfolderBase]: For 5361/5423 co-relation queries the response was YES. [2025-04-14 01:15:44,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39805 conditions, 17800 events. 12500/17800 cut-off events. For 5361/5423 co-relation queries the response was YES. Maximal size of possible extension queue 623. Compared 106564 event pairs, 10539 based on Foata normal form. 281/18052 useless extension candidates. Maximal degree in co-relation 20734. Up to 13297 conditions per place. [2025-04-14 01:15:44,120 INFO L140 encePairwiseOnDemand]: 47/51 looper letters, 73 selfloop transitions, 3 changer transitions 0/84 dead transitions. [2025-04-14 01:15:44,121 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 84 transitions, 385 flow [2025-04-14 01:15:44,121 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 01:15:44,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 01:15:44,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 119 transitions. [2025-04-14 01:15:44,122 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2025-04-14 01:15:44,122 INFO L175 Difference]: Start difference. First operand has 51 places, 50 transitions, 142 flow. Second operand 4 states and 119 transitions. [2025-04-14 01:15:44,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 84 transitions, 385 flow [2025-04-14 01:15:44,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 84 transitions, 382 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 01:15:44,123 INFO L231 Difference]: Finished difference. Result has 55 places, 52 transitions, 160 flow [2025-04-14 01:15:44,123 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=160, PETRI_PLACES=55, PETRI_TRANSITIONS=52} [2025-04-14 01:15:44,124 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 3 predicate places. [2025-04-14 01:15:44,124 INFO L485 AbstractCegarLoop]: Abstraction has has 55 places, 52 transitions, 160 flow [2025-04-14 01:15:44,124 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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-04-14 01:15:44,124 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:15:44,124 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] [2025-04-14 01:15:44,124 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-14 01:15:44,124 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 01:15:44,126 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:15:44,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1894950177, now seen corresponding path program 1 times [2025-04-14 01:15:44,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:15:44,126 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75994999] [2025-04-14 01:15:44,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:15:44,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:15:44,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-14 01:15:44,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-14 01:15:44,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:15:44,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:15:44,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:15:44,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:15:44,238 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75994999] [2025-04-14 01:15:44,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75994999] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:15:44,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:15:44,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 01:15:44,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34632397] [2025-04-14 01:15:44,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:15:44,238 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 01:15:44,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:15:44,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 01:15:44,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 01:15:44,239 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 51 [2025-04-14 01:15:44,239 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 52 transitions, 160 flow. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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-04-14 01:15:44,239 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:15:44,239 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 51 [2025-04-14 01:15:44,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:15:45,417 INFO L116 PetriNetUnfolderBase]: 15701/22581 cut-off events. [2025-04-14 01:15:45,417 INFO L117 PetriNetUnfolderBase]: For 7188/7242 co-relation queries the response was YES. [2025-04-14 01:15:45,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50525 conditions, 22581 events. 15701/22581 cut-off events. For 7188/7242 co-relation queries the response was YES. Maximal size of possible extension queue 747. Compared 142631 event pairs, 13476 based on Foata normal form. 411/22935 useless extension candidates. Maximal degree in co-relation 40798. Up to 16808 conditions per place. [2025-04-14 01:15:45,533 INFO L140 encePairwiseOnDemand]: 45/51 looper letters, 72 selfloop transitions, 6 changer transitions 0/86 dead transitions. [2025-04-14 01:15:45,534 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 86 transitions, 408 flow [2025-04-14 01:15:45,534 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 01:15:45,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 01:15:45,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 131 transitions. [2025-04-14 01:15:45,535 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5137254901960784 [2025-04-14 01:15:45,535 INFO L175 Difference]: Start difference. First operand has 55 places, 52 transitions, 160 flow. Second operand 5 states and 131 transitions. [2025-04-14 01:15:45,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 86 transitions, 408 flow [2025-04-14 01:15:45,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 86 transitions, 404 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-14 01:15:45,541 INFO L231 Difference]: Finished difference. Result has 61 places, 56 transitions, 195 flow [2025-04-14 01:15:45,541 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=195, PETRI_PLACES=61, PETRI_TRANSITIONS=56} [2025-04-14 01:15:45,541 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 9 predicate places. [2025-04-14 01:15:45,541 INFO L485 AbstractCegarLoop]: Abstraction has has 61 places, 56 transitions, 195 flow [2025-04-14 01:15:45,542 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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-04-14 01:15:45,542 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:15:45,542 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] [2025-04-14 01:15:45,542 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-14 01:15:45,542 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 01:15:45,542 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:15:45,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1035047855, now seen corresponding path program 1 times [2025-04-14 01:15:45,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:15:45,542 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135826890] [2025-04-14 01:15:45,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:15:45,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:15:45,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-14 01:15:45,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-14 01:15:45,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:15:45,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:15:45,836 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:15:45,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:15:45,836 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135826890] [2025-04-14 01:15:45,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135826890] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:15:45,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:15:45,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 01:15:45,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450331916] [2025-04-14 01:15:45,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:15:45,837 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 01:15:45,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:15:45,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 01:15:45,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-14 01:15:45,840 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 51 [2025-04-14 01:15:45,840 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 56 transitions, 195 flow. Second operand has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:15:45,841 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:15:45,841 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 51 [2025-04-14 01:15:45,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:15:47,740 INFO L116 PetriNetUnfolderBase]: 25719/36565 cut-off events. [2025-04-14 01:15:47,740 INFO L117 PetriNetUnfolderBase]: For 10534/10586 co-relation queries the response was YES. [2025-04-14 01:15:47,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82757 conditions, 36565 events. 25719/36565 cut-off events. For 10534/10586 co-relation queries the response was YES. Maximal size of possible extension queue 1128. Compared 240134 event pairs, 9929 based on Foata normal form. 2/35203 useless extension candidates. Maximal degree in co-relation 59919. Up to 15105 conditions per place. [2025-04-14 01:15:47,916 INFO L140 encePairwiseOnDemand]: 44/51 looper letters, 118 selfloop transitions, 8 changer transitions 1/134 dead transitions. [2025-04-14 01:15:47,916 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 134 transitions, 675 flow [2025-04-14 01:15:47,917 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 01:15:47,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 01:15:47,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 178 transitions. [2025-04-14 01:15:47,917 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5816993464052288 [2025-04-14 01:15:47,917 INFO L175 Difference]: Start difference. First operand has 61 places, 56 transitions, 195 flow. Second operand 6 states and 178 transitions. [2025-04-14 01:15:47,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 134 transitions, 675 flow [2025-04-14 01:15:47,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 134 transitions, 668 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-04-14 01:15:47,928 INFO L231 Difference]: Finished difference. Result has 69 places, 59 transitions, 236 flow [2025-04-14 01:15:47,928 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=236, PETRI_PLACES=69, PETRI_TRANSITIONS=59} [2025-04-14 01:15:47,930 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 17 predicate places. [2025-04-14 01:15:47,930 INFO L485 AbstractCegarLoop]: Abstraction has has 69 places, 59 transitions, 236 flow [2025-04-14 01:15:47,930 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:15:47,930 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:15:47,931 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] [2025-04-14 01:15:47,931 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-14 01:15:47,931 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 01:15:47,931 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:15:47,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1339487870, now seen corresponding path program 1 times [2025-04-14 01:15:47,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:15:47,932 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468754238] [2025-04-14 01:15:47,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:15:47,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:15:47,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-14 01:15:47,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-14 01:15:47,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:15:47,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:15:48,142 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:15:48,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:15:48,142 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468754238] [2025-04-14 01:15:48,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468754238] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:15:48,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:15:48,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 01:15:48,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375336357] [2025-04-14 01:15:48,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:15:48,143 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 01:15:48,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:15:48,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 01:15:48,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-14 01:15:48,145 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 51 [2025-04-14 01:15:48,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 59 transitions, 236 flow. Second operand has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:15:48,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:15:48,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 51 [2025-04-14 01:15:48,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:15:49,876 INFO L116 PetriNetUnfolderBase]: 21059/29957 cut-off events. [2025-04-14 01:15:49,877 INFO L117 PetriNetUnfolderBase]: For 13098/13110 co-relation queries the response was YES. [2025-04-14 01:15:49,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70891 conditions, 29957 events. 21059/29957 cut-off events. For 13098/13110 co-relation queries the response was YES. Maximal size of possible extension queue 881. Compared 190034 event pairs, 17563 based on Foata normal form. 0/28405 useless extension candidates. Maximal degree in co-relation 56158. Up to 27041 conditions per place. [2025-04-14 01:15:50,025 INFO L140 encePairwiseOnDemand]: 45/51 looper letters, 45 selfloop transitions, 5 changer transitions 33/90 dead transitions. [2025-04-14 01:15:50,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 90 transitions, 479 flow [2025-04-14 01:15:50,026 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 01:15:50,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 01:15:50,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 140 transitions. [2025-04-14 01:15:50,026 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.45751633986928103 [2025-04-14 01:15:50,026 INFO L175 Difference]: Start difference. First operand has 69 places, 59 transitions, 236 flow. Second operand 6 states and 140 transitions. [2025-04-14 01:15:50,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 90 transitions, 479 flow [2025-04-14 01:15:50,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 90 transitions, 471 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-04-14 01:15:50,037 INFO L231 Difference]: Finished difference. Result has 75 places, 57 transitions, 228 flow [2025-04-14 01:15:50,038 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=228, PETRI_PLACES=75, PETRI_TRANSITIONS=57} [2025-04-14 01:15:50,038 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 23 predicate places. [2025-04-14 01:15:50,038 INFO L485 AbstractCegarLoop]: Abstraction has has 75 places, 57 transitions, 228 flow [2025-04-14 01:15:50,038 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:15:50,038 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:15:50,038 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-04-14 01:15:50,038 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-14 01:15:50,039 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 01:15:50,039 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:15:50,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1062411702, now seen corresponding path program 1 times [2025-04-14 01:15:50,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:15:50,039 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811897462] [2025-04-14 01:15:50,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:15:50,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:15:50,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-14 01:15:50,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-14 01:15:50,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:15:50,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:15:50,311 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:15:50,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:15:50,312 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811897462] [2025-04-14 01:15:50,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811897462] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:15:50,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:15:50,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 01:15:50,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049296020] [2025-04-14 01:15:50,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:15:50,312 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 01:15:50,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:15:50,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 01:15:50,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-04-14 01:15:50,317 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 51 [2025-04-14 01:15:50,317 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 57 transitions, 228 flow. Second operand has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 6 states have internal predecessors, (104), 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-04-14 01:15:50,317 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:15:50,317 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 51 [2025-04-14 01:15:50,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:15:51,506 INFO L116 PetriNetUnfolderBase]: 13221/19611 cut-off events. [2025-04-14 01:15:51,507 INFO L117 PetriNetUnfolderBase]: For 9970/9974 co-relation queries the response was YES. [2025-04-14 01:15:51,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48050 conditions, 19611 events. 13221/19611 cut-off events. For 9970/9974 co-relation queries the response was YES. Maximal size of possible extension queue 663. Compared 125764 event pairs, 2013 based on Foata normal form. 836/20407 useless extension candidates. Maximal degree in co-relation 38497. Up to 12269 conditions per place. [2025-04-14 01:15:51,634 INFO L140 encePairwiseOnDemand]: 45/51 looper letters, 83 selfloop transitions, 5 changer transitions 2/98 dead transitions. [2025-04-14 01:15:51,634 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 98 transitions, 542 flow [2025-04-14 01:15:51,635 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 01:15:51,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 01:15:51,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 147 transitions. [2025-04-14 01:15:51,635 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4803921568627451 [2025-04-14 01:15:51,635 INFO L175 Difference]: Start difference. First operand has 75 places, 57 transitions, 228 flow. Second operand 6 states and 147 transitions. [2025-04-14 01:15:51,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 98 transitions, 542 flow [2025-04-14 01:15:51,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 98 transitions, 520 flow, removed 6 selfloop flow, removed 7 redundant places. [2025-04-14 01:15:51,772 INFO L231 Difference]: Finished difference. Result has 70 places, 56 transitions, 212 flow [2025-04-14 01:15:51,772 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=212, PETRI_PLACES=70, PETRI_TRANSITIONS=56} [2025-04-14 01:15:51,773 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 18 predicate places. [2025-04-14 01:15:51,773 INFO L485 AbstractCegarLoop]: Abstraction has has 70 places, 56 transitions, 212 flow [2025-04-14 01:15:51,773 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 6 states have internal predecessors, (104), 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-04-14 01:15:51,773 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:15:51,773 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-04-14 01:15:51,773 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-14 01:15:51,773 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 01:15:51,774 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:15:51,774 INFO L85 PathProgramCache]: Analyzing trace with hash 312417685, now seen corresponding path program 1 times [2025-04-14 01:15:51,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:15:51,774 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610926921] [2025-04-14 01:15:51,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:15:51,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:15:51,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-14 01:15:51,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-14 01:15:51,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:15:51,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:15:52,039 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:15:52,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:15:52,040 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610926921] [2025-04-14 01:15:52,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610926921] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:15:52,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:15:52,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 01:15:52,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788014917] [2025-04-14 01:15:52,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:15:52,040 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 01:15:52,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:15:52,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 01:15:52,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-14 01:15:52,044 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 51 [2025-04-14 01:15:52,045 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 56 transitions, 212 flow. Second operand has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 6 states have internal predecessors, (104), 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-04-14 01:15:52,045 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:15:52,045 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 51 [2025-04-14 01:15:52,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:15:52,693 INFO L116 PetriNetUnfolderBase]: 9177/13343 cut-off events. [2025-04-14 01:15:52,693 INFO L117 PetriNetUnfolderBase]: For 9857/9867 co-relation queries the response was YES. [2025-04-14 01:15:52,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33734 conditions, 13343 events. 9177/13343 cut-off events. For 9857/9867 co-relation queries the response was YES. Maximal size of possible extension queue 485. Compared 79619 event pairs, 1461 based on Foata normal form. 512/13843 useless extension candidates. Maximal degree in co-relation 28974. Up to 8719 conditions per place. [2025-04-14 01:15:52,759 INFO L140 encePairwiseOnDemand]: 45/51 looper letters, 84 selfloop transitions, 5 changer transitions 1/98 dead transitions. [2025-04-14 01:15:52,759 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 98 transitions, 534 flow [2025-04-14 01:15:52,759 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 01:15:52,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 01:15:52,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 149 transitions. [2025-04-14 01:15:52,760 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4869281045751634 [2025-04-14 01:15:52,760 INFO L175 Difference]: Start difference. First operand has 70 places, 56 transitions, 212 flow. Second operand 6 states and 149 transitions. [2025-04-14 01:15:52,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 98 transitions, 534 flow [2025-04-14 01:15:52,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 98 transitions, 508 flow, removed 7 selfloop flow, removed 6 redundant places. [2025-04-14 01:15:52,767 INFO L231 Difference]: Finished difference. Result has 68 places, 55 transitions, 204 flow [2025-04-14 01:15:52,768 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=204, PETRI_PLACES=68, PETRI_TRANSITIONS=55} [2025-04-14 01:15:52,768 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 16 predicate places. [2025-04-14 01:15:52,768 INFO L485 AbstractCegarLoop]: Abstraction has has 68 places, 55 transitions, 204 flow [2025-04-14 01:15:52,768 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 6 states have internal predecessors, (104), 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-04-14 01:15:52,768 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:15:52,768 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, 1, 1, 1, 1, 1] [2025-04-14 01:15:52,768 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-14 01:15:52,768 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 01:15:52,769 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:15:52,769 INFO L85 PathProgramCache]: Analyzing trace with hash -73347314, now seen corresponding path program 1 times [2025-04-14 01:15:52,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:15:52,769 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23204455] [2025-04-14 01:15:52,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:15:52,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:15:52,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-14 01:15:52,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-14 01:15:52,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:15:52,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 01:15:52,820 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-14 01:15:52,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-14 01:15:52,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-14 01:15:52,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:15:52,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 01:15:52,875 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-14 01:15:52,875 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-14 01:15:52,876 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2025-04-14 01:15:52,877 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2025-04-14 01:15:52,877 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2025-04-14 01:15:52,877 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2025-04-14 01:15:52,877 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2025-04-14 01:15:52,878 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-14 01:15:52,878 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:15:52,963 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-14 01:15:52,963 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-14 01:15:52,971 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 01:15:52 BasicIcfg [2025-04-14 01:15:52,971 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-14 01:15:52,971 INFO L158 Benchmark]: Toolchain (without parser) took 14700.83ms. Allocated memory was 155.2MB in the beginning and 3.0GB in the end (delta: 2.8GB). Free memory was 106.9MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 1.4GB. Max. memory is 8.0GB. [2025-04-14 01:15:52,971 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 159.4MB. Free memory is still 85.5MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 01:15:52,971 INFO L158 Benchmark]: CACSL2BoogieTranslator took 266.31ms. Allocated memory is still 155.2MB. Free memory was 106.3MB in the beginning and 89.9MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-04-14 01:15:52,972 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.30ms. Allocated memory is still 155.2MB. Free memory was 89.9MB in the beginning and 87.0MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 01:15:52,972 INFO L158 Benchmark]: Boogie Preprocessor took 32.55ms. Allocated memory is still 155.2MB. Free memory was 87.0MB in the beginning and 84.4MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 01:15:52,972 INFO L158 Benchmark]: IcfgBuilder took 880.25ms. Allocated memory is still 155.2MB. Free memory was 84.4MB in the beginning and 46.7MB in the end (delta: 37.7MB). Peak memory consumption was 70.3MB. Max. memory is 8.0GB. [2025-04-14 01:15:52,972 INFO L158 Benchmark]: TraceAbstraction took 13483.13ms. Allocated memory was 155.2MB in the beginning and 3.0GB in the end (delta: 2.8GB). Free memory was 46.0MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 1.4GB. Max. memory is 8.0GB. [2025-04-14 01:15:52,975 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 159.4MB. Free memory is still 85.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 266.31ms. Allocated memory is still 155.2MB. Free memory was 106.3MB in the beginning and 89.9MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 32.30ms. Allocated memory is still 155.2MB. Free memory was 89.9MB in the beginning and 87.0MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.55ms. Allocated memory is still 155.2MB. Free memory was 87.0MB in the beginning and 84.4MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 8.0GB. * IcfgBuilder took 880.25ms. Allocated memory is still 155.2MB. Free memory was 84.4MB in the beginning and 46.7MB in the end (delta: 37.7MB). Peak memory consumption was 70.3MB. Max. memory is 8.0GB. * TraceAbstraction took 13483.13ms. Allocated memory was 155.2MB in the beginning and 3.0GB in the end (delta: 2.8GB). Free memory was 46.0MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 1.4GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 155]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L41] 0 int *q1, *q2, *f; [L42] 0 int q1_front, q1_back, q2_front, q2_back, i, j, n1, n2, N, total; [L129] 0 pthread_t t1, t2, t3, t4; [L131] 0 N = __VERIFIER_nondet_int() [L132] 0 n1 = __VERIFIER_nondet_int() [L133] 0 n2 = __VERIFIER_nondet_int() [L134] 0 q1_front = __VERIFIER_nondet_int() [L135] 0 q1_back = q1_front [L136] 0 q2_front = __VERIFIER_nondet_int() [L137] 0 q2_back = q2_front [L138] CALL, EXPR 0 create_fresh_int_array(n1) [L161] CALL 0 assume_abort_if_not(size >= 0) [L38] COND FALSE 0 !(!cond) [L161] RET 0 assume_abort_if_not(size >= 0) [L162] CALL 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L38] COND FALSE 0 !(!cond) [L162] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L164] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L165] 0 int i = 0; VAL [N=1, \at(size, Pre)=1, arr={-2:0}, f={0:0}, i=0, i=0, j=0, n1=1, n2=1, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=1, total=0] [L165] COND TRUE 0 i < size [L166] 0 arr[i] = __VERIFIER_nondet_int() [L165] 0 i++ VAL [N=1, \at(size, Pre)=1, arr={-2:0}, f={0:0}, i=0, i=1, j=0, n1=1, n2=1, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=1, total=0] [L165] COND FALSE 0 !(i < size) [L168] 0 return arr; [L138] RET, EXPR 0 create_fresh_int_array(n1) [L138] 0 q1 = create_fresh_int_array(n1) [L139] CALL, EXPR 0 create_fresh_int_array(n2) [L161] CALL 0 assume_abort_if_not(size >= 0) [L38] COND FALSE 0 !(!cond) [L161] RET 0 assume_abort_if_not(size >= 0) [L162] CALL 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L38] COND FALSE 0 !(!cond) [L162] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L164] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L165] 0 int i = 0; VAL [N=1, \at(size, Pre)=1, arr={-3:0}, f={0:0}, i=0, i=0, j=0, n1=1, n2=1, q1={-2:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=1, total=0] [L165] COND TRUE 0 i < size [L166] 0 arr[i] = __VERIFIER_nondet_int() [L165] 0 i++ VAL [N=1, \at(size, Pre)=1, arr={-3:0}, f={0:0}, i=0, i=1, j=0, n1=1, n2=1, q1={-2:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=1, total=0] [L165] COND FALSE 0 !(i < size) [L168] 0 return arr; [L139] RET, EXPR 0 create_fresh_int_array(n2) [L139] 0 q2 = create_fresh_int_array(n2) [L140] CALL, EXPR 0 create_fresh_int_array(N) [L161] CALL 0 assume_abort_if_not(size >= 0) [L38] COND FALSE 0 !(!cond) [L161] RET 0 assume_abort_if_not(size >= 0) [L162] CALL 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L38] COND FALSE 0 !(!cond) [L162] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L164] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L165] 0 int i = 0; VAL [N=1, \at(size, Pre)=1, arr={-5:0}, f={0:0}, i=0, i=0, j=0, n1=1, n2=1, q1={-2:0}, q1_back=0, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, size=1, total=0] [L165] COND TRUE 0 i < size [L166] 0 arr[i] = __VERIFIER_nondet_int() [L165] 0 i++ VAL [N=1, \at(size, Pre)=1, arr={-5:0}, f={0:0}, i=0, i=1, j=0, n1=1, n2=1, q1={-2:0}, q1_back=0, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, size=1, total=0] [L165] COND FALSE 0 !(i < size) [L168] 0 return arr; [L140] RET, EXPR 0 create_fresh_int_array(N) [L140] 0 f = create_fresh_int_array(N) [L142] CALL 0 assume_abort_if_not(N >= 0) [L38] COND FALSE 0 !(!cond) [L142] RET 0 assume_abort_if_not(N >= 0) [L145] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [N=1, f={-5:0}, i=0, j=0, n1=1, n2=1, q1={-2:0}, q1_back=0, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, t1=-1, total=0] [L146] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [N=1, f={-5:0}, i=0, j=0, n1=1, n2=1, q1={-2:0}, q1_back=0, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, t1=-1, t2=0, total=0] [L71] 2 _Bool cond = j < N; VAL [N=1, \at(_argptr, Pre)={0:0}, _argptr={0:0}, cond=1, f={-5:0}, i=0, j=0, n1=1, n2=1, q1={-2:0}, q1_back=0, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, total=0] [L73] COND TRUE 2 \read(cond) VAL [N=1, f={-5:0}, i=0, j=0, n1=1, n2=1, q1={-2:0}, q1_back=0, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, total=0] [L75] CALL 2 assume_abort_if_not(q2_back >= 0 && q2_back < n2) [L38] COND FALSE 2 !(!cond) [L75] RET 2 assume_abort_if_not(q2_back >= 0 && q2_back < n2) [L76] EXPR 2 f[j] [L76] CALL 2 assume_abort_if_not(f[j] > -2147483648) [L38] COND FALSE 2 !(!cond) [L76] RET 2 assume_abort_if_not(f[j] > -2147483648) [L77] EXPR 2 q2[q2_back] [L77] EXPR 2 f[j] [L77] CALL 2 assume_abort_if_not(q2[q2_back] == -f[j]) [L38] COND FALSE 2 !(!cond) [L77] RET 2 assume_abort_if_not(q2[q2_back] == -f[j]) [L78] CALL 2 assume_abort_if_not(q2_back < 2147483647) [L38] COND FALSE 2 !(!cond) [L78] RET 2 assume_abort_if_not(q2_back < 2147483647) [L79] 2 j++ VAL [N=1, \at(_argptr, Pre)={0:0}, _argptr={0:0}, cond=1, f={-5:0}, i=0, j=1, n1=1, n2=1, q1={-2:0}, q1_back=0, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, total=0] [L147] FCALL, FORK 0 pthread_create(&t3, 0, thread3, 0) VAL [N=1, f={-5:0}, i=0, j=1, n1=1, n2=1, q1={-2:0}, q1_back=0, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, t1=-1, t2=0, t3=1, total=0] [L94] 3 _Bool cond = i < N || q1_front < q1_back; VAL [N=1, \at(_argptr, Pre)={0:0}, _argptr={0:0}, cond=1, f={-5:0}, i=0, j=1, n1=1, n2=1, q1={-2:0}, q1_back=0, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, total=0] [L148] FCALL, FORK 0 pthread_create(&t4, 0, thread4, 0) VAL [N=1, f={-5:0}, i=0, j=1, n1=1, n2=1, q1={-2:0}, q1_back=0, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, t1=-1, t2=0, t3=1, t4=2, total=0] [L112] 4 _Bool cond = j < N || q2_front < q2_back; VAL [N=1, \at(_argptr, Pre)={0:0}, _argptr={0:0}, cond=0, f={-5:0}, i=0, j=1, n1=1, n2=1, q1={-2:0}, q1_back=0, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, total=0] [L82] 2 q2_back++ VAL [N=1, \at(_argptr, Pre)={0:0}, _argptr={0:0}, cond=1, f={-5:0}, i=0, j=1, n1=1, n2=1, q1={-2:0}, q1_back=0, q1_front=0, q2={-3:0}, q2_back=1, q2_front=0, total=0] [L85] 2 cond = j < N VAL [N=1, \at(_argptr, Pre)={0:0}, _argptr={0:0}, cond=0, f={-5:0}, i=0, j=1, n1=1, n2=1, q1={-2:0}, q1_back=0, q1_front=0, q2={-3:0}, q2_back=1, q2_front=0, total=0] [L114] COND FALSE 4 !(\read(cond)) [L125] 4 return 0; [L73] COND FALSE 2 !(\read(cond)) [L89] 2 return 0; [L49] 1 _Bool cond = i < N; VAL [N=1, \at(_argptr, Pre)={0:0}, _argptr={0:0}, cond=1, f={-5:0}, i=0, j=1, n1=1, n2=1, q1={-2:0}, q1_back=0, q1_front=0, q2={-3:0}, q2_back=1, q2_front=0, total=0] [L51] COND TRUE 1 \read(cond) VAL [N=1, f={-5:0}, i=0, j=1, n1=1, n2=1, q1={-2:0}, q1_back=0, q1_front=0, q2={-3:0}, q2_back=1, q2_front=0, total=0] [L53] CALL 1 assume_abort_if_not(q1_back >= 0 && q1_back < n1) [L38] COND FALSE 1 !(!cond) [L53] RET 1 assume_abort_if_not(q1_back >= 0 && q1_back < n1) [L54] EXPR 1 q1[q1_back] [L54] EXPR 1 f[i] [L54] CALL 1 assume_abort_if_not(q1[q1_back] == f[i]) [L38] COND FALSE 1 !(!cond) [L54] RET 1 assume_abort_if_not(q1[q1_back] == f[i]) [L55] CALL 1 assume_abort_if_not(q1_back < 2147483647) [L38] COND FALSE 1 !(!cond) [L55] RET 1 assume_abort_if_not(q1_back < 2147483647) [L56] 1 i++ VAL [N=1, \at(_argptr, Pre)={0:0}, _argptr={0:0}, cond=1, f={-5:0}, i=1, j=1, n1=1, n2=1, q1={-2:0}, q1_back=0, q1_front=0, q2={-3:0}, q2_back=1, q2_front=0, total=0] [L59] 1 q1_back++ VAL [N=1, \at(_argptr, Pre)={0:0}, _argptr={0:0}, cond=1, f={-5:0}, i=1, j=1, n1=1, n2=1, q1={-2:0}, q1_back=1, q1_front=0, q2={-3:0}, q2_back=1, q2_front=0, total=0] [L62] 1 cond = i < N VAL [N=1, \at(_argptr, Pre)={0:0}, _argptr={0:0}, cond=0, f={-5:0}, i=1, j=1, n1=1, n2=1, q1={-2:0}, q1_back=1, q1_front=0, q2={-3:0}, q2_back=1, q2_front=0, total=0] [L51] COND FALSE 1 !(\read(cond)) [L66] 1 return 0; [L96] COND TRUE 3 \read(cond) VAL [N=1, f={-5:0}, i=1, j=1, n1=1, n2=1, q1={-2:0}, q1_back=1, q1_front=0, q2={-3:0}, q2_back=1, q2_front=0, total=0] [L98] CALL 3 assume_abort_if_not(q1_front < q1_back && q1_front >= 0 && q1_front < n1) [L38] COND FALSE 3 !(!cond) [L98] RET 3 assume_abort_if_not(q1_front < q1_back && q1_front >= 0 && q1_front < n1) [L99] EXPR 3 q1[q1_front] [L99] CALL, EXPR 3 plus(total, q1[q1_front]) [L172] CALL 3 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L38] COND FALSE 3 !(!cond) [L172] RET 3 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L173] CALL 3 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L38] COND FALSE 3 !(!cond) [L173] RET 3 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L174] 3 return a + b; [L99] RET, EXPR 3 plus(total, q1[q1_front]) [L99] 3 total = plus(total, q1[q1_front]) [L100] 3 q1_front++ VAL [N=1, \at(_argptr, Pre)={0:0}, _argptr={0:0}, cond=1, f={-5:0}, i=1, j=1, n1=1, n2=1, q1={-2:0}, q1_back=1, q1_front=1, q2={-3:0}, q2_back=1, q2_front=0, total=6] [L103] 3 cond = i < N || q1_front < q1_back VAL [N=1, \at(_argptr, Pre)={0:0}, _argptr={0:0}, cond=0, f={-5:0}, i=1, j=1, n1=1, n2=1, q1={-2:0}, q1_back=1, q1_front=1, q2={-3:0}, q2_back=1, q2_front=0, total=6] [L96] COND FALSE 3 !(\read(cond)) [L107] 3 return 0; [L149] FCALL, JOIN 1 pthread_join(t1, 0) VAL [N=1, f={-5:0}, i=1, j=1, n1=1, n2=1, q1={-2:0}, q1_back=1, q1_front=1, q2={-3:0}, q2_back=1, q2_front=0, t1=-1, t2=0, t3=1, t4=2, total=6] [L150] FCALL, JOIN 2 pthread_join(t2, 0) VAL [N=1, f={-5:0}, i=1, j=1, n1=1, n2=1, q1={-2:0}, q1_back=1, q1_front=1, q2={-3:0}, q2_back=1, q2_front=0, t1=-1, t2=0, t3=1, t4=2, total=6] [L151] FCALL, JOIN 3 pthread_join(t3, 0) VAL [N=1, f={-5:0}, i=1, j=1, n1=1, n2=1, q1={-2:0}, q1_back=1, q1_front=1, q2={-3:0}, q2_back=1, q2_front=0, t1=-1, t2=0, t3=1, t4=2, total=6] [L152] FCALL, JOIN 4 pthread_join(t4, 0) VAL [N=1, f={-5:0}, i=1, j=1, n1=1, n2=1, q1={-2:0}, q1_back=1, q1_front=1, q2={-3:0}, q2_back=1, q2_front=0, t1=-1, t2=0, t3=1, t4=2, total=6] [L154] CALL 0 assume_abort_if_not(total != 0) [L38] COND FALSE 0 !(!cond) [L154] RET 0 assume_abort_if_not(total != 0) [L155] 0 reach_error() VAL [N=1, f={-5:0}, i=1, j=1, n1=1, n2=1, q1={-2:0}, q1_back=1, q1_front=1, q2={-3:0}, q2_back=1, q2_front=0, t1=-1, t2=0, t3=1, t4=2, total=6] - UnprovableResult [Line: 147]: 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: 145]: 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: 148]: 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: 146]: 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, 75 locations, 85 edges, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 13.3s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 11.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 361 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 355 mSDsluCounter, 17 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1141 IncrementalHoareTripleChecker+Invalid, 1143 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 3 mSDtfsCounter, 1141 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=236occurred in iteration=6, InterpolantAutomatonStates: 42, 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.6s InterpolantComputationTime, 358 NumberOfCodeBlocks, 358 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 306 ConstructedInterpolants, 0 QuantifiedInterpolants, 742 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 9/9 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-04-14 01:15:52,992 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...