/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.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis FINITE_AUTOMATA -i ../../../trunk/examples/svcomp/weaver/parallel-barrier-loop.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 18:02:34,619 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 18:02:34,664 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-13 18:02:34,674 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 18:02:34,674 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 18:02:34,698 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 18:02:34,699 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 18:02:34,699 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 18:02:34,700 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 18:02:34,700 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 18:02:34,700 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 18:02:34,701 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 18:02:34,701 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 18:02:34,701 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 18:02:34,701 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 18:02:34,702 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 18:02:34,702 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 18:02:34,702 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 18:02:34,702 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 18:02:34,702 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 18:02:34,702 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 18:02:34,702 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 18:02:34,702 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 18:02:34,702 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 18:02:34,702 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 18:02:34,702 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 18:02:34,702 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 18:02:34,702 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 18:02:34,702 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 18:02:34,702 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 18:02:34,702 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 18:02:34,702 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 18:02:34,702 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 18:02:34,703 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 18:02:34,703 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 18:02:34,703 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 18:02:34,703 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 18:02:34,703 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 18:02:34,703 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 18:02:34,703 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 18:02:34,703 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 18:02:34,703 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 18:02:34,703 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 18:02:34,703 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 18:02:34,703 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 18:02:34,703 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 18:02:34,703 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 18:02:34,703 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 -> FINITE_AUTOMATA [2025-04-13 18:02:34,942 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 18:02:34,951 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 18:02:34,953 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 18:02:34,953 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 18:02:34,954 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 18:02:34,955 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-barrier-loop.wvr.c [2025-04-13 18:02:37,032 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f0b917a3/beb661a25af94c9fa46660df65c1ae3a/FLAGb460f4fb6 [2025-04-13 18:02:37,247 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 18:02:37,248 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-barrier-loop.wvr.c [2025-04-13 18:02:37,256 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f0b917a3/beb661a25af94c9fa46660df65c1ae3a/FLAGb460f4fb6 [2025-04-13 18:02:38,033 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f0b917a3/beb661a25af94c9fa46660df65c1ae3a [2025-04-13 18:02:38,035 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 18:02:38,038 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 18:02:38,040 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 18:02:38,040 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 18:02:38,047 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 18:02:38,047 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 06:02:38" (1/1) ... [2025-04-13 18:02:38,048 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22d8329 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:02:38, skipping insertion in model container [2025-04-13 18:02:38,048 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 06:02:38" (1/1) ... [2025-04-13 18:02:38,067 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 18:02:38,263 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/parallel-barrier-loop.wvr.c[3922,3935] [2025-04-13 18:02:38,268 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 18:02:38,281 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 18:02:38,318 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/parallel-barrier-loop.wvr.c[3922,3935] [2025-04-13 18:02:38,319 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 18:02:38,334 INFO L204 MainTranslator]: Completed translation [2025-04-13 18:02:38,335 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:02:38 WrapperNode [2025-04-13 18:02:38,335 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 18:02:38,336 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 18:02:38,336 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 18:02:38,336 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 18:02:38,341 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:02:38" (1/1) ... [2025-04-13 18:02:38,351 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:02:38" (1/1) ... [2025-04-13 18:02:38,377 INFO L138 Inliner]: procedures = 22, calls = 22, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 223 [2025-04-13 18:02:38,378 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 18:02:38,378 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 18:02:38,380 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 18:02:38,381 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 18:02:38,388 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:02:38" (1/1) ... [2025-04-13 18:02:38,388 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:02:38" (1/1) ... [2025-04-13 18:02:38,395 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:02:38" (1/1) ... [2025-04-13 18:02:38,415 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-04-13 18:02:38,415 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:02:38" (1/1) ... [2025-04-13 18:02:38,415 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:02:38" (1/1) ... [2025-04-13 18:02:38,422 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:02:38" (1/1) ... [2025-04-13 18:02:38,426 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:02:38" (1/1) ... [2025-04-13 18:02:38,429 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:02:38" (1/1) ... [2025-04-13 18:02:38,434 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:02:38" (1/1) ... [2025-04-13 18:02:38,435 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:02:38" (1/1) ... [2025-04-13 18:02:38,441 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 18:02:38,442 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 18:02:38,442 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 18:02:38,442 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 18:02:38,443 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:02:38" (1/1) ... [2025-04-13 18:02:38,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 18:02:38,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:02:38,474 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-13 18:02:38,476 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-13 18:02:38,497 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 18:02:38,497 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 18:02:38,497 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 18:02:38,497 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 18:02:38,497 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 18:02:38,497 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-13 18:02:38,497 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-13 18:02:38,497 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-13 18:02:38,497 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-13 18:02:38,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 18:02:38,498 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2025-04-13 18:02:38,498 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2025-04-13 18:02:38,498 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2025-04-13 18:02:38,498 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2025-04-13 18:02:38,498 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 18:02:38,498 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 18:02:38,499 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 18:02:38,578 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 18:02:38,579 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 18:02:38,839 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 18:02:38,840 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 18:02:38,840 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 18:02:39,067 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 18:02:39,071 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 18:02:39,076 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 18:02:39,080 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 18:02:39,086 INFO L313 CfgBuilder]: Removed 4 assume(true) statements. [2025-04-13 18:02:39,086 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 06:02:39 BoogieIcfgContainer [2025-04-13 18:02:39,086 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 18:02:39,088 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 18:02:39,089 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 18:02:39,092 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 18:02:39,093 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 06:02:38" (1/3) ... [2025-04-13 18:02:39,093 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ba69d3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 06:02:39, skipping insertion in model container [2025-04-13 18:02:39,093 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:02:38" (2/3) ... [2025-04-13 18:02:39,093 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ba69d3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 06:02:39, skipping insertion in model container [2025-04-13 18:02:39,093 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 06:02:39" (3/3) ... [2025-04-13 18:02:39,094 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-barrier-loop.wvr.c [2025-04-13 18:02:39,107 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 18:02:39,109 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-barrier-loop.wvr.c that has 7 procedures, 82 locations, 83 edges, 1 initial locations, 4 loop locations, and 1 error locations. [2025-04-13 18:02:39,109 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 18:02:39,226 INFO L143 ThreadInstanceAdder]: Constructed 18 joinOtherThreadTransitions. [2025-04-13 18:02:39,252 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 106 places, 99 transitions, 264 flow [2025-04-13 18:02:41,569 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 51059 states, 51058 states have (on average 5.748736730776764) internal successors, (293519), 51058 states have internal predecessors, (293519), 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-13 18:02:41,591 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 18:02:41,599 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=FINITE_AUTOMATA, 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;@19dbc579, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 18:02:41,599 INFO L341 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-04-13 18:02:41,725 INFO L278 IsEmpty]: Start isEmpty. Operand has 51059 states, 51058 states have (on average 5.748736730776764) internal successors, (293519), 51058 states have internal predecessors, (293519), 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-13 18:02:42,227 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-04-13 18:02:42,228 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:02:42,228 INFO L218 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:02:42,230 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-04-13 18:02:42,235 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:02:42,236 INFO L85 PathProgramCache]: Analyzing trace with hash 818063446, now seen corresponding path program 1 times [2025-04-13 18:02:42,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:02:42,241 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114999819] [2025-04-13 18:02:42,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:02:42,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:02:42,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-04-13 18:02:42,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-04-13 18:02:42,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:02:42,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:02:42,727 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-13 18:02:42,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:02:42,728 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114999819] [2025-04-13 18:02:42,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114999819] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:02:42,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:02:42,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 18:02:42,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559945043] [2025-04-13 18:02:42,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:02:42,734 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 18:02:42,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:02:42,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 18:02:42,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 18:02:42,860 INFO L87 Difference]: Start difference. First operand has 51059 states, 51058 states have (on average 5.748736730776764) internal successors, (293519), 51058 states have internal predecessors, (293519), 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) Second operand has 3 states, 2 states have (on average 25.0) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:02:44,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:02:44,018 INFO L93 Difference]: Finished difference Result 53295 states and 304206 transitions. [2025-04-13 18:02:44,019 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 18:02:44,020 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 25.0) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2025-04-13 18:02:44,020 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:02:44,759 INFO L225 Difference]: With dead ends: 53295 [2025-04-13 18:02:44,760 INFO L226 Difference]: Without dead ends: 53238 [2025-04-13 18:02:44,816 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 18:02:44,823 INFO L437 NwaCegarLoop]: 28 mSDtfsCounter, 8 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:02:44,824 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 44 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:02:45,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53238 states. [2025-04-13 18:02:47,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53238 to 51769. [2025-04-13 18:02:47,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51769 states, 51768 states have (on average 5.728577499613661) internal successors, (296557), 51768 states have internal predecessors, (296557), 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-13 18:02:47,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51769 states to 51769 states and 296557 transitions. [2025-04-13 18:02:47,947 INFO L79 Accepts]: Start accepts. Automaton has 51769 states and 296557 transitions. Word has length 50 [2025-04-13 18:02:47,950 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:02:47,950 INFO L485 AbstractCegarLoop]: Abstraction has 51769 states and 296557 transitions. [2025-04-13 18:02:47,951 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 25.0) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:02:47,951 INFO L278 IsEmpty]: Start isEmpty. Operand 51769 states and 296557 transitions. [2025-04-13 18:02:48,157 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:02:48,158 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:02:48,158 INFO L218 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:02:48,158 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 18:02:48,158 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-04-13 18:02:48,159 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:02:48,159 INFO L85 PathProgramCache]: Analyzing trace with hash -2137331797, now seen corresponding path program 1 times [2025-04-13 18:02:48,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:02:48,159 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114080116] [2025-04-13 18:02:48,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:02:48,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:02:48,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:02:48,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:02:48,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:02:48,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:02:48,254 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-13 18:02:48,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:02:48,254 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114080116] [2025-04-13 18:02:48,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114080116] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:02:48,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:02:48,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 18:02:48,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023030146] [2025-04-13 18:02:48,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:02:48,255 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 18:02:48,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:02:48,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 18:02:48,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 18:02:48,256 INFO L87 Difference]: Start difference. First operand 51769 states and 296557 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:02:49,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:02:49,826 INFO L93 Difference]: Finished difference Result 102721 states and 589138 transitions. [2025-04-13 18:02:49,826 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 18:02:49,826 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2025-04-13 18:02:49,826 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:02:50,568 INFO L225 Difference]: With dead ends: 102721 [2025-04-13 18:02:50,568 INFO L226 Difference]: Without dead ends: 55485 [2025-04-13 18:02:50,658 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 18:02:50,660 INFO L437 NwaCegarLoop]: 42 mSDtfsCounter, 49 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:02:50,660 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 65 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:02:50,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55485 states. [2025-04-13 18:02:52,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55485 to 55485. [2025-04-13 18:02:52,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55485 states, 55484 states have (on average 5.4806250450580345) internal successors, (304087), 55484 states have internal predecessors, (304087), 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-13 18:02:53,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55485 states to 55485 states and 304087 transitions. [2025-04-13 18:02:53,191 INFO L79 Accepts]: Start accepts. Automaton has 55485 states and 304087 transitions. Word has length 56 [2025-04-13 18:02:53,192 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:02:53,192 INFO L485 AbstractCegarLoop]: Abstraction has 55485 states and 304087 transitions. [2025-04-13 18:02:53,192 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:02:53,192 INFO L278 IsEmpty]: Start isEmpty. Operand 55485 states and 304087 transitions. [2025-04-13 18:02:53,404 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:02:53,404 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:02:53,404 INFO L218 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:02:53,404 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 18:02:53,405 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-04-13 18:02:53,405 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:02:53,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1631536089, now seen corresponding path program 1 times [2025-04-13 18:02:53,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:02:53,405 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805129855] [2025-04-13 18:02:53,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:02:53,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:02:53,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:02:53,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:02:53,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:02:53,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:02:53,490 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-13 18:02:53,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:02:53,490 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805129855] [2025-04-13 18:02:53,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805129855] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:02:53,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:02:53,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 18:02:53,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372056057] [2025-04-13 18:02:53,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:02:53,491 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 18:02:53,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:02:53,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 18:02:53,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 18:02:53,492 INFO L87 Difference]: Start difference. First operand 55485 states and 304087 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:02:54,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:02:54,995 INFO L93 Difference]: Finished difference Result 98197 states and 544215 transitions. [2025-04-13 18:02:54,995 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 18:02:54,995 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2025-04-13 18:02:54,995 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:02:55,370 INFO L225 Difference]: With dead ends: 98197 [2025-04-13 18:02:55,371 INFO L226 Difference]: Without dead ends: 40401 [2025-04-13 18:02:55,458 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 18:02:55,460 INFO L437 NwaCegarLoop]: 42 mSDtfsCounter, 48 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:02:55,461 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 65 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:02:55,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40401 states. [2025-04-13 18:02:56,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40401 to 40401. [2025-04-13 18:02:56,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40401 states, 40400 states have (on average 5.1936138613861385) internal successors, (209822), 40400 states have internal predecessors, (209822), 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-13 18:02:56,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40401 states to 40401 states and 209822 transitions. [2025-04-13 18:02:57,061 INFO L79 Accepts]: Start accepts. Automaton has 40401 states and 209822 transitions. Word has length 56 [2025-04-13 18:02:57,062 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:02:57,062 INFO L485 AbstractCegarLoop]: Abstraction has 40401 states and 209822 transitions. [2025-04-13 18:02:57,062 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:02:57,062 INFO L278 IsEmpty]: Start isEmpty. Operand 40401 states and 209822 transitions. [2025-04-13 18:02:57,413 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:02:57,413 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:02:57,413 INFO L218 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:02:57,413 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 18:02:57,413 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-04-13 18:02:57,414 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:02:57,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1308100135, now seen corresponding path program 1 times [2025-04-13 18:02:57,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:02:57,414 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077875339] [2025-04-13 18:02:57,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:02:57,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:02:57,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:02:57,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:02:57,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:02:57,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:02:57,484 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-13 18:02:57,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:02:57,485 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077875339] [2025-04-13 18:02:57,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077875339] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:02:57,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:02:57,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 18:02:57,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104263350] [2025-04-13 18:02:57,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:02:57,485 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 18:02:57,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:02:57,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 18:02:57,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 18:02:57,486 INFO L87 Difference]: Start difference. First operand 40401 states and 209822 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:02:58,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:02:58,462 INFO L93 Difference]: Finished difference Result 77459 states and 404486 transitions. [2025-04-13 18:02:58,462 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 18:02:58,462 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2025-04-13 18:02:58,462 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:02:58,911 INFO L225 Difference]: With dead ends: 77459 [2025-04-13 18:02:58,911 INFO L226 Difference]: Without dead ends: 42463 [2025-04-13 18:02:58,983 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 18:02:58,985 INFO L437 NwaCegarLoop]: 42 mSDtfsCounter, 48 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:02:58,986 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 65 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:02:59,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42463 states. [2025-04-13 18:03:00,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42463 to 42463. [2025-04-13 18:03:00,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42463 states, 42462 states have (on average 4.943667278978852) internal successors, (209918), 42462 states have internal predecessors, (209918), 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-13 18:03:00,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42463 states to 42463 states and 209918 transitions. [2025-04-13 18:03:00,774 INFO L79 Accepts]: Start accepts. Automaton has 42463 states and 209918 transitions. Word has length 56 [2025-04-13 18:03:00,774 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:00,774 INFO L485 AbstractCegarLoop]: Abstraction has 42463 states and 209918 transitions. [2025-04-13 18:03:00,774 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:00,775 INFO L278 IsEmpty]: Start isEmpty. Operand 42463 states and 209918 transitions. [2025-04-13 18:03:00,880 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:03:00,880 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:00,880 INFO L218 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:03:00,880 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 18:03:00,880 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-04-13 18:03:00,881 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:00,881 INFO L85 PathProgramCache]: Analyzing trace with hash 880899737, now seen corresponding path program 1 times [2025-04-13 18:03:00,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:00,881 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010434274] [2025-04-13 18:03:00,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:03:00,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:00,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:03:00,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:03:00,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:03:00,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:00,945 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-13 18:03:00,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:00,946 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010434274] [2025-04-13 18:03:00,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010434274] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:00,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:00,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 18:03:00,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957912407] [2025-04-13 18:03:00,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:00,946 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 18:03:00,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:00,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 18:03:00,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 18:03:00,946 INFO L87 Difference]: Start difference. First operand 42463 states and 209918 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:01,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:01,903 INFO L93 Difference]: Finished difference Result 78169 states and 388260 transitions. [2025-04-13 18:03:01,904 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 18:03:01,904 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2025-04-13 18:03:01,904 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:02,164 INFO L225 Difference]: With dead ends: 78169 [2025-04-13 18:03:02,164 INFO L226 Difference]: Without dead ends: 31245 [2025-04-13 18:03:02,242 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 18:03:02,242 INFO L437 NwaCegarLoop]: 42 mSDtfsCounter, 47 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:02,243 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 65 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:03:02,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31245 states. [2025-04-13 18:03:03,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31245 to 31245. [2025-04-13 18:03:03,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31245 states, 31244 states have (on average 4.660542824222251) internal successors, (145614), 31244 states have internal predecessors, (145614), 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-13 18:03:03,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31245 states to 31245 states and 145614 transitions. [2025-04-13 18:03:03,739 INFO L79 Accepts]: Start accepts. Automaton has 31245 states and 145614 transitions. Word has length 56 [2025-04-13 18:03:03,740 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:03,740 INFO L485 AbstractCegarLoop]: Abstraction has 31245 states and 145614 transitions. [2025-04-13 18:03:03,740 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:03,740 INFO L278 IsEmpty]: Start isEmpty. Operand 31245 states and 145614 transitions. [2025-04-13 18:03:03,825 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-04-13 18:03:03,825 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:03,825 INFO L218 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:03:03,825 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 18:03:03,825 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-04-13 18:03:03,826 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:03,826 INFO L85 PathProgramCache]: Analyzing trace with hash 686962002, now seen corresponding path program 1 times [2025-04-13 18:03:03,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:03,826 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322137856] [2025-04-13 18:03:03,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:03:03,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:03,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-04-13 18:03:03,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-04-13 18:03:03,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:03:03,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:03,924 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-13 18:03:03,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:03,924 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322137856] [2025-04-13 18:03:03,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322137856] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:03,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:03,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 18:03:03,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92015726] [2025-04-13 18:03:03,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:03,925 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 18:03:03,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:03,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 18:03:03,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 18:03:03,925 INFO L87 Difference]: Start difference. First operand 31245 states and 145614 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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-13 18:03:04,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:04,566 INFO L93 Difference]: Finished difference Result 48677 states and 227867 transitions. [2025-04-13 18:03:04,566 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 18:03:04,566 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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) Word has length 62 [2025-04-13 18:03:04,567 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:04,789 INFO L225 Difference]: With dead ends: 48677 [2025-04-13 18:03:04,789 INFO L226 Difference]: Without dead ends: 27261 [2025-04-13 18:03:04,827 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 18:03:04,828 INFO L437 NwaCegarLoop]: 40 mSDtfsCounter, 67 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:04,828 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 56 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:03:04,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27261 states. [2025-04-13 18:03:05,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27261 to 27261. [2025-04-13 18:03:05,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27261 states, 27260 states have (on average 4.615994130594277) internal successors, (125832), 27260 states have internal predecessors, (125832), 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-13 18:03:05,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27261 states to 27261 states and 125832 transitions. [2025-04-13 18:03:05,880 INFO L79 Accepts]: Start accepts. Automaton has 27261 states and 125832 transitions. Word has length 62 [2025-04-13 18:03:05,880 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:05,880 INFO L485 AbstractCegarLoop]: Abstraction has 27261 states and 125832 transitions. [2025-04-13 18:03:05,880 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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-13 18:03:05,880 INFO L278 IsEmpty]: Start isEmpty. Operand 27261 states and 125832 transitions. [2025-04-13 18:03:05,957 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-04-13 18:03:05,957 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:05,957 INFO L218 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:03:05,957 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 18:03:05,957 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-04-13 18:03:05,957 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:05,957 INFO L85 PathProgramCache]: Analyzing trace with hash 911421734, now seen corresponding path program 2 times [2025-04-13 18:03:05,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:05,958 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890888577] [2025-04-13 18:03:05,958 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:03:05,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:05,970 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 62 statements into 1 equivalence classes. [2025-04-13 18:03:05,998 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-04-13 18:03:05,998 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:03:05,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 18:03:05,998 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 18:03:06,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-04-13 18:03:06,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-04-13 18:03:06,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:03:06,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 18:03:06,061 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 18:03:06,061 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 18:03:06,062 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (10 of 11 remaining) [2025-04-13 18:03:06,064 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 11 remaining) [2025-04-13 18:03:06,064 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 11 remaining) [2025-04-13 18:03:06,064 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 11 remaining) [2025-04-13 18:03:06,064 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 11 remaining) [2025-04-13 18:03:06,064 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 11 remaining) [2025-04-13 18:03:06,065 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 11 remaining) [2025-04-13 18:03:06,065 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Thread1of1ForFork1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 11 remaining) [2025-04-13 18:03:06,065 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Thread1of1ForFork1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 11 remaining) [2025-04-13 18:03:06,065 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Thread1of1ForFork3Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 11 remaining) [2025-04-13 18:03:06,065 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Thread1of1ForFork3Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 11 remaining) [2025-04-13 18:03:06,065 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 18:03:06,069 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1] [2025-04-13 18:03:06,175 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 18:03:06,175 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 18:03:06,177 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 06:03:06 BasicIcfg [2025-04-13 18:03:06,177 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 18:03:06,178 INFO L158 Benchmark]: Toolchain (without parser) took 28141.14ms. Allocated memory was 155.2MB in the beginning and 7.1GB in the end (delta: 7.0GB). Free memory was 108.3MB in the beginning and 3.8GB in the end (delta: -3.7GB). Peak memory consumption was 3.3GB. Max. memory is 8.0GB. [2025-04-13 18:03:06,178 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 159.4MB. Free memory is still 85.1MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 18:03:06,178 INFO L158 Benchmark]: CACSL2BoogieTranslator took 295.38ms. Allocated memory is still 155.2MB. Free memory was 108.3MB in the beginning and 92.6MB in the end (delta: 15.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-13 18:03:06,178 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.33ms. Allocated memory is still 155.2MB. Free memory was 92.6MB in the beginning and 90.4MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 18:03:06,178 INFO L158 Benchmark]: Boogie Preprocessor took 63.00ms. Allocated memory is still 155.2MB. Free memory was 90.4MB in the beginning and 88.1MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 18:03:06,178 INFO L158 Benchmark]: RCFGBuilder took 644.47ms. Allocated memory is still 155.2MB. Free memory was 87.8MB in the beginning and 34.0MB in the end (delta: 53.8MB). Peak memory consumption was 54.5MB. Max. memory is 8.0GB. [2025-04-13 18:03:06,178 INFO L158 Benchmark]: TraceAbstraction took 27088.68ms. Allocated memory was 155.2MB in the beginning and 7.1GB in the end (delta: 7.0GB). Free memory was 33.3MB in the beginning and 3.8GB in the end (delta: -3.8GB). Peak memory consumption was 3.2GB. Max. memory is 8.0GB. [2025-04-13 18:03:06,179 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.28ms. Allocated memory is still 159.4MB. Free memory is still 85.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 295.38ms. Allocated memory is still 155.2MB. Free memory was 108.3MB in the beginning and 92.6MB in the end (delta: 15.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 42.33ms. Allocated memory is still 155.2MB. Free memory was 92.6MB in the beginning and 90.4MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 63.00ms. Allocated memory is still 155.2MB. Free memory was 90.4MB in the beginning and 88.1MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 644.47ms. Allocated memory is still 155.2MB. Free memory was 87.8MB in the beginning and 34.0MB in the end (delta: 53.8MB). Peak memory consumption was 54.5MB. Max. memory is 8.0GB. * TraceAbstraction took 27088.68ms. Allocated memory was 155.2MB in the beginning and 7.1GB in the end (delta: 7.0GB). Free memory was 33.3MB in the beginning and 3.8GB in the end (delta: -3.8GB). Peak memory consumption was 3.2GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 171]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L36] 0 _Atomic unsigned int x_0, y_1, x_8, y_9; [L37] 0 _Atomic _Bool f1_2, f2_3, f1_10, f2_11; [L38] 0 unsigned int temp_4, temp_5, temp_6, temp_7, temp_12, temp_13, temp_14, temp_15; [L142] 0 pthread_t t1, t4; [L145] 0 x_0 = __VERIFIER_nondet_uint() VAL [f1_10=0, f1_2=0, f2_11=0, f2_3=0, temp_12=0, temp_13=0, temp_14=0, temp_15=0, temp_4=0, temp_5=0, temp_6=0, temp_7=0, x_0=-4294967293, x_8=0, y_1=0, y_9=0] [L146] 0 y_1 = __VERIFIER_nondet_uint() VAL [f1_10=0, f1_2=0, f2_11=0, f2_3=0, temp_12=0, temp_13=0, temp_14=0, temp_15=0, temp_4=0, temp_5=0, temp_6=0, temp_7=0, x_0=-4294967293, x_8=0, y_1=-4294967292, y_9=0] [L147] 0 x_8 = __VERIFIER_nondet_uint() VAL [f1_10=0, f1_2=0, f2_11=0, f2_3=0, temp_12=0, temp_13=0, temp_14=0, temp_15=0, temp_4=0, temp_5=0, temp_6=0, temp_7=0, x_0=-4294967293, x_8=3, y_1=-4294967292, y_9=0] [L148] 0 y_9 = __VERIFIER_nondet_uint() VAL [f1_10=0, f1_2=0, f2_11=0, f2_3=0, temp_12=0, temp_13=0, temp_14=0, temp_15=0, temp_4=0, temp_5=0, temp_6=0, temp_7=0, x_0=-4294967293, x_8=3, y_1=-4294967292, y_9=4] [L149] 0 temp_4 = __VERIFIER_nondet_uint() [L150] 0 temp_5 = __VERIFIER_nondet_uint() [L151] 0 temp_6 = __VERIFIER_nondet_uint() [L152] 0 temp_7 = __VERIFIER_nondet_uint() [L153] 0 temp_12 = __VERIFIER_nondet_uint() [L154] 0 temp_13 = __VERIFIER_nondet_uint() [L155] 0 temp_14 = __VERIFIER_nondet_uint() [L156] 0 temp_15 = __VERIFIER_nondet_uint() [L157] 0 f1_2 = __VERIFIER_nondet_bool() VAL [f1_10=0, f1_2=0, f2_11=0, f2_3=0, x_0=-4294967293, x_8=3, y_1=-4294967292, y_9=4] [L158] 0 f2_3 = __VERIFIER_nondet_bool() VAL [f1_10=0, f1_2=0, f2_11=0, f2_3=1, x_0=-4294967293, x_8=3, y_1=-4294967292, y_9=4] [L159] 0 f1_10 = __VERIFIER_nondet_bool() VAL [f1_10=0, f1_2=0, f2_11=0, f2_3=1, x_0=-4294967293, x_8=3, y_1=-4294967292, y_9=4] [L160] 0 f2_11 = __VERIFIER_nondet_bool() VAL [f1_10=0, f1_2=0, f2_11=1, f2_3=1, x_0=-4294967293, x_8=3, y_1=-4294967292, y_9=4] [L163] CALL 0 assume_abort_if_not( ( x_0 == x_8 ) && ( y_1 == y_9 ) ) [L33] COND FALSE 0 !(!cond) [L163] RET 0 assume_abort_if_not( ( x_0 == x_8 ) && ( y_1 == y_9 ) ) [L165] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [\at(_argptr, Pre)={0:0}, f1_10=0, f1_2=0, f2_11=1, f2_3=1, t1=-6, x_0=-4294967293, x_8=3, y_1=-4294967292, y_9=4] [L78] 1 pthread_t t2, t3; VAL [\at(_argptr, Pre)={0:0}, _argptr={0:0}, f1_10=0, f1_2=0, f2_11=1, f2_3=1, x_0=-4294967293, x_8=3, y_1=-4294967292, y_9=4] [L166] FCALL, FORK 0 pthread_create(&t4, 0, thread4, 0) VAL [\at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, _argptr={0:0}, f1_10=0, f1_2=0, f2_11=1, f2_3=1, t1=-6, t4=-5, x_0=-4294967293, x_8=3, y_1=-4294967292, y_9=4] [L128] 2 pthread_t t5, t6; VAL [\at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=0, f1_2=0, f2_11=1, f2_3=1, x_0=-4294967293, x_8=3, y_1=-4294967292, y_9=4] [L130] 2 f1_10 = 0 VAL [\at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=0, f1_2=0, f2_11=1, f2_3=1, x_0=-4294967293, x_8=3, y_1=-4294967292, y_9=4] [L131] 2 f2_11 = 0 VAL [\at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=0, f1_2=0, f2_11=0, f2_3=1, x_0=-4294967293, x_8=3, y_1=-4294967292, y_9=4] [L133] FCALL, FORK 2 pthread_create(&t5, 0, thread5, 0) VAL [\at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=0, f1_2=0, f2_11=0, f2_3=1, t5=-4, x_0=-4294967293, x_8=3, y_1=-4294967292, y_9=4] [L92] COND TRUE 3 __VERIFIER_nondet_bool() [L93] 3 temp_12 = x_8 VAL [\at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, _argptr={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=0, f1_2=0, f2_11=0, f2_3=1, t5=-4, temp_12=3, x_0=-4294967293, x_8=3, y_1=-4294967292, y_9=4] [L94] 3 x_8 = temp_12 + 1 VAL [\at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, _argptr={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=0, f1_2=0, f2_11=0, f2_3=1, t5=-4, temp_12=3, x_0=-4294967293, x_8=4, y_1=-4294967292, y_9=4] [L96] 3 f1_10 = 1 VAL [\at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, _argptr={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=1, f1_2=0, f2_11=0, f2_3=1, t5=-4, temp_12=3, x_0=-4294967293, x_8=4, y_1=-4294967292, y_9=4] [L80] 1 f1_2 = 0 VAL [\at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=1, f1_2=0, f2_11=0, f2_3=1, t5=-4, temp_12=3, x_0=-4294967293, x_8=4, y_1=-4294967292, y_9=4] [L134] FCALL, FORK 2 pthread_create(&t6, 0, thread6, 0) VAL [\at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=1, f1_2=0, f2_11=0, f2_3=1, t5=-4, t6=-3, temp_12=3, x_0=-4294967293, x_8=4, y_1=-4294967292, y_9=4] [L110] COND TRUE 4 __VERIFIER_nondet_bool() [L111] 4 temp_14 = y_9 VAL [\at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, _argptr={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=1, f1_2=0, f2_11=0, f2_3=1, t5=-4, t6=-3, temp_12=3, temp_14=4, x_0=-4294967293, x_8=4, y_1=-4294967292, y_9=4] [L112] 4 y_9 = temp_14 + 1 VAL [\at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, _argptr={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=1, f1_2=0, f2_11=0, f2_3=1, t5=-4, t6=-3, temp_12=3, temp_14=4, x_0=-4294967293, x_8=4, y_1=-4294967292, y_9=5] [L114] 4 f2_11 = 1 VAL [\at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, _argptr={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=1, f1_2=0, f2_11=1, f2_3=1, t5=-4, t6=-3, temp_12=3, temp_14=4, x_0=-4294967293, x_8=4, y_1=-4294967292, y_9=5] [L115] CALL 4 assume_abort_if_not(f1_10) [L33] COND FALSE 4 !(!cond) [L115] RET 4 assume_abort_if_not(f1_10) [L117] 4 temp_15 = x_8 VAL [\at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, _argptr={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=1, f1_2=0, f2_11=1, f2_3=1, t5=-4, t6=-3, temp_12=3, temp_14=4, temp_15=4, x_0=-4294967293, x_8=4, y_1=-4294967292, y_9=5] [L118] 4 x_8 = temp_15 + 1 VAL [\at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, _argptr={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=1, f1_2=0, f2_11=1, f2_3=1, t5=-4, t6=-3, temp_12=3, temp_14=4, temp_15=4, x_0=-4294967293, x_8=5, y_1=-4294967292, y_9=5] [L97] CALL 3 assume_abort_if_not(f2_11) [L33] COND FALSE 3 !(!cond) [L97] RET 3 assume_abort_if_not(f2_11) [L99] 3 temp_13 = y_9 VAL [\at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, _argptr={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=1, f1_2=0, f2_11=1, f2_3=1, t5=-4, t6=-3, temp_12=3, temp_13=5, temp_14=4, temp_15=4, x_0=-4294967293, x_8=5, y_1=-4294967292, y_9=5] [L120] 4 f2_11 = 0 VAL [\at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, _argptr={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=1, f1_2=0, f2_11=0, f2_3=1, t5=-4, t6=-3, temp_12=3, temp_13=5, temp_14=4, temp_15=4, x_0=-4294967293, x_8=5, y_1=-4294967292, y_9=5] [L100] 3 y_9 = temp_13 + 1 VAL [\at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, _argptr={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=1, f1_2=0, f2_11=0, f2_3=1, t5=-4, t6=-3, temp_12=3, temp_13=5, temp_14=4, temp_15=4, x_0=-4294967293, x_8=5, y_1=-4294967292, y_9=6] [L102] 3 f1_10 = 0 VAL [\at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, _argptr={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=0, f1_2=0, f2_11=0, f2_3=1, t5=-4, t6=-3, temp_12=3, temp_13=5, temp_14=4, temp_15=4, x_0=-4294967293, x_8=5, y_1=-4294967292, y_9=6] [L121] CALL 4 assume_abort_if_not(!f1_10) [L33] COND FALSE 4 !(!cond) [L121] RET 4 assume_abort_if_not(!f1_10) [L110] COND FALSE 4 !(__VERIFIER_nondet_bool()) [L124] 4 return 0; [L103] CALL 3 assume_abort_if_not(!f2_11) [L33] COND FALSE 3 !(!cond) [L103] RET 3 assume_abort_if_not(!f2_11) [L92] COND FALSE 3 !(__VERIFIER_nondet_bool()) [L106] 3 return 0; [L135] FCALL, JOIN 3 pthread_join(t5, 0) VAL [\at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=0, f1_2=0, f2_11=0, f2_3=1, t5=-4, t6=-3, temp_12=3, temp_13=5, temp_14=4, temp_15=4, x_0=-4294967293, x_8=5, y_1=-4294967292, y_9=6] [L136] FCALL, JOIN 4 pthread_join(t6, 0) VAL [\at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=0, f1_2=0, f2_11=0, f2_3=1, t5=-4, t6=-3, temp_12=3, temp_13=5, temp_14=4, temp_15=4, x_0=-4294967293, x_8=5, y_1=-4294967292, y_9=6] [L138] 2 return 0; [L81] 1 f2_3 = 0 VAL [\at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, \result={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=0, f1_2=0, f2_11=0, f2_3=0, t5=-4, t6=-3, temp_12=3, temp_13=5, temp_14=4, temp_15=4, x_0=-4294967293, x_8=5, y_1=-4294967292, y_9=6] [L83] FCALL, FORK 1 pthread_create(&t2, 0, thread2, 0) VAL [\at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, \result={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=0, f1_2=0, f2_11=0, f2_3=0, t2=-2, t5=-4, t6=-3, temp_12=3, temp_13=5, temp_14=4, temp_15=4, x_0=-4294967293, x_8=5, y_1=-4294967292, y_9=6] [L84] FCALL, FORK 1 pthread_create(&t3, 0, thread3, 0) VAL [\at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, \result={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=0, f1_2=0, f2_11=0, f2_3=0, t2=-2, t3=-1, t5=-4, t6=-3, temp_12=3, temp_13=5, temp_14=4, temp_15=4, x_0=-4294967293, x_8=5, y_1=-4294967292, y_9=6] [L60] COND FALSE 6 !(__VERIFIER_nondet_bool()) [L74] 6 return 0; [L42] COND FALSE 5 !(__VERIFIER_nondet_bool()) [L56] 5 return 0; [L85] FCALL, JOIN 5 pthread_join(t2, 0) VAL [\at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, \result={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=0, f1_2=0, f2_11=0, f2_3=0, t2=-2, t3=-1, t5=-4, t6=-3, temp_12=3, temp_13=5, temp_14=4, temp_15=4, x_0=-4294967293, x_8=5, y_1=-4294967292, y_9=6] [L86] FCALL, JOIN 6 pthread_join(t3, 0) VAL [\at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, \result={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=0, f1_2=0, f2_11=0, f2_3=0, t2=-2, t3=-1, t5=-4, t6=-3, temp_12=3, temp_13=5, temp_14=4, temp_15=4, x_0=-4294967293, x_8=5, y_1=-4294967292, y_9=6] [L88] 1 return 0; [L167] FCALL, JOIN 1 pthread_join(t1, 0) VAL [\at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, \result={0:0}, \result={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=0, f1_2=0, f2_11=0, f2_3=0, t1=-6, t2=-2, t3=-1, t4=-5, t5=-4, t6=-3, temp_12=3, temp_13=5, temp_14=4, temp_15=4, x_0=-4294967293, x_8=5, y_1=-4294967292, y_9=6] [L168] FCALL, JOIN 2 pthread_join(t4, 0) VAL [\at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, \result={0:0}, \result={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=0, f1_2=0, f2_11=0, f2_3=0, t1=-6, t2=-2, t3=-1, t4=-5, t5=-4, t6=-3, temp_12=3, temp_13=5, temp_14=4, temp_15=4, x_0=-4294967293, x_8=5, y_1=-4294967292, y_9=6] [L170] CALL 0 assume_abort_if_not( !( ( x_0 == x_8 ) && ( y_1 == y_9 ) ) ) [L33] COND FALSE 0 !(!cond) [L170] RET 0 assume_abort_if_not( !( ( x_0 == x_8 ) && ( y_1 == y_9 ) ) ) [L171] 0 reach_error() VAL [\at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, \result={0:0}, \result={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=0, f1_2=0, f2_11=0, f2_3=0, t1=-6, t2=-2, t3=-1, t4=-5, t5=-4, t6=-3, temp_12=3, temp_13=5, temp_14=4, temp_15=4, x_0=-4294967293, x_8=5, y_1=-4294967292, y_9=6] - UnprovableResult [Line: 84]: 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: 83]: 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: 165]: 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: 166]: 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: 134]: 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: 133]: 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: 83]: 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: 84]: 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: 134]: 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: 133]: 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 13 procedures, 148 locations, 179 edges, 11 error locations. Started 1 CEGAR loops. OverallTime: 26.8s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 1.7s, AutomataDifference: 10.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 267 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 267 mSDsluCounter, 360 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 124 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 842 IncrementalHoareTripleChecker+Invalid, 853 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 236 mSDtfsCounter, 842 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55485occurred in iteration=2, InterpolantAutomatonStates: 18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 10.9s AutomataMinimizationTime, 6 MinimizatonAttempts, 1469 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 398 NumberOfCodeBlocks, 398 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 330 ConstructedInterpolants, 0 QuantifiedInterpolants, 874 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-04-13 18:03:06,196 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...