/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis FINITE_AUTOMATA --preprocessor.replace.while.statements.and.if-then-else.statements false -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 22:30:45,584 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 22:30:45,631 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 22:30:45,634 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 22:30:45,634 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 22:30:45,653 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 22:30:45,653 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 22:30:45,653 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 22:30:45,654 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 22:30:45,654 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 22:30:45,654 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 22:30:45,654 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 22:30:45,654 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 22:30:45,654 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 22:30:45,654 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 22:30:45,654 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 22:30:45,654 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 22:30:45,654 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 22:30:45,654 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 22:30:45,654 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 22:30:45,654 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 22:30:45,655 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 22:30:45,655 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 22:30:45,655 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 22:30:45,655 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 22:30:45,655 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 22:30:45,655 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 22:30:45,655 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 22:30:45,655 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 22:30:45,655 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 22:30:45,655 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 22:30:45,655 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 22:30:45,655 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 22:30:45,655 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 22:30:45,655 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 22:30:45,655 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 22:30:45,655 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 22:30:45,656 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 22:30:45,656 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 22:30:45,656 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 22:30:45,656 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 22:30:45,656 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 22:30:45,656 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 22:30:45,656 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 22:30:45,656 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 22:30:45,656 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 22:30:45,656 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 22:30:45,656 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-13 22:30:45,852 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 22:30:45,860 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 22:30:45,861 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 22:30:45,862 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 22:30:45,862 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 22:30:45,863 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 22:30:47,175 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ccefb9659/471c41d6f042414f9fdfd131ab764fba/FLAGe81c7dc09 [2025-04-13 22:30:47,401 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 22:30:47,401 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-barrier-loop.wvr.c [2025-04-13 22:30:47,412 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ccefb9659/471c41d6f042414f9fdfd131ab764fba/FLAGe81c7dc09 [2025-04-13 22:30:48,176 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ccefb9659/471c41d6f042414f9fdfd131ab764fba [2025-04-13 22:30:48,178 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 22:30:48,179 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 22:30:48,180 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 22:30:48,180 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 22:30:48,184 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 22:30:48,184 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 10:30:48" (1/1) ... [2025-04-13 22:30:48,185 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68f07c66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:30:48, skipping insertion in model container [2025-04-13 22:30:48,185 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 10:30:48" (1/1) ... [2025-04-13 22:30:48,199 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 22:30:48,398 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 22:30:48,405 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 22:30:48,415 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 22:30:48,457 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 22:30:48,460 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 22:30:48,470 INFO L204 MainTranslator]: Completed translation [2025-04-13 22:30:48,470 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:30:48 WrapperNode [2025-04-13 22:30:48,470 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 22:30:48,471 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 22:30:48,471 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 22:30:48,471 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 22:30:48,478 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:30:48" (1/1) ... [2025-04-13 22:30:48,485 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:30:48" (1/1) ... [2025-04-13 22:30:48,503 INFO L138 Inliner]: procedures = 22, calls = 22, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 223 [2025-04-13 22:30:48,503 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 22:30:48,504 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 22:30:48,504 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 22:30:48,504 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 22:30:48,509 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:30:48" (1/1) ... [2025-04-13 22:30:48,509 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:30:48" (1/1) ... [2025-04-13 22:30:48,515 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:30:48" (1/1) ... [2025-04-13 22:30:48,532 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 22:30:48,532 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:30:48" (1/1) ... [2025-04-13 22:30:48,535 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:30:48" (1/1) ... [2025-04-13 22:30:48,542 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:30:48" (1/1) ... [2025-04-13 22:30:48,543 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:30:48" (1/1) ... [2025-04-13 22:30:48,544 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:30:48" (1/1) ... [2025-04-13 22:30:48,545 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:30:48" (1/1) ... [2025-04-13 22:30:48,548 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 22:30:48,548 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-13 22:30:48,549 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-13 22:30:48,549 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-13 22:30:48,549 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:30:48" (1/1) ... [2025-04-13 22:30:48,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 22:30:48,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:30:48,574 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 22:30:48,577 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 22:30:48,594 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 22:30:48,594 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 22:30:48,594 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 22:30:48,594 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 22:30:48,595 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 22:30:48,595 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-13 22:30:48,595 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-13 22:30:48,595 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-13 22:30:48,595 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-13 22:30:48,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 22:30:48,595 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2025-04-13 22:30:48,595 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2025-04-13 22:30:48,595 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2025-04-13 22:30:48,595 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2025-04-13 22:30:48,595 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 22:30:48,595 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 22:30:48,596 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 22:30:48,672 INFO L256 CfgBuilder]: Building ICFG [2025-04-13 22:30:48,673 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 22:30:48,922 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 22:30:48,923 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 22:30:48,923 INFO L318 CfgBuilder]: Performing block encoding [2025-04-13 22:30:49,129 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 22:30:49,136 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 22:30:49,139 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 22:30:49,143 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 22:30:49,149 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 22:30:49,149 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 10:30:49 BoogieIcfgContainer [2025-04-13 22:30:49,149 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-13 22:30:49,151 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 22:30:49,151 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 22:30:49,154 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 22:30:49,154 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 10:30:48" (1/3) ... [2025-04-13 22:30:49,155 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cc1d3b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 10:30:49, skipping insertion in model container [2025-04-13 22:30:49,155 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:30:48" (2/3) ... [2025-04-13 22:30:49,155 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cc1d3b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 10:30:49, skipping insertion in model container [2025-04-13 22:30:49,155 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 10:30:49" (3/3) ... [2025-04-13 22:30:49,156 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-barrier-loop.wvr.c [2025-04-13 22:30:49,167 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 22:30:49,169 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 22:30:49,170 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 22:30:49,250 INFO L143 ThreadInstanceAdder]: Constructed 18 joinOtherThreadTransitions. [2025-04-13 22:30:49,271 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 106 places, 99 transitions, 264 flow [2025-04-13 22:30:51,125 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 22:30:51,142 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 22:30:51,150 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;@7ccdd81d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 22:30:51,150 INFO L341 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-04-13 22:30:51,284 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 22:30:51,621 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-04-13 22:30:51,622 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:30:51,622 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 22:30:51,623 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-04-13 22:30:51,627 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:30:51,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1668606182, now seen corresponding path program 1 times [2025-04-13 22:30:51,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:30:51,633 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10721368] [2025-04-13 22:30:51,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:30:51,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:30:51,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-04-13 22:30:51,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-04-13 22:30:51,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:30:51,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:30:52,198 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 22:30:52,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:30:52,199 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10721368] [2025-04-13 22:30:52,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10721368] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:30:52,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:30:52,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 22:30:52,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66349818] [2025-04-13 22:30:52,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:30:52,202 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 22:30:52,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:30:52,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 22:30:52,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 22:30:52,325 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 22:30:53,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:30:53,200 INFO L93 Difference]: Finished difference Result 53295 states and 304206 transitions. [2025-04-13 22:30:53,201 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 22:30:53,202 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 22:30:53,202 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:30:53,963 INFO L225 Difference]: With dead ends: 53295 [2025-04-13 22:30:53,963 INFO L226 Difference]: Without dead ends: 53238 [2025-04-13 22:30:53,999 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 22:30:54,010 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 8 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:30:54,011 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 0 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:30:54,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53238 states. [2025-04-13 22:30:56,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53238 to 51769. [2025-04-13 22:30:56,377 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 22:30:57,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51769 states to 51769 states and 296557 transitions. [2025-04-13 22:30:57,066 INFO L79 Accepts]: Start accepts. Automaton has 51769 states and 296557 transitions. Word has length 50 [2025-04-13 22:30:57,067 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:30:57,067 INFO L485 AbstractCegarLoop]: Abstraction has 51769 states and 296557 transitions. [2025-04-13 22:30:57,067 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 22:30:57,068 INFO L278 IsEmpty]: Start isEmpty. Operand 51769 states and 296557 transitions. [2025-04-13 22:30:57,266 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:30:57,267 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:30:57,267 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 22:30:57,267 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 22:30:57,267 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-04-13 22:30:57,268 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:30:57,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1722787251, now seen corresponding path program 1 times [2025-04-13 22:30:57,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:30:57,268 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736943717] [2025-04-13 22:30:57,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:30:57,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:30:57,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:30:57,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:30:57,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:30:57,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:30:57,337 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 22:30:57,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:30:57,337 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736943717] [2025-04-13 22:30:57,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736943717] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:30:57,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:30:57,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 22:30:57,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599659238] [2025-04-13 22:30:57,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:30:57,338 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 22:30:57,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:30:57,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 22:30:57,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 22:30:57,339 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 22:30:59,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:30:59,010 INFO L93 Difference]: Finished difference Result 98947 states and 570399 transitions. [2025-04-13 22:30:59,010 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 22:30:59,010 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 22:30:59,010 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:30:59,692 INFO L225 Difference]: With dead ends: 98947 [2025-04-13 22:30:59,692 INFO L226 Difference]: Without dead ends: 54549 [2025-04-13 22:30:59,761 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 22:30:59,762 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 49 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:30:59,762 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 0 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:30:59,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54549 states. [2025-04-13 22:31:01,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54549 to 54549. [2025-04-13 22:31:01,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54549 states, 54548 states have (on average 5.47998093422307) internal successors, (298922), 54548 states have internal predecessors, (298922), 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 22:31:01,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54549 states to 54549 states and 298922 transitions. [2025-04-13 22:31:01,907 INFO L79 Accepts]: Start accepts. Automaton has 54549 states and 298922 transitions. Word has length 56 [2025-04-13 22:31:01,907 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:31:01,907 INFO L485 AbstractCegarLoop]: Abstraction has 54549 states and 298922 transitions. [2025-04-13 22:31:01,908 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 22:31:01,908 INFO L278 IsEmpty]: Start isEmpty. Operand 54549 states and 298922 transitions. [2025-04-13 22:31:02,244 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:31:02,244 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:31:02,245 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 22:31:02,245 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 22:31:02,245 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-04-13 22:31:02,245 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:31:02,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1679471043, now seen corresponding path program 1 times [2025-04-13 22:31:02,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:31:02,246 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794088339] [2025-04-13 22:31:02,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:31:02,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:31:02,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:31:02,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:31:02,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:31:02,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:31:02,309 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 22:31:02,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:31:02,310 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794088339] [2025-04-13 22:31:02,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794088339] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:31:02,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:31:02,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 22:31:02,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20163428] [2025-04-13 22:31:02,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:31:02,311 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 22:31:02,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:31:02,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 22:31:02,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 22:31:02,311 INFO L87 Difference]: Start difference. First operand 54549 states and 298922 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 22:31:03,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:31:03,730 INFO L93 Difference]: Finished difference Result 108679 states and 595397 transitions. [2025-04-13 22:31:03,730 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 22:31:03,730 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 22:31:03,730 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:31:04,365 INFO L225 Difference]: With dead ends: 108679 [2025-04-13 22:31:04,365 INFO L226 Difference]: Without dead ends: 58445 [2025-04-13 22:31:04,462 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 22:31:04,464 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 50 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:31:04,465 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 0 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:31:04,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58445 states. [2025-04-13 22:31:06,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58445 to 58445. [2025-04-13 22:31:06,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58445 states, 58444 states have (on average 5.230288823489152) internal successors, (305679), 58444 states have internal predecessors, (305679), 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 22:31:06,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58445 states to 58445 states and 305679 transitions. [2025-04-13 22:31:06,823 INFO L79 Accepts]: Start accepts. Automaton has 58445 states and 305679 transitions. Word has length 56 [2025-04-13 22:31:06,824 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:31:06,824 INFO L485 AbstractCegarLoop]: Abstraction has 58445 states and 305679 transitions. [2025-04-13 22:31:06,824 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 22:31:06,824 INFO L278 IsEmpty]: Start isEmpty. Operand 58445 states and 305679 transitions. [2025-04-13 22:31:07,233 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:31:07,233 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:31:07,233 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 22:31:07,234 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 22:31:07,234 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-04-13 22:31:07,234 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:31:07,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1296452949, now seen corresponding path program 1 times [2025-04-13 22:31:07,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:31:07,234 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101358227] [2025-04-13 22:31:07,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:31:07,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:31:07,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:31:07,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:31:07,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:31:07,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:31:07,308 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 22:31:07,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:31:07,309 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101358227] [2025-04-13 22:31:07,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101358227] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:31:07,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:31:07,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 22:31:07,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723170373] [2025-04-13 22:31:07,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:31:07,309 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 22:31:07,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:31:07,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 22:31:07,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 22:31:07,311 INFO L87 Difference]: Start difference. First operand 58445 states and 305679 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 22:31:08,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:31:08,687 INFO L93 Difference]: Finished difference Result 103859 states and 548923 transitions. [2025-04-13 22:31:08,687 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 22:31:08,687 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 22:31:08,688 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:31:08,988 INFO L225 Difference]: With dead ends: 103859 [2025-04-13 22:31:08,988 INFO L226 Difference]: Without dead ends: 42411 [2025-04-13 22:31:09,079 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 22:31:09,080 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 49 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:31:09,080 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 0 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:31:09,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42411 states. [2025-04-13 22:31:10,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42411 to 42411. [2025-04-13 22:31:10,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42411 states, 42410 states have (on average 4.94494223060599) internal successors, (209715), 42410 states have internal predecessors, (209715), 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 22:31:10,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42411 states to 42411 states and 209715 transitions. [2025-04-13 22:31:10,572 INFO L79 Accepts]: Start accepts. Automaton has 42411 states and 209715 transitions. Word has length 56 [2025-04-13 22:31:10,572 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:31:10,572 INFO L485 AbstractCegarLoop]: Abstraction has 42411 states and 209715 transitions. [2025-04-13 22:31:10,573 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 22:31:10,573 INFO L278 IsEmpty]: Start isEmpty. Operand 42411 states and 209715 transitions. [2025-04-13 22:31:10,690 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:31:10,690 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:31:10,690 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 22:31:10,691 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 22:31:10,691 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-04-13 22:31:10,691 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:31:10,691 INFO L85 PathProgramCache]: Analyzing trace with hash -2020147259, now seen corresponding path program 1 times [2025-04-13 22:31:10,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:31:10,691 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576681956] [2025-04-13 22:31:10,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:31:10,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:31:10,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:31:10,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:31:10,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:31:10,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:31:10,985 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 22:31:10,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:31:10,985 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576681956] [2025-04-13 22:31:10,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576681956] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:31:10,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:31:10,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 22:31:10,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885908781] [2025-04-13 22:31:10,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:31:10,986 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 22:31:10,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:31:10,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 22:31:10,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 22:31:10,986 INFO L87 Difference]: Start difference. First operand 42411 states and 209715 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 22:31:11,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:31:11,932 INFO L93 Difference]: Finished difference Result 77860 states and 387211 transitions. [2025-04-13 22:31:11,932 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 22:31:11,932 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 22:31:11,933 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:31:12,187 INFO L225 Difference]: With dead ends: 77860 [2025-04-13 22:31:12,187 INFO L226 Difference]: Without dead ends: 31245 [2025-04-13 22:31:12,250 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 22:31:12,251 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 46 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:31:12,251 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 0 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:31:12,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31245 states. [2025-04-13 22:31:12,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31245 to 31245. [2025-04-13 22:31:13,013 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 22:31:13,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31245 states to 31245 states and 145614 transitions. [2025-04-13 22:31:13,465 INFO L79 Accepts]: Start accepts. Automaton has 31245 states and 145614 transitions. Word has length 56 [2025-04-13 22:31:13,465 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:31:13,466 INFO L485 AbstractCegarLoop]: Abstraction has 31245 states and 145614 transitions. [2025-04-13 22:31:13,466 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 22:31:13,467 INFO L278 IsEmpty]: Start isEmpty. Operand 31245 states and 145614 transitions. [2025-04-13 22:31:13,548 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-04-13 22:31:13,548 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:31:13,548 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 22:31:13,548 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 22:31:13,548 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-04-13 22:31:13,549 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:31:13,549 INFO L85 PathProgramCache]: Analyzing trace with hash -2090562086, now seen corresponding path program 1 times [2025-04-13 22:31:13,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:31:13,549 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51422957] [2025-04-13 22:31:13,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:31:13,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:31:13,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-04-13 22:31:13,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-04-13 22:31:13,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:31:13,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:31:13,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:31:13,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:31:13,698 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51422957] [2025-04-13 22:31:13,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51422957] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:31:13,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:31:13,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 22:31:13,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268525152] [2025-04-13 22:31:13,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:31:13,698 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 22:31:13,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:31:13,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 22:31:13,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 22:31:13,699 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 22:31:14,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:31:14,499 INFO L93 Difference]: Finished difference Result 48871 states and 228470 transitions. [2025-04-13 22:31:14,500 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 22:31:14,500 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 22:31:14,500 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:31:14,718 INFO L225 Difference]: With dead ends: 48871 [2025-04-13 22:31:14,719 INFO L226 Difference]: Without dead ends: 27245 [2025-04-13 22:31:14,749 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 22:31:14,750 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 60 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:31:14,750 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 0 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:31:14,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27245 states. [2025-04-13 22:31:15,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27245 to 27245. [2025-04-13 22:31:15,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27245 states, 27244 states have (on average 4.616722948172074) internal successors, (125778), 27244 states have internal predecessors, (125778), 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 22:31:15,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27245 states to 27245 states and 125778 transitions. [2025-04-13 22:31:15,639 INFO L79 Accepts]: Start accepts. Automaton has 27245 states and 125778 transitions. Word has length 62 [2025-04-13 22:31:15,640 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:31:15,640 INFO L485 AbstractCegarLoop]: Abstraction has 27245 states and 125778 transitions. [2025-04-13 22:31:15,640 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 22:31:15,640 INFO L278 IsEmpty]: Start isEmpty. Operand 27245 states and 125778 transitions. [2025-04-13 22:31:15,698 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-04-13 22:31:15,698 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:31:15,698 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 22:31:15,698 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 22:31:15,698 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-04-13 22:31:15,699 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:31:15,699 INFO L85 PathProgramCache]: Analyzing trace with hash -642767532, now seen corresponding path program 2 times [2025-04-13 22:31:15,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:31:15,699 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449896413] [2025-04-13 22:31:15,699 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:31:15,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:31:15,707 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 62 statements into 1 equivalence classes. [2025-04-13 22:31:15,733 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-04-13 22:31:15,734 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:31:15,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 22:31:15,734 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 22:31:15,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-04-13 22:31:15,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-04-13 22:31:15,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:31:15,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 22:31:15,787 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 22:31:15,787 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 22:31:15,788 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (10 of 11 remaining) [2025-04-13 22:31:15,789 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 11 remaining) [2025-04-13 22:31:15,790 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 11 remaining) [2025-04-13 22:31:15,790 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 11 remaining) [2025-04-13 22:31:15,790 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 11 remaining) [2025-04-13 22:31:15,790 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 11 remaining) [2025-04-13 22:31:15,791 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 11 remaining) [2025-04-13 22:31:15,791 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Thread1of1ForFork3Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 11 remaining) [2025-04-13 22:31:15,791 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Thread1of1ForFork3Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 11 remaining) [2025-04-13 22:31:15,791 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Thread1of1ForFork0Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 11 remaining) [2025-04-13 22:31:15,791 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Thread1of1ForFork0Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 11 remaining) [2025-04-13 22:31:15,791 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 22:31:15,794 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1] [2025-04-13 22:31:15,910 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 22:31:15,910 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 22:31:15,913 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 10:31:15 BasicIcfg [2025-04-13 22:31:15,913 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 22:31:15,913 INFO L158 Benchmark]: Toolchain (without parser) took 27733.99ms. Allocated memory was 125.8MB in the beginning and 6.8GB in the end (delta: 6.7GB). Free memory was 89.4MB in the beginning and 3.4GB in the end (delta: -3.4GB). Peak memory consumption was 3.3GB. Max. memory is 8.0GB. [2025-04-13 22:31:15,913 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 142.6MB. Free memory is still 78.3MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 22:31:15,913 INFO L158 Benchmark]: CACSL2BoogieTranslator took 290.25ms. Allocated memory is still 125.8MB. Free memory was 89.4MB in the beginning and 73.8MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-04-13 22:31:15,915 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.29ms. Allocated memory is still 125.8MB. Free memory was 73.8MB in the beginning and 71.6MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 22:31:15,915 INFO L158 Benchmark]: Boogie Preprocessor took 44.30ms. Allocated memory is still 125.8MB. Free memory was 71.6MB in the beginning and 68.9MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 22:31:15,915 INFO L158 Benchmark]: IcfgBuilder took 600.85ms. Allocated memory is still 125.8MB. Free memory was 68.9MB in the beginning and 78.5MB in the end (delta: -9.6MB). Peak memory consumption was 52.2MB. Max. memory is 8.0GB. [2025-04-13 22:31:15,915 INFO L158 Benchmark]: TraceAbstraction took 26761.28ms. Allocated memory was 125.8MB in the beginning and 6.8GB in the end (delta: 6.7GB). Free memory was 77.8MB in the beginning and 3.4GB in the end (delta: -3.4GB). Peak memory consumption was 3.3GB. Max. memory is 8.0GB. [2025-04-13 22:31:15,916 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.16ms. Allocated memory is still 142.6MB. Free memory is still 78.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 290.25ms. Allocated memory is still 125.8MB. Free memory was 89.4MB in the beginning and 73.8MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 32.29ms. Allocated memory is still 125.8MB. Free memory was 73.8MB in the beginning and 71.6MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 44.30ms. Allocated memory is still 125.8MB. Free memory was 71.6MB in the beginning and 68.9MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * IcfgBuilder took 600.85ms. Allocated memory is still 125.8MB. Free memory was 68.9MB in the beginning and 78.5MB in the end (delta: -9.6MB). Peak memory consumption was 52.2MB. Max. memory is 8.0GB. * TraceAbstraction took 26761.28ms. Allocated memory was 125.8MB in the beginning and 6.8GB in the end (delta: 6.7GB). Free memory was 77.8MB in the beginning and 3.4GB in the end (delta: -3.4GB). Peak memory consumption was 3.3GB. 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=3, 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=3, x_8=0, y_1=4, 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=3, x_8=-4294967293, y_1=4, 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=3, x_8=-4294967293, y_1=4, y_9=-4294967292] [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=1, f2_11=0, f2_3=0, x_0=3, x_8=-4294967293, y_1=4, y_9=-4294967292] [L158] 0 f2_3 = __VERIFIER_nondet_bool() VAL [f1_10=0, f1_2=1, f2_11=0, f2_3=0, x_0=3, x_8=-4294967293, y_1=4, y_9=-4294967292] [L159] 0 f1_10 = __VERIFIER_nondet_bool() VAL [f1_10=1, f1_2=1, f2_11=0, f2_3=0, x_0=3, x_8=-4294967293, y_1=4, y_9=-4294967292] [L160] 0 f2_11 = __VERIFIER_nondet_bool() VAL [f1_10=1, f1_2=1, f2_11=0, f2_3=0, x_0=3, x_8=-4294967293, y_1=4, y_9=-4294967292] [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=1, f1_2=1, f2_11=0, f2_3=0, t1=-4, x_0=3, x_8=-4294967293, y_1=4, y_9=-4294967292] [L78] 1 pthread_t t2, t3; VAL [\at(_argptr, Pre)={0:0}, _argptr={0:0}, f1_10=1, f1_2=1, f2_11=0, f2_3=0, x_0=3, x_8=-4294967293, y_1=4, y_9=-4294967292] [L80] 1 f1_2 = 0 VAL [\at(_argptr, Pre)={0:0}, _argptr={0:0}, f1_10=1, f1_2=0, f2_11=0, f2_3=0, x_0=3, x_8=-4294967293, y_1=4, y_9=-4294967292] [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=1, f1_2=0, f2_11=0, f2_3=0, t1=-4, t4=-3, x_0=3, x_8=-4294967293, y_1=4, y_9=-4294967292] [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=1, f1_2=0, f2_11=0, f2_3=0, x_0=3, x_8=-4294967293, y_1=4, y_9=-4294967292] [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=0, f2_3=0, x_0=3, x_8=-4294967293, y_1=4, y_9=-4294967292] [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=0, x_0=3, x_8=-4294967293, y_1=4, y_9=-4294967292] [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=0, t5=-2, x_0=3, x_8=-4294967293, y_1=4, y_9=-4294967292] [L92] COND TRUE 3 __VERIFIER_nondet_bool() [L92] COND FALSE 3 !(__VERIFIER_nondet_bool()) [L106] 3 return 0; [L81] 1 f2_3 = 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=0, t5=-2, x_0=3, x_8=-4294967293, y_1=4, y_9=-4294967292] [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=0, f1_2=0, f2_11=0, f2_3=0, t5=-2, t6=-1, x_0=3, x_8=-4294967293, y_1=4, y_9=-4294967292] [L110] COND TRUE 4 __VERIFIER_nondet_bool() [L110] COND FALSE 4 !(__VERIFIER_nondet_bool()) [L124] 4 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=0, t2=0, t5=-2, t6=-1, x_0=3, x_8=-4294967293, y_1=4, y_9=-4294967292] [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=0, t2=0, t5=-2, t6=-1, x_0=3, x_8=-4294967293, y_1=4, y_9=-4294967292] [L83] FCALL, FORK 1 pthread_create(&t2, 0, thread2, 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=0, t2=0, t5=-2, t6=-1, x_0=3, x_8=-4294967293, y_1=4, y_9=-4294967292] [L42] COND TRUE 5 __VERIFIER_nondet_bool() [L42] COND TRUE 5 __VERIFIER_nondet_bool() [L43] 5 temp_4 = x_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=0, t2=0, t5=-2, t6=-1, temp_4=3, x_0=3, x_8=-4294967293, y_1=4, y_9=-4294967292] [L44] 5 x_0 = temp_4 + 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=0, t2=0, t5=-2, t6=-1, temp_4=3, x_0=4, x_8=-4294967293, y_1=4, y_9=-4294967292] [L46] 5 f1_2 = 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=1, f2_11=0, f2_3=0, t2=0, t5=-2, t6=-1, temp_4=3, x_0=4, x_8=-4294967293, y_1=4, y_9=-4294967292] [L84] FCALL, FORK 1 pthread_create(&t3, 0, thread3, 0) VAL [\at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=0, f1_2=1, f2_11=0, f2_3=0, t2=0, t3=1, t5=-2, t6=-1, temp_4=3, x_0=4, x_8=-4294967293, y_1=4, y_9=-4294967292] [L60] COND TRUE 6 __VERIFIER_nondet_bool() [L60] COND TRUE 6 __VERIFIER_nondet_bool() [L61] 6 temp_6 = y_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=1, f2_11=0, f2_3=0, t2=0, t3=1, t5=-2, t6=-1, temp_4=3, temp_6=4, x_0=4, x_8=-4294967293, y_1=4, y_9=-4294967292] [L62] 6 y_1 = temp_6 + 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=1, f2_11=0, f2_3=0, t2=0, t3=1, t5=-2, t6=-1, temp_4=3, temp_6=4, x_0=4, x_8=-4294967293, y_1=5, y_9=-4294967292] [L64] 6 f2_3 = 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=1, f2_11=0, f2_3=1, t2=0, t3=1, t5=-2, t6=-1, temp_4=3, temp_6=4, x_0=4, x_8=-4294967293, y_1=5, y_9=-4294967292] [L47] CALL 5 assume_abort_if_not(f2_3) [L33] COND FALSE 5 !(!cond) [L47] RET 5 assume_abort_if_not(f2_3) [L49] 5 temp_5 = y_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=1, f2_11=0, f2_3=1, t2=0, t3=1, t5=-2, t6=-1, temp_4=3, temp_5=5, temp_6=4, x_0=4, x_8=-4294967293, y_1=5, y_9=-4294967292] [L50] 5 y_1 = temp_5 + 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=1, f2_11=0, f2_3=1, t2=0, t3=1, t5=-2, t6=-1, temp_4=3, temp_5=5, temp_6=4, x_0=4, x_8=-4294967293, y_1=6, y_9=-4294967292] [L138] 2 return 0; [L65] CALL 6 assume_abort_if_not(f1_2) [L33] COND FALSE 6 !(!cond) [L65] RET 6 assume_abort_if_not(f1_2) [L67] 6 temp_7 = x_0 VAL [\at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, \result={0:0}, _argptr={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=0, f1_2=1, f2_11=0, f2_3=1, t2=0, t3=1, t5=-2, t6=-1, temp_4=3, temp_5=5, temp_6=4, temp_7=4, x_0=4, x_8=-4294967293, y_1=6, y_9=-4294967292] [L68] 6 x_0 = temp_7 + 1 VAL [\at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, \result={0:0}, _argptr={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=0, f1_2=1, f2_11=0, f2_3=1, t2=0, t3=1, t5=-2, t6=-1, temp_4=3, temp_5=5, temp_6=4, temp_7=4, x_0=5, x_8=-4294967293, y_1=6, y_9=-4294967292] [L70] 6 f2_3 = 0 VAL [\at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, \result={0:0}, _argptr={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=0, f1_2=1, f2_11=0, f2_3=0, t2=0, t3=1, t5=-2, t6=-1, temp_4=3, temp_5=5, temp_6=4, temp_7=4, x_0=5, x_8=-4294967293, y_1=6, y_9=-4294967292] [L52] 5 f1_2 = 0 VAL [\at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, \result={0:0}, _argptr={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=0, f1_2=0, f2_11=0, f2_3=0, t2=0, t3=1, t5=-2, t6=-1, temp_4=3, temp_5=5, temp_6=4, temp_7=4, x_0=5, x_8=-4294967293, y_1=6, y_9=-4294967292] [L71] CALL 6 assume_abort_if_not(!f1_2) [L33] COND FALSE 6 !(!cond) [L71] RET 6 assume_abort_if_not(!f1_2) [L60] COND TRUE 6 __VERIFIER_nondet_bool() [L60] COND FALSE 6 !(__VERIFIER_nondet_bool()) [L74] 6 return 0; [L53] CALL 5 assume_abort_if_not(!f2_3) [L33] COND FALSE 5 !(!cond) [L53] RET 5 assume_abort_if_not(!f2_3) [L42] COND TRUE 5 __VERIFIER_nondet_bool() [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=0, t3=1, t5=-2, t6=-1, temp_4=3, temp_5=5, temp_6=4, temp_7=4, x_0=5, x_8=-4294967293, y_1=6, y_9=-4294967292] [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=0, t3=1, t5=-2, t6=-1, temp_4=3, temp_5=5, temp_6=4, temp_7=4, x_0=5, x_8=-4294967293, y_1=6, y_9=-4294967292] [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=-4, t2=0, t3=1, t4=-3, t5=-2, t6=-1, temp_4=3, temp_5=5, temp_6=4, temp_7=4, x_0=5, x_8=-4294967293, y_1=6, y_9=-4294967292] [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=-4, t2=0, t3=1, t4=-3, t5=-2, t6=-1, temp_4=3, temp_5=5, temp_6=4, temp_7=4, x_0=5, x_8=-4294967293, y_1=6, y_9=-4294967292] [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=-4, t2=0, t3=1, t4=-3, t5=-2, t6=-1, temp_4=3, temp_5=5, temp_6=4, temp_7=4, x_0=5, x_8=-4294967293, y_1=6, y_9=-4294967292] - 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: 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: 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: 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: 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: 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: 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: 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. - 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.5s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 1.7s, AutomataDifference: 10.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 262 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 262 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1206 IncrementalHoareTripleChecker+Invalid, 1217 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 0 mSDtfsCounter, 1206 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=58445occurred in iteration=3, 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.5s AutomataMinimizationTime, 6 MinimizatonAttempts, 1469 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s 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 22:31:15,933 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...